scholarly journals Compression and Decompression of Audio Files Using the Arithmetic Coding Method

2019 ◽  
Vol 6 (1) ◽  
pp. 73-81
Author(s):  
Parasian D. P Silitonga ◽  
Irene Sri Morina

Audio file size is relatively larger when compared to files with text format. Large files can cause various obstacles in the form of large space requirements for storage and a long enough time in the shipping process. File compression is one solution that can be done to overcome the problem of large file sizes. Arithmetic coding is one algorithm that can be used to compress audio files. The arithmetic coding algorithm encodes the audio file and changes one row of input symbols with a floating point number and obtains the output of the encoding in the form of a number of values greater than 0 and smaller than 1. The process of compression and decompression of audio files in this study is done against several wave files. Wave files are standard audio file formats developed by Microsoft and IBM that are stored using PCM (Pulse Code Modulation) coding. The wave file compression ratio obtained in this study was 16.12 percent with an average compression process time of 45.89 seconds, while the average decompression time was 0.32 seconds.

2021 ◽  
Vol 3 (1) ◽  
pp. 25-34
Author(s):  
Nurasyiah

Information exchange nowadays requires speed in sending information. The speed of this transmission depends on the size of the information. One solution to the above problem is compression. There are lots of data compression methods available today, but in this thesis we will discuss the working principles of the Arithmetic Coding algorithm with an implementation using Visual Basic 6.0. This algorithm performance analysis aims to determine the performance of this algorithm in * .MP3 and * .WAV audio files. In this system there are compression and decompression stages. The compression stage aims to compress the audio file size, while the decompression stage aims to restore the audio file size to its original size.


Author(s):  
Rohit Anand ◽  
Gulshan Shrivastava ◽  
Sachin Gupta ◽  
Sheng-Lung Peng ◽  
Nidhi Sindhwani

Digital signal watermarking is an indiscernible and safe transmission of freehold data through host signal that includes immersing into and extrication from the actual host. Some algorithms have been investigated for the strong and secure embedding and extraction of watermarks within the host audio files but they do not yet yield good results in compression and re-sampling. In this chapter, an excellent method is suggested for the compressed wave files that uses random carrier to immerse the watermark in the sequence of an audio signal. The watermark is embedded lucently in audio stream after adaptive differential pulse code modulation (ADPCM) before quantization. The proposed scheme has been implemented and its parameters are compared with the finest auditory watermarking method known. A tool has been used to measure the parameters to produce the results and tabular values. The larger PSNR and smaller BER prove that the suggested scheme is robust.


Author(s):  
Riyo Oktavianty Finola

The size of the audio file can affect the time of sending data to be long and can cause waste of storage space. Therefore, compression is performed to compress the contents of the audio file into smaller ones. One of the compression techniques is lossless technique, which is a compression method where the compressed audio file can be returned to the file before it is compressed without losing information on the previous data. This study uses the Interpolative coding algorithm on mp3 audio files. Interpolative coding algorithm is an innovative way to assign dynamic code to data symbols. This method is different from other compression methods, because the code it provides for individual symbols is not static. The design of this system consists of 2 main processes namely the compression process and the decompression process and the process of calculating the performance of Compression Ratio (CR) and Redundancy. The resulting compression results in a new file with the * .ipc extension containing the compressed bit string which can then be decompressed. Application designed only one form, where in the form there is a process for compression and decompression, while the process of compressing the input file has the extension *. MP3 and produces output with the extension * IPC, and the size of the compressed audio file is smaller than the previous file size .Keywords: Compression, Audio File, Interpolative coding algorithm


1983 ◽  
Vol 19 (2) ◽  
pp. 63 ◽  
Author(s):  
N.M. Nasrabadi ◽  
S.K. Pal ◽  
R.A. King

1978 ◽  
Vol 13 (4) ◽  
pp. 504-510 ◽  
Author(s):  
G. Smarandoiu ◽  
D.A. Hodges ◽  
P.R. Gray ◽  
G.F. Landsburg

Sign in / Sign up

Export Citation Format

Share Document