The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1983 vol.32)
pp: 989-1001
H.K. Nagpal , Department of Electrical Engineering, University of Windsor
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.
INDEX TERMS
two-dimensional convolution, Finite fields and rings, generalized DFT's, image processing, look-up table implementation, number theoretic transforms, processor architecture, residue number system
CITATION
G.A. Jullien, H.K. Nagpal, "Processor Architectures for Two-Dimensional Convolvers Using a Single Multiplexed Computational Element with Finite Field Arithmetic", IEEE Transactions on Computers, vol.32, no. 11, pp. 989-1001, November 1983, doi:10.1109/TC.1983.1676150
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool