VHDL IMPLEMENTATION AND TESTING OF DATA COMPRESSION ALGORITHM IN DIGITAL COMMUNICATION

While transmitting data in digital communication, data bits should be as minimum as possible. There are several methods to compress the data. Source coding theorem says that the source encoder is said to be efficient when coding efficiency approaches unity. Minimum value of code length can be found using source coding theorem. In source coding, a prefix code is constructed based on the set of symbol and their probabilities or frequency. This enables faster writing and reading, less disk space, variable dynamic range and faster file transfer. Our project is aimed to compress data through VHDL implementation using Shannon- Fano and Huffman algorithm, their average code word length is determined and the efficient one among them are used in communication. Hence bandwidth available is utilized more efficiently. Shannon-Fano and Huffman is used in an implode compression method which are used in zip of rar format. The project is an effort to find out the optimum code for data compression. Synthesis and simulation of the source coding theorem is done using VHDL programming on software Xilinx ISE 14.2, simulated using Modelsim SE6.3f. KEYWORDS: VHDL, SHANNON FANO, HUFFMA