Processor Architectures for Two-Dimensional Convolvers Using a Single Multiplexed Computational Element with Finite Field Arithmetic

IEEE Transactions on Computers

Volumn C-32, Issue 11, 1983, Pages 989-1001

  Nagpal, Hari K ^a   Jullien, Graham A ^a   Miller, William C ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Finite fields and rings; generalized DFT's; image processing; look up table implementation; number theoretic transforms; processor architecture; residue number system; two dimensional convolution

Indexed keywords

EID: 0345400978     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1983.1676150     Document Type: Article

References (21)

1. B. Gold and T. Bially, “Parallelism in fast Fourier transform hardware,” IEEE Trans. Audio Electroacoust., vol. AU-21, pp. 5-16, Feb. 1973.
2. M. J. Corinthios, “A fast Fourier transform for high speed signal processing,” IEEE Trans. Comput., vol. C-20, pp. 843-846, Apr. 1971.
3. C. S. Joshi et al., “A video rate two-dimensional FFT processor,” in Proc. IEEE Intern. Conf. Acoust., Speech, Signal Processing, Denver, CO, Apr. 1980, pp. 774-777.
4. P. J. Nicholson, “Algebraic theory of finite Fourier transforms,” J. Comput. Syst. Sci., vol. 5, pp. 524-547, 1971.
5. J. M. Pollard, “The fast Fourier transform in a finite field,” Math. Comput., vol. 25, pp. 524-547, Apr. 1971.
6. C. M. Rader, “Discrete convolutions via Mersenne transforms,” IEEE Trans. Comput., vol. C-21, pp. 1269-1273, Dec. 1972.
7. H. Nussbaumer, “Digital filtering using pseudo Fermat number transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 79-83, Feb. 1977.
8. R. H. Vander Kraats and A. N. Venetsanopoulos, “Hardware for two-dimensional digital filtering using Fermat number transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, pp. 155-162, Apr. 1982.
9. H. K. Nagpal, G. A. Jullien, W. C Miller, “Memory organization for an image processor using a multiplexed DFT butterfly,” presented at the Intern. Conf. Acoust., Speech, Signal Processing, Florence, Italy, 1981.
10. E. Dubois and A. N. Venetsanopoulos, “The discrete Fourier transform over finite rings with applications to fast convolution,” IEEE Trans. Comput., vol. C-17, pp. 586-593, July 1978.
11. R. C. Agarwal and C. S. Burrus, “Number theoretic transforms to implement fast digital convolution,” Proc. IEEE, vol. 63, pp. 550-560, Apr. 1975.
12. N. S. Szabo and R. I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology. New York: McGraw-Hill, 1967.
13. G. A. Jullien, “Residue number scaling and other operations using ROM arrays,” IEEE Trans. Comput., vol. C-27, pp. 325-336, Apr. 1978.
14. G. A. Jullien, “Implementation of multiplication modulo a prime number, with applications to number theoretic transforms,” IEEE Trans. Comput., vol. C-29, pp. 899-905, Oct. 1980.
15. M. C. Vanwarmhoud, “Structural properties of complex residue rings applied to number theoretic Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-26, pp. 99-104, Feb. 1978.
16. A. Baraniecka, “Digital filtering using number theoretic techniques,” Univ. Windsor, Windsor, Ont., Canada, Ph.D. dissertation, 1980.
17. H. K. Nagpal, G. A. Jullien, and W. C. Miller, “Multidimensional algorithms and processor architectures for computing a class of unitary transforms,” IEEE Trans. Comput., submitted for publication.
18. A. Baraniecka and G. A. Jullien, “Hardware implementation of convolution using number theoretic transforms,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, Washington, DC, Apr. 1979.
19. J. W. Modestino and R. W. Fries, “Edge detection in noisy images using recursive filtering,” Comput. Graphics Image Processing, vol. 6, pp. 409-433, Oct. 1977.
20. I. M. Vinogradov, Elements of Number Theory. New York: Dover, 1954.
21. U. Dudley, Elements of Number Theory. San Francisco, CA: Freeman, 1969.