DocumentCode :
896666
Title :
Properties and experimental results of fastest linearly independent ternary arithmetic transforms
Author :
Falkowski, Bogdan J. ; Fu, Cheng
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
Volume :
53
Issue :
4
fYear :
2006
fDate :
4/1/2006 12:00:00 AM
Firstpage :
858
Lastpage :
866
Abstract :
Two categories of fastest linearly independent ternary arithmetic transforms, which possesses forward and inverse butterfly diagrams with the lowest computational complexity have been identified and their various properties have been presented in this paper. This family is recursively defined and has consistent formulas relating forward and inverse transform matrices. Computational costs of the calculation for new transforms are also discussed. Some experimental results for standard ternary benchmark functions and comparison with multi-polarity ternary arithmetic transform are also presented.
Keywords :
computational complexity; digital arithmetic; logic design; matrix algebra; ternary logic; transforms; arithmetic algebra; computational complexity; fastest linearly independent transforms; forward butterfly diagrams; forward transform matrices; inverse butterfly diagrams; inverse transform matrices; ternary arithmetic transforms; ternary logic functions; Algebra; Arithmetic; Computational complexity; Computational efficiency; Logic circuits; Logic design; Logic devices; Logic functions; Multivalued logic; Polynomials; Arithmetic algebra; fastest transforms; linearly independent transform; ternary logic functions;
fLanguage :
English
Journal_Title :
Circuits and Systems I: Regular Papers, IEEE Transactions on
Publisher :
ieee
ISSN :
1549-8328
Type :
jour
DOI :
10.1109/TCSI.2005.861890
Filename :
1618873
Link To Document :
بازگشت