Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Pendas : Jurnah Ilmiah Pendidikan Dasar

PERBANDINGAN KINERJA ALGORITMA GOLOMB CODE DAN TABOO CODE PADA KOMPRESI FILE MP4 Megawati; Sinurat, Sinar; Ulfa, Kurnia
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.18123

Abstract

File compression is a crucial technique in data processing for reducing file size without sacrificing data quality. Effective compression algorithms not only reduce file size but also maintain data integrity. This study compares the performance of two compression algorithms, Golomb Code and Taboo Code, in the context of MP4 file compression. Golomb Code is an efficient compression algorithm for data with geometric distribution, commonly used in lossless compression. Taboo Code is a newer compression algorithm designed to address some limitations of traditional compression methods by using more adaptive and flexible encoding techniques. The study evaluates the performance of both algorithms based on several metrics, including compression ratio, compression speed, and quality of the compressed file. Experiments were conducted on a range of MP4 files with varying sizes and content to achieve comprehensive results and better generalization. The findings indicate that each algorithm has its own strengths and weaknesses. Golomb Code performs better with files that have more regular data patterns and data distributions that align with the algorithm's assumptions. In contrast, Taboo Code excels in flexibility and adaptability with files that have more complex and irregular data patterns.
ANALISIS PERBANDINGAN ALGORITMA LZW DENGAN LEVENSTHEIN PADA KOMPRESI FILE PPT Sihombing, Monalisa Dosma; Sunandar, Hery; Ulfa, Kurnia
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.18266

Abstract

In today's digital era, ppt or pptx files are crucial for presentations or data processing in the professional world. Using pptx for presentations allows for a more organized and structured presentation according to the design. However, the size of pptx files can be quite large compared to other data, leading to storage wastage. Thus, compression is needed. When compressing pptx files, it is important to balance file size and content quality. Higher compression levels reduce file size but may affect file quality. Data compression is a technique used to reduce file or information size without compromising data quality or significance. In an age of abundant data, data compression is essential for saving storage space and speeding up information transfer. By eliminating redundancy and utilizing existing data patterns, data compression can create a more efficient and compact representation. The challenge arises as pptx file sizes tend to be larger than other data due to the extensive use of slides, which wastes storage and slows down data transfer. To address this issue, a data reduction technique or compression is needed. Compression aims to reduce data size to a smaller size, and the compression parameters obtained include the ratio of compression, compression ratio, and space saving.