Abstract
In our recent work, we solved the word sequence length constraint problem associated with number theoretic transforms defined in finite integer rings. This is based on the American-Indian-Chinese extension of the Chinese remainder theorem. This work builds further on the results by extending them to the domain of integer polynomial rings. The theory of polynomial factorization and the resulting direct sum property are studied in depth. The emphasis is on the theory of computational algorithms for processing sequences defined in finite integer and complex integer rings.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. C. Agarwal and C. S. Burrus, Fast convolution using Fermat number transforms with applications to digital filtering,IEEE Trans. on Acoust., Speech, and Sig. Proc., vol. ASSP-22, pp. 87–97, 1974.
R. C. Agarwal and C. S. Burrus, Number theoretic transforms to implement fast digital convolution,Proceedings IEEE, vol. 63, pp. 550–560, 1975.
E. Dubois and A. N. Venetsanopoulos, The discrete Fourier transform over finite rings with applications to fast convolution,IEEE Trans. on Comput., vol. C-27, pp. 586–593, 1978.
E. Dubois and A. N. Venetsanopoulos, The generalized discrete Fourier transform in rings of algebraic integers,IEEE Trans. on Acoust., Speech, and Sig. Proc., vol. ASSP-28, pp. 169–175, 1980.
H. Krishna Garg and C. C. Ko, Fast algorithms for computing one and two dimensional convolutions in integer polynomial rings,Circuits, Sys., Sig. Proc., accepted for publication 1997.
H. Krishna, B. Krishna, and K. Y. Lin, The AICE-CRT and algorithms for digital signal processing: The complex case,Circuits, Sys., Sig. Proc., vol. 14, no. 1, pp. 69–95, 1995.
K. Y. Lin, H. Krishna, and B. Krishna, Rings, fields, the Chinese remainder theorem and an American-Indian-Chinese extension, Part I: Theory,IEEE Trans. on Cir. and Sys. II, vol. 41, no. 10, pp. 641–655, 1994.
K. Y. Lin, H. Krishna, and B. Krishna, Rings, fields, the Chinese remainder theorem and an American-Indian-Chinese extension, Part II: Applications to Digital Signal Processing,IEEE Trans. on Cir. and Sys. II, vol. 41, no. 10, pp. 656–668, 1994.
J. B. Martens and M. C. Vanwormhoudt, Convolutions of long integer sequences by means of number theoretic transforms over residue class polynomial rings.IEEE Trans. on Acoust. Speech, and Sig. Proc., vol. ASSP-31, pp. 1125–1134, 1983.
R. J. McElice,Finite Fields for Computer Scientists and Engineers, Kluwer Academic Publishers, Boston, MA, 1987.
W. W. Peterson and E. J. Weldon, Jr.,Error Correcting Codes, MIT Press, Cambridge, MA, 1978.
C. M. Radar, Discrete convolutions via Mersenne transforms,IEEE Trans. on Comput., vol. C-21, pp. 1269–1273, 1972.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Garg, H.K. On the factorization of polynomials and direct sum properties in integer polyomial rings. Circuits Systems and Signal Process 15, 415–435 (1996). https://doi.org/10.1007/BF01182595
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01182595