**1. What is information?**

Information can be defined as the inverse of probability of occurrence

= - log pk

**2. Give two properties of information.**

• Information must be Non-negative (i.e.) I (sk) 0

• If probability is less then information is more and if probability is more then

Information is less

If ( I (sk) > I (si)) then p(sk ) <>3. What is entropy?

Entropy can be defined as the average amount of information per source symbol.

K-1

H() = - pk log pk

k=0

4. Give two properties of entropy.

• H() = 0 if and only if pk =1 and the remaining probabilities in the set is equal to 0.The lower bound on entropy corresponds to no uncertainty.

• H() = log 2K if and only if pk = 1/ K then all the probabilities in the set is equiprobable. The upper bound on entropy corresponds to maximum uncertainty.

5. What is extremal property?

H() log 2K

6. What is extension property?

The entropy of the extended source is ‘n’ times that of the primary source.

n

H( ) = n * H()

7. What is discrete source?

If a source emits symbols = {s0, s1, s2 ,… s k-1} from a fixed finite alphabet then the source is said to be discrete source.

8. State Shannon’s first theorem.

_ _

A distortion less coding occurs when L H() where L represents the average codeword length and H() represents entropy.

9. What is data compaction?

Data compaction is used to remove redundant information so that the decoder reconstructs the original data with no loss of information.

10. What is decision tree? Where it is used?

The decision tree is a tree that has an initial state and terminal states corresponding to source symbols s0, s1, s2 ,… s k-1. Once each terminal state emits its symbol, the decoder is reset to its initial state.

Decision tree is used for decoding operation of prefix codes.

11. How will you check the condition for validity in ternary Huffman coding?

_L * log 23 H()

12. What is instantaneous code?

If a codeword is not a prefix of any other code word then it is said to be instantaneous code.

(e.g)

0

10

110

1110

13. What is uniquely decipherable code?

If a codeword is not a combination of any other code word then it is said to be uniquely decipherable code.

(e.g)

0

11

101

1001

14. How an encoding operation is taken place in Lempel-ziv coding using binary sequence?

Encoding operation can be taken place by parsing the source data stream into segments that are the shortest subsequences not encountered previously.

15. What is discrete channel?

The channel is said to be discrete when both the alphabets

and have finite sizes.

16. What is memory less channel?

The channel is said to be memory less when the current output symbol depends only on the current input symbol and not any of the previous choices.

17. What is the important property while using the joint probability (xj, yk)?

The sum of all the elements in a matrix is equal to 1.

18. What is the important property while using the conditional probability (xj / yk)?

The sum of all the elements along the column side should be equal to 1.

19. What is the important property while using the conditional probability (yk / xj)?

The sum of all the elements along the row side should be equal to 1.

20. Define mutual information?

Mutual information of the channel is the average amount of information gained by the transmitter when the state of the receiver is known.

I( ; ) = H( ) – H( / )

21. Give two properties of mutual information?

• Mutual information is always non-negative (i.e.) I( ; ) 0

• The mutual information of the channel is symmetric

I ( ; ) = I ( ; )

22. Define channel capacity?

Channel capacity of a discrete memory less channel can be defined as the maximum value of the mutual information I ( ; ) , Where the maximization is carried out for all input probabilities {p(xj)} when the symbols whose input probabilities {p(xj)} are equiprobable.

C= max I ( ; )

{p(xj)}

23. State Shannon’s second theorem.

H() C

----- ---

Ts Tc

There exists a coding scheme for which the source output can be transmitted over the channel and be reconstructed with an arbitrarily small probability of error.

Conversely if

H() C

----- ---

Ts Tc

It is not possible to transmit information over the channel and be reconstructed with an arbitrarily small probability of error.

--------

What are the two important points while considering a code word?

• The code words produced by the source encoder are in binary form.

• The source code is uniquely decodable.

UNIT II

24. What is quantization?

The process of converting the original signal m (t) into a new signal (or) quantized signal mq (t) which is an approximation of m (t) is known as quantization.

25. What is quantization error?

The difference between the original signal m (t) and the quantized signal mq (t) is called quantization error.

26. Define uniform quantization?

If the step size ‘s’ is fixed then it is said to be uniform quantization. This is also known as non-linear quantization.

27. Define uniform quantization?

If the step size ‘s’ is not fixed then it is said to be non-uniform quantization. This is also known as non-linear quantization. Non-linear quantization is used to reduce the probability of quantization error.

28. Define Mid tread quantization?

If the origin lies in the middle of a tread of the stair case graph, then it is said to be mid thread quantization.

29. Define Mid rise quantization?

If the origin lies in the middle of a rising part of the stair case graph, then it is said to be mid rise quantization.

30. What is PCM?

A signal, which is to be quantized prior to transmission, is usually sampled. We may represent each quantized level by a code number and transmit the code numbers rather than sample value itself. This system of transmission is termed as PCM.

31. Specify the 3 elements of regenerative repeater

• Equalizer

• Timing circuit

• Decision making device

32. What is DPCM?

In DPCM, it transmits the difference between the current sample value m (k) at sampling time k and the immediately preceding sample value m (k-1) at time k-1. Now these differences are added in the receiver to generate a waveform, which is identical to the message signal m (t).

33. How DPCM works?

DPCM works on the principle of prediction.

34. How a speech signal is coded at low bit rates?

• To remove redundancies from the speech signal as far as possible.

• Assign the available bits to code the non-redundant parts of the speech signal in an efficient manner.

By means of these 2 conditions 64 bit sample is reduced into 32 bits,16 bits,8 bits and 4 bits.

35. What is ADPCM?

A digital coding scheme that uses both adaptive quantization and adaptive prediction is called ADPCM.

The use of ADPCM is used for reducing the number of bits per sample from 8 into 4.

36. What is AQF?

Adaptive quantization with forward estimation.

Here unquantized samples of the input signal are used to derive forward estimates of σM (nTs).

37. What is AQB?

Adaptive quantization with backward estimation.

Here samples of the quantizer output are used to derive backward estimates of σM (nTs).

38. What is APF?

Adaptive prediction with forward estimation.

Here unquantized samples of the input signal are used to derive forward estimates of the predictor coefficients.

39. What is APB?

Adaptive prediction with backward estimation.

Here samples of the quantizer output and the prediction error, are used to derive backward estimates of the predictor coefficients.

40. What is ASBC?

Adaptive sub band coding. ASBC is a frequency coder (i.e.) the speech signal is processed in frequency domain in which in which the step size varies with respect to frequency.

41. Give the main difference between PCM and ASBC?

The ASBC is capable of digitizing speech at a rate of 16 KBPS where as PCM is capable of digitizing speech at a rate of 64 KBPS.

42. What is noise-masking phenomenon?

Noise can be measured in terms of decibels. If the noise is below 15 db of the signal level in the band, the human ear does not perceive noise. This is known as noise masking phenomenon.

43. How much delay that is taken place in ASBC?

25 ms, because a large number of arithmetic operations are involved in designing the adaptive sub band coder whereas in PCM delay is not encountered.

44. What is delta modulation?

Delta modulation is a DPCM scheme in which the difference signal ∆ (t) is encoded into a single bit 0 (or) 1. This single bit is used to increase (or)

decrease the estimate mˆ(t).

45. What are the drawbacks in delta modulation?

• Granular noise (or) hunting

• Slope overloading

46. What is hunting?

In hunting, there is a large discrepancy (or) difference between m (t) and mˆ (t) and stepwise approach of mˆ (t) to m (t). When mˆ (t) caught m (t) and if m (t) remains unvarying mˆ (t) hunts swinging up (or) down, above and below m (t). This process is known as hunting.

47. What is slope overloading?

We have a signal m (t), which over an extended time exhibits a slope, which is so large that mˆ (t) cannot keep up with it. The excessive disparity (or) difference between m (t) and mˆ (t) is described as slope overloading.

48. How Hunting and slope overloading problems can be solved?

These two problems can be solved by Adaptive delta modulation by varying the step size in an adaptive fashion.

UNIT III

49. What is the use of error control coding?

The main use of error control coding is to reduce the overall probability of error, which is also known as channel coding.

50. What is the difference between systematic code and non-systematic code?

• If the parity bits are followed by message bits then it is said to be systematic codes.

• If the message bits and parity check bits are randomly arranged then it is said to be non-systematic codes.

51. What is a Repetition code?

A single message bit is encoded in to a block of ‘n’ identical bits producing a

(n, 1) block code. There are only two code words in the code.

• all-zero code word

• all-one code word

52. What is forward acting error correction method?

The method of controlling errors at the receiver through attempts to correct noise-induced errors is called forward acting error correction method.

53. What is error detection?

The decoder accepts the received sequence and checks whether it matches a valid message sequence. If not, the decoder discards the received sequence and notifies the transmitter (over the reverse channel from the receiver to the transmitter) that errors have occurred and the received message must be retransmitted. This method of error control is called error detection.

54. Give the properties of syndrome in linear block code.

• The syndrome depends only on the error patterns and not on the transmitted code word.

• All error patterns that differ by a code word have the same syndrome.

55. What is Hamming code?

This is a family of (n,k) linear block code.

Block length : n= 2m – 1

Number of message bits : k = 2m – m-1

Number of parity bits : n – k = m

Where m ≥ 3 and m should be any positive integer.

56. When a code is said to be cyclic?

• Linearity property

The sum of any two code words in the code is also a code word.

• Cyclic property

Any cyclic shift of a code word in the code is also a code word.

57. Give the difference between linear block code and cyclic code.

• Linear block code can be simply represented in matrix form

• Cyclic code can be represented by polynomial form

58. What is generator polynomial?

Generator polynomial g (x) is a polynomial of degree n-k that is a factor of

X n + 1, where g (x) is the polynomial of least degree in the code. g(x) may be expanded as

n-k-1

g (x) = 1 + ∑ giXi + X n-k

i =1

Where the coefficient gi is equal to 0 (or) 1. According to this expansion the polynomial g (x) has two terms with coefficient 1 separated by n-k-1 terms.

59. What is parity check polynomial?

Parity check polynomial h (x) is a polynomial of degree ‘k’ that is a factor of

X n + 1, where h (x) is the polynomial of least degree in the code. h(x) may be expanded as

k-1

h (x) = 1 + ∑ hiXi + X k

i =1

Where the coefficient hi is equal to 0 (or) 1. According to this expansion the polynomial h (x) has two terms with coefficient 1 separated by k-1 terms.

60. How will you convert a generator polynomial into a generator matrix?

g(x),xg(x),x2g(x),…………….,x k-1 g(x)

61. How will you convert parity check polynomial into a parity check matrix?

Xk h(x – 1)

65.How a syndrome polynomial can be calculated?

The syndrome polynomial is a remainder that results from dividing r(x) by the generator polynomial g(x).

R(x) = q(x) b(x) + S (x)

62. Give two properties of syndrome in cyclic code.

• The syndrome of a received word polynomial is also the syndrome of the corresponding error polynomial.

• The syndrome polynomial S(x) is identical to the error polynomial e(x).

63. Define Hamming distance (HD)?

The number of bit position in which two adjacent code vectors differs is known as Hamming distance.

(e.g) if c1 = 1 0 0 1 0 1 1 0 and c2 = 1 1 0 0 1 1 0 1

then HD = 5

64. Define Weight of a code vector?

The number of non-zero components in a code vector is known as weight of a code vector.

(e.g) if c1 = 1 0 0 1 0 1 1 0

then W(c1) = 4

65. Define minimum distance?

The minimum distance of a linear block code is the smallest hamming distance between any pairs of code words in a code.

(e.g)

if c1 = 0 0 1 1 1 0

c2 = 0 1 1 0 1 1

c3 = 1 1 0 1 1 0

d min = 3

66. What is coset leader?

A Coset leader is an error pattern with 2 n-k possible cosets.

67. What is convolutional code?

A convolutional code in which parity bits are continuously interleaved by information (or) message bits.

68. Define constraint length?

The constraint length (K) of a convolutional code is defined as the number of shifts a single message bit to enter the shift register and finally comes out of the encoder output.

K= M + 1

UNIT IV

74.How compression is taken place in text and audio?

In text the large volume of information is reduced, where as in audio the bandwidth is reduced.

69. Specify the various compression principles?

• Source encoders and destination decoders

• Loss less and lossy compression

• Entropy encoding

• Source encoding

70. What is lossy and loss less compression?

The Compressed information from the source side is decompressed in the destination side and if there is loss of information then it is said to be lossy compression.

The Compressed information from the source side is decompressed in the destination side and if there is no loss of information then it is said to be

loss less compression. Loss less compression is also known as reversible.

71. Define run-length encoding?

This can be used for long sub strings of the same character or binary digits.

(e.g) 000000011111111110000011……..

This can be represented in run-length as:

0,7,1,10,0,5,1,2……….

72. Define statistical encoding?

Statistical encoding is used for a set of variable length code words, in which shortest code words are represented for frequently occurring symbols (or) characters.

73. Define Differential encoding?

Differential encoding is used to represent the difference in amplitude between the current value/signal being encoded and the immediately preceding value/signal.

74. Define transform coding?

This is used to transform the source information from spatial time domain representation into frequency domain representation.

75. Define spatial frequency?

The rate of change in magnitude while traversing the matrix is known as spatial frequency.

76. What is a horizontal and vertical frequency component?

If we scan the matrix in horizontal direction then it is said to be horizontal frequency components.

If we scan the matrix in Vertical direction then it is said to be vertical frequency components.

77. Define static and dynamic coding?

After finding the code words these code words are substituted in a particular type of text is known as static coding.

If the code words may vary from one transfer to another then it is said to be dynamic coding.

78. Let us consider the codeword for A is 1, the codeword for B is 01,the codeword for c is 001 and the codeword for D is 000. How many bits needed for transmitting the text AAABBCCD.

4 * 1 + 2 * 2 + 1 * 3 + 1 * 3 = 14 bits

79. Give two differences between Arithmetic coding and Huffman coding.

• The code words produced by arithmetic coding always achieve Shannon value

• The code words produced by Huffman coding gives an optimum value.

• In arithmetic coding a single code word is used for each encoded string of characters.

• In Huffman coding a separate codeword is used for each character.

80. Define GIF?

Graphics interchange format. It is used extensively with the Internet for the representation and compression of graphical images. Color images can be represented by means of 24-bit pixels. Each 8-bit corresponds to R, G and B.

81. What is global and local color table?

If the whole image is related to the table of colors then it is said to be global color table.

If the portion of the image is related to the table of colors then it is said to be local color table.

82. Define TIFF?

Tagged image file format. Color images can be represented by means of 48 bits. Each 16-bits corresponds to R, G and B.TIFF is used for transferring both images and digitized documents. Code numbers 2,3,4,5 were used.

83. Define termination code and Make-up code table?

Code words in the termination-code table are for white (or) black run lengths of from 0 to 63 pels in steps of one pel.

Code words in the Make up-code table are for white (or) black run lengths that are multiples of 64 pels.

84. Define Over scanning?

Over scanning means all lines start with a minimum of one white pel. Therefore the receiver knows the first codeword always relates to white pels and then alternates between black and white.

85. What is modified Huffman code?

If the coding scheme uses two sets of code words (termination and make up). They are known as Modified Huffman codes.

86. What is one-dimensional coding?

If the scan line is encoded independently then it is said to be One-dimensional coding.

87. What is two-dimensional coding?

Two-dimensional coding is also known as Modified Modified Read (MMR) coding. MMR identifies black and White run lengths by comparing adjacent scan lines.

88. Define pass mode?

If the run lengths in the reference line (b1b2) is to the left of the next run-length in the coding line (a1a2) (i.e.) b2 is to the left of a1, then it is said to be pass mode.

89. Define Vertical mode?

If the run lengths in the reference line (b1b2) overlap the next run-length in the coding line (a1a2) by a maximum of plus or minus 3 pels, then it is said to be vertical mode.

100. Define Horizontal mode?

If the run lengths in the reference line (b1b2) overlap the next run-length in the coding line (a1a2) by more than plus or minus 3 pels, then it is said to be horizontal mode.

UNIT V

101. What are Vocal tract excitation parameters?

The origin, pitch, period and loudness are known as vocal tract excitation parameters

102. Give the classification of vocal tract excitation parameters

• Voiced sounds

• unvoiced sounds

103. What is CELP?

CELP – code excited Linear Prediction

In this model, instead of treating each digitized segment independently for encoding purpose, just a limited set of segments is used, each known as waveform template.

104. What are the international standards used in code excited LPC?

ITU-T Recommendations

G.728

G. 729

G. 7.29(A) and

G. 723.1

105. What is perceptual coding?

Perceptual encoders are designed for the compression of general audio such as that associated with a digital television broadcast. This process is called perceptual coding.

106. What is algorithmic delay?

Before the speech samples can be analyzed, it necessary to store the block of samples in memory (i.e.) in buffer. The time taken to accumulate the block of samples in memory is known as algorithmic delay.

107. What is temporal masking?

After the ear hears a loud sound, it takes a further short time before it can hear a quieter sound. This is known as temporal masking.

108. What is called critical bandwidth?

The width of each curve at a particular signal level is known as the critical bandwidth. For that frequency and experiments have shown that for frequencies less than 500 HZ, the critical bandwidth remains constant at about 100 HZ.

109. Define dynamic range of a signal?

Dynamic range of a signal is defined as the ratio of the maximum amplitude of the signal to the minimum amplitude and is measured in decibels (db)

110. What is MPEG?

MPEG-Motion Pictures Expert Group (MPEG)

MPEG was formed by the ISO to formulate a set of standards relating to a range of multimedia applications that involves the use of video with sound

111. What is the use of DFT in MPEG audio coder?

DFT-Discrete Fourier transforms

DFT is a mathematical technique by which the 12 sets of 32 PCM samples are first transformed into an equivalent set of frequency components.

112. What are SMRs?

SMRs – Signal to Mask Ratios

SMRs indicate those frequency components whose amplitude is below the related audible threshold

113. What is meant by AC in Dolby AC-1?

AC Acoustic coder. It was designed for use in satellites to relay FM radio programs and the sound associated with television programs.

114. What is meant by the backward adaptive bit allocation mode?

The operation mode in which, instead of each frame containing bit allocation information in addition to the set of quantized samples it contains the encoded frequency coefficients that are present in the sampled waveform segment. This is known as the encoded spectral envelope and this mode of operation is the backward adaptive bit allocation mode

115. List out the various video features used in multimedia applications.

a. Interpersonal - Video telephony and video conference

b. Interactive – Access to stored video in various forms

c. Entertainment – Digital television and movie/video – on demand

116. What does the digitization format define?

The digitization format defines the sampling rate that is used for the luminance y and two chrominance Cb and Cr, signals and their relative position in each frame

117. What is SQCIF?

SQCIF – Sub Quarter Common Intermediate Format.

It is used for video telephony, with 162 Mbps for the 4:2:0 format as used for digital television broadcasts.

118. What is motion estimation and motion compensation?

The technique that is used to exploit the high correlation between successive frames it to predict the content of many of the frames. The accuracy of the prediction operation is determined by how well any movement between successive frames is estimated. This operation is known as motion estimation

If the motion estimation process is not exact, so additional information must also be sent to indicate any small differences between the predicted and actual positions of the moving segments involved. This is known as motion compensation.

119. What are intracoded frames?

Frames that encoded independently are called intracoded frames or I-frames

120. Define GOP?

GOP- group of pictures.

The number of frames/pictures between successive I- frames is known as a group of pictures.

121. What is a macro block?

The digitized contents of the Y matrix associated with each frame are first divided into a two dimension matrix of 16 x 16 pixels known as a macro block.

122. What is H.261?

H.261 video compression standard has been defined by the ITU-T for the provision of video telephony and video conferencing over an ISDN.

123. What is GOB?

GOB- Group of blocks

Although the encoding operation is carried out on individual macro blocks, a large data structure known as a group of block is also defined.

124. What are AVOs and VOPs?

AVOs- Audio Visual Objects

VOPs- Video Objects Planes

125. What is the difference between MPEG and other standard.

Difference between MPEG-4 and other standard is that MPEG-4 has a number of content based functionalities.

126. What are blocking artifacts?

The high quantization threshold leads to blocking artifacts which are cause by the macro block encoded using high thresholds differing from those quantized using lower thresholds.

## No comments:

Write comments