Introduction to VLSI Systems
Image Processing by Transforms Over a Finite Field
IEEE Transactions on Computers
Discrete Convolutions via Mersenne Transrorms
IEEE Transactions on Computers
Hi-index | 14.98 |
In this correspondence, a parallel architecture is developed to compute the linear convolution of two sequences of arbitrary lengths using the Fermat number transform (FNT). In particular, a pipeline structure is designed to compute a 128-point FNT. In this FNT, only additions and bit rotations are required.