Comparison of LDPC Block and LDPC Convolutional Codes Based on their Decoding Latency
Författare
Summary, in English
We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC convolutional codes, a sliding window decoder with different window sizes is applied to continuously decode the input symbols. We show the required Eb/N0 to achieve a bit error rate of 10-5 for the LDPC block and LDPC convolutional codes for the decoding latency of up to approximately 550 information bits. It has been observed that LDPC convolutional codes perform better than the block codes from which they are derived even at low latency. We demonstrate the trade off between complexity and performance in terms of lifting factor and window size for a fixed value of latency. Furthermore, the two codes are also compared in terms of their complexity as a function of Eb/N0. Convolutional codes with Viterbi decoding are also compared with the two above mentioned codes.
Publiceringsår
2012
Språk
Engelska
Sidor
225-229
Publikation/Tidskrift/Serie
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)
Fulltext
- Available as PDF - 331 kB
- Download statistics
Dokumenttyp
Konferensbidrag
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Nyckelord
- spatial coupling
- LDPC codes
- LDPC convolutional codes
Conference name
International Symposium on Turbo Codes & Related Topics (ISTC), 2012
Conference date
2012-08-27 - 2012-08-31
Conference place
Gothenburg, Sweden
Status
Published
Forskningsgrupp
- Telecommunication Theory
ISBN/ISSN/Övrigt
- ISSN: 2165-4700
- ISBN: 978-1-4577-2114-4