Current audio coding standards, such as MPEG-I layers 1-3, MPEG-II layers 1-4, MPEG-!V, and AC-3, have adopted for compression various forms of the cosine modulated filter banks (CMFBs). It is demonstrated that all modulated cosine transforms can be divided into two modules - the permutation and discrete cosine transform. The derived discrete cosine transforms are either type II, type III, or type IV. A fast computing algorith is proposed that will compute all three types of transforms uniformly. The new fast algorithm has good features with regard to regularity, complexity, and general applicability.

Authors: Liu, Chi-Min; Lee, Wen-Chieh
Affiliation: Department and Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan
JAES Volume 47 Issue 12 pp. 1061-1075; December 1999
Publication Date: December 1, 1999

Click to purchase paper as a non-member or you can login as an AES member to see more options.

No AES members have commented on this paper yet.

Subscribe to this discussion

To be notified of new comments on this paper you can subscribe to this RSS feed. Forum users should login to see additional options.

Start a discussion!

If you would like to start a discussion about this paper and are an AES member then you can login here:
Username:
Password:

If you are not yet an AES member and have something important to say about this paper then we urge you to join the AES today and make your voice heard. You can join online today by clicking here.