A new approach to solve the sequence-length constraint problem incircular convolution using number theoretic transform

Authors:
H. Lu;S.C. Lee
Affiliations:
Dept. of Comput. Sci., Oklahoma State Univ., Stillwater, OK;-
Venue:
IEEE Transactions on Signal Processing
Year:
1991

Citing 0
Cited 2

Algorithms and pipeline architectures for 2-D FFT and FFT-like transforms

Digital Signal Processing
Bit-serial, VLSI architecture for the implementation of maximum-length number-theoretic transforms using mixed basis representations

ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I

Quantified Score

Hi-index	35.68

Visualization

Abstract

Offers a novel approach to solve the sequence-length constraint problem by proposing a formula to produce generalized modulo a numbers for number theoretic transforms. By selecting a prime M as the modulo number and choosing the least primitive root M as the a in the number theoretic transform, the sequence lengths become exponentially proportional to the word length. The set of generalized modulo numbers includes Mersenne and Fermat numbers. The circular convolution obtained by this method is accurate, i.e., without roundoff error