Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 20

ADAPTIVE AND

VECTOR
QUANTIZATION
SHAILZA
GOTRA
M.Tech (WC)
A232601500

LIST OF
CONTENTS

QUANTIZATION
UNIFORM QUANTIZATION
NON UNIFORM QUANTIZATION
LLOYD MAX ALGORITHM
ADAPTIVE QUANTIZATION
FORWARD ADAPTIVE QUANTIZATION
BACKWARD ADAPTIVE QUANTIZATION
VECTOR QUANTIZATION

QUANTIZATIO
N
mapping a continuous range of
amplitudes of a signal into a finite set
of discrete amplitudes
N-bits can have M discrete amplitude
levels
M= 2^N

WHY DO WE NEED
QUANTIZATION?
SAMPLING

QUANTIZING

ENCODING

It is irreversible in nature along with some


distortion.

UNIFORM
QUANTIZATION
Step size is uniform.
Intervals are equally
spaced.
It is categorized into two
types:
1. midtread quantizer
2. midrise quantizer

MIDTREAD QUANTIZER

MIDRISE
QUANTIZER

MEAN SQUARE ERROR


DISTORTION FOR UNIFORM
QUANTIZATION
Where,
x(t) = original speech signal
fQ(t) = quantized speech signal

NON UNIFORM
QUANTIZATION

Step size is not uniform.


Intervals are not equally
spaced.
Also called optimum
quantization

MEAN SQUARE ERROR DISTORTION


FOR NON- UNIFORM
QUANTIZATION
Quantization levels varied in accordance with
the pdf of input waveform

Where,
x-fQ(t) = quantization
noise
p(x) = pdf

LLOYD-MAX
ALGORITHM
Used to minimize the distortion of the
signal
Determines optimum quantization levels
iteratively changing levels to minimize MSE
Different companding techniques are used

ADAPTIVE
QUANTIZATION
Adopt due to short term and long term pdf
results in time varying non stationary
speech signals

Results when speech signal pdf vary in


dynamic range of 40 dB or more
It varies its step size in accordance to
speech signal power by expanding and

TYPES OF ADAPTIVE
QUANTIZATION
FORWARD ADAPTIVE
QUANTIZATION
REVERSE ADAPTIVE
QUANTIZATION

FORWARD ADAPTIVE
QUANTIZATION

KWARD ADAPTIVE QUANTIZA

VECTOR
QUANTIZATION

It is based on Shannons rate distortion theorem


There exists a mapping from a source waveform to output code word to
reconstruct the waveform

R > R(D)
R = log2n/L

Better performance by using delayed-decision coding


technique

VQ CODING OUTLINE
Divide data into non-overlapping vectors

Each vector contains n elements


For each image vector :
Find closest vector in codebook
Get its index in codebook
Encode indices

VQ DECODING OUTLINE
Entropy decode the indices

Lookup codebook for each index and retrieve vector


Combine vectors to reconstruct data

THANK YOU

ANY QUESTIONS ??

You might also like