Critical Understanding Performance of Huffman and Lempel Zip to Pattern Audio Data 16-bit

This paper provides different perspectives on the Huffman and Lempel Ziv algorithms performance in terms of lossless compression. This performance will be tested using 16-bit audio data, which in related research is still not as much analysis as in this paper. Huffman and Lampel Zip are still included in entropy coding with a linear estimation combining system. Each method has advantages and disadvantages depending on the type of data being compressed, and until now no one has claimed which algorithm is the most effective and efficient in compressing data. As a result, this study attempts to assess size of the file, proportion, velocity, compression factor, and waveform properties. In the final results, it is known that Huffman is fast in compression with a ratio of 18.0051%, while Lempel Zip is 12.3554%. From the results of the final analysis, it was found that there were many differences in performance perceptions from related previous studies.