ECED4504

Problem Set # 1

Linear Block Codes

1. Consider a (7, 4) code whose generator 1 1 1 0 G= 0 1 1 1 matrix is 1 1 0 0 0 1 0 1 0 0 1 0 0 1 0 0 0 0 0 1

(a) Find all the code vectors of the code. (b) Find H, the parity-check matrix of the code. (c) Compute the syndrome for the received vector 1 1 0 1 1 0 1. Is this a valid code vector? (d) What is the error-correcting capability of the code? (e) What is the error-detecting capability of the code? 2. Consider a systematic block code whose parity-check equations are b0 = m0 + m1 + m3 b1 = m0 + m2 + m3 b2 = m0 + m1 + m2 b3 = m1 + m2 + m3 where mi i {0, 1, 2, 3} are message digits and bi i {0, 1, 2, 3} are check digits. (a) Find the generator matrix and the parity-check matrix for this code. What are the parameters n, k and r. (b) How many errors can the code correct (usually referred as the parameter t)? What is the value of dmin ? (c) Is the vector 1 0 1 0 1 0 1 0 a valid codeword? If not, nd the error vector (if you can) and determine the transmitted codeword. (d) Is the vector 0 1 0 1 1 1 0 0 a valid codeword? If not, nd the error vector (if you can) and determine the transmitted codeword.

ECED4504 3. Problem 8.3.3 from the text (p.438).

Problem Set # 1

Can you provide a general proof (really a short one) that for all linear block codes H GT = 0

4. Problem 8.3.4 from the text (p.438).

Cyclic Codes
5. The generator polynomial of a (15, 11) Hamming code is dened by g(x) = 1 + x + x4 Using the above polynomial nd the generator matrix and the parity check matrix (in a systematic form) of this code. HINT: To solve this problem, it is useful to read Example 3 in the text on p. 384. Specically you should concentrate on the part (p.385, the paragraph starting with To construct matrix G ...) explaining the construction of the generator matrix from the generator polynomial. You specialize this method to the case considered in this problem. NOTE: Hamming codes are a class of linear block codes with n = 2m 1, k = 2m m 1 and dmin = 3 for some integer m 2. With this minimum distance, these codes are capable of providing error-correction capabilities for single errors. 6. Encode the message 1 0 1 in systematic form using polynomial division and the generator g(x) = 1 + x + x2 + x4 . 7. Problem 8.4.3 from the text (p.439). 8. Design a feedback shift register encoder for (8, 5) cyclic code with a generator g(x) = 1 + x + x2 + x3 . Use the encoder to nd the codeword for the message 1 0 1 0 1 in systematic form (list the states of the register at each clock tick. Verify your observations by calculating the codeword through the polynomial division. 2

ECED4504 9. A (15, 5) cyclic code has a generator polynomial as follows: g(x) = 1 + x + x2 + x5 + x8 + x10

Problem Set # 1

Is r(x) = 1 + x4 + x6 + x8 + x14 a code polynomial in this system? HINT: To justify your answer, the reading of the subsection (4) Calculation of the Syndrome in the text on p. 387, may be necessary.

Performance Analysis
10. Assuming that (i) the coherent PSK modulation is employed in the system; (ii) the encoded bit rate is 10,000 code bits per second, and (iii) the decoder is a single error-correcting (7,4) decoder, is a SNR of P/N0 = 48 dBW (P is the average power per transmitted bit, not energy) sucient to provide a probability of message error of 103 at the output of the decoder? Justify your answer. Assume that a message block contains 4 data bits and that any single error pattern in a block of length of 7 bits can be corrected. 11. Information from a source is organized in 36-bit messages that are to be transmitted over an AWGN channel using noncoherently detected BFSK modulation. (a) If no error control coding is used, compute the Eb /N0 required to provide a message error probability of 103 . (b) Consider the use of a (127, 36) linear block code (minimum distance 31 giving the error correction capability of 15 bits in the codeword) in the transmission of these messages. Compute the coding gain for this code for the message error probability of 103 . HINT: The coding gain is dened as the dierence between the Eb /N0 required without coding and the E0 /N0 required with coding. 3