Itc Review 3 PDF
Itc Review 3 PDF
Review-3
SLOT: B1+TB1
Team Members:
P.VAISHNAVI 17BEC0066
A.ABID ALI 17BEC0513
Submitted to:
Prof. K.S.Preetha
1|Page
Title of the project:
AUDIO COMPRESSION USING DCT
Abstract:
Introduction:
DCT is the real part of the Fourier transform. A discrete cosine transform (DCT)
describes a finite sequence of data points in terms of the sum of oscillating cosine
functions at different frequencies.
2|Page
Thanks to the high correlation in neighboring coefficients, discrete Cosine Transform
can be used for audio compression. We can reconstruct a series from very few DCT
coefficients, quite accurately. This DCT property assists in successful data reduction.
Its basic procedure is to take input audio data and convert it from one type of
representation to another, while in our case the signal is an audio sample block. In
this transformation, we transform set of spiral domain points to their equivalents in
the frequency domain.
DCT retains those coefficients which are just enough to represent the signal at a
particular desired quality. The DCT, as it has a strong energy compaction property in
typical applications, appears to concentrate most of the signal information in a few
low-frequency DCT components. It identifies pieces of information that can be
effectively thrown away without seriously reducing the audio's quality.
Tools to be used:
MATLAB software
3|Page
Block Diagram:
4|Page
Methodology:
ALGORITHM:
DCT:
1) select the audio and find the actual signal size.
2) Find amplitude and frequency
3) Set a particular sampling frequency
4) In the procedure, we will decompose the signal into DCT basis vectors. There
will be as many terms in the decomposition as there are samples in the signal.
The expansion coefficients will be assembled in a vector X which will actually
measure how much energy is stored in each of the components. Sort the
coefficients from largest to smallest.
5) Then we will determine the number of DCT coefficients that comprises 99.9%
of the energy in the signal.
6) we will set coefficients to zero that contain the remaining 0.1% of the energy.
7) 7.At last, using inverse discrete cosine transformation (IDCT) we can
reconstruct the signal from the compressed representation of signal
8) 8.Finally we will, analyze the compressed signal through Compression factor,
the quality of the signal by parameters such as Signal to Noise Ratio (PSNR),
and Root Mean Square Error (MSE)
Huffman coding:
5|Page
EXPLANATION:
MEMBER 2(17BEC0513):
Finding the size of compressed signal and also analyze the quality of the signal by
parameters such as Signal to Noise Ratio (SNR), and Root Mean Square Error
(MSE). Performing Huffman encoding which involves quantization of coefficients,
finding probability distribution, dictionary generation for Huffman coding,
Encoding, Decoding, applying IDCT to get compressed file
6|Page
Results and Discussions:
Audiosample_1:
Audiosample_2:
7|Page
Sample PSNR MSE Compression ratio
Audiofile_1 40.9280 2.292 1.9477
Audiofile_2 54.8459 0.46188 2.0011
Thus, we have successfully reconstructed with compression ratio 1.9477, 2.0011 for
Audiofile_1 and Audiofile_2 respectively. We obtained PSN, MSE as 40.9280, 2.292
For Audiofile_1; 54.8459, 0.46188 for Audofile_2 thus providing us a compressed
audio file of good quality without much deviation from the original audio signal.
We have also Implemented Huffman encoding even though there would be
some quantization error, the quality of signal is still reasonable.
References:
1) Sankalp Shukla, Maniram Ahirwar, Ritu Gupta, Sarthak Jain, Dheeraj Singh
Rajput. Audio Compression Algorithm using Discrete Cosine Transform (DCT)
and Lempel-Ziv-Welch(LZW) Encoding Method, 2019 International
Conference on Machine Learning, Big Data, Cloud and Parallel Computing
(Com-IT-Con), India, 14th -16th Feb 2019
8|Page