Title :
Efficient Algorithm for Calculation of Quaternardy Fixed Polarity Arithmetic Expansions
Author :
Falkowski, Bogdan J. ; Lozano, Cicilia C. ; Luba, Tadeusz
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
Abstract :
A recursive algorithm for efficient calculation of quaternary fixed polarity arithmetic expansions (QFPAEs) spectra is presented in this paper. It derives either all QFPAE spectra or a QFPAE coefficient vector in nonzero polarity for the input function from the functions´ QFPAE in polarity zero. Fast flow graphs and computational costs for the new algorithm are given. The number of additions/subtractions and multiplications required by the algorithm for n <7 are also listed and compared with the fast transform method. The comparison shows that the new algorithm has lower computational cost for generating the complete polarity matrix than other algorithms.
Keywords :
algorithm theory; flow graphs; recursive functions; fast transform method; flow graphs; polarity matrix; polarity zero; quaternary fixed polarity arithmetic expansions spectra; recursive algorithm; Arithmetic; Computational complexity; Computational efficiency; Flow graphs; Hardware; Input variables; Integrated circuit interconnections; Integrated circuit technology; Logic; Telecommunication computing;
Conference_Titel :
Multiple-Valued Logic, 2007. ISMVL 2007. 37th International Symposium on
Conference_Location :
Oslo
Print_ISBN :
0-7695-2831-7
DOI :
10.1109/ISMVL.2007.16
