Please use this identifier to cite or link to this item: https://doi.org/10.1007/BF01270932
Title: On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
Authors: Krishna Garg, H. 
Wei, T.
Keywords: Computational complexity
Cyclic convolution
Cyclotomic polynomials
Finite integer rings
Number theory
Issue Date: Nov-2001
Source: Krishna Garg, H., Wei, T. (2001-11). On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings. Circuits, Systems, and Signal Processing 20 (6) : 619-634. ScholarBank@NUS Repository. https://doi.org/10.1007/BF01270932
Abstract: In this work, we present and analyze a number theoretic approach to computing one-dimensional cyclic convolution of sequences defined in finite integer and complex integer rings. A fundamental result of this work is that under the nonrestrictive condition, (N, M) = 1, the algorithms defined in finite integer and complex integer rings are as intensive computationally as the corresponding algorithms defined in rational and complex rational number systems only in the worst case. They simplify considerably for a large number of cases of importance in digital signal processing.
Source Title: Circuits, Systems, and Signal Processing
URI: http://scholarbank.nus.edu.sg/handle/10635/56860
ISSN: 0278081X
DOI: 10.1007/BF01270932
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

33
checked on Mar 11, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.