Comparative Analysis of Huffman Coding Implementations for Efficient Data Communication Using Greedy and Divide-and-Conquer Techniques

Authors

  • Kaleb Frye Marshall University
  • Josh Ronhovde Marshall University
  • Connor Stonestreet Marshall University
  • Yousef Fazea Marshall University

DOI:

https://doi.org/10.62123/enigma.v2i1.24

Keywords:

Data compression, Algorithm efficiency, Greedy, Divide and Conquer

Abstract

Efficient data compression techniques are required to minimize storage and processing overhead due to modern systems' growing amount of data. Huffman Coding is a lossless compression technique that maintains data integrity by assigning shorter bit codes to characters appearing frequently, reducing size. Our analysis focuses on two implementation methodologies: greedy technique and divide and conquer. To find efficient solutions, divide-and-conquer algorithms partition problems into smaller components. In contrast, greedy algorithms strive to attain the utmost attainable result at each level. Our extensive investigation centers on the timing and space intricacies of diverse methodologies, enabling a comparative analysis that underscores their respective merits and drawbacks.

Downloads

Download data is not yet available.

References

A. Adadi, "A survey on data‐efficient algorithms in big data era," Journal of Big Data, vol. 8, no. 1, p. 24, 2021.

J. Reis and M. Housley, Fundamentals of data engineering. " O'Reilly Media, Inc.", 2022.

F. S. Mahammad and V. M. Viswanatham, "Performance analysis of data compression algorithms for heterogeneous architecture through parallel approach," The Journal of Supercomputing, vol. 76, no. 4, pp. 2275-2288, 2020.

G. Wu, F. Zhou, G. Ding, Q. Wu, and X.-Y. Li, "An efficient heterogeneous edge-cloud learning framework for spectrum data compression," IEEE Transactions on Mobile Computing, 2022.

T. Choudhary, V. Mishra, A. Goswami, and J. Sarangapani, "A comprehensive survey on model compression and acceleration," Artificial Intelligence Review, vol. 53, pp. 5113-5155, 2020.

J. Tian et al., "Revisiting huffman coding: Toward extreme performance on modern gpu architectures," in 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2021: IEEE, pp. 881-891.

M. A. Rahman and M. Hamada, "Burrows–wheeler transform based lossless text compression using keys and Huffman coding," Symmetry, vol. 12, no. 10, p. 1654, 2020.

Y. Zhou et al., "47 Gbps 100 m ultra-high-speed free-space visible light tricolor laser communication system utilizing time domain hybrid Huffman coding," Optics Express, vol. 32, no. 14, pp. 24811-24825, 2024.

C. Jaranilla and J. Choi, "Requirements and Trade-Offs of Compression Techniques in Key–Value Stores: A Survey," Electronics, vol. 12, no. 20, p. 4280, 2023.

S. S. Mukherjee, P. Sarkar, and P. J. Bickel, "Two provably consistent divide-and-conquer clustering algorithms for large networks," Proceedings of the National Academy of Sciences, vol. 118, no. 44, p. e2100482118, 2021.

S. Khuller, B. Raghavachari, and N. E. Young, "Greedy methods," in Handbook of Approximation Algorithms and Metaheuristics: Chapman and Hall/CRC, 2018, pp. 55-69.

T. H. Alabi. "What is a greedy algorithm? examples of greedy algorithms. ." https://www.freecodecamp.org/news/greedy-algorithms/ (accessed 2023).

R. Hannane, A. Elboushaki, and K. Afdel, "A divide-and-conquer strategy for facial landmark detection using dual-task CNN architecture," Pattern Recognition, vol. 107, p. 107504, 2020.

A. Qaroush, A. Awad, A. Hanani, K. Mohammad, B. Jaber, and A. Hasheesh, "Learning-free, divide and conquer text-line extraction algorithm for printed Arabic text with diacritics," Journal of King Saud University-Computer and Information Sciences, vol. 34, no. 9, pp. 7699-7709, 2022.

U. Jayasankar, V. Thirumal, and D. Ponnurangam, "A survey on data compression techniques: From the perspective of data quality, coding schemes, data type and applications," Journal of King Saud University-Computer and Information Sciences, vol. 33, no. 2, pp. 119-140, 2021.

R. Ranjan, "Canonical Huffman coding based image compression using wavelet," Wireless Personal Communications, vol. 117, no. 3, pp. 2193-2206, 2021.

X. Liu, P. An, Y. Chen, and X. Huang, "An improved lossless image compression algorithm based on Huffman coding," Multimedia Tools and Applications, vol. 81, no. 4, pp. 4781-4795, 2022.

B. A. Wijaya, S. Siboro, M. Brutu, and Y. K. Lase, "Application of huffman algorithm and unary codes for text file compression," Sinkron: jurnal dan penelitian teknik informatika, vol. 6, no. 3, pp. 1000-1007, 2022.

R. R. Gajjala, S. Banchhor, A. M. Abdelmoniem, A. Dutta, M. Canini, and P. Kalnis, "Huffman coding based encoding techniques for fast distributed deep learning," in Proceedings of the 1st Workshop on Distributed Machine Learning, 2020, pp. 21-27.

A. K. M Al-Qurabat, "A lightweight Huffman-based differential encoding lossless compression technique in IoT for smart agriculture," International Journal of Computing and Digital System, 2021.

F. Prakash, V. Singh, and A. K. Saxena, "An Evaluation of Arithmetic and Huffman Coding in Data Compression & Source Coding," in 2024 International Conference on Optimization Computing and Wireless Communication (ICOCWC), 2024: IEEE, pp. 1-6.

T. Hidayat, M. H. Zakaria, and A. N. C. Pee, "Increasing the Huffman generation code algorithm to equalize compression ratio and time in lossless 16-bit data archiving," Multimedia Tools and Applications, vol. 82, no. 16, pp. 24031-24068, 2023.

Downloads

Published

2024-10-30

How to Cite

Frye, K., Ronhovde, J., Stonestreet, C., & Fazea, Y. (2024). Comparative Analysis of Huffman Coding Implementations for Efficient Data Communication Using Greedy and Divide-and-Conquer Techniques. Electronic Integrated Computer Algorithm Journal, 2(1), 1–8. https://doi.org/10.62123/enigma.v2i1.24

Similar Articles

1 2 > >> 

You may also start an advanced similarity search for this article.