DocumentCode :
3344304
Title :
Fast transforms for orthogonal logic
Author :
Falkowski, Bogdan J. ; Rahardja, Susanto
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore
Volume :
3
fYear :
1995
fDate :
30 Apr-3 May 1995
Firstpage :
2164
Abstract :
The ways of generation of forward and inverse fast transforms for recently introduced orthogonal logic have been presented. The list of all fast transforms is thoroughly discussed. The paper summarizes those orthogonal transforms which have fast algorithms and easily defined recursive equations. In addition, those transforms which require one or more permutations to have fast transform are also discussed
Keywords :
matrix multiplication; switching circuits; switching functions; butterfly structures; forward fast transforms; inverse fast transforms; matrix multiplications; orthogonal logic; recursive equations; switching circuits; Adders; Algebra; Circuit testing; Discrete Fourier transforms; Equations; Fourier transforms; Logic circuits; Logic functions; Polynomials; Switching circuits;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2570-2
Type :
conf
DOI :
10.1109/ISCAS.1995.523855
Filename :
523855
Link To Document :
بازگشت