On the Computation of the Discrete Cosine Transform

DOI10.1109/TCOM.1978.1094144MaRDI QIDQ4155792zbMATH OpenDBLPWikidataFDO

Authors Madihally J. Narasimha, Allen M. Peterson

Publication date 1978

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCOM.1978.1094144

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Cited in

(10)

• A quadratic classifier for high-dimensional, periodic-measurement pattern-recognition problems
• On algebras related to the discrete cosine transform
• Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms
• Cosine manifestations of the Gelfand transform
• Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications
• Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations
• Numerical differentiation by a Tikhonov regularization method based on the discrete cosine transform
• Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization
• Numerical modeling of aluminium foam on two scales
• Simple systolic arrays for discrete cosine transform

This page was built for publication: On the Computation of the Discrete Cosine Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4155792)