Complexity of Turbo codes is related to the convolutional codes complexity but LDPC, I need to get the computational complexity equation of encoding and decoding?
In the book Modern Coding Theory by Richardson and Urbanke, there is an Appendix that discussed encoding of LDPC codes in detail.
Hello , please can you look at this article. I think it is useful to your question.
the complexity of the encoding 5G is n+g^2. There is a problem the presence of g that is why greedy algorithm reduce the value of g to reduce to complexity of the algorithm of encoding.
Can some guide me how to compute the complexity of convolution encoder i mean any general close form expression?
For me I use an algorithm of Richarson-Urbankie . In this article of encoding LDPC you can see the complexity . it is n^2+g and g is the size a certain matrix(submatrix of the matrix H).
Sir I am asking about encoding complexity of convolutional encoder not LDPC encoder? It will help if you can comment on that.
Ah sorry . I want to see it because I didn't work in convolutionnal code until now.
I am working on the PHY layer in 5G . I will use the convolutionnal code to encode the control bits CQI RI and ACK/NACK, it is important to know the complexity of this encoder
But sir, polar code has been recommended for control channel for 5 G in the physical layer
I also hope that polar code replace LDPC, but the reality seems that LDPC has been finalized for data channels in NR standard by 3GPP.
- Badges
- Science topic