A class of sliding Fermat number transforms that admit a tradeoff between complexity and input-output delay
Sigmund Gudvangen · IEEE Transactions on Signal Processing · 1997
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.