ECNG 6703 - Principles of Communications

Introduction to Information Theory - Channel Coding: Part II

Sean Rocke

October 7th , 2013

ECNG 6703 - Principles of Communications

1 / 17

Outline

Channel Coding Preliminaries Block Coding Cyclic Coding Conclusion

ECNG 6703 - Principles of Communications

2 / 17

Channel Coding Preliminaries

Channel Coding in Context

Consider the following Digital Comms Examples: Taking & posting a narcissistic picture of you ziplining in Chaguaramas, on your Facebook prole A GSM phone conversation Sending instrumentation data to a control system for a manufacturing plant Downloading a legal copy of an ebook from amazon.com Live transmission of a Machel Montano concert over the Internet Last lecture. . . Source Coding: Representing the information to be transmitted with as few bits as possible. . . (Data Compression) This lecture. . . Channel Coding: How do we ensure that the compressed data is transmitted reliably on a possibly unreliable channel? (Error Detection & Correction)
ECNG 6703 - Principles of Communications 3 / 17

Channel Coding Preliminaries

Recall: Elements of a Digital Communications System

Information source and input transducer Source encoder Channel encoder Digital modulator

Channel

Output transducer

Source decoder

Channel decoder

Digital demodulator

Elements not specically included in the illustration: Carrier and Symbol Synchronization A\D interface Channel interfaces (e.g., RF front end (RFFE), ber optic front end (FOFE), BAN front end (BANFE), . . . )

ECNG 6703 - Principles of Communications

4 / 17

Channel Coding Preliminaries

Recall: Channel Coding Dened

Channel encoding: To introduce, in a controlled manner, some redundancy in the binary information sequence, which can be used at the receiver to overcome the effects of noise & interference encountered during signal transmission through the channel. Channel coding challenge: How can the source output be transmitted across an unreliable channel and reliably received, with as little power, bandwidth, and implementation complexity as possible? Key performance metrics: coding rate, bit error rate, power efciency, bandwidth efciency, implementation complexity To answer the above, it is essential to model the channel. . .
ECNG 6703 - Principles of Communications 5 / 17

Channel Coding Preliminaries

Recall: Error Control Mechanisms

Error Control Stop & Wait ARQ Continuous ARQ Go-BackN Selective Repeat Non-linear Non-cyclic Golay FECC Block codes Group(Linear) Polynomially generated (cyclic) BCH ReedBinary BCH Solomon Hamming(e = 1) e>1 Convolutional codes

ECNG 6703 - Principles of Communications

6 / 17

Block Coding

Block Coding Examples

Questions: In a communication channel encoder, every data bit is repeated ve times, and at the receiver, a majority vote decides the value of each data bit. If the uncoded bit error probability is p = 103 , calculate the coded bit error probability when using this bestofve code.

ECNG 6703 - Principles of Communications

7 / 17

Block Coding

Block Coding Examples

Questions: In a single parity check code, a single parity bit is appended to a block of k data bits (d1 d2 . . . dk ). The single parity bit c1 is chosen so that the code word satises the even parity rule: d1 d2 dk c1 = 0
1 2 3

For k = 3 set up all possible words in the (4, 3) code. Which error patterns can the code detect? Compute the probability of an undetected symbol error, assuming that all symbol errors are independent and that the probability of a symbol error is p = 0.01.

ECNG 6703 - Principles of Communications

8 / 17

Block Coding

Block Coding Examples

Questions:
1

Is C1 = {000, 111} a linear code? Is C2 = {000, 001, 101} a linear code? Consider the following code vectors: c1 = [10010] c2 = [01101] c3 = [11001] Find d (c1 , c2 ), d (c1 , c3 ) and d (c2 , c3 ).

What are the error detection and correction properties of C1 ? Can it correct the error pattern (110)?

ECNG 6703 - Principles of Communications

9 / 17

Block Coding

Block Coding Examples

Questions: For a (6, 3) systematic linear block code, the three parity check bits c4 , c5 , and c6 are formed from the following equations: c4 = d1 d3 c5 = d1 d2 d3 c6 = d1 d2
1 2 3 4

Write down the generator matrix, G. Construct all possible codewords. Determine the Hamming weghts for all codewords. What are the error detection and correction properties of this code? Suppose that the received word is 010111. Decode the word by nding the location of the error and the transmitted data bits using the syndrome. ECNG 6703 - Principles of Communications 10 / 17 Now use the Hamming distance and repeat the previous question.

Block Coding

Block Coding Examples

Questions: A paritycheck code has the paritycheck matrix 1 0 1 1 0 0 H = 1 1 0 0 1 0 0 1 1 0 0 1
1 2 3 4

5 6

Determine the generator matrix, G. Construct all possible codewords. Determine the Hamming weghts for all codewords. What are the error detection and correction properties of this code? Find the codeword that begins with 101 . . . Suppose that the received word is 110110. Decode this received word.
ECNG 6703 - Principles of Communications 11 / 17

Block Coding

Block Coding Examples

Questions: Consider a (7, 4) linear block code with the paritycheck matrix 1 0 1 1 1 0 0 H = 1 1 0 1 0 1 0 0 1 1 1 0 0 1
1 2 3

Construct the code words for thsi (7, 4) code. Show that this is a Hamming code. Illustrate the relation between the minimum distance and the structure of the parity-check matrix H by considering the code word 0101100.

ECNG 6703 - Principles of Communications

12 / 17

Cyclic Coding

Cyclic Coding Examples

Questions:
1

Is C1 = {0000, 0101, 1010, 1111} a cyclic code? Is C2 = {000, 100, 011, 111} a cyclic code? Find the generator polynomial g (x ) for C1 and show that every code is a multiple of g (x ).

ECNG 6703 - Principles of Communications

13 / 17

Cyclic Coding

Cyclic Coding Examples

Questions: Consider a (7, 4) cyclic code, C with g (x ) = 1 + x + x 3

1

Let data word d = (1010). Find the corresponding code word. Let the code word c = (1100101). Find the corresponding data word. Sequence (1110011) is received. Find the data word sent. Find the generator matrix for C . Repeat the rst question using the generator matrix.

3 4 5

ECNG 6703 - Principles of Communications

14 / 17

Cyclic Coding

Cyclic Coding Examples

Questions: Consider a (7, 4) cyclic code with g (x ) = 1 + x + x 3

1

Let data word d = (1010). Find the corresponding code word. Let the code word c = (1100101). Find the corresponding data word.

ECNG 6703 - Principles of Communications

15 / 17

Conclusion

Conclusion

We covered: Channel coding fundamentals Block coding Cyclic coding Introducing Simulink Your goals for next class: Continue ramping up your MATLAB & Simulink skills Review channel coding handout on course site Complete HW 4 for submission next week

ECNG 6703 - Principles of Communications

16 / 17

Conclusion

Thank You

Questions????

ECNG 6703 - Principles of Communications

17 / 17