loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07)
A Pipelined Fast 2D-DCT Accelerator for FPGA-based SoCs
Porto Alegre, Brazil
March 09-March 11
ISBN: 0-7695-2896-1
Antonino Tumeo, Politecnico di Milano, Italy
Matteo Monchiero, Politecnico di Milano, Italy
Gianluca Palermo, Politecnico di Milano, Italy
Fabrizio Ferrandi, Politecnico di Milano, Italy
Donatella Sciuto, Politecnico di Milano, Italy

Multimedia applications, and in particular the encoding and decoding of standard image and video formats, are usually a typical target for Systemson- Chip (SoC). The bi-dimensional Discrete Cosine Transformation (2D-DCT) is a commonly used frequency transformation in graphic compression algorithms. Many hardware implementations, adopting disparate algorithms, have been proposed for Field Programmable Gate Arrays (FPGA). These designs focus either on performance or area, and often do not succeed in balancing the two aspects.

In this paper, we present a design of a fast 2DDCT hardware accelerator for a FPGA-based SoC. This accelerator makes use of a single seven stages 1D-DCT pipeline able to alternate computation for the even and odd coefficients in every cycle. In addition, it uses special memories to perform the transpose operations. Our hardware takes 80 clock cycles at 107MHz to generate a complete 8x8 2D DCT, from the writing of the first input sample to the reading of the last result (including the overhead of the interface logic). We show that this architecture provides optimal performance/ area ratio with respect to several alternative designs.

Citation:
Antonino Tumeo, Matteo Monchiero, Gianluca Palermo, Fabrizio Ferrandi, Donatella Sciuto, "A Pipelined Fast 2D-DCT Accelerator for FPGA-based SoCs," isvlsi, pp.331-336, IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.