A fast cosine transform in one and two dimensions
From MaRDI portal
Publication:3673048
DOI10.1109/TASSP.1980.1163351zbMath0522.65092WikidataQ55970223 ScholiaQ55970223MaRDI QIDQ3673048
Publication date: 1980
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
image processingfast Fourier transformdiscrete Fourier transformsignal processingspeech processingdiscrete cosine transformfast cosine transform
Signal detection and filtering (aspects of stochastic processes) (60G35) Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
On algebras related to the discrete cosine transform ⋮ Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization ⋮ \texttt{PittPack}: an open-source Poisson's equation solver for extreme-scale computing with accelerators ⋮ Circular-symmetric correlation layer ⋮ FluTAS: a GPU-accelerated finite difference code for multiphase flows ⋮ Modal clustering of matrix-variate data ⋮ DCT-former: efficient self-attention with discrete cosine transform ⋮ A generalized approach to linear transform approximations with applications to the discrete cosine transform ⋮ Fast radix-\(p\) discrete cosine transform ⋮ Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications ⋮ Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms ⋮ Concurrent computation of two-dimensional discrete cosine transform ⋮ Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms ⋮ The Chebyshev points of the first kind
