Processor Architectures for Two-Dimensional Convolvers Using a Single Multiplexed Computational Element with Finite Field Arithmetic
- 1 November 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (11) , 989-1001
- https://doi.org/10.1109/tc.1983.1676150
Abstract
This paper describes the theory, simulation, and construction of a two-dimensional number theoretic transform (NTT) convolver. The convolver performs indirect convolution by using the cyclic convolution property of a class of generalized discrete Fourier transforms (DFT's) defined over rings isomorphic to direct sums of Galois fields. The paper first presents the theoretical development of the computational element required for computing the generalized discrete Fourier transform (GDFIT) and its inverse. The theory extends the use of base fields to second degree extension fields and provides efficient choices for transform parameters to minimize hardware. The paper next presents results of recent work in multidimensional transform memory structures, and extends this work to the complete convolution process. The two theories are then "married" to produce efficient, very high speed convolution architectures. Simulation results are presented for a second degree extension field image convolver and constructional details are presented for a fast image convolver using 2 base fields and designed to operate as a peripheral to a fast 32 bit minicomputer.Keywords
This publication has 15 references indexed in Scilit:
- Hardware implementation of convolution using number theoretic transformsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A video rate two dimensional FFT processorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic TransformsIEEE Transactions on Computers, 1980
- The Discrete Fourier Transform Over Finite Rings with Application to Fast ConvolutionIEEE Transactions on Computers, 1978
- Residue Number Scaling and Other Operations Using ROM ArraysIEEE Transactions on Computers, 1978
- Structural properties of complex residue rings applied to number theoretic Fourier transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- Edge detection in noisy images using recursive digital filteringComputer Graphics and Image Processing, 1977
- Number theoretic transforms to implement fast digital convolutionProceedings of the IEEE, 1975
- Discrete Convolutions via Mersenne TransformsIEEE Transactions on Computers, 1972
- Algebraic theory of finite fourier transformsJournal of Computer and System Sciences, 1971