A Novel FPGA Approach to DCT Based on the First-Order Moments
Authors:
- Xiuyuan DongXDXiuyuan Dong
- Jun LiJLJun Li
- Jianguo LiuJLJianguo Liu
- Jianlong WuJWJianlong Wu
- 1 September 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 905-908
Abstract
Discrete Cosine Transform (DCT) plays a significant role in digital signal processing, especially in various international compressing standards, such as JPEG (Joint Photographic Experts Group), MPEG4 (Moving Pictures Expert Group), and H26X. Due to its high computational complexity, fast DCT algorithms have been widely studied in recent years. This paper highlights a novel approach to calculate DCT based on first-order moments on FPGA (Field Programmable Gate Array). The proposed method is of high structural regularity, low hardware cost of PE (Processing Element) and low I/O cost. The approach is also applicable to multi-dimensional DCT and inverse DCT.Keywords
This publication has 9 references indexed in Scilit:
- Efficient systolic implementation of DFT using only the first-order moments2010
- An Efficient VLSI Linear Array for DCT/IDCT Using Subband Decomposition AlgorithmMathematical Problems in Engineering, 2010
- Systolic Designs for DCT Using a Low-Complexity Concurrent Convolutional FormulationIEEE Transactions on Circuits and Systems for Video Technology, 2006
- Systolic algorithms and a memory-based design approach for a unified architecture for the computation of DCT/DST/IDCT/IDSTIEEE Transactions on Circuits and Systems I: Regular Papers, 2005
- A hardware/software concurrent design for a real-time SP@ML MPEG2 video-encoder chip set2002
- A fast DCT processor, based on special purpose CORDIC rotators2002
- Data driven VLSI computation for low power DCT-based video coding2002
- DCT implementation with distributed arithmeticIEEE Transactions on Computers, 2001
- Fast algorithm for computing discrete cosine transformIEEE Transactions on Signal Processing, 1997