scispace - formally typeset
Search or ask a question
Topic

List decoding

About: List decoding is a research topic. Over the lifetime, 7251 publications have been published within this topic receiving 151182 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A novel reliability ratio based weighted bit-flipping decoding scheme is proposed for low-density parity-check codes, achieving a coding gain of 1 dB when communicating over an AWGN channel, while maintaining the same decoding complexity.
Abstract: A novel reliability ratio based weighted bit-flipping decoding scheme is proposed for low-density parity-check codes. A coding gain of 1 dB is achieved in comparison to the weighted bit-flipping scheme, when communicating over an AWGN channel, while maintaining the same decoding complexity.

77 citations

01 Jan 2000
TL;DR: This work proposes mutual information transfer characteristics for soft in/soft out decoders to design serially concatenated codes based on the convergence behavior of iterative decoding.
Abstract: The design of serially concatenated codes has yet been dominated by optimizing asymptotic slopes of error probability curves. We propose mutual information transfer characteristics for soft in/soft out decoders to design serially concatenated codes based on the convergence behavior of iterative decoding. The exchange of extrinsic information is visualized as a decoding trajectory in the Extrinsic Information Transfer Chart (EXIT chart).

75 citations

Journal ArticleDOI
Philippe Delsarte1, P. Piret1
TL;DR: A solution based on Justesen's idea of variable concatenated codes is given for the case of a symmetric memoryless channel with an input alphabet of prime power order, under the assumption that the information messages are equiprobable.
Abstract: The problem of the explicit construction of encoders achieving Shannon's capacity and admitting a simple decoding algorithm is considered. A solution based on Justesen's idea of variable concatenated codes is given for the case of a symmetric memoryless channel with an input alphabet of prime power order, under the assumption that the information messages are equiprobable. This construction remains good for a nonsymmetric channel provided the encoding rate is smaller than a well-defined "pseudocapacity." In case the channel is regular, it is shown that the error probability after decoding is an exponentially decreasing function of the block length for any encoding rate less than the channel capacity.

75 citations

Journal ArticleDOI
TL;DR: This work proposes a novel coding scheme called multi-CRC polar code for significant reduction of memory size and decoding delay but with negligible performance loss and applies this scheme to hybrid automatic repeat request (HARQ) system to aid retransmission.
Abstract: Polar codes under successive cancelation list (SCL) decoding are capable of achieving almost the same or better performance than turbo codes or low density parity-check codes with the help of single cyclic redundancy check (CRC). This decoding scheme, however, suffers from very high complexity with long delay and large memory space. Motivated by this research problem, we propose a novel coding scheme called multi-CRC polar code for significant reduction of memory size and decoding delay but with negligible performance loss. Our analysis and simulation have shown that about half reduction of memory size and decoding delay can be achieved in SCL decoding. We also apply this scheme to hybrid automatic repeat request (HARQ) system to aid retransmission and show that the throughput of multi-CRC polar code is higher than that of the single-CRC one.

75 citations

Posted Content
TL;DR: The results suggest that structured/lattice codes may be used to mimic, and sometimes outperform, random Gaussian codes in general Gaussian networks.
Abstract: Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as independent, identically distributed (i.i.d.) random Gaussian codebooks. Lattice codes are also known to outperform random codes for certain channel models that are able to exploit their linearity. In this work, we show that lattice codes may be used to achieve the same performance as known i.i.d. Gaussian random coding techniques for the Gaussian relay channel, and show several examples of how this may be combined with the linearity of lattices codes in multi-source relay networks. In particular, we present a nested lattice list decoding technique, by which, lattice codes are shown to achieve the Decode-and-Forward (DF) rate of single source, single destination Gaussian relay channels with one or more relays. We next present two examples of how this DF scheme may be combined with the linearity of lattice codes to achieve new rate regions which for some channel conditions outperform analogous known Gaussian random coding techniques in multi-source relay channels. That is, we derive a new achievable rate region for the two-way relay channel with direct links and compare it to existing schemes, and derive another achievable rate region for the multiple access relay channel. We furthermore present a lattice Compress-and-Forward (CF) scheme for the Gaussian relay channel which exploits a lattice Wyner-Ziv binning scheme and achieves the same rate as the Cover-El Gamal CF rate evaluated for Gaussian random codes. These results suggest that structured/lattice codes may be used to mimic, and sometimes outperform, random Gaussian codes in general Gaussian networks.

75 citations


Network Information
Related Topics (5)
Base station
85.8K papers, 1M citations
89% related
Fading
55.4K papers, 1M citations
89% related
Wireless network
122.5K papers, 2.1M citations
87% related
Network packet
159.7K papers, 2.2M citations
87% related
Wireless
133.4K papers, 1.9M citations
86% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202384
2022153
202179
202078
201982
201894