Mutational LDPC Decoding
- NázevTitle
- Mutational LDPC DecodingMutational LDPC Decoding
- Druh výsledkuResult type
- Příspěvek ve sborníkuProceedings paper
- AutořiAuthors
- J. Broulím, H. Grigorian, A. Ayriyan
- DOIDOI
- 10.1109/LATINCOM53176.2021.9647799
- Časopis / citaceJournal / citation
- In: 2021 IEEE Latin-American Conference on Communications (LATINCOM 2021). Piscataway (New Jersey): IEEE, 2021. IEEE Latin-American Conference on Communications, LATINCOM. ISBN 978-1-6654-4035-6.
- JazykLanguage
- eng
- ScopusScopus
- 2-s2.0-85124107356
- RIVRIV
- RIV/68407700:21670/21:00356156!RIV22-MSM-21670___
- ProjektProject
- Institucionální podpora na rozvoj výzkumné org.Institucionální podpora na rozvoj výzkumné org.
AbstraktAbstract
In this paper, we propose an algorithm for improving performance of LDPC decoders, which we called the Mutational LDPC (MLDPC). This algorithm is based on different parity-check matrices produced by slight mutations. An iterative decoding process is performed using mutated matrices in several decoders running in parallel and an overall codeword estimation is then given by information from all decoders. This approach leads to a significant improvement in terms of Bit Error Rate.
In this paper, we propose an algorithm for improving performance of LDPC decoders, which we called the Mutational LDPC (MLDPC). This algorithm is based on different parity-check matrices produced by slight mutations. An iterative decoding process is performed using mutated matrices in several decoders running in parallel and an overall codeword estimation is then given by information from all decoders. This approach leads to a significant improvement in terms of Bit Error Rate.