Efficient dual domain decoding of linear block codes using genetic algorithms
Summary: 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.
- Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms
- Minimum distance computation of linear codes via genetic algorithms with permutation encoding
- Improved BP-based decoding algorithms integrated with GA for LDPC codes
- Improved multiuser detectors employing genetic algorithms in a space-time block coded system
- An effective genetic algorithm for network coding
- Publication:4943037
- scientific article; zbMATH DE number 20218
This page was built for publication: Efficient dual domain decoding of linear block codes using genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693814)