Reduced complexity decoding strategies for LDPC convolutional codes

While low-density parity-check (LDPC) convolutional codes tend to significantly outperform LDPC block codes with the same processor complexity, large storage requirements and a long initial decoding delay are two issues related to their continuous pipeline decoding architecture [A. Jimenez Feltstrom...

Full description

Saved in:
Bibliographic Details
Main Authors: Pusane, A.E., Lentmaier, M., Zigangirov, K.Sh, Costello, D.J.
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
AWGN
Bit error rate
Block codes
Computer science
control theory
systems
Convolutional codes
Degradation
Delay
Electrical Engineering, Electronic Engineering, Information Engineering
Elektroteknik och elektronik
Engineering and Technology
Equations
Exact sciences and technology
Information theory
Information, signal and communications theory
Iterative decoding
LDPC codes
LDPC convolutional codes
Parity check codes
Pipelines
spatial coupling
Teknik
Telecommunications and information theory
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:While low-density parity-check (LDPC) convolutional codes tend to significantly outperform LDPC block codes with the same processor complexity, large storage requirements and a long initial decoding delay are two issues related to their continuous pipeline decoding architecture [A. Jimenez Feltstrom et al., (1999)]. In this paper, we propose reduced complexity decoding strategies to lessen the storage requirements and the initial decoding delay without significant loss in performance.
DOI:10.1109/ISIT.2004.1365528