Conference Paper
ProtographBased LDPC Convolutional Codes for Correlated Erasure Channels
Univ. of California San Diego, La Jolla, CA, USA
DOI: 10.1109/ICC.2010.5502364 Conference: Communications (ICC), 2010 IEEE International Conference on Source: IEEE Xplore

Conference Paper: Performance analysis of spatially coupled codes over the correlated erasure channel
[Show abstract] [Hide abstract]
ABSTRACT: Desirable characteristics of spatiallycoupled lowdensity paritycheck (LDPC) codes including low implementation complexity, lowdelay, and closetooptimal performance over a wide variety of channels make them a noticeable candidate for the nextgeneration wireless communication standards. However, error performance of the sliding window decoding scheme used to decode these codes is considerably degraded over channels with memory, such as the burst erasure channel. Traditionally, communication over channels with memory is achieved through the use of block interleavers but as it introduces a large amount of delay, it is not always a viable option. In this paper, employing a convolutional interleaver which benefits from the inherent convolutional nature of the spatiallycoupled codes with very low overall delay is considered. The performance of the proposed combination is analyzed using the density evolution technique. The performance improvement of using a convolutional interleaver is demonstrated as a function of the added interleaving delay in terms of iterative decoding thresholds.Signal Processing and Communications Applications Conference (SIU), 2013 21st; 01/2013  [Show abstract] [Hide abstract]
ABSTRACT: Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binaryinput channels. The performance is good both asymptotically, since the belief propagation thresholds approach the Shannon limit, as well as for finite lengths, since degree2 variable nodes that result in high error floors can be completely avoided. However, to realize the promised good performance, one needs large blocklengths. This in turn implies a large latency and decoding complexity. For the memoryless binary erasure channel, we consider the decoding of spatially coupled codes through a windowed decoder that aims to retain many of the attractive features of belief propagation, while trying to reduce complexity further. We characterize the performance of this scheme by defining thresholds on channel erasure rates that guarantee a target erasure rate. We give analytical lower bounds on these thresholds and show that the performance approaches that of belief propagation exponentially fast in the window size. We give numerical results including the thresholds computed using density evolution and the erasure rate curves for finitelength spatially coupled codes.IEEE Transactions on Information Theory 04/2013; 59(4):22772292. · 2.65 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: Low implementation complexity, low delay and closetooptimal performance over a wide variety of channels are some of the advantages of spatiallycoupled lowdensity paritycheck (LDPC) codes. However, the error performance of the sliding window decoding scheme that is used to decode these codes is considerably degraded over channels with memory, such as the correlated erasure channel. Employing a block interleaver to encounter this situation is not always a viable option, since it introduces a large amount of delay and cancels out the lowdelay property of the sliding window decoder. Another way to reduce the effects of erasure bursts is to construct a more robust code ensemble by presenting additional code design rules. However, this approach results in additional constraints on the already complicated code construction process. The authors propose a novel communication system that combats the effects of the erasure bursts through the use of a convolutional interleaver. The proposed system combines the inherent convolutional nature of the spatiallycoupled LDPC codes with that of a convolutional interleaver to achieve very low overall delay. The performance of the proposed approach is analysed using the density evolution technique and the performance improvement is demonstrated as a function of the interleaving delay via computer simulations.IET Communications 01/2013; 7(8):755765. · 0.72 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.