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:||Garg, H.Krishna
|Issue Date:||1996||Citation:||Garg, H.Krishna,Ko, C.Chung (1996). Fast algorithms for computing one and two dimensional convolution in integer polynomial rings. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings 4 : 2180-2183. ScholarBank@NUS Repository.||Abstract:||In this work, 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 theoretical transforms (NTTs) are a special case of the general theory presented here.||Source Title:||ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/72633||ISSN:||07367791|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 27, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.