Performance Evaluation of Various Discrete Cosine Transforms


Author(s): S.Varkeessheeba, V.Magudeeswaran

Digital signal processing (DSP) algorithms exhibit an increasing need for the efficient implementation of complex arithmetic operations. Coordinate transformations of complex valued phasors and the computation of trigonometric functions is sort of naturally involved with modern DSP algorithms. One of the most computationally high algorithms called the Discrete Cosine Transform. Discrete cosine transform (DCT) is widely used transform in image and signal processing and it has a strong property which is energy compaction. Most of the signal information is concentrated in a few low-frequency components of the DCT. It’s a real transform with better computational efficiency and it does not introduce discontinuity while imposing periodicity in the time signal. Many DCT algorithms were proposed in order to achieve high speed DCT and low power consumption. CORDIC algorithm can be widely used in Software Defined Radio, wireless communications and medical imaging applications. These are heavily dependent on signal processing. The algorithm is very much hardware efficient because it performs combination of shift-add operations and omits the dependence on multipliers. This article discusses the CORDIC algorithm and various DCT performances in the Digital Signal Processing.