Fpga based modified golomb rice mge algorithm for lossless compression

Abstract

Field Programmable Gate Array (FPGA) is a grand platform to implement the required circuit design for hardware realization. The program code is developed for the design and stored as data in memory. The mconfiguration of data is done by fetching the code and placing it in the FPGA board. The process that changes the configured data is called reconfiguration. The frequent change of modules in design is expected, to improve the performance of the circuit and design reconfiguration is a valuable technique in embedded technology-based fields.The configuration data is often reconfigured and get stored in memory.There is always a huge demand for memory in FPGA design. Thecompression of data is advisable to store the data in order to effectively utilizethe memory. The stored information is compressed using preferable techniques. This technique also improves the communication bandwidth and decreases the reconfiguration time.The broad classification of Data compression is LossLess Data Compression and Lossy Data Compression. In the Loss Less Compression technique, the input data is retrieved accurately from the compressed information. Lossy Compression permits the reconstruction of original data in approximation. Data compression in FPGA uses one of compression technique among LLC.In the existing approach, the technology used is a mix of three Loss Less Compression methods. Dictionary coding is applied with the Bitmask method and the result is compressed using Run Length Encoding (RLE) method developed to reduce the code size of an FPGA program newline