Title :
A class of sliding Fermat number transforms that admit a tradeoff between complexity and input-output delay
Author_Institution :
Inst. of Electron. & Control Eng., Kongsberg
fDate :
12/1/1997 12:00:00 AM
Abstract :
A sliding Fermat number transform (SFNT) is proposed in order to reduce the input-output delay of finite ring convolvers and correlators. The scheme relays on a common-factor decomposition of the FNT. Every L sample periods, L new samples are input, and the complete FNT-domain vector is updated. By varying L, a tradeoff between low input-output delay and low complexity is achieved
Keywords :
computational complexity; convolution; correlation theory; delays; number theory; FNT-domain vector; common-factor decomposition; complexity; finite ring convolvers; finite ring correlators; input-output delay; sliding Fermat number transforms; Application specific integrated circuits; Arithmetic; Convolution; Convolvers; Correlators; Delay; Relays; Roundoff errors; Signal processing algorithms; Very large scale integration;
Journal_Title :
Signal Processing, IEEE Transactions on
