Scribd
Upload
66 views8 pages

Bandlimiting Filter U-Law or A-Law Compressor Linear PCM

PCM involves sampling an analog signal, quantizing it, then encoding the digital samples. DPCM predicts and quantizes the difference between actual and predicted samples. Delta modulation quantizes the difference between actual and predicted samples to the nearest level. LZW compression builds a dictionary of strings and outputs codes as it encodes the input string.

Uploaded by

jayadeeptp
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
66 views8 pages

Bandlimiting Filter U-Law or A-Law Compressor Linear PCM

PCM involves sampling an analog signal, quantizing it, then encoding the digital samples. DPCM predicts and quantizes the difference between actual and predicted samples. Delta modulation quantizes the difference between actual and predicted samples to the nearest level. LZW compression builds a dictionary of strings and outputs codes as it encodes the input string.

Uploaded by

jayadeeptp
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

1.explain PCM and DPCM with neat block diagrams.

explain
Delta modulation
PCM:
ip analog Bandlimiting filter u-law or a-law compressor Linear Pcm

signal

Low pass filter u-law or a-law expander Digital to analog converter

op analog signal
the input analog signal contains high frequency components
mainly noise.so,it is passed through a band limiting filter at the
initial stage.
Then it is compressed using u-law or a-law companding.this is
done to achieve non uniform quantization.
Next it is subjected to pcm, which involves sampling and
quantization
At the receiver end the digital signal is first converted to analog
format
The analog signal is then expanded to nullify the effect of
compression
Finally it is passed through a low pass filter to remove the step
components of the digitized signal
DPCM:
It involves the use of a quantiser.
Fn’=function of(gn-1,gn-2………..)
En=fn-Fn’
En’=q[en]
Reconstruct: gn=fn’+en’
Here fn is the original signal ,fn’is the predictor output ,gn is the
reconstructed quantized signal ,en is the error signal and en’ is
the quantized error signal.
Encoder:

+ quantizer Symbol coder


En EN’ en’

+
Fn’ predictor Gn
Binary stream
Decoder:

Symbol decoder
En’ Gn reconstructed
+

Binary stream
predictor Fn’

Delta modulation:
Only a single quantized error value either positive or negative
Fn’=gn-1
En=fn-fn’
En’=+k if en>0
=-k if en<0
Gn=fn’+en’
Draw the adaptive huffmann tree for AADCCDD and obtain the
sequence of symbols and codes sent to the encoder

(1) (2)

0 1`

New:(0) a:(1) new:(0) a:(2)

“a” “aa”

(3)

0 1

(1) A:(2)

New:(o) d:(1)

“aad”

(4)

0 1

(2) 1 A:(2)

0 d:(1)

C:(1)

“aadc”

(4)

0 1

(2) A:(2)

D:(1)

C(1+1)

“aadcc” step1
(4)

0 1

0 (2+1) 1 a:(2)

(1) 1 c:(2)

0 d:(1)

New(0)

“aadcc” step 2 (5)

0 1

A:(2) (3)

0 1

(1) c:(2)

0 1

New: (0) d:(1)

:aadcc” step3

(6)

0 1

A: (2) (4)

0 1

(2)

0 1 c: (2)

New: (0) d:(2)

“aadccd”
(7)

0 1

D:(3) (4)

0 1

(2) c: (2)

0 1

New: (0) a: (2)

“aadccdd”

New A A New D New C C D D


0 1 1 00 01 000 001 001 101 101

3.explain Lzw compression and obtain output codes for the


string ABABBABCA
Lzw is an adaptive dictionary based coding
Algorithm:
Begin
S=next ip character
While(!eof)
{
C=next ip character;
If s+c is present in dictionary
S=s+c;
Else
output the code for s;
add s+c to dictionary with a new code;
s=c;
}
}
Output the code for s;
End
ABABBABCA
S c output code string
A B 1 4 AB
B A 2 5 BA
A B
AB B 4 6 ABB
B A
BA B 5 7 BAB
B C 2 8 BC
C A 3 9 CA
A EOF 1

CODE IS 1245231

You might also like