Cited By
View all- Gui ZGe YZhang DWu J(2012)Generalized fast mixed-radix algorithm for the computation of forward and inverse MDCTsSignal Processing10.1016/j.sigpro.2011.08.00192:2(363-373)Online publication date: 1-Feb-2012
An efficient hardware accelerator architecture for implementing fast IMDCT computation
Authors: 
Hui Li, Ping Li, Yiwen WangAuthors Info & Claims
Abstract
In this paper, a new fast inverse modified discrete cosine transform (IMDCT) algorithm and an efficient hardware accelerator architecture are proposed. The proposed fast algorithm is derived from our previously presented type-IV discrete cosine transform/type-IV discrete sine transform (DCT-IV/DST-IV) decomposition algorithm. After transformations of DST-IV to DCT-IV and DCT-IV to IDCT-II, the computational items are further recombined to share hardware resources. Experimental results show that the proposed algorithm's computational cycles are decreased by 20% and 51%, respectively compared with two other reported fast algorithms. By employing resource sharing and multiplexing techniques, the proposed hardware accelerator reduces 24% and 48% of transistors compared with two other ones, respectively.
References
[1]
Princen, J.P. and Bradley, A.B., Analysis/synthesis filter bank designs based on time domain aliasing cancellation. IEEE Trans. Acoust. Speech Signal Process. vASSP-34. 1153-1161.
[2]
J.P. Princen, A.W. Johnson, A.B. Bradley, Subband/transform coding using filter bank designs based on time domain aliasing cancellation, in: Proceedings of IEEE Internationl Conference on Acoustics, Speech, and Signal Processing, Dallas, TX, April 1987, pp. 2161-2164.
[3]
Information technology-coding of moving pictures and associated audio for digital storage media at up to about 1.5Mbit/s-Part 3: Audio, ISO/IEC IS 11172-3, (MPEG1), 1992.
[4]
Information technology-generic coding of moving pictures and associated audio-Part 3: Audio, ISO/IEC IS 13818-3, (MPEG2), 1994.
[5]
Digital Audio Compression (AC-3) Standard, Document of Advanced Television Systems Committee (ATSC): Audio Specialist Group T3/S7, December 1995.
[6]
Cheng, M.H. and Hsu, Y.H., Fast IMDCT and MDCT algorithms-a matrix approach. IEEE Trans. Signal Process. v51 i1. 221-229.
[7]
Shu, H., Bao, X., Toumoulin, C. and Luo, L., Radix-3 algorithm for the fast computation of forward and inverse MDCT. IEEE Trans. Signal Process. Lett. v14 i2. 93-96.
[8]
R.K. Chivukula, Y.A. Reznik, Efficient implementation of a class of MDCT/IMDCT filterbanks for speech and audio coding applications, in: Proceedings of IEEE Internationl Conference on Acoustics, Speech, and Signal Processing, Las Vegas, NV, March 31-April 4, 2008, pp. 213-216.
[9]
Britanak, V. and Rao, K.R., A new fast algorithm for the unified forward and inverse MDCT/MDST computation. Signal Process. v82 i3. 433-459.
[10]
Lee, S.W., Improved algorithm for efficient computation of the forward and backward MDCT in MPEG audio coder. IEEE Trans. Circuits Syst. II: Analog Digital Signal Process. v48 i10. 990-994.
[11]
Truong, T.K., Chen, P.D. and Cheng, T.C., Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding. Signal Process. v86 i5. 1055-1060.
[12]
Wu, J., Shu, H., Senhadji, L. and Luo, L., Mixed-radix algorithm for the computation of forward and inverse MDCTs. IEEE Trans. Circuits Syst. I: Regular Papers. v56 i4. 784-794.
[13]
D.-Y. Chan, J.-F. Yang, S.-Y. Chen, Regular implementation algorithms of time domain aliasing cancellation, in: IEE Proceedings-Vision, Image and Signal Processing, vol. 143(6), December 1996, pp. 387-392.
[14]
C.-H. Chen, C.-B. Wu, B.-D. Liu, J.-F. Yang, Recursive architectures for the forward and inverse modified discrete cosine transform, in: Proceedings of the IEEE Workshop on Signal Processing Systems: Design and Implementation (SiPS'2000), Lafayette, LA, October 2000, pp. 50-59.
[15]
V. Nikolajevic, G. Fettweis, New recursive algorithms for the forward and inverse MDCT, in: Proceedings of the IEEE Workshop on Signal Processing Systems: Design and Implementation (SiPS'2000), Antwerp, Belgium, September 2001, pp. 51-57.
[16]
Nikolajevic, V. and Fettweis, G., New recursive algorithms for the unified forward and inverse MDCT/MDST. J. VLSI Signal Process. Syst. Signal, Image Video Technol. v34 i3. 203-208.
[17]
Z.-Y. Cheng, C.-H. Chen, B.-D. Liu, J.-F. Yang, Unified selectable fixed-coefficient recursive structures for computing DCT, IMDCT and subband synthesis filtering, in: Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS'2004), vol. 3, Vancouver, Canada, May 2004, pp. 557-560.
[18]
T.W. Fox, A. Carriera, Goertzel implementations of the forward and inverse modified discrete cosine transform, in: Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering (CCECE2004), vol. 4, Niagara Falls, Canada, May 2004, pp. 2371-2374.
[19]
Chiang, H.C. and Liu, J.C., Regressive implementation for the forward and inverse MDCT in MPEG audio coding. IEEE Signal Process. Lett. v3 i4. 116-118.
[20]
Nikolajevic, V. and Fettweis, G., Computation of forward and inverse MDCT using Clenshaw's recurrence formula. IEEE Trans. Signal Process. v51 i5. 1439-1444.
[21]
Chen, C.H., Liu, B.D. and Yang, J.F., Recursive architectures for realizing modified discrete cosine transform and its inverse. IEEE Trans. Circuits Syst-II: Analog Digital Process. v50 i1. 38-45.
[22]
Li, H., Li, P. and Wang, Y., A new decomposition algorithm of DCT-IV DST-IV for realizing fast IMDCT computation. IEEE Signal Process. Lett. v16 i9. 735-738.
[23]
Wang, Z.D., Fast algorithms for the discrete W transform and for the discrete Fourier transform. IEEE Trans. Acoust. Speech Signal Process. vASSP-32. 803-816.
[24]
R. Koenig, T. Stripf, J. Becker, A novel recursive algorithm for bit-efficient realization of arbitrary length inverse modified cosine transforms, in: Proceedings of Design, Automation and Test in Europe (DATE 2008), Munich, Germany, March 10-14, 2008, pp. 604-609.
[25]
Uyemura, J.P., Introduction to VLSI Circuits and Systems. 2004. Publishing House of Electronics Industry, Beijing, China.
Recommendations
Low complexity and fast computation for recursive MDCT and IMDCT algorithms
Fast algorithms are derived for modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) in this brief. The proposed algorithms based on type II discrete cosine transform and type II discrete sine transform not only adopt a unified ...
Fast IMDCT and MDCT algorithms - a matrix approach
This paper presents a systematic investigation of the modified discrete cosine transform/inverse modified discrete cosine transform (MDCT/IMDCT) algorithm using a matrix representation. This approach results in new understanding of the MDCT/IMDCT, ...
Hardware Efficient Fast Computation of the Discrete Fourier Transform
In this paper, a new systolic array for prime N-length DFT is first proposed, and then combined with Winograd Fourier Transform algorithm (WFTA) to control the increase of the hardware cost when the transform length is large. The proposed new DFT design ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © Elsevier B.V. © 2010.
Publisher
Elsevier North-Holland, Inc.
United States
Publication History
Published: 01 August 2010
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025
Other Metrics
Citations
Cited By
View all- Gui ZGe YZhang DWu J(2012)Generalized fast mixed-radix algorithm for the computation of forward and inverse MDCTsSignal Processing10.1016/j.sigpro.2011.08.00192:2(363-373)Online publication date: 1-Feb-2012