On the Computation of the Discrete Cosine Transform
From MaRDI portal
Publication:4155792
DOI10.1109/TCOM.1978.1094144zbMath0377.65069DBLPjournals/tcom/NarasimhaP78WikidataQ55970222 ScholiaQ55970222MaRDI QIDQ4155792
Allen M. Peterson, Madihally J. Narasimha
Publication date: 1978
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Related Items (10)
Numerical differentiation by a Tikhonov regularization method based on the discrete cosine transform ⋮ On algebras related to 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 ⋮ A quadratic classifier for high-dimensional, periodic-measurement pattern-recognition problems ⋮ 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 ⋮ Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms ⋮ Simple systolic arrays for discrete cosine transform ⋮ Cosine manifestations of the Gelfand transform
This page was built for publication: On the Computation of the Discrete Cosine Transform