A fast cosine transform in one and two dimensions
DOI10.1109/TASSP.1980.1163351zbMATH Open0522.65092WikidataQ55970223 ScholiaQ55970223MaRDI QIDQ3673048FDOQ3673048
Publication date: 1980
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
signal processingimage processingdiscrete Fourier transformfast Fourier transformdiscrete cosine transformfast cosine transformspeech processing
Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)
Cited In (15)
- The Chebyshev points of the first kind
- Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications
- Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization
- Fast radix-\(p\) discrete cosine transform
- Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms
- Modal clustering of matrix-variate data
- DCT-former: efficient self-attention with discrete cosine transform
- FluTAS: a GPU-accelerated finite difference code for multiphase flows
- \texttt{PittPack}: an open-source Poisson's equation solver for extreme-scale computing with accelerators
- Circular-symmetric correlation layer
- A generalized approach to linear transform approximations with applications to the discrete cosine transform
- A fast cosine transformation accelerated method for predicting effective thermal conductivity
- On algebras related to the discrete cosine transform
- Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
- Concurrent computation of two-dimensional discrete cosine transform
This page was built for publication: A fast cosine transform in one and two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673048)
