DocumentCode
1801047
Title
Polynomial expansions over GF(2) based on fastest transformation
Author
Rahardja, Susanto ; Falkowski, Bogdan J.
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
Volume
3
fYear
2002
fDate
2002
Abstract
Recent papers show that the existence of numerous linearly independent (LI) transformations in GF(2) algebra creates circuits that are superior in the design of XOR based polynomial expansions and corresponding digital circuits. In this paper, new classes of LI logic transformations and their corresponding polynomial expansions over GF(2) are identified and introduced. The transforms are the fastest and most efficient LI transformation in terms of its GF(2) computational complexity.
Keywords
computational complexity; decision diagrams; logic arrays; polynomial approximation; switching functions; LI logic transformation; XOR based polynomial expansions; butterfly diagrams; computational complexity; linearly independent transformations; logic functions; polynomial expansions; Circuit testing; Field programmable gate arrays; Logic arrays; Logic circuits; Logic design; Logic devices; Logic functions; Logic testing; Polynomials; Programmable logic arrays;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on
Print_ISBN
0-7803-7448-7
Type
conf
DOI
10.1109/ISCAS.2002.1010239
Filename
1010239
Link To Document