Research on 2-D DCT Algorithm and Performance Based on Transform Basic Matrix

Abstract:

With the development of information processing technology, 2-D DCT has been used more and more widely. But the 2-D DCT is accomplished by computing twice 1-D DCT successively, and cannot embody the total space characteristic of 2-D transform well. To overcome such drawbacks, the paper has broken the traditional thinking of DCT operation, and proposed 2-D SDCT operation method. First, some new 2-D matrix operation principles are defined. Then, the transform basic matrix used for 2-D SDCT operation was build and the operation principle of 2-D SDCT is described in detail. Finally, the performance of 2-D SDCT was described systematically. The theoretical analysis shows that the proposed method makes 2-D DCT succinct to express, easy to comprehend and convenient to operate.

• Periodical: Applied Mechanics and Materials (Volumes 58-60)
• Pages: 2570-2575
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.58-60.2570
• Online since: June 2011
• Authors: Wen Bang Sun, He Xin Chen, Wen Bing Sun, Mai Yu Zhou
• Keywords: DCT, SDCT, Transform Basic Matrix

References

[1] Chen W. A., Harrison C., Fralick S. C: A Fast Computational Algorithm for the Discrete Cosine Transform. IEEE Transactions on Communications, Vol. 25, No. 9(1977): 1004-1011.

DOI: 10.1109/tcom.1977.1093941

[2] Lee B. G.: A New Algorithm to Compute the Discrete Cosine Transform. IEEE Transactions on Acoustics Speech, and Signal Processing, Vol. 32, No. 6(1984): 1243-1245.

DOI: 10.1109/tassp.1984.1164443

[3] Suehiro N.: Fast algorithms for the DFT and other sinusoidal transform. IEEE Transactions on Acoustics Speech and Signal Processing, Vol. 34, No. 3(1986): 642~644.

DOI: 10.1109/tassp.1986.1164854

[4] Vetterli M.: Simple FFT and DCT algorithms with reduced number of operations. IEEE Signal Processing, Vol. 6, No. 4(1984): 267~278.

DOI: 10.1016/0165-1684(84)90059-8

[5] Feig E., Winograd S.: Fast algorithm for the discrete cosine transform. IEEE Trans SP, Vol. 40, No. 9(1992): 2174-2193.

DOI: 10.1109/78.157218

[6] Tran T. D.: The BinDCT: Fast Multiplierless Approximation of the DCT. IEEE Signal Processing Letters, Vol. 7, No. 6(2000): 141-144.

DOI: 10.1109/97.844633