Scribd
Upload
3 views

Assignment_6

The document outlines an assignment focused on the BCJR algorithm and various coding techniques including Turbo, LDPC, and Polar Codes. It includes specific tasks such as finding the MAP estimate using the BCJR algorithm, proving equations related to iterative decoding, decoding a received codeword using the log-domain Belief Propagation algorithm, and constructing a polar code for a Binary Erasure Channel. The assignment requires detailed calculations and illustrations for each problem presented.

Uploaded by

Chinthani Chathurika Kumaradasa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Assignment_6

The document outlines an assignment focused on the BCJR algorithm and various coding techniques including Turbo, LDPC, and Polar Codes. It includes specific tasks such as finding the MAP estimate using the BCJR algorithm, proving equations related to iterative decoding, decoding a received codeword using the log-domain Belief Propagation algorithm, and constructing a polar code for a Binary Erasure Channel. The assignment requires detailed calculations and illustrations for each problem presented.

Uploaded by

Chinthani Chathurika Kumaradasa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Channel Coding and Modulation October 27, 2023

Assignment 6
BCJR Algorithm and Turbo, LDPC, and Polar Codes
1. Consider the (2, 1, 2) encoder given by the following trellis diagram. Suppose that
upon the transmission of a sequence x of six coded symbols over an AWGN channel
the following sequence of twelve real numbers is received in the decoder.

y = 0.3 0.1 − 0.5 0.2 0.8 0.5 − 0.5 0.3 0.1 − 0.7 1.5 − 0.4 (1)
The encoder input bits, uk = ±1, are equally likely and the trellis path associated
with the coded sequence x begins and ends in the all-zero state, for which two tail
bits have to be added to the message. The AWGN channel is such that Ec /N0 = 1dB
and a = 1. Find the MAP estimate of the transmitted bit sequence using the BCJR
algorithm. Show the calculation steps in each iteration and the final values on a
trellis diagram. (This problem was partially discussed in the tutorial class).

Figure 1: The trellis for the (2, 1, 2) encoder.

2. Prove the equations (5) - (10), (14), (15), and (16) in the paper “Iterative Decoding
of Binary Block and Convolutional Codes”.
3. Consider the following parity check matrix with wc = 2 and wr = 3.
 
1 1 0 1 0 0
0 1 1 0 1 0
H= 1 0 0

0 1 1
0 0 1 1 0 1
Assume a codeword generated from this encoder system is sent over a BSC with
cross-over probability p = 0.2 and y = [1 0 1 0 1 1] is received. Decode the
received codeword using the log-domain Belief Propagation algorithm to find the
transmitted codeword. (Use a maximum number of three iterations and show the
calculation steps in each iteration).
4. Polar code has a channel-specific design. Assume that the channel W is Binary
Erasure Channel (BEC) with erasure probability ϵ = 1/4. Construct a polar code
of length N = 16 with rate R = 1/2 for such a BEC and illustrate the encoder
structure. What are the frozen bit indices?
Page 1 of 1

You might also like