Efficient Input Reordering for the DCT Based on a Real-Valued Decimation in Time FFT [1 citations — 0 self]
Download:
|
|
by Rainer Storn
http://http.icsi.berkeley.edu/~storn/fct2.ps.gz
Add To MetaCart
Abstract:
The possibility of computing the Discrete Cosine Transform (DCT) of length N=2 n, n integer, via an Npoint Discrete Fourier Transform (DFT) is widely known from the literature. In this correspondence it will be demonstrated that this computation can be done in-place by just employing butterfly swaps if the input reordering- necessary for the DCT computation via DFT- is combined with the bit-reverse scrambling required by the decimation in time Fast Fourier Transform-algorithm.
Citations
| 14 | A Fast Cosine Transform in One and Two Dimensions – Makhoul - 1980 |
| 10 | Restructured recursive DCT and DST algorithms – Lee, Huang - 1994 |
| 5 | On computing the discrete Fourier and Cosine transforms – Wang - 1985 |
| 1 | On the Discrete Cosine Transform Computation", Signal processing 40 – Britanah - 1994 |
| 1 | et alii, Real-Valued Fast Fourier Transform Algorithms – Sorensen - 1987 |
