ANALISA PERBANDINGAN ALGORITMA INTERPOLATIVE CODING DAN RICE CODE UNTUK KOMPRESI FILE AUDIO (MP3)

Abstract

This study aims to apply the interpolative coding and rice code algorithms for compressing MP3 audio files and to compare the effectiveness of these two algorithms in the compression process. Additionally, the study focuses on measuring the compression ratios of each algorithm to evaluate the efficiency of each method in reducing MP3 file sizes. As the use of applications for information management becomes increasingly common, a frequent issue arises: the need for significant storage space. Therefore, compression is required to reduce the size of these files. File compression is the process of transforming a set of data into a coded format to minimize storage requirements. There are several data compression algorithms, including Interpolative Coding and Rice Code. The multitude of compression algorithms creates uncertainty about which algorithms are most accurate for data compression. Thus, a comparison between algorithms, such as Interpolative Coding and Rice Code, is necessary. This comparison will help determine which algorithm is more accurate for compressing MP3 audio files, using parameters such as compression ratio and space saving of the Interpolative Coding and Rice Code algorithms.