This paper conducts a systematic and comprehensive comparison of the performance differences between Huffman coding and arithmetic coding in terms of coding efficiency, time/space complexity, and practical application scenarios through in - depth theoretical derivations and rigorous experimental verifications. Three typical datasets (English text, binary data, and DNA sequences) are used in the experiments, which are carried out in a unified experimental environment. The results show that the average compression ratio of arithmetic coding is increased by 12.3% compared with that of Huffman coding, but the encoding time is increased by 2.8 times; the decoding speed of Huffman coding reaches 4.1 times that of arithmetic coding. The research further proposes an efficient implementation scheme based on Java, and elaborates on the key code implementation process, verifying the advantages of Huffman coding in real - time systems and the applicability of arithmetic coding in scenarios with high compression requirements. This paper provides a quantitative decision - making basis for the selection of coding algorithms in engineering practice, and also explores the optimization directions of the two coding algorithms and future research trends.

Xu Dan, Minghui Qiu, Tang Yi. A Comparative Study on the Performance of Huffman Coding and Arithmetic Coding. Academic Journal of Engineering and Technology Science (2025), Vol. 8, Issue 3: 1-7. https://doi.org/10.25236/AJETS.2025.080301.

[1] Ma Xian-Min, Zhou Gui-Yu,et al. Improved Huffman Algorithm in Multi-channel Synchronous Data Acquisition and Compression System[C]. Information Engineering Research Institute, 2012: 354-360.

[2] Gaurav Kumar, Rajeev Kumar. Analysis of Arithmetic and Huffman Compression Techniques by Using DWT-DCT[J]. International Journal of Image, Graphics and Signal Processing (IJIGSP), 2021,4(13):63-70.

[3] Shree Ram Khaitu, Sanjeeb Prasad Panday. Fractal Image Compression Using Canonical Huffman Coding[J]. Journal of the Institute of Engineering,2019,1(15):91-105.

[4] Ahsan Habib, Debojyoti Chowdhury. An Efficient Compression Technique Using Arithmetic Coding[J]. Journal of Scientific Research and Reports,2015,1(4):60-67.

[5] Peter Kwaku Baidoo. Comparative Analysis of the Compression of Text Data Using Huffman, Arithmetic, Run-Length, and Lempel Ziv Welch Coding Algorithms[J].Journal of Advances in Mathematics and Computer Science,2023,9(38):144-156.

[6] Hidayat Tonny, Zakaria Mohd Hafiz, Che Pee Naim. Comparison of Lossless Compression Schemes for WAV Audio Data 16-Bit Between Huffman and Coding Arithmetic[J]. International journal of simulation: systems, science & technology.2019,6(36):10-21.

[7] Idris A., Deros N.A.M., et al. PAPR reduction using huffman and arithmetic coding techniques in F-OFDM system[J]. Bulletin of Electrical Engineering and Informatics,2018,2(7):257-263.