Efficient implementation of n-point DCT, n-point IDCT,...

Details Efficient implementation of n-point DCT, n-point IDCT,... Efficient implementation of n-point DCT, n-point IDCT,...

2007-05-08

2007-05-08

An, Meng-Al T. (Department: 2193)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

Reexamination Certificate

active

09676556

ABSTRACT:
An efficient implementation of n-point discrete cosine transform, n-point inverse discrete cosine transform, shape adaptive discrete cosine transform and shape adaptive inverse discrete cosine transform algorithms for multimedia compression and decompression optimization. An n-point DCT function is represented by a first equation having an input matrix, an output matrix and a matrix of predetermined values. An n-point IDCT function is represented by a second equation having an input matrix, an output matrix and a matrix of predetermined values. The multiplication operations within the matrix of predetermined values are paired, thereby reducing processor instructions. SIMD operations, MMX operations, VLSI implementation, single processor implementation, and vector processing are used to perform the algorithms.

REFERENCES:
patent: 5325215 (1994-06-01), Shibata et al.
patent: 5422836 (1995-06-01), Beichter et al.
patent: 5522085 (1996-05-01), Harrison et al.
patent: 5610849 (1997-03-01), Huang
patent: 5621674 (1997-04-01), Gray et al.
patent: 5724278 (1998-03-01), Ohgose et al.
patent: 5764787 (1998-06-01), Nickerson
patent: 5983257 (1999-11-01), Dulong et al.
patent: 5990956 (1999-11-01), Lee
patent: 6006246 (1999-12-01), Ohki
patent: 6058408 (2000-05-01), Fischer et al.
patent: 6237016 (2001-05-01), Fischer et al.
patent: 6243730 (2001-06-01), Wang
patent: 6408025 (2002-06-01), Kaup
patent: 6490607 (2002-12-01), Oberman
patent: 6535946 (2003-03-01), Bryant et al.
patent: 6687724 (2004-02-01), Mogi et al.
Andre Kaup, Object-based Texture coding of moving video in MPEG-4, 1999, IEEE transactions on circuits and systems for video technology vol. 9, No. 1, p. 5-15.
Thuyen Le et al., A new flexible architecture for variable length DCT targeting shape-adaptive transform, 1999, IEEE, p. 1949-1952.
William Smith, Subword extensions for video processing on mobile systems, Sep. 1998, IEEE mobile computing, pp. 13-16.
Yonghon et al., Integer sinusoidal transforms based on lifting factorization, 2001, IEEE, pp. 1181-1184.
Yonghong et al., Integer DCTs and Fast algorithms, Nov. 2001, IEEE Transactions on signal processing, vol. 49, No. 11, pp. 2774-2782.
Chen, Wen-Hsiung, et al., A Fast Computational Algorithm for the Discrete Cosine Transform, IEEE Transactions On Communications, vol. Com-25, No. 3, Sep. 1977, pp. 1004-1009.
Kauff, Peter et al., Experimental Results on a Fast SA-DCT Implementation, International Organisation For Standardisation Organisation Internationale De Normalisation ISO/IEC/JTC1/SC29/WG11 Coding Of Moving Pictures And Audio, ISO/IECJTC1/SC29/2G11N, MPEG 98/3569, Dublin, Jul. 1998, pp. 1-10.
Owzar, M., et al., Evaluation of SA-DCT Hardware Complexity, International Organisation For Standardisation Organisation Internationale De Normalisation ISO/IEC/JTC1/SC29/WG11 Coding Of Moving Pictures And Audio, ISO/IECJTC1/SC29/WG11MPEG 99/4407 Seoul, Mar. 1999, 9 pages.
No Author, Using MMX™ Instructions in a Fast iDCT Algorithm for MPEG Decoding, Application Note AP-528, MMX™ Technology Application Notes, http://developer.intel.com/drg/mmx/appnotes/ap528.htm, Apr. 28, 2000, pp. 1-21.
No Author., Using Streaming SIMD Extensions in a Fast DCT Algorithm for MPEG Encoding, Version 1.2, Jan. 1999, Order No.: 243651-002, Feb. 4, 1999, Copyright © Intel Corporation 1998, 1999, cover pages—p. 7.
H. Fassbender, “The Parameterized SR Algorithm for Symplectic (Butterfly) Matrices”,Mathematics of Computation, vol. 70, No. 236, 2000, p. 1515-1541.

Affiliated with

Also associated with

Rating

Efficient implementation of n-point DCT, n-point IDCT,... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient implementation of n-point DCT, n-point IDCT,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient implementation of n-point DCT, n-point IDCT,... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3814801