A fast DCT processor, based on special purpose CORDIC rotators

Mariatos, E. P.; Metafas, D. E.; Hallas, J.A.; Goutis, C.E.

doi:10.1109/iscas.1994.409249

Cited by 19 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [9], authors proposed a low-complexity CORDIC based DCT algorithm based on the Flow Graph Algorithm (FGA) which is the commonly used way to represent the fast DCT. It requires only 38 add and 16 shift operations and consumes about 26.1 % less power compared to [13],with a minor image quality degradation of 0.04 dB.…”

Section: Introductionmentioning

confidence: 99%

High Precision DCT CORDIC Architectures for Maximum PSNR

Saad¹,

Hachaı̈chi²,

Lahbib³

et al. 2017

ijacsa

View full text Add to dashboard Cite

Abstract-This paper proposes two optimal Cordic Loeffler based DCT (Discrete Cosine Transform algorithm) architectures: a fast and low Power DCT architecture and a high PSNR DCT architecture. The rotation parameters of CORDIC angles required for these architectures have been calculated using a MATLAB script. This script allows the variation of the angle's precision from 10 −1 to 10 −4 . The experimental results show that the fast and low Power DCT architecture correponds to the precision 10 −1 . Its complexity is even lower than the BinDCT which is a reference in terms of low complexity and its power has been enhanced in comparison with the conventional Cordic Loeffler DCT by 12 mW. The experimental results also show that the high PSNR DCT architecture corresponds to the precision 10 −3 for which the PSNR has been improved by 6.55 dB in comparison with the conventional Cordic Loeffler DCT. Then, the hardware implementation and the generated RTL of some required Cordics are presented.

show abstract

Section: Introductionmentioning

confidence: 99%

High Precision DCT CORDIC Architectures for Maximum PSNR

Saad¹,

Hachaı̈chi²,

Lahbib³

et al. 2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…However, due to the recursive nature of itself, it is difficult to realize pipeline [12]. Using the unfolding technique *Address correspondence to this author at the Microelectronics Center, Harbin Institute of Technology, 150000, Harbin, P. R. China; Tel: 13258676498: Fax: 86397100; E-mail: husthh@yahoo.com.cn can overcome this problem [13][14][15], but will introduce new problems, such as numerical inaccuracy, the scalability problem of variable length DCT computations.…”

Section: Introductionmentioning

confidence: 99%

Variable Length Reconfigurable Algorithms and Architectures for DCT/IDCT Based on Modified Unfolded Cordic

Huang

Xiao²

2013

TOEEJ

View full text Add to dashboard Cite

A coordinate rotation digital computer (CORDIC) based variable length reconfigurable DCT/IDCT algorithm and corresponding architecture are proposed. The proposed algorithm is easily to extend to the 2 n -point DCT/IDCT. Furthermore, we can easily construct the N-point DCT/IDCT with two N/2-pt DCTs/IDCTs based the proposed algorithm. The architecture based on the proposed algorithm can support several power-of-two transform sizes. To speed up the computation of DCT/IDCT without losing accuracy, we develop the modified unfolded CORDIC with the efficient carry save adder (CSA). The rotation angles of CORDIC used in proposed algorithm are arithmetic sequence. For convenience, we develop the architecture of N-point IDCT with the orthogonal property of DCT and IDCT transforms. The proposed architecture are modeled with MATLAB language and performed in DCT-based JPEG process, the experimental results show that the peak signal to noise ratio (PSNR) values of proposed architectures are higher than the existing CORDIC based architectures at both different quantization factors and different test images. Furthermore, the proposed architectures have higher regularity, modularity, computation accuracy and suitable for VLSI implementation.

show abstract

“…Then, the vector rotation can be performed using the iterative equation given in [Mariatos et al (1994); Jeong et al (2004)]:…”

Section: Introductionmentioning

confidence: 99%

A low-power and high-quality implementation of the discrete cosine transformation

Heyne

Götze

2007

Adv. Radio Sci.

View full text Add to dashboard Cite

Abstract. In this paper a computationally efficient and high-quality preserving DCT architecture is presented. It is obtained by optimizing the Loeffler DCT based on the Cordic algorithm. The computational complexity is reduced from 11 multiply and 29 add operations (Loeffler DCT) to 38 add and 16 shift operations (which is similar to the complexity of the binDCT). The experimental results show that the proposed DCT algorithm not only reduces the computational complexity significantly, but also retains the good transformation quality of the Loeffler DCT. Therefore, the proposed Cordic based Loeffler DCT is especially suited for low-power and high-quality CODECs in battery-based systems.

show abstract

A fast DCT processor, based on special purpose CORDIC rotators

Cited by 19 publications

References 13 publications

High Precision DCT CORDIC Architectures for Maximum PSNR

High Precision DCT CORDIC Architectures for Maximum PSNR

Variable Length Reconfigurable Algorithms and Architectures for DCT/IDCT Based on Modified Unfolded Cordic

A low-power and high-quality implementation of the discrete cosine transformation

Contact Info

Product

Resources

About