Cost-Effective Triple-Mode Reconfigurable Pipeline FFT/IFFT/2-D DCT Processor

Lin, Chin‐Teng; Yu, Yuan-Chu; Van, Lan-Da

doi:10.1109/tvlsi.2008.2000676

Cited by 27 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The fast DCT algorithm stated in [7] reduces the computational complexity to ( N /2) log 2 N multiplications and N log 2 ⁡ N additions. A few algorithms and implementation structure exist for computing real valued 1D-DCT and 2D-DCT [8–23]. Among them the algorithm presented by Prado and Duhamel [16] is given significant importance because the study reveals that if an optimal algorithm is obtained for 1D-DCT then the extension to the corresponding 2D-DCT and 3D-DCT algorithm will also be optimal.…”

Section: Introductionmentioning

confidence: 99%

FPGA Implementation of Optimal 3D‐Integer DCT Structure for Video Compression

Jacob¹,

Kumar²

2015

The Scientific World Journal

View full text Add to dashboard Cite

A novel optimal structure for implementing 3D-integer discrete cosine transform (DCT) is presented by analyzing various integer approximation methods. The integer set with reduced mean squared error (MSE) and high coding efficiency are considered for implementation in FPGA. The proposed method proves that the least resources are utilized for the integer set that has shorter bit values. Optimal 3D-integer DCT structure is determined by analyzing the MSE, power dissipation, coding efficiency, and hardware complexity of different integer sets. The experimental results reveal that direct method of computing the 3D-integer DCT using the integer set [10, 9, 6, 2, 3, 1, 1] performs better when compared to other integer sets in terms of resource utilization and power dissipation.

show abstract