Abstract

This paper presents an FPGA implementation for the Block Truncation Coding (BTC) image compression technique. Images are divided into equal blocks. The BTC calculates the mean of each block for which a two-level quantization is performed so that a zero value is stored for the pixels with values smaller than the mean. The rest of the pixels are represented by the value one. The implementation exploits the inherent parallelism of the algorithm to provide efficient algorithm-to-architecture mapping. FPGA implementation of the BTC is composed of three modules: the input module, to receive input pixels; the quantizer module, to classify pixels to one of the two levels;= and divider circuits to obtain the two quantized values. The implementation is performed for gray and color images. The Xilinx-VirtexE BTC implementation has shown to provide about 23.4x10 6 of pixels/second processing rate which is about 3500 times faster than an Intel Pentium III-550-MHz processor.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.