Configuration bitstream compression for dynamically reconfigurable FPGAs

ABSTRACT

Field programmable gate arrays (FPGAs) holds the possibility of dynamic reconfiguration. The key advantages of dynamic reconfiguration are the ability to rapidly adapt to dynamic changes and better utilization of the programmable hardware resources for multiple applications. However, with the advent of multi-million gate equivalent FPGAs, configuration time is increasingly becoming a concern. High reconfiguration cost can potentially wipe out any gains from dynamic reconfiguration. One solution to alleviate this problem is to exploit the high levels of redundancy in the configuration bitstream by compression. In this paper, we propose a novel configuration compression technique that exploits redundancies both within a configuration's bitstream as well as between bitstreams of multiple configurations. By maximizing reuse, our results show that the proposed technique performs 26.5-75.8% better than the previously proposed techniques. To the best of our knowledge, ours is the first work that performs inter-configuration compression.

REFERENCES

• 1: James A. Storer , Thomas G. Szymanski, Data compression via textual substitution, Journal of the ACM (JACM), v.29 n.4, p.928-951, Oct. 1982 [doi>10.1145/322344.322346]
• 2: [2] K. Bazargan, R. Kastner, and M. Sarrafzadeh. 3-D floorplanning: Simulated annealing and greedy placement methods for reconfigurable computing systems. Design Automation for Embedded Systems, April 2000.
• 3: [3] Y. J. Chu and T. H. Liu. On the shortest arborescence of a direct graph. Science Sinica, 14, 1965.
• 4: Andreas Dandalis , Viktor K. Prasanna, Configuration compression for FPGA-based embedded systems, Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays, p.173-182, February 2001, Monterey, California, United States [doi>10.1145/360276.360342]
• 5: Zhiyuan Li , Scott Hauck, Configuration Compression for Virtex FPGAs, Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, p.147-159, April 29-May 02, 2001 [doi>10.1109/FCCM.2001.19]
• 6: [6] S. Hauck, Z. Li. and E. Schwabe. Configuration compression for Xilinx 6200 FPGA, IEEE TCAD, 18(8), 1999.
• 7: Scott Hauck , William D. Wilson, Runlength Compression Techniques for FPGA Configurations, Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines, p.286, April 21-23, 1999
• 8: [8] D. A. Huffman. A method for the construction of minimum redundancy codes. Proceedings of the Institute of Radio Engineers 40, 1952.
• 9: [9] Xilinx Inc. Virtex Series Configuration Architecture User Guide, 2000.
• 10: [10] A. Khu. Xilinx FPGA Configuration Data Compression and Decompression, 2001.
• 11: S. R. Park , W. Burleson, Configuration cloning: exploiting regularity in dynamic DSP architectures, Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays, p.81-89, February 21-23, 1999, Monterey, California, United States [doi>10.1145/296399.296433]
• 12: [12] S. D. Warhade. Implementation approaches to Huffman decoding. Technical report, Wipro Technologies, 2002.