Journal ArticleDOI
The construction of fast, high-rate, soft decision block decoders
Reads0
Chats0
TLDR
A detailed description is given of a fast soft decision decoding procedure for high-rate block codes made possible by using the symmetries of the code to simplify the syndrome decoding by table look-up and by making the best use of the soft decision information.Abstract:
A detailed description is given of a fast soft decision decoding procedure for high-rate block codes. The high speed is made possible (in part) by using the symmetries of the code to simplify the syndrome decoding by table look-up and by making the best use of the soft decision information. The (128,106,8) BCH code is used as an example.read more
Citations
More filters
Journal ArticleDOI
Maximum-likelihood soft decision decoding of BCH codes
Alexander Vardy,Yair Be'ery +1 more
TL;DR: The authors show that the same kind of direct-sum structure exists in all the primitive B CH codes, as well as in the BCH codes of composite block length, and introduce a related structure termed the "concurring-sum", and establish its existence in the primitive binary BCH code.
Journal ArticleDOI
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
J. Snyders,Yair Be'ery +1 more
TL;DR: 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.
Journal ArticleDOI
Optimal soft decision block decoders based on fast Hadamard transform
Yair Be'ery,J. Snyders +1 more
TL;DR: An approach for efficient utilization of fast Hadamard transform in decoding binary linear block codes is presented and the availability of these codewords in general, and particularly in some of the most frequently encountered codes, is discussed.
Journal ArticleDOI
Reduced lists of error patterns for maximum likelihood soft decoding
TL;DR: A method whereby a substantially reduced family of error patterns, called survivors, may be created for maximum likelihood soft decoding is introduced and the use of predetermined lists that represent all families of survivors is proposed.
Journal ArticleDOI
Soft trellis-based decoder for linear block codes
Y. Berger,Yair Be'ery +1 more
TL;DR: A systematic design of a trellis-based maximum-likelihood soft-decision decoder for linear block codes is presented and Computational gain of up to 6 is achieved for long high-rate codes over the well-known trellIS decoder of Wolf (1978).
References
More filters
Journal ArticleDOI
The technology of error-correcting codes
TL;DR: This paper is a survey of error-correcting codes, with emphasis on the costs of encoders and decoders, and the relationship of these costs to various important system parameters such as speed and delay.
Related Papers (5)
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
J. Snyders,Yair Be'ery +1 more
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
John H. Conway,Neil J. A. Sloane +1 more