Rings, Fields, the Chinese Remainder Theorem and an Extension—Part I:Theory

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

Volumn 41, Issue 10, 1994, Pages 641-655

  Lin, K Y ^a   Krishna, H ^a   Krishna, B ^b  

^a SYRACUSE UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY ROORKEE   (India)

Author keywords

American Indian Chinese Extension; Chinese Remainder Theorem; Finite fields; integer rings; number theoretic transforms; polynomial rings; the; word and sequence length constraints

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL TRANSFORMATIONS; NUMBER THEORY; POLYNOMIALS; THEOREM PROVING;

AMERICAN INDIAN CHINESE EXTENSION; CHINESE REMAINDER THEOREM; FINITE FIELDS; INTEGER RINGS; NUMBER THEORETIC TRANSFORMS; POLYNOMIAL RINGS; SEQUENCE LENGTH CONSTRAINTS; WORD LENGTH CONSTRAINTS;

DIGITAL SIGNAL PROCESSING;

EID: 0028528667     PISSN: 10577130     EISSN: None     Source Type: Journal    
DOI: 10.1109/82.329735     Document Type: Article

References (28)

1. J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex fourier series,” Math. Comput., vol. 19, pp. 297-301, Apr. 1965.
2. C. M. Rader, “Discrete convolutions via Mersenne transforms,” IEEE Trans. Comput., vol. c-21, pp. 1269-1273, Dec. 1972.
3. R. C. Aganval and C. S. Bums, “Fast convolution using fermat number transforms with applications to digital filtering,” IEEE Trans. ASSP, vol. ASSP-22, no. 2, pp. 87-97, Apr. 1974.
4. R. C. Agarwal and C. S. Bums, “Number theoretic transforms to implement fast digital convolution,” Proc. IEEE, vol. 63, pp. 550-560, Apr. 1975.
5. J. H. McClellan, “Hardware realization of a fermat number transform,” IEEE Trans. ASSP, vol. ASSP-24, no. 3, pp. 216–225, June, 1976.
6. H. Lu and S. C. Lee, “A new approach to solve the sequence length constraint problem in circular convolution using number theoretic transform,” IEEE Trans. Sig. Proc., vol. 39, no. 6, pp. 1314—1321, June 1991.
7. I. S. Reed and T. K. Truong, “The use of finite fields to compute convolutions,” IEEE Trans. Info. Theory, vol. IT-21, no. 2, pp. 208–213, Mar. 1975.
8. H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, 2nd Ed. New York: Springer-Verlag, 1982.
9. D. G. Myers, Digital Signal Processing—Efficient Convolution and Fourier Transform Techniques. Englewood Cliffs, NJ: Prentice-Hall, 1990.
10. J. H. McClellan and C. M. Rader, Number Theory in Digital Signal Processing. Englewood Cliffs, NJ: Prentice Hall Inc. 1979.
11. R. E. Blahut, Fast Algorithms for Digital Signal Processing. Reading, MA: Addison-Wesley, 1985.
12. L. K. Hua, Introduction to Number Theory. New York: Springer-Verlag, 1982.
13. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
14. R. C. Agarwal and J. W. Cooley, “New algorithms for digital convolution,” IEEE Trans. ASSP, vol. ASSP-25, pp. 392-110, Oct. 1977.
15. D. P. Kolba and T. W. Parks, “A prime factor FFT algorithm using high-speed convolution,” IEEE Trans. ASSP, vol. ASSP-25, pp. 281–294, Aug. 1977.
16. S. Winograd, “On computing the discrete fourier transform,” Math. Computation, vol. 32, no. 41, pp. 175–199, Jan. 1978.
17. S. Winograd, “Some bilinear forms whose multiplicative complexity depends on the field of constants,” Math. Syst. Theory 10, pp. 169–180, 1977.
18. M. D. Wagh and S. D. Morgera, “A new structured design method for convolutions over finite fields, Part I.” IEEE Trans. Info. Theory, vol. IT-29, no. 4, pp. 583–595, July 1983.
19. S. D. Morgera and H. Krishna, Digital Signal Processing—Applications to Communications and Algebraic Coding Theories. Academic Press, 1989.
20. A. Skavantzos and F. J. Taylor, “On the polynomial residue number system,” IEEE Trans. Sig. Proc., vol. 39, no. 2, pp. 376–382, Feb. 1992.
21. G. H. Golub and C. F. V. Loan, Matrix Computations. Baltimore, MD: Johns Hopkins University Press, 1983.
22. E. R. Berlekamp, “Factoring polynomials over large finite fields,” Math. Comp., vol. 24, no. 111, pp. 713–735, July 1970.
23. A. K. Lenstra, “Factoring multivariate polynomials over algebraic number fields,” SIAM J. Comput., vol. 16, no. 3, pp. 591–598, June 1987.
24. D. R. Musser, “Multivariate polynomial factorization,” J. Asso. Comput. Mach., vol. 22, no. 2, pp. 291–308, Apr. 1975.
25. P. S. Wang and L. P. Rothschild, “Factoring multivariate polynomials over the integers,” Math. Comp., vol. 29, no. 131, pp. 935–950, July 1975.
26. D. E. Knuth, The Art of Computer Programming, vol. II, Seminumerical Algorithm. Reading, MA: Addison-Wesley, 1969.
27. H. Zassenhaus, “On Hensel factorization,” Int. J. Numer. Theory, vol. 1, pp. 291–311, 1969.
28. H. Krishna, B. Krishna, K.-Y. Lin, and J.-D. Sun, Computational Number Theory and Digital Signal Processing: Fast Algorithms and Error Control Techniques. CRC Press, 1994.