Efficient Input Reordering for the DCT Based on a Real-Valued Decimation in Time FFT
| Title | Efficient Input Reordering for the DCT Based on a Real-Valued Decimation in Time FFT |
| Publication Type | Technical Report |
| Year of Publication | 1995 |
| Authors | Storn, R. |
| Other Numbers | 1001 |
| Abstract | The possibility of computing the Discrete Cosine Transform (DCT) of length N=2^n, n integer, via an N-point 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. |
| URL | http://www.icsi.berkeley.edu/ftp/global/pub/techreports/1995/tr-95-061.pdf |
| Bibliographic Notes | ICSI Technical Report TR-95-061 |
| Abbreviated Authors | R. Storn |
| ICSI Publication Type | Technical Report |