DocumentCode
3430331
Title
CMOS VLSI Lukasiewicz logic arrays
Author
Mills, Jonathan Wayne ; Daffinger, C.A.
Author_Institution
Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA
fYear
1990
fDate
5-7 Sep 1990
Firstpage
469
Lastpage
480
Abstract
Lukasiewicz logic arrays (LLAs) are massively parallel analog computers organized as binary trees of identical processing elements. The authors have designed and performed preliminary tests on a series of CMOS VLSI LLAs whose cells perform Lukasiewicz implication (→). The authors describe the LLA architecture and its relationship to cellular automata, describe the CMOS VLSI implementation of versions LL9 and LL10 and their initial characterization, and report on the results obtained by programming LL9 and LL10 as fuzzy function recognizers, the first step in designing more general function units such as expert systems and neural networks. Initial test results showed that the LLAs implemented the notch function linearly, but with a slope that varied from that of the ideal function. Trimming the LLA inputs and outputs is expected to result in a typical error of less than 2%, and a mean error of less than 0.5%
Keywords
CMOS integrated circuits; VLSI; analogue computer circuits; fuzzy logic; logic arrays; many-valued logics; parallel architectures; CMOS VLSI; LL10; LL9; Lukasiewicz logic arrays; binary trees; expert systems; fuzzy function recognizers; massively parallel analog computers; neural networks; notch function; processing elements; programming; Analog computers; Automatic programming; Binary trees; CMOS logic circuits; Computer architecture; Functional programming; Logic arrays; Performance evaluation; Testing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Application Specific Array Processors, 1990. Proceedings of the International Conference on
Conference_Location
Princeton, NJ
Print_ISBN
0-8186-9089-5
Type
conf
DOI
10.1109/ASAP.1990.145483
Filename
145483
Link To Document