HW06 - University of Illinois Spring 2011 ECE 361: Problem...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: University of Illinois Spring 2011 ECE 361: Problem Set 6: Solutions Erasure Channels; Gaussian Channel Capacity 1. [Single erasure correcting code] A simple overall parity-check code with generator matrix G = 1 0 0 0 1 0 1 0 0 1 0 0 1 0 1 0 0 0 1 1 suffices. Note that the transmitted codeword is [ u ,u 1 ,u 2 ,u 3 ,u u 1 u 2 u 3 ] = [ c ,c 1 ,c 2 ,c 3 ,c 4 ] where c 4 is the overall parity-check bit. If c 4 is erased, no problems! [ c ,c 1 ,c 2 ,c 3 , ?] = [ u ,u 1 ,u 2 ,u 3 , ?] and the four data bits are received without error. But if one of the other bits is erased, then it can be obtained as the XOR sum of the four unerased bits. For example, if the receiver gets [ c ,c 1 , ? ,c 3 ,c 4 ], then c c 1 c 3 c 4 = u u 1 u 3 ( u u 1 u 2 u 3 ) = u 2 , the erased data bit! Of course, the unerased data bits are just c ,c 1 , and c 3 . 2. [Decoding a Reed-Solomon on an erasure channel] (a) We have to interpolate d ( z ) of degree 3 through the 4 points (0 , 1) , (1 , 3) , (2 , 0) , (4 , 0). But since x i 3 = x i 4 = 0, the corresponding terms disappear from the sum defining d ( z ), and we have d ( z ) = 1 ( z- 1)( z- 2)( z- 4) (0- 1)(0- 2)(0- 4) + 3 ( z- 0)( z- 2)( z- 4) (1- 0)(1- 2)(1- 4) = ( z- 2)( z- 4) z- 1 6 + 3 z 3 = ( z- 2)( z- 4) since z/ 6 - z and- 1 / 6 = 1 modulo 7 = z 2- 6 z + 8 z 2 + z + 1 modulo 7 ....
View Full Document

This document was uploaded on 01/24/2012.

Page1 / 2

HW06 - University of Illinois Spring 2011 ECE 361: Problem...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online