# A Simplified Design Approach for Efficient Computation of DCT

@article{Muchahary2015ASD, title={A Simplified Design Approach for Efficient Computation of DCT}, author={D. Muchahary and Abir J. Mondal and Rajesh Singh Parmar and Amlan deep Borah and A. Majumder}, journal={2015 Fifth International Conference on Communication Systems and Network Technologies}, year={2015}, pages={483-487} }

Discrete cosine transform (DCT) is the most widely used transformation technique in the field of signal processing particularly in the areas of image data. This paper addresses the design of parallel architectures for computing DCT using CORDIC. It concentrates on indirect methods, which avoids decomposition of direct DCT equation. In this paper, CORDIC methodology has been used to simplify the traditional indirect techniques for the computation of DCT. The proposed methodology is CORDIC… Expand

#### Figures, Tables, and Topics from this paper

#### 3 Citations

An Efficient 2D Discrete Cosine Transform Processor for Multimedia Applications

- Computer Science
- 2020 28th Signal Processing and Communications Applications Conference (SIU)
- 2020

To demonstrate this, 2D DCT is implemented in associate in-memory processors and the proposed accelerator achieves the best energy efficiency for 4K HD inputs at 30 frames per second. Expand

Circular-Symmetric Correlation Layer based on FFT

- Computer Science
- ArXiv
- 2021

A Circular-symmetric Correlation Layer (CCL) is proposed based on the formalism of roto-translation equivariant correlation on the continuous group S × R, and implemented efficiently using the well-known Fast Fourier Transform (FFT) algorithm. Expand

Local Entropy and Standard Deviation for Facial Expressions Recognition in Thermal Imaging

- Computer Science
- 2018

The Discrete Cosine Transform with Local Entropy (LE) and Local Standard Deviation (LSD) features are presented as an efficient filters for investigating human emotional state in thermal images. Expand

#### References

SHOWING 1-10 OF 15 REFERENCES

A scaled DCT architecture with the CORDIC algorithm

- Computer Science
- IEEE Trans. Signal Process.
- 2002

This paper presents an efficient approach for computing the N-point (N=2/sup n/) scaled discrete cosine transform (DCT) with the coordinate rotation digital computer (CORDIC) algorithm based on an indirect approach so that the vector rotations are completely separated from the other operations and placed at the end of the DCT unit. Expand

A new algorithm to compute the DCT and its inverse

- Mathematics, Computer Science
- IEEE Trans. Signal Process.
- 1991

A novel algorithm to convert the discrete cosine transform (DCT) to skew-circular convolutions is presented and it is shown that the inverse DCT (IDCT) can be computed using the same building blocks which are used for computing the DCT. Expand

Practical fast 1-D DCT algorithms with 11 multiplications

- Mathematics, Computer Science
- International Conference on Acoustics, Speech, and Signal Processing,
- 1989

A class of practical fast algorithms is introduced for the discrete cosine transform (DCT) and the structure of many of the published algorithms can be found in members of this class. Expand

Discrete Cosine Transform

- Mathematics
- 1974

A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of… Expand

Low-power and high-quality Cordic-based Loeffler DCT for signal processing

- Mathematics, Computer Science
- IET Circuits Devices Syst.
- 2007

The proposed Cordic-based Loeffler DCT is very suitable for low-power and high-quality encoder/decoders (codecs) used in battery-based systems and retains the good transformation quality of the original Loeffer DCT. Expand

High throughput CORDIC-based systolic array design for the discrete cosine transform

- Mathematics, Computer Science
- Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94
- 1994

A modified Malvar algorithm that can transfer thediscrete Hartley Transform results to the Discrete Cosine Transform by using a one additional CORDIC computing stage is proposed. Expand

A CORDIC-friendly FFT architecture

- Computer Science
- 2014 International Wireless Communications and Mobile Computing Conference (IWCMC)
- 2014

This paper introduces a restructure of the butterflies of the radix-2 FFT to be more CORDIC friendly, which achieves superior signal to quantization noise ratio (SQNR), and leads to an improvement in latency or a reduction in the total area. Expand

On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences

- Mathematics
- 1990

An algorithm based on O/sup 2/DFT (odd-time odd-frequency discrete Fourier transform) is presented for the computation of the EDCT-2 of purely real sequences. Comparison of this algorithm with two… Expand

A Storage Efficient Way to Implement the Discrete Cosine Transform

- Computer Science
- IEEE Transactions on Computers
- 1976

This correspondence shows that the amount of work can be cut to doing two single length FFT's, which is equivalent to doing one double length fast Fourier transform. Expand

On the Computation of the Discrete Cosine Transform

- Mathematics, Computer Science
- IEEE Trans. Commun.
- 1978

An N -point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared… Expand