Scribd
Upload
74 views7 pages

Error Control Coding: Assignment - 3

This document discusses an assignment for an error control coding course. It includes the assignment questions, an allocation of questions to students with their submission status, and the full solutions to several questions. Specifically, it provides the solutions to question 19 involving finding generator matrices and codewords for different feedforward encoders, question 21 explaining the necessity of an inverse generator matrix and providing an example, and question 22 defining a catastrophic encoder and giving an example.

Uploaded by

jeevitharrk
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
74 views7 pages

Error Control Coding: Assignment - 3

This document discusses an assignment for an error control coding course. It includes the assignment questions, an allocation of questions to students with their submission status, and the full solutions to several questions. Specifically, it provides the solutions to question 19 involving finding generator matrices and codewords for different feedforward encoders, question 21 explaining the necessity of an inverse generator matrix and providing an example, and question 22 defining a catastrophic encoder and giving an example.

Uploaded by

jeevitharrk
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/ 7

ERROR CONTROL CODING

ASSIGNMENT 3

CONTENTS
1 2 3 Assignment Questions Allotment of Questions with status of submission Assignment Answers Page-2 Page-3 Page-4 onwards

Page 1 of 7

Assignment 3 Questions

Page 2 of 7

Allotment of Questions for Assignment -3 (ECC)


Sl No
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

USN

Name

Questions
1&2 3&4 5&6 7&8 XXXX 9 & 10 11 & 12 13 & 14 15 & 16 17 & 18 19 (Prob 11.1 & 11.2) 19 (Prob 11.3 & 11.4) 19 (Prob 11.5 & 11.6) 19 (Prob 11.9 & 11.10) 19 (Prob 11.11 & 11.12) 19 (Prob 11.13 & 11.14) 19 (Prob 11.15) & 20 21 & 22

Submitted
No No No No
XXXX

1DS12LEC01 Abhilasha NS 1DS12LEC02 Sai Kumar Krishna 1DS12LEC03 Arunkumar CK 1DS12LEC04 C Ravikumar 1DS12LEC05 Diwakar K 1DS12LEC06 Jeevitha T 1DS12LEC07 Prathibha M 1DS12LEC08 Ragini K 1DS12LEC09 Sandeep BS 1DS12LEC10 Sandhya GM 1DS12LEC11 Shreyansh L 1DS12LEC12 Srikanth SP 1DS12LEC13 Shruthi N 1DS12LEC14 Sowmya P 1DS12LEC15 Sridhar R 1DS12LEC16 Supriya V 1DS12LEC17 Tejali S 1DS12LEC18 Chethan K

No No No No No No Yes No No No No No Yes

Page 3 of 7

Question No.19. Problem No. 11.3 Consider (3,1,2) nonsystematic feed-forward encoder with

a. Find the transform-domain generator matrix G(D) b. Find the set of output sequences V(D) and the ocdeword v(D) corresponding to the information sequence Solution: The Generator polynomial
and can be writted in polynomial form as is the transform domain generator matrix Where

The Transform Domain Generator matrix is

Given

and the output sequence where

is given by

The set of output sequence and the code word is as below

Page 4 of 7

Question No.19. Problem No. 11.4 Consider (3,2,2) non systematic encoder as shown below

a. Find the composite generator polynomials and b. Find the code word corresponding t the set of information sequences
]

Solution: From the encoder G(D) is given by [ ]

Compsite form of Generator polynomial is [ ]


[ [ ] ]

Page 5 of 7

Q No 21. What is the necessity of inverse generator matrix? Give feed forward inverse

circuit for (2,1,3) CC with G(D)=[1+D2+D3, 1+D+D2+D3]. In some cases it is desirable to recover a noisy version of the information sequence directly from the codeword. In cases like i. ii. iii. channel noise conditions are being tested decoder is malfunctioning channel SNR is high enough that decoding is not necessary

This process requires an inverter to recover the information sequence from the codeword, so construct the inverse generator matrix to construct the encoder inverse such that G(D) G-1(D) = IDl (2,1,3) encoder V(0)

V(1)

For the above encoder G(D)= [g(0)(D) g(1)(D)] = [1+D2+D3 1+D+D2+D3]

GCD[g(0)(D) g(1)(D)]=GCD[[1+D2+D3 And the transfer function matrix G-1(D)= 1+D+D2 D+D2

1+D+D2+D3] = 1

Provides the required feedforward inverse of delay 0;that is G(D) G-1(D)=1 . Realization of the encoder inverse is as shown

Page 6 of 7

V(0)

V(1)

Q.No 22. What do you mean by catastrophic encoder? Give example. The estimated information sequence produced by the encoder inverse, which contains an infinite number of decoding errors caused by the finite number of channel errors. This can be explained with an example If the information sequence is u(D)=1/1+D = 1+D+D2+D3+ Output sequences are V(0)(D) = 1 V(0)(D) = 1+D The codeword has only weight of 3 even the information sequence has infinite weight. If the codeword is transmitted over BSC and the 3 nonzero bits are changed to zeros by the channel noise then the received sequence will be all zero . A max likelihood decoder will then produce the all zero codeword as its estimate since this is a valid codeword and it aggress exactly with the received sequence. Thus the estimated information sequence will be u(D)=0(D) implying infinite number of errors. Example of catastrophic encoder is (2,1,2) Generator matrix G(D)=[ g(0)(D) g(1)(D)] = [1+D GCD[g(0)(D) g(1)(D)]=GCD[[1+D 1+D2] = 1+D 1+D2]

Which not satisfies the condition G(D) G-1(D) =1

Page 7 of 7

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy