• Title/Summary/Keyword: fuzzy logic circuits.

Search Result 26, Processing Time 0.022 seconds

Hardware Approach to Fuzzy Inference―ASIC and RISC―

  • Watanabe, Hiroyuki
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.975-976
    • /
    • 1993
  • This talk presents the overview of the author's research and development activities on fuzzy inference hardware. We involved it with two distinct approaches. The first approach is to use application specific integrated circuits (ASIC) technology. The fuzzy inference method is directly implemented in silicon. The second approach, which is in its preliminary stage, is to use more conventional microprocessor architecture. Here, we use a quantitative technique used by designer of reduced instruction set computer (RISC) to modify an architecture of a microprocessor. In the ASIC approach, we implemented the most widely used fuzzy inference mechanism directly on silicon. The mechanism is beaded on a max-min compositional rule of inference, and Mandami's method of fuzzy implication. The two VLSI fuzzy inference chips are designed, fabricated, and fully tested. Both used a full-custom CMOS technology. The second and more claborate chip was designed at the University of North Carolina(U C) in cooperation with MCNC. Both VLSI chips had muliple datapaths for rule digital fuzzy inference chips had multiple datapaths for rule evaluation, and they executed multiple fuzzy if-then rules in parallel. The AT & T chip is the first digital fuzzy inference chip in the world. It ran with a 20 MHz clock cycle and achieved an approximately 80.000 Fuzzy Logical inferences Per Second (FLIPS). It stored and executed 16 fuzzy if-then rules. Since it was designed as a proof of concept prototype chip, it had minimal amount of peripheral logic for system integration. UNC/MCNC chip consists of 688,131 transistors of which 476,160 are used for RAM memory. It ran with a 10 MHz clock cycle. The chip has a 3-staged pipeline and initiates a computation of new inference every 64 cycle. This chip achieved an approximately 160,000 FLIPS. The new architecture have the following important improvements from the AT & T chip: Programmable rule set memory (RAM). On-chip fuzzification operation by a table lookup method. On-chip defuzzification operation by a centroid method. Reconfigurable architecture for processing two rule formats. RAM/datapath redundancy for higher yield It can store and execute 51 if-then rule of the following format: IF A and B and C and D Then Do E, and Then Do F. With this format, the chip takes four inputs and produces two outputs. By software reconfiguration, it can store and execute 102 if-then rules of the following simpler format using the same datapath: IF A and B Then Do E. With this format the chip takes two inputs and produces one outputs. We have built two VME-bus board systems based on this chip for Oak Ridge National Laboratory (ORNL). The board is now installed in a robot at ORNL. Researchers uses this board for experiment in autonomous robot navigation. The Fuzzy Logic system board places the Fuzzy chip into a VMEbus environment. High level C language functions hide the operational details of the board from the applications programme . The programmer treats rule memories and fuzzification function memories as local structures passed as parameters to the C functions. ASIC fuzzy inference hardware is extremely fast, but they are limited in generality. Many aspects of the design are limited or fixed. We have proposed to designing a are limited or fixed. We have proposed to designing a fuzzy information processor as an application specific processor using a quantitative approach. The quantitative approach was developed by RISC designers. In effect, we are interested in evaluating the effectiveness of a specialized RISC processor for fuzzy information processing. As the first step, we measured the possible speed-up of a fuzzy inference program based on if-then rules by an introduction of specialized instructions, i.e., min and max instructions. The minimum and maximum operations are heavily used in fuzzy logic applications as fuzzy intersection and union. We performed measurements using a MIPS R3000 as a base micropro essor. The initial result is encouraging. We can achieve as high as a 2.5 increase in inference speed if the R3000 had min and max instructions. Also, they are useful for speeding up other fuzzy operations such as bounded product and bounded sum. The embedded processor's main task is to control some device or process. It usually runs a single or a embedded processer to create an embedded processor for fuzzy control is very effective. Table I shows the measured speed of the inference by a MIPS R3000 microprocessor, a fictitious MIPS R3000 microprocessor with min and max instructions, and a UNC/MCNC ASIC fuzzy inference chip. The software that used on microprocessors is a simulator of the ASIC chip. The first row is the computation time in seconds of 6000 inferences using 51 rules where each fuzzy set is represented by an array of 64 elements. The second row is the time required to perform a single inference. The last row is the fuzzy logical inferences per second (FLIPS) measured for ach device. There is a large gap in run time between the ASIC and software approaches even if we resort to a specialized fuzzy microprocessor. As for design time and cost, these two approaches represent two extremes. An ASIC approach is extremely expensive. It is, therefore, an important research topic to design a specialized computing architecture for fuzzy applications that falls between these two extremes both in run time and design time/cost. TABLEI INFERENCE TIME BY 51 RULES {{{{Time }}{{MIPS R3000 }}{{ASIC }}{{Regular }}{{With min/mix }}{{6000 inference 1 inference FLIPS }}{{125s 20.8ms 48 }}{{49s 8.2ms 122 }}{{0.0038s 6.4㎲ 156,250 }} }}

  • PDF

Performance Analysis of MPPT Techniques Based on Fuzzy Logic and P&O Algorithm in Actual Weather Environment (실제 날씨 환경에서 퍼지로직과 P&O 제어방식의 MPPT 동작 성능 분석)

  • Eom, Hyun-Sang;Yang, Hye-Ji;An, Hyun-Jun;Kwon, Youngsung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.10
    • /
    • pp.291-298
    • /
    • 2020
  • The power generation of a PV system changes according to the weather variables, such as solar radiation and temperature. In particular, the output characteristics of photovoltaic systems, which are sensitive to changes in solar radiation, can be produced effectively and reliably in various weather conditions through MPPT (Maximum Power Point Tracking) control. This paper proposes a fuzzy-based MPPT control method to improve the efficiency and stability of the power production from a solar system. To verify the performance of the proposed method, under the same weather environment, the efficiency and stability of the newly proposed fuzzy logic were compared and evaluated empirically with P&O (Perturb and Observe), a representative algorithm of MPPT control. Furthermore, the circuits designed to improve the reliability and reliability of the hardware were manufactured from Printed Circuit Boards (PCB) to conduct experiments. Based on the results of the experiment during a certain period, the fuzzy-based MPPT proposed in this paper improved the efficiency by more than 4.4% compared to the MPPT based on the existing P&O algorithm and decreased the fluctuation width by more than 39.7% at the maximum power point.

Error Analysis of a Sensorless Position Estimation Considering Noise for Switched Reluctance Motor (노이즈 성분을 고려한 SRM 센서리스 위치 추정의 오차 해석)

  • 김갑동;최재동;이학주;안재황;성세진
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.6 no.1
    • /
    • pp.74-81
    • /
    • 2001
  • The sensorless scheme for Switched Reluctance Motor(SRM) drives must have the robustness and reliability because the noise and error are sensitive. These elements make electrically noisy environments due to the proximity of high current power circuits with small signal electronic circuits when SRM drives. Also, due to the leakage inductances and finite coupling capacitances, these can cause the noise on any low voltage current and voltage measurement circuit. The position estimate error occurs because the current and voltage including the noise are sued as the inputs of sensorless algorithm. In this paper the high robustness and resistance of input noise re described. The fuzzy logic based rotor estimation algorithm and the observer model are used to reduce the tolerance of input data.

  • PDF

A Fuzzy Back-EMF Observer for Sensorless Drive of BLDC Motor (브러시리스 전동기의 센서리스 구동을 위한 퍼지 역기전력 관측기)

  • Park, Byoung-Gun;Kim, Tae-Sung;Ryu, Ji-Su;Hyun, Dong-Seok
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.12 no.2
    • /
    • pp.157-164
    • /
    • 2007
  • In this paper, a novel sensorless drive for brushless DC (BLDC) motor using the fuzzy back-EMF observer is proposed to improve the performance of conventional sensorless drive methods. Existing sensorless drive methods of the BLDC motor have low performance at transients or low speed range and occasionally require additional circuits. To cope with these problems, the back-EMF of the BLDC motor must be precisely estimated by a fuzzy logic, which is suitable to estimate the back-EMF which has a trapezoidal shape. The proposed algorithm using fuzzy back-EMF observer can achieve robust control for the change of an external condition and continuously estimate position of the rotor at transients as well as at steady state. The superiority of the proposed algorithm is proved through the simulation compared with other sensorless drive methods.

An Intelligent Fire Detection Algorithm for Fire Detector

  • Hong, Sung-Ho;Choi, Moon-Su
    • International Journal of Safety
    • /
    • v.11 no.1
    • /
    • pp.6-10
    • /
    • 2012
  • This paper presents a study on the analysis for reducing the number of false alarms in fire detection system. In order to intelligent algorithm fuzzy logic is adopted in developing fire detection system to reduce false alarm. The intelligent fire detection algorithm compared and analyzed the fire and non-fire signatures measured in circuits simulating flame fire and smoldering fire. The algorithm has input variables obtained by fire experiment with K-type thermocouple and optical smoke sensor. Also triangular membership function is used for inference rules. And the antecedent part of inference rules consists of temperature and smoke density, and the consequent part consists of fire probability. A fire-experiment is conducted with paper, plastic, and n-heptane to simulate actual fire situation. The results show that the intelligent fire detection algorithm suggested in this study can more effectively discriminate signatures between fire and similar fire.

Memory Organization for a Fuzzy Controller.

  • Jee, K.D.S.;Poluzzi, R.;Russo, B.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1041-1043
    • /
    • 1993
  • Fuzzy logic based Control Theory has gained much interest in the industrial world, thanks to its ability to formalize and solve in a very natural way many problems that are very difficult to quantify at an analytical level. This paper shows a solution for treating membership function inside hardware circuits. The proposed hardware structure optimizes the memoried size by using particular form of the vectorial representation. The process of memorizing fuzzy sets, i.e. their membership function, has always been one of the more problematic issues for the hardware implementation, due to the quite large memory space that is needed. To simplify such an implementation, it is commonly [1,2,8,9,10,11] used to limit the membership functions either to those having triangular or trapezoidal shape, or pre-definite shape. These kinds of functions are able to cover a large spectrum of applications with a limited usage of memory, since they can be memorized by specifying very few parameters ( ight, base, critical points, etc.). This however results in a loss of computational power due to computation on the medium points. A solution to this problem is obtained by discretizing the universe of discourse U, i.e. by fixing a finite number of points and memorizing the value of the membership functions on such points [3,10,14,15]. Such a solution provides a satisfying computational speed, a very high precision of definitions and gives the users the opportunity to choose membership functions of any shape. However, a significant memory waste can as well be registered. It is indeed possible that for each of the given fuzzy sets many elements of the universe of discourse have a membership value equal to zero. It has also been noticed that almost in all cases common points among fuzzy sets, i.e. points with non null membership values are very few. More specifically, in many applications, for each element u of U, there exists at most three fuzzy sets for which the membership value is ot null [3,5,6,7,12,13]. Our proposal is based on such hypotheses. Moreover, we use a technique that even though it does not restrict the shapes of membership functions, it reduces strongly the computational time for the membership values and optimizes the function memorization. In figure 1 it is represented a term set whose characteristics are common for fuzzy controllers and to which we will refer in the following. The above term set has a universe of discourse with 128 elements (so to have a good resolution), 8 fuzzy sets that describe the term set, 32 levels of discretization for the membership values. Clearly, the number of bits necessary for the given specifications are 5 for 32 truth levels, 3 for 8 membership functions and 7 for 128 levels of resolution. The memory depth is given by the dimension of the universe of the discourse (128 in our case) and it will be represented by the memory rows. The length of a world of memory is defined by: Length = nem (dm(m)+dm(fm) Where: fm is the maximum number of non null values in every element of the universe of the discourse, dm(m) is the dimension of the values of the membership function m, dm(fm) is the dimension of the word to represent the index of the highest membership function. In our case then Length=24. The memory dimension is therefore 128*24 bits. If we had chosen to memorize all values of the membership functions we would have needed to memorize on each memory row the membership value of each element. Fuzzy sets word dimension is 8*5 bits. Therefore, the dimension of the memory would have been 128*40 bits. Coherently with our hypothesis, in fig. 1 each element of universe of the discourse has a non null membership value on at most three fuzzy sets. Focusing on the elements 32,64,96 of the universe of discourse, they will be memorized as follows: The computation of the rule weights is done by comparing those bits that represent the index of the membership function, with the word of the program memor . The output bus of the Program Memory (μCOD), is given as input a comparator (Combinatory Net). If the index is equal to the bus value then one of the non null weight derives from the rule and it is produced as output, otherwise the output is zero (fig. 2). It is clear, that the memory dimension of the antecedent is in this way reduced since only non null values are memorized. Moreover, the time performance of the system is equivalent to the performance of a system using vectorial memorization of all weights. The dimensioning of the word is influenced by some parameters of the input variable. The most important parameter is the maximum number membership functions (nfm) having a non null value in each element of the universe of discourse. From our study in the field of fuzzy system, we see that typically nfm 3 and there are at most 16 membership function. At any rate, such a value can be increased up to the physical dimensional limit of the antecedent memory. A less important role n the optimization process of the word dimension is played by the number of membership functions defined for each linguistic term. The table below shows the request word dimension as a function of such parameters and compares our proposed method with the method of vectorial memorization[10]. Summing up, the characteristics of our method are: Users are not restricted to membership functions with specific shapes. The number of the fuzzy sets and the resolution of the vertical axis have a very small influence in increasing memory space. Weight computations are done by combinatorial network and therefore the time performance of the system is equivalent to the one of the vectorial method. The number of non null membership values on any element of the universe of discourse is limited. Such a constraint is usually non very restrictive since many controllers obtain a good precision with only three non null weights. The method here briefly described has been adopted by our group in the design of an optimized version of the coprocessor described in [10].

  • PDF