The MPEG committee has completed development of a new audio coding standard called “MPEG-4 advanced audio coding-enhanced low delay” (AAC-ELD). AAC-ELD uses low delay spectral band replication (LD-SBR) technology together with a low delay time domain alias cancellation (LD TDAC) filterbank in the encoder to achieve both high coding efficiency and low algorithmic delay. In this paper, we present fast algorithms for implementing LD-TDAC filterbanks in AAC-ELD. Two types of fast algorithms are presented. In the first, we map LD-TDAC analysis and synthesis filterbanks to modified discrete cosine transform (MDCT) and inverse modified discrete cosine transform (IMDCT), respectively. Since MDCT/IMDCT are already extensively used in AAC and they have many fast algorithms, this mapping not only provides a fast implementation but also allows a common implementation of the filterbanks in AAC Low Complexity (AAC-LC), AAC Low Delay (AAC-LD) and AAC-ELD codecs. In the second algorithm, we provide a mapping to discrete Cosine transform of type II. The mapping to DCT-II allows the merger of the matrix operations with the windowing stage that precedes or follows them. This further reduces the number of multiplications and leads to an algorithm with the lowest known arithmetic complexity. For filterbanks of lengths 1024 and 960, we also present a new fast factorization of 15-point DCT-II that requires only 14 irrational multiplications, 3 dyadic rational multiplications and 67 additions.

The MPEG committee has recently completed development of a new audio coding standard “MPEG-4 Advanced Audio Coding-Enhanced Low Delay” (AAC-ELD). AAC-ELD is targeted towards high-quality, full-duplex communication applications such as audio and video conferencing. AAC-ELD uses low delay spectral band replication (LD-SBR) technology together with a low delay AAC core encoder to achieve high coding efficiency and low algorithmic delays. In this paper, we present fast algorithms for computing LD-SBR filterbanks in AAC-ELD. The proposed algorithms map complex exponential modulation portion of the filterbanks to discrete cosine transforms of types IV and II. Our proposed mapping also allows to merge some multiplications with the windowing stage that precedes or succeeds the modulation step. This further reduces computational complexity. Our presentation includes detailed explanation and flow-graphs of the algorithms, complexity analysis, and comparisons with alternative implementations.

This paper presents fast 15times15 transform for image and video coding applications. We note, that our proposed transform is significantly less complex than DCT-II of nearest dyadic size N=16, for which best known factorization [2] requires 31 multiplications and 81 additions. In comparison with H.264-type cascade of 4-point transforms, our proposed algorithm is slightly higher in complexity, but offers better coding gain.

In this paper, an efficient algorithm for implementing MDCT/IMDCT of lengths N = 5 ldr 2m(m ges 2) is presented. Transforms for such lengths are of interest for speech and audio coding applications, such as recently issued and/or emerging standards G.729.1, G.EV-VBR, and EVRC-WB. In our design we utilize a mapping of MDCT of size N into JV/2-point DCT-IV and DCT-II with isolated pre- multiplications, which are subsequently moved in the windowing stage. We show that such a modified window is piece-wise symmetric, and can be stored using N/2 words. In our algorithm we also use an efficient factorization of 5- point DCT-II which requires only 4 multiplications by irrational factors. We compare our proposed algorithm with several alternative implementations and show that our design offers practically appreciable reduction in complexity and memory usage.