Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms | Zendy

Ahmed Azouaoui | Zendy; Mostafa Belkasmi | Zendy; Abderrazak Farchane | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms

Author(s) -

Ahmed Azouaoui,

Mostafa Belkasmi,

Abderrazak Farchane

Publication year - 2012

Publication title -

journal of electrical and computer engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.318

H-Index - 25

eISSN - 2090-0155

pISSN - 2090-0147

DOI - 10.1155/2012/503834

Subject(s) - crossover , algorithm , decoding methods , berlekamp–welch algorithm , computer science , list decoding , block code , sequential decoding , domain (mathematical analysis) , concatenated error correction code , mathematics , mathematical analysis , artificial intelligence

A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research