A computational model for a fuzzy coprocessor (types and structures of data and the set of instructions) is proposed. The coprocessor will be charged only of the typical operations of fuzzy logic as calculating membership degrees, unions and intersections of fuzzy sets, fuzzy inferences, defuzzifications and so on. One main novelty is that the programming language admits fuzzy rules conditions in which there would be linguistic edges preceding the predicates and the coprocessor is designed to deal with them directly. In order to that, the compiler codifies both the predicates and the edges into the instructions. Using this coprocessor the number of linguistic values of the variables and the number of rules can be reduced and the executions of systems based on fuzzy rules will be speeded up.
Peer reviewed