An efficient soft decision decoding algorithm using cyclic permutations and compact genetic algorithm

Boualame, Hamza; Tahiri, N.; Chana, Idriss; Azouaoui, Ahmed; Belkasmi, Mostafa

doi:10.1109/acosis.2016.7843936

Cited by 3 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Te most interesting areas of application of compact optimisation in the discrete domain include the Travelling Salesman Problem (TSP) [224,261]; determining minimum set primers in Polymerase Chain Reaction (PCR) [262]; task scheduling in grid computing environments [263]; protein folding [264]; object recognition [265,266]; soft decision decoding [267,268]; minimising the number of coding operations required in multicast based on network coding [222]; estimating the parameters of the maximum log-likelihood function of a frst-order moving average model MA [269] and a mixed model ARMA (1, 1) [223]; optimising the aggregation of multiple similarity measures to obtain a single similarity metric for ontology matching [270]; optimising ontology alignment [271]; designing multiple input multiple output wireless communication systems [272].…”

Section: Binary/discrete Compact Optimisation Algorithmsmentioning

confidence: 99%

Metaheuristics in the Balance: A Survey on Memory-Saving Approaches for Platforms with Seriously Limited Resources

Khalfi,

Caraffini,

Iacca

2023

International Journal of Intelligent Systems

View full text Add to dashboard Cite

In the last three decades, the field of computational intelligence has seen a profusion of population-based metaheuristics applied to a variety of problems, where they achieved state-of-the-art results. This remarkable growth has been fuelled and, to some extent, exacerbated by various sources of inspiration and working philosophies, which have been thoroughly reviewed in several recent survey papers. However, the present survey addresses an important gap in the literature. Here, we reflect on a systematic categorisation of what we call “lightweight” metaheuristics, i.e., optimisation algorithms characterised by purposely limited memory and computational requirements. We focus mainly on two classes of lightweight algorithms: single-solution metaheuristics and “compact” optimisation algorithms. Our analysis is mostly focused on single-objective continuous optimisation. We provide an updated and unified view of the most important achievements in the field of lightweight metaheuristics, background concepts, and most important applications. We then discuss the implications of these algorithms and the main open questions and suggest future research directions.

show abstract

Section: Binary/discrete Compact Optimisation Algorithmsmentioning

confidence: 99%

Metaheuristics in the Balance: A Survey on Memory-Saving Approaches for Platforms with Seriously Limited Resources

Khalfi,

Caraffini,

Iacca

2023

International Journal of Intelligent Systems

View full text Add to dashboard Cite

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

Soft decision strategy design for signal demodulation in IEEE 802.11 protocol suite based wireless communication process

Nai

Zhang

Lei

et al. 2017

2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)

View full text Add to dashboard Cite

An efficient soft decision decoding algorithm using cyclic permutations and compact genetic algorithm

Cited by 3 publications

References 10 publications

Metaheuristics in the Balance: A Survey on Memory-Saving Approaches for Platforms with Seriously Limited Resources

Metaheuristics in the Balance: A Survey on Memory-Saving Approaches for Platforms with Seriously Limited Resources

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

Soft decision strategy design for signal demodulation in IEEE 802.11 protocol suite based wireless communication process

Contact Info

Product

Resources

About