Recycling and parallel processing method and apparatus for performing discrete cosine transform and its inverse
AssigneeWinbond Electronic Corp.
InventorRong-Fuh Shyu
Life of this patent
Estimating the term…
Loading patent…
AssigneeWinbond Electronic Corp.
InventorRong-Fuh Shyu
Estimating the term…
A discrete cosine transform (DCT) apparatus, capable of generating one-dimensional and two-dimensional DCT and inverse DCT results, uses six-stage DCT/IDCT fast algorithms to process a sequence of input data of an 8.times.8 data block. Each of the different stages of the DCT/IDCT fast algorithms involves a number of butterfly operations, which can be performed by a butterfly operation unit of the DCT apparatus, or a number of intrinsic multiplications, a number of post-addition multiplication operations, or a number of post-multiplication subtraction operations, all of which can be performed by a multiplication operation unit. A control unit of the DCT apparatus permits the use of a single butterfly operation unit and a single multiplication operation unit to perform the different stages of the DCT/IDCT fast algorithms. The results of each stage of the DCT/IDCT fast algorithms are stored in a data register unit of the DCT apparatus to serve as inputs for the succeeding stages of the DCT/IDCT fast algorithms.
A discrete cosine transform (DCT) method using a six-stage DCT fast algorithm for parallel processing a sequence of input data of an 8.times.8 data block so as to generate a sequence of transform data, said DCT fast algorithm including first, third and fifth stages, each of which involving a plurality of butterfly operations, second and fourth states, each of which involving a plurality of post-addition multiplication operations, and a sixth stage involving a plurality of intrinsic multiplication operations, said DCT method comprising the steps of:
A one-dimensional discrete cosine transform (DCT) apparatus for performing a six-stage DCT fast algorithm to parallel process a sequence of input data of an 8.times.8 data block so as to generate a sequence of transform data, said DCT fast algorithm including first, third and fifth stages, each of which involving a plurality of butterfly operations, second and fourth stages, each of which involving a plurality of post-addition multiplication operations, and a sixth stage involving a plurality of intrinsic multiplication operations, said DCT apparatus comprising:
An inverse discrete cosine transform (IDCT) method using a six-stage IDCT fast algorithm for parallel processing a sequence of input data of an 8.times.8 data block so as to generate a sequence of transform data, said IDCT fast algorithm including a first stage involving a plurality of intrinsic multiplication operations, second, fourth and sixth stages, each of which involving a plurality of butterfly operations, and third and fifth stages, each of which involving a plurality of post-multiplication subtraction operations, said IDCT method comprising the steps of:
A one-dimensional inverse discrete cosine transform (IDCT) apparatus for performing a six-stage IDCT fast algorithm to parallel process a sequence of input data of an 8.times.8 data block so as to generate a sequence of transform data, said IDCT fast algorithm including a first stage involving a plurality of intrinsic multiplication operations, second, fourth and sixth stages, each of which involving a plurality of butterfly operations, and third and fifth stages, each of which involving a plurality of post-multiplication subtraction operations, said IDCT apparatus comprising:
Dependencies are inferred from the claim text.