Please use this identifier to cite or link to this item:
|Title:||Cyclotomic polynomial factorization in finite integer rings with applications to digital signal processing|
|Citation:||Garg, H.K. (1999). Cyclotomic polynomial factorization in finite integer rings with applications to digital signal processing. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing 46 (5) : 608-616. ScholarBank@NUS Repository. https://doi.org/10.1109/82.769809|
|Abstract:||In this paper, results are presented that can be used to obtain all the possible generators for a number theoretic transform (NTT) defined in a finite integer ring and its polynomial extensions. A generalization of the well-known Euler's theorem is derived which can be used to determine all the generators of a given NTT once the generators in the underlying finite field are identified. Based on this extension, a procedure is also described to compute cyclotomic factorization in these rings. This factorization and Chinese Remainder Theorem lead to computationally efficient algorithms for computing cyclic convolution of two sequences defined in finite and complex integer rings.|
|Source Title:||IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 14, 2018
WEB OF SCIENCETM
checked on Jun 20, 2018
checked on May 5, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.