List decoding

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

Multi-layer run level encoding and decoding

Abstract: Entropy coding and decoding techniques are described, which may be implemented separately or in combination. For example, a video encoder uses two-layer run level coding to reduce bitrate for frequency transform coefficients in a quick and efficient manner, and a video decoder uses corresponding two-layer run level decoding. This two-layer coding/decoding can be generalized to more than two layers of run level coding/decoding. The video encoder and decoder exploit common patterns in run level information to reduce code table size and create opportunities for early termination of decoding. Using zoned Huffman code tables helps limit overall table size while still providing a level of adaptivity in encoding and decoding. Using embedded Huffman code tables allows the encoder and decoder to reuse codes for 8×8, 8×4, 4×8, and 4×4 blocks.

Iterative Decoding Trajectories of Parallel Concatenated Codes

Abstract: Mutual information transfer characteristics for soft in/soft out decoders are proposed as a tool to better understand the convergence behavior of iterative decoding schemes. The exchange of extrinsic information is visualized as a decoding trajectory in the Extrinsic Information Transfer Chart. This allows the prediction of turbo cliff position and bit error rate after an arbitrary number of iterations. The influence of code memory, generator polynomials as well as different constituent codes on the convergence behavior is studied for parallel concatenated codes.

Fast Successive-Cancellation Decoding of Polar Codes: Identification and Decoding of New Nodes

Abstract: The decoding latency of polar codes can be reduced by implementing fast parallel decoders in the last stages of decoding. In this letter, we present five such decoders corresponding to different frozen-bit sequences to improve the decoding speed of polar codes. Implementing them achieves significant latency reduction without tangibly altering the bit-error-rate performance of the code.

Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward

Abstract: Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as 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 paper, 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 multisource relay networks. In particular, we present a nested lattice list decoding technique in 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 multisource 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 a new 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.

Polar code decoding method and decoding device

Abstract: Embodiments of the present invention provide a method and a device for decoding Polar codes. A reliable subset is extracted from an information bit set of the Polar codes, where reliability of information bits in the reliable subset is higher than reliability of other information bits. The method includes: obtaining a probability value or an LLR of a current decoding bit of the Polar codes; when the current decoding bit belongs to the reliable subset, performing judgment according to the probability value or the LLR of the current decoding bit to determine a decoding value of the current decoding bit, keeping the number of decoding paths of the Polar codes unchanged, and modifying probability values of all the decoding paths by using the probability value or the LLR of the current decoding bit. The probability values of the decoding paths are obtained by calculation according to the probability value or the LLR of the decoding bit of the Polar codes. In the embodiments of the present invention, the information bits in the reliable subset are judged without splitting the decoding path, thereby reducing overall decoding complexity.