METHOD AND CIRCUIT FOR PERFORMING CORDIC BASED LOEFFLER DISCRETE COSINE TRANSFORMATION (DCT) FOR SIGNAL PROCESSING

• US 20070250557A1
• Filed: 04/24/2007
• Published: 10/25/2007
• Est. Priority Date: 04/24/2006
• Status: Abandoned Application

• Current Assignee: National Taiwan University of Science and Technology, Universitã¤T Dortmund
• Original Assignee: National Taiwan University of Science and Technology, Universitã¤T Dortmund
• Inventors: Ruan, Shang-Jang, Sun, Chi-Cha, Heyne, Benjamin, Gotze, Jorgen
• Application Number:
  US11/739,669
• Publication Number:
  US 20070250557A1
• Time in Patent Office: Days
• US Class Current: 708/400
• CPC Class Codes: G06F 17/147 Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform G06F17/145 takes precedence
• CPC Class Codes: H04N 19/42 characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation H04N19/635 takes precedence

Abstract

A low-power and high-quality DCT transformation based on the Cordic method is presented. The proposed Cordic based Loeffler DCT architecture only requires 38 add and 16 shift operations to carry out the DCT transformation. The complexity is almost the same as the complexity of the binDCT-C5. The simulation results show that the DCT according to the invention reduces the area and the power dissipation of the implementation compared to the original Loeffler DCT significantly. Furthermore, it only has a fraction of the power dissipation of the binDCT-C5. The major contribution of the DCT according to the invention is that it not only reduces the area and power consumption significantly, but also keeps the good transformation quality of the original Loeffler DCT. It is worth noticing that the Cordic based Loeffler DCT according to the invention is very suitable for low-power and high-quality CODECs in multimedia hand-held systems.

Claims

1. A method for performing a Loeffler discrete cosine transformation (Loeffler DCT), comprising:

using a coordinate rotation digital computer method (Cordic method) suitable for signal processing, wherein all relationships and butterfly stages are expressed as Cordic transformations, and wherein the Cordic transformations are carried out by a combination of shift and add operations with compensational steps in a final quantizer without multiply operations.

2. The method according to claim 1, wherein all relationships and butterfly stages for carrying out the Loeffler DCT are expressed as Cordic transformations.

3. The method according to claim 1, wherein the Cordic-transformations except for Cordic transformations for π

/16, 3π

/8, 3π

/16 are directly carried out by a combination of shift and add operations each with a compensational step in a final quantizer.

4. The method according to claim 1, wherein the method for performing the Loeffler DCT comprises 38 add and 16 shift operations.

5. The method according to claim 1, wherein the scaled butterflies of the Loeffler DCT are replaced by Cordic transformations using θ

=3π

/8, θ

=π

/16, θ

=3π

/16 and θ

=π

/4 to derive a pure Cordic based Loeffler DCT.

6. The method according to claim 5, wherein compensation iterations of the π

/4 rotation are shifted to the final quantizer.

7. The method according to claim 5, wherein the Cordic transformation of π

/4 is carried out with two add operations.

8. The method according to claim 5, wherein the Cordic transformations for π

/16 are carried out by a combination of shift and add operations.

9. The method according to claim 5, wherein the Cordic transformations for 3π

/8 are carried out by a combination of shift and add operations.

10. The method according to claim 9, wherein the Cordic transformation for 3π

/8 is carried out by three rotation iterations and shifting all compensational steps to the final quantizer.

11. The method according to claim 9, wherein the Cordic transformation for 3π

/8 is carried out by six add and six shift operations for approximating the 3π

/8 Cordic rotation.

12. The method according to claim 5, wherein the Cordic transformation for π

/16 is carried out by two rotation iterations while ignoring needed compensation.

13. The method according to claim 5, wherein the Cordic transformation for 3π

/16 is carried out by a combination of shift and add operations including two compensational steps.

14. The method according to claim 13, wherein the Cordic transformation for 3π

/16 is carried out by four rotation iterations.

15. The method according to claim 1, wherein compensation steps in the final quantizer are carried out using a quantization table.

16. A circuit for carrying out the method according to claim 1, comprising shifting means, adding and subtracting means and a final quantizer.

17. The circuit according to claim 16, wherein the circuit comprises a VLSI design.

18. The circuit according to claim 16, wherein the final quantizer is built using a quantization table.

19. A computer program comprising a computer-readable storage medium including a program suitable for a computer to carry out a method for performing a Loeffler discrete cosine transformation (Loeffler DCT) for signal processing comprising using a coordinate rotation digital computer method (Cordic method) suitable for signal processing, wherein all relationships and butterfly stages are expressed as Cordic transformations, and wherein the Cordic transformations are carried out by a combination of shift and add operations with compensational steps in a final quantizer without multiply operations.

20. A computer-readable storage medium comprising a program suitable for a computer to carry out a method for performing a Loeffler discrete cosine transformation (Loeffler DCT) for signal processing comprising using a coordinate rotation digital computer method (Cordic method) suitable for signal processing, wherein all relationships and butterfly stages are expressed as Cordic transformations, and wherein the Cordic transformations are carried out by a combination of shift and add operations with compensational steps in a final quantizer without multiply operations.