On algebras related to the discrete cosine transform

Linear Algebra and Its Applications

Volumn 266, Issue 1-3, 1997, Pages 81-106

  Feig, Ephraim ^a   Ben Or, Michael ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244447021     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(96)00634-9     Document Type: Article

References (22)

1. N. Ahmed, T. Natarajan, and K. R. Rao, Discrete cosine transform, IEEE Trans. Comput. 23:90-93 (Jan. 1974).
2. L. Auslander, E. Feig, and S. Winograd, The multiplicative complexity of the discrete Fourier transform, Adv. in Appl. Math. 5:87-109 (1984).
3. L. Auslander, E. Feig, and S. Winograd, Abelian semi-simple algebras and algorithms for the discrete Fourier transform, Adv. Appl. Math. 5:31-55 (1984).
4. D. Bini and E. Bozzo, Fast discrete transforms by means of eigenpolynomials, Comput. Math. Appl. 26(9):35-52 (Nov. 1993).
5. W. H. Chen, C. H. Smith, and S. C. Fralick, A fast computational algorithm for the discrete cosine transform, IEEE Trans. Commun. COM-25:1004-009 (Sept. 1977).
6. L. Bergamaschi, R. Bevilacqua, and P. Zellini, Symplectic factorization and parallel iterative algorithms for tridiagonal systems of equations, Calcolo 29(3-4):159-191 (July, Dec. 1992).
7. F. Di Benedetto, Iterative solution of Toeplitz systems by preconditioning with discrete sine transform, Proc. SPIE 2563:302-312 (1995).
8. E. Feig and S. Winograd, On the Multiplicative Complexity of Discrete Cosine Transforms, IBM RC 15461 (No. 68749), 6 Feb. 1990; IEEE Trans. Inform. Theory, submitted for publication.
9. I. J. Good, The colleague matrix, a Chebyshev analogue of the companion matrix, Quart. J. Math. Oxford (2) 12:61-68 (1961).
10. H. S. Hou, A fast recursive algorithm for computing the discrete cosine transform, IEEE Trans. Acoust. Speech Signal Process. ASSP-35(10):1455-1461.
11. A. K. Jain, A sinusoidal family of unitary transforms, IEEE Trans. Pattern Anal. Machine Intell. PAMI-1(4):356-365 (Oct. 1979).
12. B. G. Lee, A new algorithm to compute the discrete cosine transform, IEEE Trans. Acoust. Speech Signal Process. ASSP-32(6):1243-1245 (Dec. 1984).
13. J. Makhoul, A fast cosine transform in one and two dimensions, IEEE Trans. Acoust. Speech Signal Process. ASSP-28(1):27-34 (Feb. 1980).
14. M. J. Narasinha and A. M. Peterson, On the computation of the discrete cosine transform, IEEE Trans. Commun. COM-26(6):934-936 (June 1978).
15. T. J. Rivlin, Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory, 2nd ed. Wiley-Interscience, 1990, pp. 228-230.
16. S. Serra, Multi-iterative methods, Comput. Math. Appl. 26(4):65-87 (1993).
17. N. Suehiro and M. Hatori, Fast algorithms for the DFT and other sinusoidal transforms, IEEE Trans. Acoust. Speech Signal Process. ASSP-34:642-644 (1986).
18. B. D. Tseng and W. C. Miller, On computing the discrete cosine transform, IEEE Trans. Comput. C-27:966-968 (Oct. 1978).
19. M. Vetterli and H. J. Nussbaumer, Simple FFT and DCT algorithms with reduced number of operations, Signal Process., Aug. 1984.
20. Z. Wang, Fast algorithms for the discrete W transform and for the discrete Fourier transform, IEEE Trans. Commun. COM-25:1004-1008 (Sept. 1977).
21. S. Winograd, On computing the discrete Fourier transform, Math. Comp. 32:175-199 (1978).
22. C. Van Loan, Computational Frameworks for the Fast Fourier Transform, Frontiers Appl. Math., SIAM, 1992.