Synthesis of VLSI architectures for tree-structured image coding

We propose VLSI architectures for implementing tree-structured image coding algorithms. A simple data partitioning and mapping technique is used for each processor to have a balanced work load and to work independently of each other. This technique leads to a simple memory access and processor architecture. The proposed parallel architecture has a high throughput rate and is area efficient. It can also be used to realize low-power designs.

[1]  K. Ramchandran,et al.  Joint optimization of scalar and tree-structured quantization of wavelet image decompositions , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[2]  Nikolas P. Galatsanos,et al.  Marginal analysis prioritization for image compression based on a hierarchical wavelet decomposition , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[3]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Viktor K. Prasanna,et al.  Synthesis of VLSI architectures for two-dimensional discrete wavelet transforms , 1995, Proceedings The International Conference on Application Specific Array Processors.

[5]  Murat Kunt,et al.  Embedded zerotree based lossless image coding , 1995, Proceedings., International Conference on Image Processing.

[6]  Adrian S. Lewis,et al.  Image compression using the 2-D wavelet transform , 1992, IEEE Trans. Image Process..

[7]  Jerome M. Shapiro,et al.  Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..