On this paper we describe steps required to fit fuzzy control into a computer code, represented with binary numbers, by using an example with two inputs and one output. This is intended because a continuous curve for the membership function is not represented at all elements; it is discretized into m quantization levels called á . levels that depend on the number of resolution bits used. Mamdani inference is applied to a pair of inputs to obtain the weights of the inferred rules using max and min operators. We have distinguished that all of defuzzification methods need almost k .1iterations according to the input spaces given by 2n where n is the number of bits used. We will introduce a new defuzzification method called Center of Slice Area Average (COSAA), on this method, we calculate the center of area of every slice that forms resultant membership function formed by an \alpha . level and get an average from them, requiring m-1 iterations. This defuzzification depends on the number of discretization levels of membership functions, not on the output space, this reduces number of instructions to be executed, in consequence fewer processing time is consumed.
Digital Representation of Fuzzy Inference Engine
01.09.2007
234430 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
The TI-Dallas inference engine (TIDIE) knowledge representation system
Tema Archiv | 1987
|Adaptive Digital Watermarking Integrating Fuzzy Inference HVS Perceptual Model
BASE | 2012
|A Novel Modified Adaptive Fuzzy Inference Engine and Its Application to Pattern Classification
BASE | 2011
|