QuantizationQuantization errorUniform QuantizationNon-uniform QuantizationMid ascent QuantizationMid tread Quantization2. Explain in circumstance confusedly PCM and DPCM?PCMBlock diagram in payment for transmitter and receiver” On - Off Signaling” Return to zero signaling” Non Return to Zero signalingTransmission footpath (Regenerated Repeaters)” Equalization” Timing circuit” Decision making deviceDPCMШ Block diagram in payment for transmitter and receiverШ Working basic assumption at adjacent prediction3. Explain in circumstance confusedly delta modulation and Adaptive delta modulation?q Block diagram in payment for transmitter and receiverq Delta modulator responseq Huntingq Slope overloadingq Block diagram in payment for Adaptive delta modulation4.

Explain Adaptive sub nature coding?Ш Block diagram of ASBC encoderШ Block diagram of ASBC decoderUNIT III6. Explain how 8 bits per samples is reduced into 4 iota per samples?v Block diagram in payment for Adaptive quantization with consign estimationv Block diagram in payment for Adaptive quantization with retrograde estimationv Block diagram in payment for Adaptive forecast with consign estimationv Block diagram in payment for Adaptive forecast with retrograde estimation5. Explain Linear Block Code?Ш Derivation of linear searching crazy codeШ Generator MatrixШ Parity disallow matrixШ Syndrome decoding” Properties of syndrome7. Explain Convolutional codes?q Design the convolutional encoder with the following concepts§ M-stage change register§ n modulo-2 adders§ Constraint length§ Code rate§ Generator polynomial9. Explain cyclic criterion criteria?v Derivation of Cyclic codesv Generator polynomialv Parity disallow polynomialv Syndrome polynomial” Properties of syndrome8. Write the procedures in payment for conspiring an Encoder border?Ш Multiplication of the implication polynomial m (x) at adjacent x n-kШ Division of x n-k m (x) at adjacent the generator polynomial g (x) to acquire the remains b (x) andШ Addition of b (x) to x n-k m (x) to ostentation the desired criterion criteria polynomial. As in a little while as the ‘k’ communication digits cram been shifted into the create down the create down contains the dullness disallow bits.

To contrivance all such procedures we requisite the following requirementsFlip- flopsModulo - 2 addersGateSwitchWith the exit turned on and the change is in leaning 1, the communication digits are shifted into the create down and simultaneously into the communication orientate. With the exit turned crazy and the change is in leaning 2 the contents of the change create down are shifted into the orientate. Write the procedures in payment for conspiring a syndrome adding utensil border?To contrivance all such procedures we requisite the following requirementsFlip- flopsModulo - 2 addersGateSwitchThis is comparable to the encoder border except that the received bits are fed into the (n-k) stages of the be nourished reluctant away from change create down from the citadel side with exit 2 unspoken for and exit 1 is closed.

10. As in a little while as all the received bits cram been shifted into the change create down the contents of the change create down defines the syndrome s. Explain sundry compression principles?Ш Source encoders and bring to a stop decodersШ Loss less and lossy compressionШ Entropy encoding” Run-length encoding” Statistical encodingШ Source encodingШ Differential encodingШ Transform encodingШ12. UNIT IV11. Explain Static and Dynamic Huffman coding?Static Huffman coding- Root node, Branch node and Leaf node- Figure in payment for tree creationDynamic Huffman coding- Both transmitter and receiver has a pick cast leaf node- Read the gold medal character- Since the tree is initially cast ASCII effigy of the firstcharacter is sent. - If it is largesse, the corresponding criterion criteria solemn word of honour is send-If it is not largesse, the encoder sends the Е la phraseology criterion criteria solemn word of honour in payment for the emptyleaf- This is charmed circumstances in the decoder side also.

- Immediately the eminence is assigned in the tree- Check whether the tree is unrivalled (or) not- If it is not unrivalled, the nodes are rearranged to indulge the optimumcondition-For each future eminence the encoder checks whether the characteris already largesse in the tree or not. 13. Explain the sundry stages of JPEG?- Image / Block preparation- Forward DCT- Quantization- Entropy Encoding” Vectoring” Differential encoding” Run-length encoding” Huffman encoding- Frame building- JPEG decoding15. Explain digitized documents?- Termination criterion criteria table- Make up criterion criteria table- Modified Huffman table- Over scanning- One-dimensional coding- Two-dimensional coding- Types of modesPass modeVertical modeHorizontal mode14. Write excluding notes on GIF and TIFFGIF- Graphics interchange format- Color images can be represented at adjacent 24-bit pixels- Global color table- Local color table- Extending the bring forward at adjacent using Lempel-Ziv coding algorithm- Interlaced modeTIFF- Tagged Image File Format- Used in images and digitized documents- Represented at adjacent 48-bit pixels- Code numbers are usedUNIT V16.

Explain Video compression principles?- Frame typeso I Frameso P frameso B frameso PB frameso D frames- Motion estimation- Motion compensation18. Explain linear predictive coding and Code edgy linear predictive coding?LPC- Perceptual featuresv Pitchv Periodv Loudnessv Origin- Vocal essay excitation parametersШ Voiced soundsШ Unvoiced sounds- Diagram in payment for LPC encoder and decoderCELP- Enhanced excitation model- Used in Limited bandwidth- Waveform template- Template codebook- ITU - T Recommendation standards- Processing delay- Algorithmic delay- Look ahead17. Explain MPEG audio coders and DOLBY audio coders?MPEG audio coders- Diagram in payment for encoding operation- Diagram in payment for decoding operationDOLBY audio coders§ Forward adaptive iota allocation§ Fixed iota allocation§ Backward adaptive iota allocation§ Hybrid backward/forward adaptive iota allocation19. Explain in circumstance confusedly MPEG?MPEG - 1″ MPEG - 1 funniness sequence” MPEG - 1 Video iota rush structureMPEG - 2″ HDTV” MP@MLMPEG - 4″ Content based functionalities” AVO’s” VOP’sUNIT I21.

Write excluding notes on H.261?v Macro searching crazy formatv Frame/picture formatv GOB structure20. Problems using Huffman coding. Arrange the allowed horse’s mouth symbols in descending law with defer to to its probabilityii. There are three phases” Generation of Huffman codei.

If it is a binary Huffman coding enlarge the after horse’s mouth values into a pick unitand placed in a unsurpassed column with other values. Once again rig the horse’s mouth values n decreasing law as obtained in diminish 2. iii. iv. v. Continue the manage until on the contrary 2 horse’s mouth symbols are citadel side.

Start assigning codes (0,1) in the retrograde communication on the procedure the overpowering place. If the order satisfies calculatecoding efficacy and criterion criteria redundancy. _” Determination of H(Б) and L” Check the order in payment for validity at adjacent using horse’s mouth coding statement. 22.

There are three phases” Generation of Shanno-Fano codei. Problems using Shanno-Fano coding. List the horse’s mouth symbols in descending law with defer to to its probabilityii. iii. Partition the standard (or) distress (or ) garments into on the edge of equi-probable groups. Assign ‘0′ to limerick bracket and ‘1′ to the other bracket. Repeat steps (ii) and (iii) on each of the subgroups until on the contrary limerick horse’s mouth standard is left_v.

iv. Determination of H(Б) and Lvi. If the conditionsatisfies add up coding efficacy and criterion criteria redundancy. Check the order in payment for validity at adjacent using horse’s mouth coding statement.

23. ” Calculate the entropy of the horse’s mouth. Problems using appendage quiddity. 2If it is a espouse law appendage then H(Б ) = 2* H(Б)3If it is a third law appendage then H(Б ) = 3* H(Б)24.

” Calculate horse’s mouth entropy H( )” Calculate bring to a stop entropy H( )” Calculate Joint entropy H( good, )” Calculate Conditional entropy H ( / )” Calculate Conditional entropy H ( / )Check at adjacent entropy in-equalities” 0 Ј H ( / ) Ј H( )” 0 Ј H ( / ) Ј H( )” H( good, ) Ј H( ) + H( )25. Problems in payment for conspiring all entropies. Write the properties of shared communication?” Mutual communication of a orientate is symmetricI( ; ) = I( ; )” Mutual communication is without disagree with non-negativeI( ; ) і 0″ Mutual communication is consanguineous to communal entropy( ; ) = H( ) + H( ) - H( good, )26.

” Shannon espouse statement (or) Channel coding statement. Explain sundry coding theorems?” Shannon gold medal statement (or) Source coding statement (or) Shannon dampened coding statement. ” Shannon third statement (or) Information competency statement (or) Channel competency statement.