DocumentCode
3477917
Title
Polynomial expansions over GF(3) based on fastest transformation
Author
Falkowski, Bogdan J. ; Fu, Cheng
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
fYear
2003
fDate
16-19 May 2003
Firstpage
40
Lastpage
45
Abstract
A new fastest Linearly Independent (LI) transforms over GF(3) and its corresponding polynomial expansions have been introduced. The number of required additions and multiplications in new LI transform is advantageous when compared with ternary Reed-Muller transform, which was previously known as the most efficient transform over GF(3). This paper discusses various properties of these fastest LI transforms and their corresponding polynomial expansions over GF(3) as well as their comparison with ternary Reed-Muller transform and its implementation in hardware.
Keywords
Galois fields; computational complexity; polynomial matrices; transforms; fastest linearly independent transforms; polynomial expansions; ternary Reed-Muller transform; Circuit synthesis; Circuit testing; Computational efficiency; Equations; Galois fields; Hardware; Logic testing; Neural networks; Polynomials; Transforms;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 2003. Proceedings. 33rd International Symposium on
ISSN
0195-623X
Print_ISBN
0-7695-1918-0
Type
conf
DOI
10.1109/ISMVL.2003.1201382
Filename
1201382
Link To Document