Mapping of image compression transforms to reconfigurable processors: simulation and analysis

Frank M. Caimi; Mark S. Schmalz; Gerhard X. Ritter

doi:10.1117/12.372745

Translator Disclaimer

16 December 1999 Mapping of image compression transforms to reconfigurable processors: simulation and analysis

Frank M. Caimi, Mark S. Schmalz, Gerhard X. Ritter

Author Affiliations +

Proceedings Volume 3814, Mathematics of Data/Image Coding, Compression, and Encryption II; (1999) https://doi.org/10.1117/12.372745
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1999, Denver, CO, United States

Abstract

This paper summarizes techniques for mapping blockwise compression transforms such as EBLAST, JPEG, Visual Pattern Image Coding, and vector quantization to reconfigurable architectures such as field-programmable gate arrays. The distinguishing feature of this study is that computational precision is varied among different operations within a given transform. For example, we found that a four-bit block sum is sufficient to compute EBLAST accurately using encoding blocks as large as 10 X 10 pixels. In contrast, image-template convolutions constituent to EBLAST compression and decompression require seven- to eight-bit fixed-point operations.

Citation Download Citation

Frank M. Caimi, Mark S. Schmalz, and Gerhard X. Ritter "Mapping of image compression transforms to reconfigurable processors: simulation and analysis", Proc. SPIE 3814, Mathematics of Data/Image Coding, Compression, and Encryption II, (16 December 1999); https://doi.org/10.1117/12.372745

ACCESS THE FULL ARTICLE