VLSI implementation of image compression and decompression using Discrete Hartley Transform

Abstract

Today there are various efficient techniques available which reduce bits per pixel and increase redundancies in picture without affecting the quality of image. Some examples are Huffman Coding, Golomb Coding, Arithmetic Coding, LZW Coding, Run-Length Coding, Symbol Based Coding, Bit Plane Coding and Block Transform Coding among others.
Now again after these coding technique further efforts are made to reduce the hardware and memory requirement. The plus point of using DHT is image compression and decompression with impressive reduction of hardware and memory requirement. Throughout the thesis we would see how.