DocumentCode
1251902
Title
A class of sliding Fermat number transforms that admit a tradeoff between complexity and input-output delay
Author
Gudvangen, S.
Author_Institution
Inst. of Electron. & Control Eng., Kongsberg
Volume
45
Issue
12
fYear
1997
fDate
12/1/1997 12:00:00 AM
Firstpage
3094
Lastpage
3096
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;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.650272
Filename
650272
Link To Document