Performance comparison of LDPC convolutional codes for memory size and encoder block size

In this paper, we compare the performance of some different types of time-invariant LDPC convolutional codes. We first confirm the well-known fact that the performance can be increased by increasing the number of delay, i.e. memory size. Then, we show by simulation that increasing the encoder block...

Full description

Saved in:
Bibliographic Details
Published in2013 International Conference on ICT Convergence (ICTC) pp. 512 - 515
Main Authors Ki-Hyeon Park, Jin Soo Park, Jung-Hyun Kim, Inseon Kim, Hong-Yeop Song, Jang-Yong Lee
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2013
Subjects
Block codes
Convolutional codes
Delays
Educational institutions
Iterative decoding
LDPC codes
Sparse matrices
Online AccessGet full text

Cover

More Information
Summary:In this paper, we compare the performance of some different types of time-invariant LDPC convolutional codes. We first confirm the well-known fact that the performance can be increased by increasing the number of delay, i.e. memory size. Then, we show by simulation that increasing the encoder block size may possibly increase the performance when the memory size is fixed, but this must be done properly. We show also that the performance is comparable when the constraint lengths are comparable regardless of memory size and encoder block size. For all these, we introduce a matrix expansion operation for various sizes of sub-matrices of H matrix to be used in the simulation.
ISSN:2162-1233
DOI:10.1109/ICTC.2013.6675408