Topic
Sequential decoding
About: Sequential decoding is a research topic. Over the lifetime, 8667 publications have been published within this topic receiving 204271 citations.
Papers published on a yearly basis
Papers
More filters
••
07 Aug 2002TL;DR: A pipelined VLSI architecture for the implementation of the K-best algorithm, which is computational inexpensive and has fixed throughput and has similar performance as the optimal lattice decoding algorithm if high value of K is used.
Abstract: Lattice decoding algorithms have been proposed for implementing the maximum likelihood detector (MLD), which is the optimal receiver for multiple-input multiple-output (MIMO) channels. However the computational complexity of direct implementation of the lattice decoding algorithm is high and the throughput is variable. In this work, a K-best algorithm is proposed to implement the lattice decoding. It is computational inexpensive and has fixed throughput. It can be easily implemented in a pipelined fashion and has similar performance as the optimal lattice decoding algorithm if high value of K is used. In this paper, we describe a pipelined VLSI architecture for the implementation of the K-best algorithm. The architecture was designed and synthesized using a 0.35 /spl mu/m library. For a 4-transmit and 4-receive antennas system using 16-QAM, a decoding throughput of 10 Mbit/s can be achieved.
413 citations
••
TL;DR: The Gorenstein-Zierler decoding algorithm for BCH codes is extended, modified, and analyzed and it is shown how to correct erasures as well as errors, and improved procedures for finding error and erasure values are exhibited.
Abstract: The Gorenstein-Zierler decoding algorithm for BCH codes is extended, modified, and analyzed; in particular, we show how to correct erasures as well as errors, exhibit improved procedures for finding error and erasure values, and consider in some detail the implementation of these procedures in a special-purpose computer.
412 citations
••
07 Aug 2002
TL;DR: A simplified algorithm for the soft-output demapper for the 16- QAM and 64-QAM constellations is developed, which allows the complexity of the demapper to be maintained at almost the same level for all the possible modes of HIPERLAN/2.
Abstract: A comparison in the performance between hard- and soft-decision Viterbi decoding, with application to the HIPERLAN/2 standard, is presented. The results show that when channel state information (CSI) is included in the generation of the soft-decision information, the soft-decision method greatly outperforms the hard method. Moreover, a simplified algorithm for the soft-output demapper for the 16-QAM and 64-QAM constellations is developed, which allows the complexity of the demapper to be maintained at almost the same level for all the possible modes of HIPERLAN/2.
410 citations
••
[...]
TL;DR: A new class of asymptotically good, linear error-correcting codes based upon expander graphs, which have linear time sequential decoding algorithms, logarithmic time parallel decoding algorithms with a linear number of processors, and are simple to understand are presented.
Abstract: We present a new class of asymptotically good, linear error-correcting codes based upon expander graphs. These codes have linear time sequential decoding algorithms, logarithmic time parallel decoding algorithms with a linear number of processors, and are simple to understand. We present both randomized and explicit constructions for some of these codes. Experimental results demonstrate the extremely good performance of the randomly chosen codes. >
401 citations
••
TL;DR: The high-rate punctured codes of rates 2/3 through 13/14 are derived from rate 1/2 specific convolutional codes with maximal free distance based on their bit error rate performances under soft decision Viterbi decoding.
Abstract: The high-rate punctured codes of rates 2/3 through 13/14 are derived from rate 1/2 specific convolutional codes with maximal free distance. Coding gains of derived codes are compared based on their bit error rate performances under soft decision Viterbi decoding.
399 citations