An efficient new soft-decision decoding algorithm for binary cyclic codes

Chana, Idriss; Allouch, Hamid; Belkasmi, Mostafa

doi:10.1109/icmcs.2011.5945580

Cited by 5 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The polynomial encoding has complexity of order O(log(n).log(n-k)) [6][7] which is very reduced comparing to the matrix encoding which is of complexity of O(k.n). The AutDAG algorithm benefit from the simplicity of polynomial encoding, contrary to the DDGA, Maini and OSD decoders which require using the generator matrix for encoding even if the code is cyclic.…”

Section: Study Of the Complexitiesmentioning

confidence: 99%

“…When the channel allows measuring the reliabilities (float symbols) of the sequence r to decode, the soft decision decoders working on these reliabilities allow to win generally about 2 dB more than the hard decision decoders working on the binary form of r can do. Many decoding algorithms benefit from the proportionality between the symbols reliabilities and the probability that these later are correct [2][3][4][5][6][7]. For the binary channels, the new majority voting procedure introduced by Nouh et al [8] allows to compute these measures and to enhance the decoder performane.…”

Section: Introductionmentioning

confidence: 99%

“…The one of the BCH codes is discussed in the work of Berger and Charpin [15]. One of the most important works that use the part of the automorphism group to decode cyclic codes is the algorithm of Chana et al [6][7]. These algorithms use some cyclic permutations and the Chasing technique on the least reliable symbols remained in the information part of some sequences.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Decoding of Block Codes by using Genetic Algorithms and Permutations Set

Nouh¹,

Chana²,

Belkasmi³

2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

Recently Genetic algorithms are successfully used for decoding some classes of error correcting codes. For decoding a linear block code C, these genetic algorithms computes a permutation p of the code generator matrix depending of the received word. Our main contribution in this paper is to choose the permutation p from the automorphism group of C. This choice allows reducing the complexity of re-encoding in the decoding steps when C is cyclic and also to generalize the proposed genetic decoding algorithm for binary nonlinear block codes like the Kerdock codes. In this paper, an efficient stop criterion is proposed and it reduces considerably the decoding complexity of our algorithm. The simulation results of the proposed decoder, over the AWGN channel, show that it reaches the error correcting performances of its competitors. The study of the complexity shows that the proposed decoder is less complex than its competitors that are based also on genetic algorithms.

show abstract

Section: Study Of the Complexitiesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Decoding of Block Codes by using Genetic Algorithms and Permutations Set

Nouh¹,

Chana²,

Belkasmi³

2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

show abstract

“…In this subsection, we compare our SASD decoder with the some known and efficient decoders: Chase-2, OSD-1 (Fossorier and Lin, 1995), Maini, SDGA, SIHO, (Chana et al, 2011), DDGA, AutDAG, cGA-HP, cGA-M, CGAD and GAMD. For this purpose we run our simulations on several codes as a base of comparison, these simulations where made with default parameters outlined in Table 2.…”

Section: Comparison Of the Proposed Algorithm Versus Other Decodersmentioning

confidence: 99%

Simulated Annealing Decoder for Linear Block Codes

Niharmine¹,

Bouzkraoui²,

Azouaoui³

et al. 2018

Journal of Computer Science

View full text Add to dashboard Cite

In this study, we introduce a novel soft decoder, the first of its kind, for linear block codes, based on Simulated Annealing algorithm (SA). The main enhancement in our contribution which let our decoder over performs with large gain (about 3 dB at 7×10-4) the classical SA approach, is to take the most reliable information set of the received codeword as a start solution and also according to this reliability generate neighbor's solutions. Besides, our algorithm performance is enhanced by reducing search space when we involve the code error correcting capability parameter. The performance of the designed algorithm is investigated through a parameter tuning process and then compared with other various decoding algorithms in terms of decoding performance and algorithmic complexity. Simulation results, show that our algorithm over performs its competitor decoders while keeping minimum computation cost. In fact, our algorithm has large gain over Chase-2 and GAMD, furthermore, it over performs the most efficient and up to date DDGA decoder by 2 dB at 10-5 for RS codes.

show abstract

“…However, it is still considered an NP-Hard problem [3]. Soft decision decoding methods that are practical and computationally efficient have attracted a lot of attention [4], [5], but it's still an open problem for linear block error-correcting codes. One of the most well-known soft decision decoders is the ordered statistical decoding (OSD) introduced in [6] or its variant proposed in [7].…”

Section: Introductionmentioning

confidence: 99%

Single parity check node adapted to polar codes with dynamic frozen bit equivalent to binary linear block codes

Khebbou

Chana²,

Ben-Azza³

2023

IJEECS

View full text Add to dashboard Cite

<span lang="EN-US">In the context of decoding binary linear block codes by polar code decoding techniques, we propose in this paper a new optimization of the serial nature of decoding the polar codes equivalent to binary linear block codes. In addition to the special nodes proposed by the simplified successive-cancellation list technique, we propose a new special node allowing to estimate in parallel the bits of its sub-code. The simulation is done in an additive white gaussian noise channel (AWGN) channel for several linear block codes, namely bose–chaudhuri–hocquenghem codes (BCH) codes, quadratic-residue (QR) codes, and linear block codes recently designed in the literature. The performance of the proposed technique offers the same performance in terms of frame error rate (FER) as the ordered statistics decoding (OSD) algorithm, which achieves that of maximum likelihood decoder (MLD), but with high memory requirements and computational complexity.</span>

show abstract

An efficient new soft-decision decoding algorithm for binary cyclic codes

Cited by 5 publications

References 9 publications

Decoding of Block Codes by using Genetic Algorithms and Permutations Set

Decoding of Block Codes by using Genetic Algorithms and Permutations Set

Simulated Annealing Decoder for Linear Block Codes

Single parity check node adapted to polar codes with dynamic frozen bit equivalent to binary linear block codes

Contact Info

Product

Resources

About