DocumentCode :
3256940
Title :
Fastest linearly independent arithmetic transforms and their applications in function verification
Author :
Falkowski, Bogdan J. ; Fu, Cheng
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
fYear :
2005
fDate :
7-10 Aug. 2005
Firstpage :
1725
Abstract :
The family of fastest linearly independent ternary arithmetic transforms, which has the lowest computational complexity, has been identified and their various properties have been presented. This family is recursively defined and has consistent formulas relating forward and inverse transform matrices. Computational costs for the new transforms are also discussed
Keywords :
computational complexity; digital arithmetic; transforms; computational complexity; forward transform matrices; function verification; inverse transform matrices; linearly independent arithmetic transforms; Arithmetic; Circuit testing; Computational complexity; Computational efficiency; Logic circuits; Logic functions; Logic testing; Multivalued logic; Stochastic processes; Transforms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2005. 48th Midwest Symposium on
Conference_Location :
Covington, KY
Print_ISBN :
0-7803-9197-7
Type :
conf
DOI :
10.1109/MWSCAS.2005.1594453
Filename :
1594453
Link To Document :
بازگشت