A fast algorithm for the implementation of filter banks based on `time domain aliasing cancellation´

Author

Duhamel, P. ; Mahieux, Y. ; Petit, J.P.

Author_Institution

CNET, Issy les Moulineaux, France

fYear

1991

fDate

14-17 Apr 1991

Firstpage

2209

Abstract

Several data compression techniques are in competition for coding high-quality audio signals (sampling rate ⩾32 kHz) down to a 64 kb/s bit rate. The authors concentrate on the subband/transform coding scheme using filter banks known as time domain aliasing cancellation (TDAC). This scheme first involves a window on a set of N data, overlapping by N/2 with the previous one, followed by a TDAC transform. First, it is shown that the transform turns out to be a doubly odd DCT, for which a fast algorithm is provided. Then, it is shown how the windowing and the overlap can be merged with the first step of the first algorithm. The total number of operations (multiplications plus additions) required by this algorithm for computing a length-N TDAC plus windowing is exactly N log₂ N. Implementation considerations are provided

Keywords

audio signals; data compression; digital filters; encoding; fast Fourier transforms; filtering and prediction theory; signal processing; time-domain analysis; FFT; TDAC transform; data compression; doubly odd DCT; fast algorithm; filter bank implementation; high-quality audio signals; subband/transform coding scheme; time domain aliasing cancellation; Channel bank filters; Data compression; Discrete cosine transforms; Equations; Filter bank; Frequency domain analysis; Quantization; Signal sampling; Transform coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on

Conference_Location

Toronto, Ont.

ISSN

1520-6149

Print_ISBN

0-7803-0003-3

Type

conf

DOI

10.1109/ICASSP.1991.150853

Filename

150853