Claim Missing Document
Check
Articles

Found 32 Documents
Search

ANALISIS PERBANDINGAN ALGORITMA LEMPEL ZIV WELCH DAN TABOO CODES DALAM KOMPRESI FILE MKV Ridho, Faisal; Pristiwanto; Siregar, Saidi Ramadan
Pendas : Jurnal Ilmiah Pendidikan Dasar Vol. 9 No. 04 (2024): Volume 09, Nomor 04, Desember 2024
Publisher : Program Studi Pendidikan Guru Sekolah Dasar FKIP Universitas Pasundan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23969/jp.v9i04.18046

Abstract

When selecting the most efficient compression method, it is crucial to compare the available algorithms. The methods used for file compression vary, including algorithms such as LZW (Lempel Ziv Welch) and Taboo Codes. Large file sizes can cause various issues, such as increased storage requirements and longer transmission times, leading to higher costs. Compression is essential as it reduces file size, and different compression algorithms, like LZW and Taboo Codes, offer various benefits. Both algorithms are lossless compression techniques. The criteria used to determine which algorithm is more efficient for compressing MKV files include Compression Ratio, Ratio Compression, Redundancy, and Space Saving. The Exponential Method is used to analyze and compare these algorithms to understand their effectiveness, highlighting their respective strengths and weaknesses. After weighting each criterion using the exponential method, Lempel Ziv Welch achieved a score of 8.7926, while Taboo Codes achieved a score of 9.48313. Based on these results, it can be concluded that Lempel Ziv Welch requires less effort compared to Taboo Codes.
ANALISIS PERBANDINGAN ALGORITMA ARITHMETIC CODING DAN LEMPEL ZIV WELCH (LZW) DALAM MENGKOMPRESI FILE AUDIO MP3 Arief, Mhd. Abrar; Pristiwanto; Siregar, Saidi Ramadan
Pendas : Jurnal Ilmiah Pendidikan Dasar Vol. 9 No. 04 (2024): Volume 09, Nomor 04, Desember 2024
Publisher : Program Studi Pendidikan Guru Sekolah Dasar FKIP Universitas Pasundan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23969/jp.v9i04.18048

Abstract

MP3 audio files are a common format for storing and transmitting audio data, but file size can impact delivery time and memory capacity requirements. Compressing MP3 files is crucial for efficient transfer and storage space savings. Two popular lossless compression algorithms, namely arithmetic coding and Lempel-Ziv-Welch (LZW), play a significant role in determining how well MP3 audio files can be compressed without significant loss of quality. A comparative analysis between these two algorithms using criteria such as Compression Ratio, Ratio Compression, Redundancy, and Space Saving with the help of exponential methods indicates that arithmetic coding and LZW have total values of 10.1127 and 9.6047, respectively. This suggests that while arithmetic coding may be more efficient in terms of compression, LZW requires less effort. This comparison provides insights into the advantages and disadvantages of each algorithm, aiding in the selection of the most effective compression method for MP3 audio files.