Please use this identifier to cite or link to this item:
|Title:||On algorithms for digital signal processing of sequences||Authors:||Krishna Garg, H.
|Issue Date:||1996||Citation:||Krishna Garg, H.,Ko, C.C.,Lin, K.Y.,Liu, H. (1996). On algorithms for digital signal processing of sequences. Circuits, Systems, and Signal Processing 15 (4) : 437-452. ScholarBank@NUS Repository.||Abstract:||In this work, we analyze the algebraic structure of fast algorithms for computing one- and two-dimensional convolutions of sequences defined over the fields of rational and complex rational numbers. The algorithms are based on factorization properties of polynomials and the direct sum property of modulo computation over such fields. Algorithms are described for cyclic as well as acyclic convolution. It is shown that under certain nonrestrictive conditions, all the previously defined algorithms over the fields of rational and complex rational numbers are also valid over the rings of finite integers. Examples are presented to illustrate the results.||Source Title:||Circuits, Systems, and Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/62517||ISSN:||0278081X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.