Citation
Abstract
In this paper a parallel architecture is developed to compute the linear convolution of two sequences of arbitrary lengths using the Fermat number transform (F-NT). In particular a pipeline structure is designed to compute a 128-point FNT. In this FNT, only additions and bit rotations are required. A standard barrel shifter circuit is modified so that it performs the required bit rotation operation. The overlap-save method is generalized for the FNT to compute a linear convolution of arbitrary length. A parallel architecture is developed to realize this type of overlap-save method using one FNT and several inverse FNTs of 128 points. The generalized overlapsave method alleviates the usual dynamic range limitation in FNTs of long transform lengths. Its architecture is regular, simple, and expandable, and therefore naturally suitable for VLSI implementation.
Details
- Volume
- 42-70
- Published
- August 15, 1982
- Pages
- 60–71
- File Size
- 546.8 KB