Please use this identifier to cite or link to this item:
|Title:||Fast algorithms for computing one-and two-dimensional convolution in integer polynomial rings||Authors:||Krishna Garg, H.
|Issue Date:||1997||Citation:||Krishna Garg, H.,Ko, C.C. (1997). Fast algorithms for computing one-and two-dimensional convolution in integer polynomial rings. Circuits, Systems, and Signal Processing 16 (1) : 121-139. ScholarBank@NUS Repository.||Abstract:||In a recent work, the factorization properties of polynomials defined over finite integer polynomial rings were analyzed. These properties, along with other results pertaining to polymomial theory, led to the direct sum property and the American-Indian-Chinese extension of the Chinese remainder theorem over such integer rings. The objective of this paper is to describe algorithms for computing the one- and two-dimensional convolution of data sequences defined over finite integer rings. For one-dimensional convolution, algorithms for computing acyclic and cyclic convolution are described. For two-dimensional convolution, only the cyclic case is analyzed. Computational and other relevant aspects associated with the structure of these algorithms are also studied.||Source Title:||Circuits, Systems, and Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/62185||ISSN:||0278081X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.