Scribd
Upload
9 views3 pages

Noc19-Ee29 Assignment1

The document discusses various aspects of LDPC and Polar Codes as applied in the 5G standard, including calculations related to parity check matrices and Tanner graphs. It provides specific examples and answers to questions regarding the properties of these codes, such as the number of edges, maximum bit node degrees, and encoding processes. The document serves as an assignment with detailed explanations for each question related to linear block codes and protograph LDPC codes.

Uploaded by

waleed ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views3 pages

Noc19-Ee29 Assignment1

The document discusses various aspects of LDPC and Polar Codes as applied in the 5G standard, including calculations related to parity check matrices and Tanner graphs. It provides specific examples and answers to questions regarding the properties of these codes, such as the number of edges, maximum bit node degrees, and encoding processes. The document serves as an assignment with detailed explanations for each question related to linear block codes and protograph LDPC codes.

Uploaded by

waleed ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

LDPC and Polar Codes in 5G Standard

Assignment 01

February 14, 2019

 
1 1 0 0 1
1. Consider a linear block code with the parity check matrix 1 1 0 1 0. The number of edges in
1 0 1 0 0
the corresponding Tanner Graph is .

Answer: 8
Explanation: Each non-zero entry in the parity check matrix corresponds to an edge in the tanner
graph. Therefore, the number of edges in the tanner graph is equal to the number of non-zero entries in
the parity check matrix.
 
0 0 0 1 1 1 1
2. Consider a linear block code with the parity check matrix 0 1 1 0 0 1 1. The maximum bit
1 0 1 0 1 0 1
node degree in the corresponding tanner graph is .

Answer: 3
Explanation: Each bit node corresponds to a column in the parity check matrix. Therefore, the
maximum bit node degree is the maximum of the weights of the columns in the parity check matrix.
3. If the expansion factor of a base matrix is 20, then the maximum value of an entry in the base matrix
is .

Answer: 19

Explanation: If the expansion factor of a base matrix is z, then any entry in that base matrix should
be from the set {−1, 0, 1, 2, 3, . . . , z − 1}.
4. Consider a protograph LDPC code with a base matrix of dimension 42 × 52. Let the expansion factor
be 12. Then, the number of message bits in any codeword of this code is .

Answer: 120
Explanation: The size of the corresponding parity check matrix will be (42 ∗ 12) × (52 ∗ 12). Since
the dimension of the parity matrix is n − k × n, where k is the number of message bits, the answer is
(52 − 42) ∗ 12.
 
0 −1 4 0 −1 −1
5. The number of 1s in a parity check matrix given by the base matrix 4 2 −1 1 0 −1 with
1 −1 3 2 −1 0
expansion factor 5 is .
Answer: 55.

1
6. The number of -1s in the E part of a 46 x 68 base matrix in the 5G standard is .

Answer: 7.

 
7. Consider a protograph LDPC code with an expansion factor of 6. The vector 1 1 0 1 0 0 when
acted on by the base matrix entry 2 will transform to:
 
1 0 1 0 0 1
 
0 1 1 0 1 0
 
0 1 0 0 1 1
 
0 0 1 1 0 1
 
Answer: 0 1 0 0 1 1

Explanation: The base matrix entry of 2 left-shifts the vector by 2.


8. Consider a protograph LDPC code with expansion factor 6. Say that two vectors p1 and q1 are related
as q1 = I2 p1 . Then, which of the following relations must also hold true:
p1 = Iq1
p1 = I4 q1
p1 = I3 q1
p1 = I2 q1
Answer: p1 = I4 q1
Explanation: A right shift by the expansion factor(which is 6 here) is equivalent to an identity
operation.
9. You are encoding a protograph LDPC code with expansion factor 5 and the following base matrix,(the
notation is same as that used in the lectures)
 
I1 0 I3 I1 I2 I 0 0
I2 I 0 I3 I2 I I 0
 
 0 I4 I2 I I1 0 I 0
I4 I1 I 0 0 0 0 I

Let the codeword be represented by m1 m2 m3 m4 p1 p2 p3 p4 , where m0i s are the message


 

blocks
 and p0i s are the
 parity blocks. Given that you are first computing p1 given a particular message
m1 m2 m3 m4 , the equation you need to solve is:
I1 p1 = I1 m1 +I2 m1 +I4 m1 +Im2 +I4 m2 +I1 m2 +I3 m3 +I2 m3 +Im3 +I1 m4 +I3 m4 +Im4 +Ip4
I1 p1 = I1 m1 + I2 m1 + Im2 + I4 m2 + I3 m3 + I2 m3 + I1 m4 + I3 m4 + Im4
I1 p1 = I4 m2 + I2 m3 + Im4 + Ip3
Ip1 = I4 m1 + I1 m2 + Im3
Answer: I1 p1 = I1 m1 + I2 m1 + Im2 + I4 m2 + I3 m3 + I2 m3 + I1 m4 + I3 m4 + Im4
Explanation: Adding the first three rows produces the above equation, and it only depends on the
message blocks and not any parity blocks.
10. Consider the 42 x 52 base matrix in the 5G standard for the expansion factor 384. Any codeword in this
code consists of 52 blocks with each block having 384 bits. Let [m1 , m2 , m3 , m4 , . . . , m10 , p1 , p2 , p3 , . . . p42 ]
denote a codeword belonging to this code where m1 , m2 , m3 , m4 , . . . , m10 are the message blocks and
p1 , p2 , p3 , . . . p42 are the parity blocks. In encoding [m1 , m2 , m3 , . . . , m10 ] to [m1 , m2 , m3 , . . . , m10 , p1 , p2 , p3 , . . . p42 ],
the sufficient information to compute p9 is

Page 2
m1 , m2 , m3 , m4 , . . . , m10 , p1 , p2 , p3 , . . . , p8
m1 , m2 , m3 , m4 , . . . , m10 , p1 , p3 , p5 , p7
m1 , m2 , m3 , m4 , . . . , m10 , p1 , p2 , p3 , p4
m1 , m2 , m3 , m4 , . . . , m10 , p2 , p4 , p6 , p8
Answer: m1 , m2 , m3 , m4 , . . . , m10 , p1 , p2 , p3 , p4

Explanation: There is only one (block) parity check equation involving parity block p9 and it contains
only m1 , m2 , m3 , m4 , . . . , m10 , p1 , p2 , p3 , p4 other than p9 .

Page 3

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