臺灣博碩士論文加值系統

本論文對修改型離散餘弦轉換(MDCT)與其反轉換(IMDCT)提出兩個快速計算方法。第一個IMDCT的快速計算方法可分成三個步驟步驟，首先將信號乘以N/2點的餘弦數列，再做N/2點DCT的快速計算，接著再將計算出來的信號做簡單的遞迴加減運算，就可以求得N點IMDCT的值。第二個新的快速計算方法的步驟剛好跟第一個新的快速計算方法相反，先將信號做遞迴加減法的運算，再對運算出來的信號做N/2點的IDCT的計算，接著再將計算出來的信號乘以N/2點的餘弦數列，就可以求出N點IMDCT的值。將上述兩個新的快速IMDCT的信號流程圖做轉置就可以得到兩個新的快速MDCT的計算方式。
本論文對文獻中和新的快速MDCT的計算方法做計算量的比較和定點誤差的模擬，新的方法計算量和文獻中的方法方法一樣好，但是定點誤差卻比已經提出的方法來的小，所以，本論文提出的新的快速MDCT計算方法在數值的精確度上有較好的表現。

In this thesis, we present two new algorithms for computing the inverse modified discrete cosine transform(IMDCT) such that the computation complexity is equal to but the numerical performance is better than existing fast algorithms. To compute N-point IMDCT, the first algorithm is realized in the following sequence: multiplication of the N/2 input data by an N/2-value cosine sequence, N/2-point fast DCT, and a simple recursive addition. The second algorithm, closely reversing the computation procedures of the first algorithm, is realized in order by simple recursive addition, N/2-point IDCT, and multiplication of the IDCT output by an N/2-value cosine sequence. MDCT realization can be simply obtained by transposing the signal flow graph for evaluating the IMDCT.
For the proposed two IMDCT algorithms,
we have analyzed the realization complexity and simulated the fixed-point error. Comparing with the existing fast IMDCT algorithms in literature, we observe from the analysis and simulation results that the new algorithms have better numerical accuracy and thus can be realized with short word length, resulting in more efficient realization.

Chap.1 簡介
Chap.2 離散餘弦轉換
Chap.3 文獻中各種MDCT/IMDCT之快速演算法
Chap.4 新的快速MDCT/IMDCT演算法
Chap.5 結論

[1] P. P. Vaidyanathan, ``Quadrature Mirror Filter Banks,M-Banb Extensions and Perfect-Reconstruction Techniques," IEEE ASSP Magazine, vol. 4, pp. 4-20, July. 1987.
[2] J. P. Princen, A. W. Johnson, and A. B. Bradley, ``Subband/Transform Coding Using Filter Bank Designs Based on Time Domain Aliasing Cancellation," proc. Int. Conf. Acoustics, Speech, and Signal processing(ICASSP-87), pp. 2161-2164, May. 1987.
[3] Henrique Malvar, Signal Processing with Lapped transforms, Arctech House, Boston, MA, 1992.
[4] Yun-Hui Fan, Vijay K. Madisetti, Russell M.Mersereau, ``On Fast Algorithms for Computing the Inverse Modified Discrete Cosine Transform," IEEE Signal Processing Letters, vol. 6, No. 3, pp. 61-64, March. 1999.
[5] Wang Jlanxin and Dong Zaiwang, ``A Fast Algorithm for Modified Discrete Cosine Transform," Communication Technology Proc., 1996. ICCT'96., 1996 Int. Conf., vol. 1, No. 5-7, pp. 445-448, May. 1996.
[6] Vladimir Britanak and K. R. Rao, ``An Efficient Implementation of the Forward and ncerse MDCT in MDCT in MPEG Audio Coding," IEEE Signal Processing Letters, vol. 8, No. 2 , pp. 48-51, Feb. 2001.
[7] N. Ahmed, T. Natarajan, K. R. Rao, ``Discrete Cosine
Transform," IEEE Trsns. Comput., vol. C-23, pp. 90-93, Jan.
1974.
[8] ISO/IEC International Standard IS 11172-3, ``Information Technology-Coding of Moving Pictures and Associated Audio for Digital Storage Media at up to about 1.5 Mbits/s -Part 3: Audio."
[9] Konstantinos Konstantinides, ``Fast Subband Filtering in MPEG Audio Coding," IEEE Signal Processing Letters, vol. 1, No. 2, pp. 26-28, Feb. 1994.
[10] Byeong Gi Lee, ``A New Algorithm to Compute the Discrete Cosine Transform," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, No. 6, pp. 1243-1245, Dec. 1984.
[11] Hsieh S. Hou, ``A Fast Recursive Algirithm for Computing the Discrete Cosine Transform,"IEEE Trans. Acoust., Speech, Signal processing, vol. ASSP-35, No. 10, pp. 1455-1461, Oct. 1987.
[12] M. Vetterli and H. Nussbaumer, ``Simple FFT and DCT Algorithm With Reduced Number of Operations," Signal Processing, vol. 6, No. 4, pp. 267-278, Aug. 1984.
[13] W. H. Chen, C. H. Smith, and S. C. Fralick, ``A Fast Computational Algorithm for the Discrete Cosine Transform,"
IEEE Trans. Commun., vol. COM-25, pp. 1004-1008, Sept. 1977.
[14] N. Suehiro and M. Hatori, ``Fast Algorithms for the DFT and Other Sinusoidal Transforms," IEEE Trans. Acoust. Speech, Signal processing, vol. ASSP-34, pp. 642-644, June. 1986.
[15] J. Makhoul, ``A Fast Cosine Transform in One and Two Dimensions," IEEE Trans. Acoust. Speech, Signal processing, vol. ASSP-28, pp. 27-34, Feb. 1980.
[16] Michael T. Heideman, ``Computation of an Odd-length DCT from a Real-Valued DCT of the Same Length," IEEE Trans. Signal Processing, vol. 40, No. 1, pp. 54-61, Jan. 1992.
[17] Yuk-Hee Chan and Wan-Chi Siu, ``Fast Radix-3/6 Algorithms for the Realization of the Discrete Cosine Transform,"
IEEE Trans. Signal Processing, vol. 1, No. 24-28, pp. 3157-3161, Nov. 1993.
[18] Yiquan Wu and Zhaoda Zhu, ``New Radix-3 Fast Algorithm for the Discrete Cosine Transform ,"Proc. IEEE conf. Aerospace and Electronics, vol. 41, No. 11, pp. 86-89, May. 1993.
[19] K. S. Harish and K.M. Prabhu, ``Fixed-Point Error Analysis of two DCT Algoruthms," IEE Proc.-Vis Image Signal processing, vol. 147, No. 2, pp. 131-137, April. 2000.