VLSI architectures for field programmable gate arrays: a case study
- 1 January 1996
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The ability to achieve highly efficient hardware implementations of algorithms will form a key aspect in the success of custom computing, Developments in VLSI architectures where regularity, simple design and locality of connections appears to be an ideal approach in the development of efficient field programmable gate array (FPGA) designs. The authors present a case study namely the implementation of the majority of a two dimensional (2D) discrete cosine transform (DCT) in a XilinK XC6216 device. The design has a 70% hardware utilisation figure and operates at 25 Mega pixels per second or over 30 frames per second for standard NTSC. The paper clearly demonstrates the hardware efficiency of such an approach. The paper also describes work on architectural synthesis framework to automatically generate highly regular designs for a wider range of complex algorithms.Keywords
This publication has 5 references indexed in Scilit:
- Fast algorithms for the discrete cosine transformIEEE Transactions on Signal Processing, 1992
- Video compression makes big gainsIEEE Spectrum, 1991
- Some Systolic Array Developments in the United KingdomComputer, 1987
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977
- Two's Complement Pipeline MultipliersIEEE Transactions on Communications, 1976