24 December 2003 A comrade-matrix-based derivation of the different versions of fast cosine and sine transforms
Author Affiliations +
Abstract
The paper provides a fully self-contained derivation of fast algorithms to compute discrete Cosine and Sine transforms I - II based on the concept of the comrade matrix. The comrade matrices associated with different versions of the transforms differ in only a few boundary elements; hence, in each case algorithms can be derived in a unified manner.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alexander Olshevsky, Alexander Olshevsky, Vadim Olshevsky, Vadim Olshevsky, Jun Wang, Jun Wang, } "A comrade-matrix-based derivation of the different versions of fast cosine and sine transforms", Proc. SPIE 5205, Advanced Signal Processing Algorithms, Architectures, and Implementations XIII, (24 December 2003); doi: 10.1117/12.508161; https://doi.org/10.1117/12.508161
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Quantum hidden subgroup algorithms The devil is in the...
Proceedings of SPIE (August 24 2004)
Two-step Gram-Schmidt downdating methods
Proceedings of SPIE (November 20 2001)
Super-fast Fourier transform
Proceedings of SPIE (February 16 2006)
Parallel QR Decomposition Of Toeplitz Matrices
Proceedings of SPIE (April 04 1986)
Reassigned scalograms and their fast algorithms
Proceedings of SPIE (September 01 1995)

Back to Top