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.
Similar content being viewed by others
References
Hauck, S., Li, Z., Schwabe, E.: Configuration compression for the Xilinx XC6200 FPGA. In: IEEE Symposium on FPGAs for Custom Computing Machines, pp. 138–146 (1998). http://ieeexplore.ieee.org/document/707891/
Li, Z., Hauck, S.: Don’t care discovery for FPGA configuration compression. In: FPGA’99: Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays, pp. 91–98 (1999). http://dl.acm.org/citation.cfm?id=296435
Pan, J.H., Mitra, T., Wong, W.-F.: Configuration bitstream compression for dynamically reconfigurable FPGAs. In: International Conference on Computer Aided Design (ICCAD), pp. 766–773 (2004)
Stefan, R., Cotofana, S.D.: Bitstream compression techniques for Virtex 4 FPGAs. In: International Conference on Field Programmable Logic and Applications, pp. 323–328 (2008). http://ieeexplore.ieee.org/document/4629952/
Bonny, T., Henkel, J.: Efficient code compression for embedded processors. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 16(12), 1696–1707 (2008). http://ieeexplore.ieee.org/document/4668658/
Jagadeesh, S., Venkateswarlu, T., Ashok, M.: Run length encoding and bit mask based data compression and decompression using verilog. Int. J. Eng. Res. Technol. (IJERT), 1(7), 1–7 (2012). http://www.ijert.org/view-pdf/923/run-length-encoding-and-bit-mask-based-data-compression-and-decompression-using-verilog
H’ng, G.H., Salleh, M.F.M., Halim, Z.A.: Golomb Coding Implementation in FPGA. Faculty of Electrical Engineering Universiti Teknologi Malaysia Vol. 10, No. 2, pp. 36–40 (2008). https://www.researchgate.net/publication/26552333_Golomb_Coding_Implementation_in_FPGA
Chandra, A., Chakrabarty, K.: System-on-a-chip test-data compression and decompression architectures based on Golomb codes. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 20(3), 355–368 (2001). http://ieeexplore.ieee.org/document/913754/
ALTERA Corporation: Stratix II Device Handbook, vol. 2. ALTERA Corporation, San Jose (2005)
Qin, X., Muthry, C., Mishra, P.: Decoding-aware compression of FPGA bitstreams. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 19(3), 411–419 (2011). http://ieeexplore.ieee.org/document/5350405/
Saranya, R., Kousalya Devi, S., Lakshmi Prabha, V.: Compression of FPGA bit stream using modified decode aware placement algorithm. Int. J. Comput. Appl., pp. 21–25 (2013). http://research.ijcaonline.org/iciiioes/number7/iciiioes1604.pdf
Wang, W.J., Lin, C.H.: An improved BitMask based code compression algorithm for embedded systems. In: Proc. IEEE Int. Symp.Electron. Syst. Design, pp. 152–157 (2011). http://ieeexplore.ieee.org/document/6117343/
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Satheesh Kumar, J., Saravana Kumar, G. & Ahilan, A. High performance decoding aware FPGA bit-stream compression using RG codes. Cluster Comput 22 (Suppl 6), 15007–15013 (2019). https://doi.org/10.1007/s10586-018-2486-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10586-018-2486-3