High performance decoding aware FPGA bit-stream compression using RG codes

Abstract

FPGA design for complex applications need high capacity of configuration memory. To fullfil the large memory requirement, higher end FPGAs are required and it leads to higher cost. In order to reduce the cost constraint, bit-stream compression is prominently involved to reduce the bit-stream size and the memory requirement of FPGA configuration. In this paper new code compression techniques are proposed with minimum cost. The proposed code compression techniques RG-1 and RG-2 codes are designed based on the combination of run length and Golomb coding. The proposed RG codes overcome the limitation of both run length and Golomb coding techniques. The main contribution of this work is to analyze the proposed work in terms of number of 1’s, number of transitions and size of compressed bits. The comparison result shows that the RG code is more robust when compared to other traditional code compression techniques. The results shows that CR improvement of 9 and 5% compare with RLE for the RG-1 and RG-2 respectively and CR improvement of 7 and 2% compare with golomb for the RG-1 and RG-2 respectively.