A CMOS Image Sensor with Focal Plane Discrete Cosine Transform Computation

In this paper we describe an image sensor with nonuniform pixel placement that enables a highly efficient computation of the discrete cosine transform, which is the most computationally demanding step of the image compression algorithm. This technique is based on the arithmetic Fourier transform (AFT), which we show to be 5 times more computationally efficient than currently used DCT computation methods. The architecture and circuits described can be implemented in conventional CMOS processes.

[1]  Abhishek Bandyopadhyay,et al.  A 80 /spl mu/W/frame 104/spl times/128 CMOS imager front end for JPEG compression , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[2]  Z Fan,et al.  Image Processing and the Arithmetic Fourier Trans-form , 1989, Photonics West - Lasers and Applications in Science and Engineering.

[3]  M. J. Narasimha,et al.  On the Computation of the Discrete Cosine Transform , 1978, IEEE Trans. Commun..

[4]  Roman Genov,et al.  Focal-Plane Spatially Oversampling CMOS Image Compression Sensor , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  Zoran Cvetkovic,et al.  New fast recursive algorithms for the computation of discrete cosine and sine transforms , 1992, IEEE Trans. Signal Process..

[6]  D W. Tufts,et al.  Arithmetic Fourier Transform And Adaptive Delta Modulation: A Symbiosis For High Speed Computation , 1988, Photonics West - Lasers and Applications in Science and Engineering.

[7]  Mark F. Bocko,et al.  Towards all-digital image sensors with built-in compression , 2004 .

[8]  Graham A. Jullien,et al.  On implementing the arithmetic Fourier transform , 1992, IEEE Trans. Signal Process..

[9]  Wen-Hsiung Chen,et al.  A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..