List decoding

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

Effects of iterative detection and decoding on the performance of BLAST

Abstract: In BLAST (Bell Labs' Layered Space Time) systems, very high spectral efficiency can be achieved by employing antenna arrays at both transmit and receive sides. Coding for these array systems is an interesting topic, as such, has seen intensive research. We study coding architectures constructed from conventional codes including convolutional codes and Reed Solomon codes. Our main interest is in the performance and complexity trade-offs involved in the design of coding/decoding and signal detection algorithms. We show that iterative detection and decoding (IDD) can significantly improve the performance of coded BLAST. In some cases, IDD allows for very simple detection algorithms to be used at the receiver front end. Therefore, it may in fact reduce the overall receiver complexity. Our results again demonstrate that coded V-BLAST (vertical-BLAST) is a promising architecture to achieve the great potential of BLAST with limited complexity.

Error-Correcting Codes and Self-Checking Circuits

Abstract: Error-control coding techniques, implemented by means of self-checking circuits, will improve system reliability.

Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes

Abstract: Maximum-likelihood soft-decision decoding of linear block codes is addressed. A binary multiple-check generalization of the Wagner rule is presented, and two methods for its implementation, one of which resembles the suboptimal Forney-Chase algorithms, are described. Besides efficient soft decoding of small codes, the generalized rule enables utilization of subspaces of a wide variety, thereby yielding maximum-likelihood decoders with substantially reduced computational complexity for some larger binary codes. More sophisticated choice and exploitation of the structure of both a subspace and the coset representatives are demonstrated for the (24, 12) Golay code, yielding a computational gain factor of about 2 with respect to previous methods. A ternary single-check version of the Wagner rule is applied for efficient soft decoding of the (12, 6) ternary Golay code. >

Codes for the correction of 'clustered' errors

Abstract: A method is described which permits the systematic construction of codes capable of error-free transmission, provided errors occur in "clusters" of limited duration. The method is valid for error clusters of any prescribed duration. The codes are relatively easy to implement and decoding operations are straightforward. Specific examples are given and applications to teletype transmission are discussed.

Low Complexity Iterative Receiver Design for Sparse Code Multiple Access

Abstract: Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques, such as low density signature, SCMA can achieve better performance due to the shaping gain of the SCMA code words. However, despite the sparsity of the code words, the decoding complexity of the current message passing algorithm utilized by SCMA is still prohibitively high. In this paper, by exploring the lattice structure of SCMA code words, we propose a low-complexity decoding algorithm based on list sphere decoding (LSD). The LSD avoids the exhaustive search for all possible hypotheses and only considers signal within a hypersphere. As LSD can be viewed a depth-first tree search algorithm, we further propose several methods to prune the redundancy-visited nodes in order to reduce the size of the search tree. Simulation results show that the proposed algorithm can reduce the decoding complexity substantially while the performance loss compared with the existing algorithm is negligible.