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

Journal of Chongqing University of Posts and Telecommunications

Algebraic soft-decision decoding of Golay codes

Lin Wang

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

In this paper,the ChaseⅡ algorithm,which is well known as a reliability-based decoding algorithm,is used for the soft decoding of the(23,12,7)Golay code.This soft-decision decoding algorithm improves greatly the error-correcting capacity compared with algebraic hard-decision decoding algorithms,but also results in more computational complexity.To overcome this,a optimality condition is introduced to quickly terminate the ChaseⅡ decoding process.Computer simulation results got by VC6.0 show that soft decoding obtains 1.7 dB coding gain compared with hard decoding case at BER of 10-5,and the modified chase-II algorithm based on the optimality condition reduces the total simulation time by 87.64%,and thus improves greatly the decoding efficiency.

Related papers

On soft-decoding of the (24, 12, 8) extended Golay code up to six errors

Tsung‐Ching Lin, Pei-Yu Shih, Wen-Ku Su +1 more

In this paper, a new soft-decision decoder of the (24, 12, 8) binary extended Golay code up to six errors is proposed. First, by using the error pattern obtained from hard decoder, the method of determining possible error patterns is developed. The emblematic probability value of each error pattern is then defined as the product of the individual bit-error probabilities corresponding to the locations of the possible error patterns. The most likely one among these error patterns is obtained by choosing the maximum of the emblematic probability values of possible error patterns. Finally, simulation results in additive white Gaussian noise (AWGN) show that this decoder reduce the decoding complexity although it performs a slight loss of coding gain than the modified Chase's II algorithm proposed by Hackett.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2009•0 citations

A low-complexity soft-decision decoding architecture for the binary extended Golay code

Patrick Adde, Raphaël Le Bidan

The (24, 12, 8) extended binary Golay code is a well-known rate-1/2 short block-length linear error-correcting code with remarkable properties. This paper investigates the design of an efficient low-complexity soft-decision decoding architecture for this code. A dedicated algorithm is introduced that takes advantage of the code's properties to simplify the decoding process. Simulation results show that the proposed algorithm achieves close to maximum-likelihood performance with low computational cost. The decoder architecture is described, and VLSI synthesis results are presented.

IEEE International Conference on Electronics, Circuits and Systems (ICECS)•Dec 1, 2012•12 citations

On soft-decoding of the (24, 12, 8) Golay code

Wen-Ku Su, Pei-Yu Shih, Tsung‐Ching Lin +2 more

In this paper, an efficient soft-decision decoder of the (24, 12, 8) binary Golay code for the four errors, composed of two stages: a conventional hard decoder up to three errors and the soft decoding for four errors, is proposed. All probable patterns of occurred weight-4 error, which are always decoded to the same weight-3 error pattern, are determined from the lookup table of weight-7 codewords. And the most possible one will be obtained by estimating the emblematic probability values of all probable patterns. The simulation result of this decoder in additive white Gaussian noise (AWGN) shows that at least 92% and 99% of weight-4 error patterns occurred are corrected if a bit-energy to noise-spectral-density ratios (Eb/N0) are greater than 2 dB and 5 dB, respectively.

IEEE Region 10 Conference (TENCON)•Oct 1, 2007•4 citations

Soft-decoding of the (23, 12, 7) Binary Golay Code

Wen-Ku Su, Pei-Yu Shih, Tsung‐Ching Lin +1 more

Abstract—Since the (23, 12, 7) binary Golay code is a perfect code, a weight-4 error occurred is always decoded as a weight-3 error pattern by a hard decoding method. In this paper, an efficient soft-decision decoder of the (23, 12, 7) binary Golay code up to the four errors is proposed. All probable patterns of occurred weight-4 error, which are always decoded to the same weight-3 error pattern, are determined from the look-up table of weight-7 codewords. And the most possible error pattern of weight-4 or weight-3 will be obtained by estimating the emblematic probability values of all probable patterns. The simulation result of this decoder in additive white Gaussian noise (AWGN) shows that at least 93 % and 99 % of weight-4 error patterns occurred are corrected if a bit-energy to noise-spectral-density ratios (E b/N 0) are greater than 3 dB and 6 dB, respectively, and at least 96 % of weight-3 error patterns occurred are corrected for any dB. I.

International MultiConference of Engineers and Computer Scientists•Mar 1, 2008•1 citation

Soft decoding of the (23, 12, 7) Golay-code up to five errors

Y. Li, Lin Wang, T. K. Truong

A new decoder is proposed to decode the (23, 12, 7) binary Golay-code up to five errors. It is based on the algorithm that can correct up to four errors for the (24, 12, 8) extended Golay-code proposed by Lin et al., thereby achieving the soft decoding in the real sense for the Golay-code. For a weight-2 or weight-3 error pattern decoded by the hard decoder for correcting up to three errors, one can find the corresponding 21 weight-4 or weight-5 error patterns and choose the one with the maximum emblematic probability value, which is defined as the product of individual bit-error probabilities corresponding to the non-zero locations of the error pattern as the ultimate choice. Finally, simulation results of this decoder over additive white Gaussian noise (AWGN) channels show that the proposed method provides 0.9 dB coding gain than that of Lin et al.'s algorithm at bit-error rate of 10−5.

IET Communications•Oct 14, 2011•1 citation

Fast decoding of the (23, 12, 7) Golay code with four‐error‐correcting capability

Shao‐I Chu, Hung‐Peng Lee, Hsin‐Chiu Chang

ABSTRACT In this paper, a fast and efficient decoding algorithm for correcting the (23, 12, 7) Golay code up to four errors is presented. The aim of this paper is to develop a fast syndrome‐group search method for finding the candidate codewords by utilizing the property that the syndromes of the weight‐4 error patterns are identical to that of the weight‐3 error pattern. When the set of the candidate codewords is constructed, the most likely one is determined by assessing the corresponding correlation metrics. The well‐known Chase‐II decoder, which needs to perform the hard‐decision decoder multiple times, acts as a comparison basis. Simulation results over the additive white Gaussian noise channel show that the decoding complexity of the proposed method is averagely reduced by at least 86% in terms of the decoding time. Furthermore, the successful decoding percentage of the new decoder in the case of four errors is always superior to Chase‐II decoder. At the signal‐to‐noise ratio of 0 dB, the proposed algorithm still can correct up to 97.40% weight‐4 error patterns. The overall bit error rate performance of the proposed decoder is close to that of Chase‐II decoder. It implies that the new decoder is beneficial to the practical implementation. Copyright © 2011 John Wiley & Sons, Ltd.

European Transactions on Telecommunications•Jul 12, 2011•5 citations
In this paper,the ChaseⅡ algorithm,which is well known as a reliability-based decoding algorithm,is used for the soft decoding of the(23,12,7)Golay code.This soft-decision decoding algorithm improves greatly the error-correcting capacity compared with algebraic hard-decision decoding algorithms,but also results in more computational complexity.To overcome this,a optimality condition is introduced to quickly terminate the ChaseⅡ decoding process.Computer simulation results got by VC6.0 show that soft decoding obtains 1.7 dB coding gain compared with hard decoding case at BER of 10-5,and the modified chase-II algorithm based on the optimality condition reduces the total simulation time by 87.64%,and thus improves greatly the decoding efficiency.
In this paper, a new soft-decision decoder of the (24, 12, 8) binary extended Golay code up to six errors is proposed. First, by using the error pattern obtained from hard decoder, the method of determining possible error patterns is developed. The emblematic probability value of each error pattern is then defined as the product of the individual bit-error probabilities corresponding to the locations of the possible error patterns. The most likely one among these error patterns is obtained by choosing the maximum of the emblematic probability values of possible error patterns. Finally, simulation results in additive white Gaussian noise (AWGN) show that this decoder reduce the decoding complexity although it performs a slight loss of coding gain than the modified Chase's II algorithm proposed by Hackett.
The (24, 12, 8) extended binary Golay code is a well-known rate-1/2 short block-length linear error-correcting code with remarkable properties. This paper investigates the design of an efficient low-complexity soft-decision decoding architecture for this code. A dedicated algorithm is introduced that takes advantage of the code's properties to simplify the decoding process. Simulation results show that the proposed algorithm achieves close to maximum-likelihood performance with low computational cost. The decoder architecture is described, and VLSI synthesis results are presented.
In this paper, an efficient soft-decision decoder of the (24, 12, 8) binary Golay code for the four errors, composed of two stages: a conventional hard decoder up to three errors and the soft decoding for four errors, is proposed. All probable patterns of occurred weight-4 error, which are always decoded to the same weight-3 error pattern, are determined from the lookup table of weight-7 codewords. And the most possible one will be obtained by estimating the emblematic probability values of all probable patterns. The simulation result of this decoder in additive white Gaussian noise (AWGN) shows that at least 92% and 99% of weight-4 error patterns occurred are corrected if a bit-energy to noise-spectral-density ratios (Eb/N0) are greater than 2 dB and 5 dB, respectively.
Abstract—Since the (23, 12, 7) binary Golay code is a perfect code, a weight-4 error occurred is always decoded as a weight-3 error pattern by a hard decoding method. In this paper, an efficient soft-decision decoder of the (23, 12, 7) binary Golay code up to the four errors is proposed. All probable patterns of occurred weight-4 error, which are always decoded to the same weight-3 error pattern, are determined from the look-up table of weight-7 codewords. And the most possible error pattern of weight-4 or weight-3 will be obtained by estimating the emblematic probability values of all probable patterns. The simulation result of this decoder in additive white Gaussian noise (AWGN) shows that at least 93 % and 99 % of weight-4 error patterns occurred are corrected if a bit-energy to noise-spectral-density ratios (E b/N 0) are greater than 3 dB and 6 dB, respectively, and at least 96 % of weight-3 error patterns occurred are corrected for any dB. I.
A new decoder is proposed to decode the (23, 12, 7) binary Golay-code up to five errors. It is based on the algorithm that can correct up to four errors for the (24, 12, 8) extended Golay-code proposed by Lin et al., thereby achieving the soft decoding in the real sense for the Golay-code. For a weight-2 or weight-3 error pattern decoded by the hard decoder for correcting up to three errors, one can find the corresponding 21 weight-4 or weight-5 error patterns and choose the one with the maximum emblematic probability value, which is defined as the product of individual bit-error probabilities corresponding to the non-zero locations of the error pattern as the ultimate choice. Finally, simulation results of this decoder over additive white Gaussian noise (AWGN) channels show that the proposed method provides 0.9 dB coding gain than that of Lin et al.'s algorithm at bit-error rate of 10−5.
ABSTRACT In this paper, a fast and efficient decoding algorithm for correcting the (23, 12, 7) Golay code up to four errors is presented. The aim of this paper is to develop a fast syndrome‐group search method for finding the candidate codewords by utilizing the property that the syndromes of the weight‐4 error patterns are identical to that of the weight‐3 error pattern. When the set of the candidate codewords is constructed, the most likely one is determined by assessing the corresponding correlation metrics. The well‐known Chase‐II decoder, which needs to perform the hard‐decision decoder multiple times, acts as a comparison basis. Simulation results over the additive white Gaussian noise channel show that the decoding complexity of the proposed method is averagely reduced by at least 86% in terms of the decoding time. Furthermore, the successful decoding percentage of the new decoder in the case of four errors is always superior to Chase‐II decoder. At the signal‐to‐noise ratio of 0 dB, the proposed algorithm still can correct up to 97.40% weight‐4 error patterns. The overall bit error rate performance of the proposed decoder is close to that of Chase‐II decoder. It implies that the new decoder is beneficial to the practical implementation. Copyright © 2011 John Wiley & Sons, Ltd.