Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Signals and communication technology

Soft Decision and Quantised Soft Decision Decoding

Martin Tomlinson, Cen Jung Tjhai, Marcel Ambroze, Mohammed Zaki Ahmed, Mubarak Jibril

Published Jan 1, 2017• 1 citation
Publisher

Abstract

In many modern communication systems, the full benefits of error-correction coding are only realised if the decoder is able to utilise soft decision decoding. In this chapter, we give both approximate and exact bounds on the performance of soft decision decoding compared to hard decision decoding. The effects of soft decision quantisation are explored as a function of the number of quantisation levels. Examples are given of the different performance achieved using soft and quantised soft decision decoding for (100,50) and (200,100) binary codes. A modified version of the near maximum likelihood decoder, the Dorsch decoder described in Chap. 15 , is presented for hard decision decoding. The performance improvements achieved by the decoder, compared to bounded distance decoding, are evaluated for some BCH codes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

DOI
10.1007/978-3-319-51103-0_3

Related papers

The Modified Dorsch Decoder

Martin Tomlinson, Cen Jung Tjhai, Marcel Ambroze +2 more

The Holy Grail in coding theory is the maximum likelihood decoder. Paradoxically, the best error-correcting codes are not commonly used in practical communication systems. This is because there is no practical decoder available that achieves anywhere near maximum likelihood performance. Inferior codes, such as LDPC or turbo codes, are used that perform much better with a practical decoder such as the iterative decoder. One day, may be in 100 years time, maximum likelihood decoders will be generally available and today’s best codes will then be used in practical systems. In this chapter a modified Dorsch decoder is described, which achieves near maximum likelihood performance for all binary codes that are not too long. It is a practical decoder for half rate codes having a length less than about 180 bits or so using current digital processors. The outstanding performance achieved, using several examples of the best binary codes known, is presented. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Signals and communication technology•Jan 1, 2017•0 citations

Fundamentals of Soft‐Decision Decoding

Mohammad Rowshan, Emanuele Viterbo

This chapter explores the critical role of decoding techniques in ensuring reliable communication over noisy channels. It discusses the role of various cost functions, which are essential for evaluating how closely a received signal corresponds to potential codewords. The chapter helps the reader to learn about the factors influencing the error rate of linear codes, providing a comprehensive understanding of how different parameters affect the reliability of communication. It explores advanced decoding techniques, including maximum a posteriori/maximum-likelihood (ML) decoding, reliability-based universal decoding, recursive decoding, message-passing algorithms, and tree/trellis-based search methods. Since the soft-decision ML decoding of the trivial codes is simple, a computationally efficient decoder for Reed–Muller codes can be obtained, based on computing the soft information for constituent codes and hard-decision on trivial codes.

Wiley eBooks•Oct 27, 2025•0 citations

Extending the Dorsch decoder towards achieving maximum-likelihood decoding for linear codes

Martin Tomlinson, Cen Jung Tjhai, Marcel Ambroze

It is shown that the relatively unknown Dorsch decoder may be extended to produce a decoder that is capable of maximum-likelihood decoding. The extension involves a technique for any linear (n, k) code that ensures that n−k less reliable, soft decisions of each received vector may be treated as erasures in determining candidate codewords. These codewords are derived from low information weight codewords and it is shown that an upper bound of this information weight may be calculated from each received vector in order to guarantee that the decoder will achieve maximum-likelihood decoding. Using the cross-correlation function, it is shown that the most likely codeword may be derived from a partial correlation function of these low information weight codewords, which leads to an efficient fast decoder. For a practical implementation, this decoder may be further simplified into a concatenation of a hard-decision decoder and a partial correlation decoder with insignificant performance degradation. Results are presented for some powerful, known codes, including a GF(4) non-binary BCH code. It is shown that maximum-likelihood decoding is realised for a high percentage of decoded codewords and that performance close to the sphere packing bound is attainable for codeword lengths up to 1000 bits.

IET Communications•Jun 1, 2007•7 citations

On maximum likelihood soft-decision decoding of binary linear codes

N.J.C. Lous, P.A.H. Bours, Henk C. A. van Tilborg

Two new implementations of a maximum-likelihood soft-decision decoding algorithm for binary linear codes are derived. Instead of checking only error patterns yielding a codeword when added to the rounded-off version of the received vector, these implementations principally consider all possible column patterns. Compared to known implementations, this allows a more efficient use of branching and bounding techniques.>

IEEE Transactions on Information Theory•Jan 1, 1993•28 citations

Iterative Soft-Decision Decoding of Binary Cyclic Codes

Marco Baldi, Giovanni Cancellieri, Franco Chiaraluce

Binary cyclic codes achieve good error correction performance and allow the implementation of very simpleencoder and decoder circuits. Among them, BCH codesrepresent a very important class of t-error correcting codes, with known structural properties and error correction capability. Decoding of binary cyclic codes is often accomplished through hard-decision decoders, although it is recognized that softdecision decoding algorithms can produce significant coding gain with respect to hard-decision techniques. Several approaches have been proposed to implement iterative soft-decision decoding of binary cyclic codes. We study the technique based on “extended parity-check matrices”, and show that such method is not suitable for high rates or long codes. We propose a new approach, based on “reduced parity-check matrices” and “spread parity-check matrices”, that can achieve better correction performance in many practical cases, without increasing the complexity.

Journal of Communications Software and Systems•Jun 22, 2008•3 citations

Soft-Decision Adaptive Recursive Maximum Likelihood Decoding Algorithm for Non-binary Codes

Yingtao Zhou, Yuichi Kaji

Maximum likelihood (ML) decoding is the optimal error-correction method but is NP-hard in general, implying that there would be no polynomial-time ML decoding algorithm that capable of decoding arbitrary linear codes. Consequently, researchers have developed a variety of ML decoding algorithms with different characteristics so that they can be used in a complementary manner. Although many modern codes such as Turbo, LDPC, and Polar codes, can be efficiently decoded without ML algorithms, there remains continual demand for developing new ML decoding algorithms and evaluating ML decoding performance in various contexts. In this study, we propose an ML decoding algorithm applicable to general non-binary linear codes, formulated as a generalization of the adaptive and recursive ML decoding algorithm previously developed for binary codes. The proposed algorithm is implemented and applied to Generalized Reed-Muller codes, and its computational complexity of soft-decision ML decoding is discussed and compared with the complexity of the Viterbi decoder, in terms of the number of addition-equivalent operations, to demonstrate the efficiency of the approach. The substantial reduction in decoding complexity enables us performing practical decoding simulation of some classes of Generalized Reed-Muller codes. This paper also shows numerical evaluation results of the error-correcting capabilities of the codes, providing insights into their performance under optimal decoding conditions.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2026•0 citations
In many modern communication systems, the full benefits of error-correction coding are only realised if the decoder is able to utilise soft decision decoding. In this chapter, we give both approximate and exact bounds on the performance of soft decision decoding compared to hard decision decoding. The effects of soft decision quantisation are explored as a function of the number of quantisation levels. Examples are given of the different performance achieved using soft and quantised soft decision decoding for (100,50) and (200,100) binary codes. A modified version of the near maximum likelihood decoder, the Dorsch decoder described in Chap. 15 , is presented for hard decision decoding. The performance improvements achieved by the decoder, compared to bounded distance decoding, are evaluated for some BCH codes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The Holy Grail in coding theory is the maximum likelihood decoder. Paradoxically, the best error-correcting codes are not commonly used in practical communication systems. This is because there is no practical decoder available that achieves anywhere near maximum likelihood performance. Inferior codes, such as LDPC or turbo codes, are used that perform much better with a practical decoder such as the iterative decoder. One day, may be in 100 years time, maximum likelihood decoders will be generally available and today’s best codes will then be used in practical systems. In this chapter a modified Dorsch decoder is described, which achieves near maximum likelihood performance for all binary codes that are not too long. It is a practical decoder for half rate codes having a length less than about 180 bits or so using current digital processors. The outstanding performance achieved, using several examples of the best binary codes known, is presented. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This chapter explores the critical role of decoding techniques in ensuring reliable communication over noisy channels. It discusses the role of various cost functions, which are essential for evaluating how closely a received signal corresponds to potential codewords. The chapter helps the reader to learn about the factors influencing the error rate of linear codes, providing a comprehensive understanding of how different parameters affect the reliability of communication. It explores advanced decoding techniques, including maximum a posteriori/maximum-likelihood (ML) decoding, reliability-based universal decoding, recursive decoding, message-passing algorithms, and tree/trellis-based search methods. Since the soft-decision ML decoding of the trivial codes is simple, a computationally efficient decoder for Reed–Muller codes can be obtained, based on computing the soft information for constituent codes and hard-decision on trivial codes.
It is shown that the relatively unknown Dorsch decoder may be extended to produce a decoder that is capable of maximum-likelihood decoding. The extension involves a technique for any linear (n, k) code that ensures that n−k less reliable, soft decisions of each received vector may be treated as erasures in determining candidate codewords. These codewords are derived from low information weight codewords and it is shown that an upper bound of this information weight may be calculated from each received vector in order to guarantee that the decoder will achieve maximum-likelihood decoding. Using the cross-correlation function, it is shown that the most likely codeword may be derived from a partial correlation function of these low information weight codewords, which leads to an efficient fast decoder. For a practical implementation, this decoder may be further simplified into a concatenation of a hard-decision decoder and a partial correlation decoder with insignificant performance degradation. Results are presented for some powerful, known codes, including a GF(4) non-binary BCH code. It is shown that maximum-likelihood decoding is realised for a high percentage of decoded codewords and that performance close to the sphere packing bound is attainable for codeword lengths up to 1000 bits.
Binary cyclic codes achieve good error correction performance and allow the implementation of very simpleencoder and decoder circuits. Among them, BCH codesrepresent a very important class of t-error correcting codes, with known structural properties and error correction capability. Decoding of binary cyclic codes is often accomplished through hard-decision decoders, although it is recognized that softdecision decoding algorithms can produce significant coding gain with respect to hard-decision techniques. Several approaches have been proposed to implement iterative soft-decision decoding of binary cyclic codes. We study the technique based on “extended parity-check matrices”, and show that such method is not suitable for high rates or long codes. We propose a new approach, based on “reduced parity-check matrices” and “spread parity-check matrices”, that can achieve better correction performance in many practical cases, without increasing the complexity.
Maximum likelihood (ML) decoding is the optimal error-correction method but is NP-hard in general, implying that there would be no polynomial-time ML decoding algorithm that capable of decoding arbitrary linear codes. Consequently, researchers have developed a variety of ML decoding algorithms with different characteristics so that they can be used in a complementary manner. Although many modern codes such as Turbo, LDPC, and Polar codes, can be efficiently decoded without ML algorithms, there remains continual demand for developing new ML decoding algorithms and evaluating ML decoding performance in various contexts. In this study, we propose an ML decoding algorithm applicable to general non-binary linear codes, formulated as a generalization of the adaptive and recursive ML decoding algorithm previously developed for binary codes. The proposed algorithm is implemented and applied to Generalized Reed-Muller codes, and its computational complexity of soft-decision ML decoding is discussed and compared with the complexity of the Viterbi decoder, in terms of the number of addition-equivalent operations, to demonstrate the efficiency of the approach. The substantial reduction in decoding complexity enables us performing practical decoding simulation of some classes of Generalized Reed-Muller codes. This paper also shows numerical evaluation results of the error-correcting capabilities of the codes, providing insights into their performance under optimal decoding conditions.