An Efficient Algorithm for Soft-Decision Decoding of the (24, 12) Extended Golay Code

1981 ◽  
Vol 29 (6) ◽  
pp. 909-911 ◽  
Author(s):  
C. Hackett
Keyword(s):  
Efficient Algorithm ◽  
Soft Decision ◽  
Golay Code ◽  
Soft Decision Decoding

scholarly journals An Efficient Decoding Algorithm for Block Codes Based on the Communication Channel Reliability Information

2020 ◽  
Vol 4 (5) ◽  
pp. 336-344
Author(s):  
Yong-Geol Shim
Keyword(s):  
Efficient Algorithm ◽  
Communication Systems ◽  
Error Probability ◽  
Sufficient Conditions ◽  
Block Codes ◽  
Code Word ◽  
Soft Decision ◽  
Channel Codes ◽  
Soft Decision Decoding ◽  
Hard Decision

For channel codes in communication systems, an efficient algorithm that controls error is proposed. It is an algorithm for soft decision decoding of block codes. The sufficient conditions to obtain the optimum decoding are deduced so that the efficient method which explores candidate code words can be presented. The information vector of signal space codes has isomorphic coherence. The path metric in the coded demodulator is the selected components of scaled regions. The carrier decision is derived by the normalized metric of synchronized space. An efficient algorithm is proposed based on the method. The algorithm finds out a group of candidate code words, in which the most likely one is chosen as a decoding result. The algorithm reduces the complexity, which is the number of candidate code words. It also increases the probability that the correct code word is included in the candidate code words. It is shown that both the error probability and the complexity are reduced. The positions of the first hard-decision decoded errors and the positions of the unreliable bits are carefully examined. From this examination, the candidate codewords are efficiently searched for. The aim of this paper is to reduce the required number of hard-decision decoding and to lower the block error probability.

Sign in / Sign up

Export Citation Format

Share Document