A comrade-matrix-based derivation of the different versions of fast cosine and sine transforms

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5205, Issue , 2003, Pages 399-410

  Olshevsky, Alexander ^a   Olshevsky, Vadim ^b   Wang, Jun ^c  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Comrade matrix; Discrete cosine transform; Discrete sine transform; Fast fourier transform

Indexed keywords

BOUNDARY CONDITIONS; COSINE TRANSFORMS; FAST FOURIER TRANSFORMS; MATHEMATICAL MODELS; MATRIX ALGEBRA;

COMRADE MATRIX; DISCRETE COSINE TRANSFORM; DISCRETE SINE TRANSFORM;

ALGORITHMS;

EID: 1842450889     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.508161     Document Type: Conference Paper

References (6)

1. S. Barnett, Division of Generalized Polynomials Using the Comrade Matrix, Linear Algebra and Its Applications 60:159-275 (1984)
2. T.Kailath and V.Olshevsky. Displacement structure approach to discrete trigonometric transform based preconditioners of G.Strang and T.Chan types. Calcolo, 33 1996, 191-208.
3. K.R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press, 1990.
4. G. Strang The Discrete Cosine Transform, SIAM Review, 41:135-147.
5. G. Strang Introduction to Applied Mathematics, Wellesley-Cambridge Press, 1986
6. C. Van Loan, Computational Frameworks for the Fast Fourier Transform, SIAM Publications, 1992.