ABSTRACT
In this paper we propose an optimized bitstream compression algorithm based on LZ and a novel architecture of decompressor, the proposed algorithm improves the Compression Ratio by fully utilizing the regularity of configuration bits of CLB (Configurable Logic Box) in FPGA and using the variable length Golomb coding method. The experimental results show that the Optimized method can improve the Compression Ratio of LZSS by 32.3% for bitstream with high regularity and 10.3% for bitstream with low regularity, and our approach shows a higher flexibility than the BMC+RLE arithmetic when compressing the bitstream with high regularity for various FPGA. Moreover, we design a two-buffer-window decompressor to download the compressed bitstreams. In order to increase the throughput of the proposed decompressor, we design a multi-stage data selector in it. The post-simulation of the decompressor shows that its throughput is up to 9280 Mbps under 65nm CMOS process. And that is 4352Mbps when verified on a Virtex-5 FPGA.
- S. Hauck, Z. Li, and E. Schwabe, Configuration compression for the Xilinx XC6200 FPGA, in IEEE Symposium on FPGAs for Custom Computing Machines, 1998, pp. 138--146. Google ScholarDigital Library
- Z. Li and S. Hauck, Configuration compression for Virtex FPGAs, Proceedings of the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 147--159, 2001. Google ScholarDigital Library
- Sellers, B.; Heiner, J.; Wirthlin, M.; Kalb, J Bitstream compression through frame removal and partial reconfiguration, Field Programmable Logic and Applications, 2009. FPL 2009. International ConferenceGoogle Scholar
- J. H. Pan, T. Mitra, and W.-F.Wong, Configuration bitstream compression for dynamically reconfigurable FPGAs, in International Conference on Computer Aided Design (ICCAD), November 2004, pp. 766--773. Google ScholarDigital Library
- Stefan, R. ; Cotofana, S.D., Bitstream compression techniques for Virtex 4 FPGAs Field Programmable Logic and Applications, 2008. FPL 2008. International Conference , pages: 476--480Google Scholar
- Huebner, M.; Ullmann, M.; Weissel, F.; Becker, J., Real-time configuration code decompression for dynamic FPGA self-reconfiguration, Parallel and Distributed Processing Symposium, 2004. Proceedings 18th International.Google Scholar
- Lei, S.; Sun, M.-T.; Ramachandran, K.; Palaniraj, S., VLSI implementation of an entropy coder and decoder for advanced TV applications, Circuits and Systems, 1990., IEEE International SymposiumGoogle Scholar
- Xiaoke Qin; Muthry, C.; Mishra, P. Decoding-Aware Compression of FPGA Bitstreams,IEEE Transaction, Very Large Scale Integration(VLSI) Systems, vol. 19, Issue. 3 Pages. 411--419, March 2011. Google ScholarDigital Library
- S. Seong and P. Mishra, Bitmask-based code compression for embedded systems, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 27, no. 4, pp. 673--685, Apr. 2008. Google ScholarDigital Library
- Nabina, A.; Nuñez-Yañez, J.L, Dynamic Reconfiguration Optimisation with Streaming Data Decompression, Field Programmable Logic and Applications (FPL), 2010 International Conference on Page(s): 602--607 Google ScholarDigital Library
- Virtex-4 User Guide, June 2009.Google Scholar
- Guy E. Blelloch, Introduction to Data Compression.Google Scholar
- Chandra, A., System-on-a-chip test-data compression and decompression architectures based on Golomb codes, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Mar 2001, Page(s): 355--368. Google ScholarDigital Library
- Wu Di; Gao Wen; Hu Mingzeng; Ji Zhenzhou; An Exp-Golomb encoder and decoder architecture for JVT/AVS, ASIC, 2003, Proceedings, 5th International Conference.Google Scholar
- Ziv, J.; Lempel, A.; A universal algorithm for sequential data compression, Information Theory, IEEE Transactions, May 1977. Google ScholarDigital Library
Index Terms
FPGA bitstream compression and decompression using LZ and golomb coding (abstract only)
Recommendations
Chain code compression with modified interpolative coding
Highlights- Interpolative coding is efficient at chain code compression.
- Interpolative ...
AbstractA lossless chain code compression algorithm consisting of Burrows-Wheeler Transform, Move-To-Front Transform, and a modified interpolative coding is presented in this paper. The interpolative coding divides a strictly increasing array ...
Improving bitstream compression by modifying FPGA architecture
FPGA '13: Proceedings of the ACM/SIGDA international symposium on Field programmable gate arraysThe size of configuration bitstreams of field-programmable gate arrays (FPGA) is increasing rapidly. Compression techniques are used to decrease the size of bitstreams. In this paper, an appropriate bitstream format and variable symbol lengths are ...
Near-lossless compression/decompression algorithms for digital data transmitted over fronthaul in C-RAN
The cloud radio access network (C-RAN) is not only a very important deployment solution for the future RAN but is also a core platform for network-centric advanced transmission techniques such as coordinated multi-point transmission and reception and ...
Comments