New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard

摘要

New fast computational structures identical for an efficient implementation of both the forward and backward modified discrete cosine transform (MDCT) in MPEG-1/2 Layer III (MP3) audio coding standard are described. They are based on a new proposed universal fast rotation-based MDCT computational structure [V. Britanak, New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks, Signal Processing 89 (11) (November 2009) 2213-2232]. New fast computational structures are derived in the form of a linear code and they are particularly suitable for high-performance programmable DSP processors. For the short audio block it is shown that our efficient MDCT implementation in MP3 can be modified to achieve the same minimal multiplicative complexity compared to that of Dai and Wagh [An MDCT hardware accelerator for MP3 audio, in: Proceedings of the IEEE Symposium on Application Specific Processors (SASF2008), Anaheim, CA, June 2008, pp. 121-125].