Journal ArticleDOI
Fast computation of discrete cosine transform through fast Hartley transform
TLDR
A relationship between the discrete cosine transform (DCT) and the discrete Hartleytransform (DHT) is derived and it leads to a new fast and numerically stable algorithm for the DCT.Abstract:
A relationship between the discrete cosine transform (DCT) and the discrete Hartley transform (DHT) is derived. It leads to a new fast and numerically stable algorithm for the DCT.read more
Citations
More filters
Journal ArticleDOI
The LOT: transform coding without blocking effects
TL;DR: An exact derivation of an optimal lapped orthogonal transform (LOT) is presented, related to the discrete cosine transform (DCT) in such a way that a fast algorithm for a nearly optimal LOT is derived.
Journal ArticleDOI
Lapped transforms for efficient transform/subband coding
TL;DR: Two lapped transforms for subband/transform coding of signals are introduced: a version of the lapped orthogonal transform (LOT), which can be efficiently computed for any transform length; and the modulated lapped transform (MLT), which is based on a modulated quadrature mirror (QMF) bank.
Journal ArticleDOI
The Fast Hartley Transform Algorithm
TL;DR: Through use of the fast Hartley transform, discrete cosine transforms (DCT) and discrete Fourier transforms (DFT) can be obtained and the recursive nature of the FHT algorithm derived in this paper enables us to generate the next higher order FHT from two identical lower order F HT's.
Journal ArticleDOI
Fast algorithm for computing discrete cosine transform
TL;DR: An efficient method for computing the discrete cosine transform (DCT) is proposed, which is a generalization of the radix 2 DCT algorithm, and the recursive properties of the DCT for an even length input sequence are derived.
Journal ArticleDOI
Fast computation of the discrete cosine transform and the discrete Hartley transform
TL;DR: A new factorization of the discrete Hartley transform is presented and it is used to derive new algorithms for the DHT and the discrete cosine transform with reduced number of multiplications.
References
More filters
Journal ArticleDOI
Fast algorithms for the discrete W transform and for the discrete Fourier transform
TL;DR: A systematic method of sparse matrix factorization is developed for all four versions of the discrete W transform, the discrete cosine transform, and the discrete sine transform as well as for the discrete Fourier transform, which makes new algorithms more efficient than conventional algorithms.
Journal ArticleDOI
Discrete Hartley transform
TL;DR: The discrete Hartley transform (DHT) resembles the discrete Fourier transform (DFT) but is free from two characteristics of the DFT that are sometimes computationally undesirable and promises to speed up Fourier-transform calculations.
Journal ArticleDOI
Simple FFT and DCT algorithms with reduced number of operations
TL;DR: A simple algorithm for the evaluation of discrete Fourier transforms (DFT) and discrete cosine transforms (DCT) is presented, which achieves a substantial decrease in the number of additions when compared to currently used FFT algorithms.
Journal ArticleDOI
On the Computation of the Discrete Cosine Transform
M.J. Narasimha,A. Peterson +1 more
TL;DR: An N -point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data.