Title :
Fast algorithms for computing one and two dimensional convolution in integer polynomial rings
Author :
Garg, Hari Krishna
Author_Institution :
Dept. of Electr. Eng., Nat. Univ. of Singapore
Abstract :
The factorization properties of polynomials defined over finite integer rings and the associated direct sums are analyzed. The objective is to describe new computationally efficient algorithms for computing one and two dimensional convolution of data sequences defined over finite integer rings. The number theoretic transforms (NTTs) are a special case of the general theory presented
Keywords :
convolution; number theory; polynomials; sequences; acyclic convolution; computationally efficient algorithms; cyclic convolution; data sequences; direct sums; fast algorithms; finite integer rings; integer polynomial rings; number theoretic transforms; one dimensional convolution; two dimensional convolution; Cathode ray tubes; Concurrent computing; Convolution; Digital signal processing; Polynomials; Signal design; Signal processing algorithms;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7803-3192-3
DOI :
10.1109/ICASSP.1996.545852
