TY - GEN
T1 - High Speed Data Compression Using FPGA
AU - Dileep Kumar, M. J.
AU - De Castro, Gunza Alfredo
AU - Anusha, R.
AU - Raghavendra Rao, P.
AU - Srinivas, Birru
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Efficient data compression is critical in modern digital systems to optimize storage and transmission bandwidth, especially in real-time applications. FieldProgrammable Gate Arrays (FPGAs) provide high-speed, hardware-accelerated solutions for data compression, offering parallel processing capabilities and reduced latency. This paper explores FPGA-based implementations of Run-Length Encoding (RLE) and Delta Encoding, two widely used lossless compression techniques. Performance is analyzed in terms of resource utilization, compression efficiency, power consumption, and scalability using the Xilinx Spartan-6 FPGA. Our results demonstrate that Delta Encoding achieves higher clock frequencies and lower power consumption, making it suitable for incremental data applications. In contrast, RLE excels in compressing redundant data sequences but has higher implementation complexity and variable throughput. The comparative study highlights the tradeoffs between these two methods and provides insights into their suitability for FPGA-based data compression in resourceconstrained environments.
AB - Efficient data compression is critical in modern digital systems to optimize storage and transmission bandwidth, especially in real-time applications. FieldProgrammable Gate Arrays (FPGAs) provide high-speed, hardware-accelerated solutions for data compression, offering parallel processing capabilities and reduced latency. This paper explores FPGA-based implementations of Run-Length Encoding (RLE) and Delta Encoding, two widely used lossless compression techniques. Performance is analyzed in terms of resource utilization, compression efficiency, power consumption, and scalability using the Xilinx Spartan-6 FPGA. Our results demonstrate that Delta Encoding achieves higher clock frequencies and lower power consumption, making it suitable for incremental data applications. In contrast, RLE excels in compressing redundant data sequences but has higher implementation complexity and variable throughput. The comparative study highlights the tradeoffs between these two methods and provides insights into their suitability for FPGA-based data compression in resourceconstrained environments.
UR - https://www.scopus.com/pages/publications/105020833220
UR - https://www.scopus.com/pages/publications/105020833220#tab=citedBy
U2 - 10.1109/NMITCON65824.2025.11187434
DO - 10.1109/NMITCON65824.2025.11187434
M3 - Conference contribution
AN - SCOPUS:105020833220
T3 - 3rd IEEE International Conference on Networks, Multimedia and Information Technology, NMITCON 2025
BT - 3rd IEEE International Conference on Networks, Multimedia and Information Technology, NMITCON 2025
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd IEEE International Conference on Networks, Multimedia and Information Technology, NMITCON 2025
Y2 - 1 August 2025 through 2 August 2025
ER -