A residue number system implementation of real orthogonal transforms

IEEE Transactions on Signal Processing

Volumn 46, Issue 3, 1998, Pages 563-570

  Dimitrov, Vassil S ^a   Jullien, Graham A ^a   Miller, William C ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Computational complexity; Computer arithmetic; Discrete transforms; Finite rings; Number systems; Number theory; Residue number systems

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; NUMBER THEORY;

REAL ORTHOGONAL TRANSFORMS; RESIDUE NUMBER SYSTEMS;

DIGITAL SIGNAL PROCESSING;

EID: 0032023710     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.661325     Document Type: Article

References (21)

1. N. Ahmed and K. R. Rao, Orthogonal Transforms in Digital Signal Processing. New York: Springer-Verlag, 1975.
2. M. Soderstrand, W. K. Jenkins, G. A. Jullien, and F. Taylor, Residue Number Systems: Modern Applications in Digital Signal Processing. New York: IEEE, 1986.
3. J. H. Cozzens and L. A. Finkelstein, "Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers," IEEE Trans. Inform. Theory, vol. IT-31, pp. 580-588, 1985.
4. A. L. Bequilard and S. D. O'Neil, "Systolic RNS computation of the two-dimensional DCT in a ring of algebraic integers," in Proc. 20th Annu. Conf. Inform. Sci. Syst., Princeton Univ., Princeton, NJ, Mar1986, pp. 783-789.
5. G. A. Ray, "Residue arithmetic in rings of algebraic integers," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., 1990, pp. . 1527-1530.
6. G. Bergman, "A number system with an irrational base," Math. Mag., vol. 31, pp. 98-119, 1957.
7. V. S. Dimitrov, T. V. Cooklev, and B. D. Donevsky, "Number theoretic transforms over the golden section quadratic field," IEEE Trans. Signal Process., vol. 43, pp. 1790-1797, Aug. 1995.
8. H. W. Lenstra, Jr. and R. Tijdeman, Eds., Computational Methods in Number Theory, 3rd ed. London, U.K.: Math. Cent. Tracts, 1987, vol. 155.
9. T. K. Truong, J. J. Chang, I. S. Hsu, D. Y. Pei, and I. S. Reed, "Techniques for computing the DFT using the quadratic Fermât residue number system," IEEE Trans. Comput., vol. C-35, pp. 1008-1012, Nov. 1986.
10. S. Vajda, Fibonacci and Lucas Numbers and the Golden Section: Theory and Applications. New York: Wiley, 1989.
11. N. Ahmed, T. Natarajan, and K. R. Rao, "Discrete cosine transform," IEEE Trans. Comput., vol. C-23, pp. 90-93, Jan. 1974.
12. V. S. Dimitrov and T. V. Cooklev, "Two algorithms for modular exponentiation using nonstandard arithmetics," IEICE Trans. Fundamentals, vol. E78-A, pp. 82-87, 1995.
13. G. E. Collins, "Computing time analysis for some arithmetic and algebraic algorithms," in Proc. 1968 Summer Inst. Symbolic Math. Comput., IBM Corp., Cambridge, MA, 1969, pp197-231.
14. P. Erdos, M. Horvath, and I. Joo, "On the uniqueness of the expansion 1 = 51 8~''" Acta Mathematica Hungarica, vol. 58, pp. 333-342, 1991.
15. R. A. Games, D. Moulin, S. D. O'Neil, and J. Rushanan, "Algebraic-integer quantization and residue number system processing," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., 1989, vol. D3.15, pp. 948-951.
16. I. S. Reed and T. K. Truong, "Convolutions over residue classes of quadratic integers," IEEE Trans. Inform. Theory, vol. IT-21, pp. 468-475, 1976.
17. E. Borel, "Les probabilities denumbrables et leurs applications arithmé tiques," Rend. Cire. Math., Palermo, vol. 27, pp. 247-271, 1909.
18. J. C. Lagarias, "Worst-case complexity bounds for algorithms in the theory of integral quadratic forms," J. Algorithms, vol. 1, pp. 142-186, 1980.
19. M. O. Rabin, "Probabilistic algorithms in finite fields," SIAM J. Comput., vol. 9, pp. 273-280, 1980.
20. R. Peralta, "A simple and fast probabilistic algorithm for computing square roots modulo a prime number," IEEE Trans. Inform. Theory, vol. IT-32, pp. 846-847, 1986.
21. E. Bach, "Realistic analysis of some randomized algorithms," J. Comput. Syst. Sci., vol. 18, pp. 110-121, 1991.