Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC Codes
The main challenge for hardware implementation of non-binary LDPC decoding is the high computational complexity and large memory requirement. To address this challenge, five new low complexity LDPC decoding algorithms are proposed in this paper. The proposed algorithms are developed specifically tow...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9154416/ |
| _version_ | 1818431104543096832 |
|---|---|
| author | Waheed Ullah Ling Cheng Fambirai Takawira |
| author_facet | Waheed Ullah Ling Cheng Fambirai Takawira |
| author_sort | Waheed Ullah |
| collection | DOAJ |
| description | The main challenge for hardware implementation of non-binary LDPC decoding is the high computational complexity and large memory requirement. To address this challenge, five new low complexity LDPC decoding algorithms are proposed in this paper. The proposed algorithms are developed specifically towards the low complexity, yet effective, decoding of the NB LDPC codes. The proposed decoding algorithms update, iteratively, the hard decision received vector to search for the valid codeword in the vector space of Galois field ${(GF)}$ . The selection criterion for least reliable symbol positions is based on the information from the failed checks and the reliability information from the Galois field structure as well as from the received channel soft information. To choose the correct value for the candidate symbol, two methods are used. The first method is based on the prediction of the error symbol from the set of Galois field symbols which maximize an objective function. In the second method, individual bits are flipped based on the reliability information obtained from the channel. Algorithms 1 and 2 flip a single symbol per iteration whilst the other three algorithms 3, 4 and 5 flip multiple symbols in each iteration. The proposed voting based Algorithms 1, 2 and 5 first short list the unreliable positions using a majority voting scheme and then choose the candidate symbol value from the set of the symbols in ${GF(q)}$ while not violating the field order ${q}$ . These methods simplify the decoding complexity in terms of computation and memory. Results and analysis of these algorithms show an appealing tradeoff between computational complexity and bit error rate performance for NB LDPC codes. |
| first_indexed | 2024-12-14T15:44:00Z |
| format | Article |
| id | doaj.art-045fbde1003f4a86b66606ca19888d20 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T15:44:00Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-045fbde1003f4a86b66606ca19888d202022-12-21T22:55:32ZengIEEEIEEE Access2169-35362020-01-01814269114270310.1109/ACCESS.2020.30138149154416Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC CodesWaheed Ullah0https://orcid.org/0000-0001-5912-0101Ling Cheng1https://orcid.org/0000-0001-7873-8206Fambirai Takawira2https://orcid.org/0000-0002-1975-3497School of Electrical and Information Engineering, University of the Witwatersrand, Johannesburg, South AfricaSchool of Electrical and Information Engineering, University of the Witwatersrand, Johannesburg, South AfricaSchool of Electrical and Information Engineering, University of the Witwatersrand, Johannesburg, South AfricaThe main challenge for hardware implementation of non-binary LDPC decoding is the high computational complexity and large memory requirement. To address this challenge, five new low complexity LDPC decoding algorithms are proposed in this paper. The proposed algorithms are developed specifically towards the low complexity, yet effective, decoding of the NB LDPC codes. The proposed decoding algorithms update, iteratively, the hard decision received vector to search for the valid codeword in the vector space of Galois field ${(GF)}$ . The selection criterion for least reliable symbol positions is based on the information from the failed checks and the reliability information from the Galois field structure as well as from the received channel soft information. To choose the correct value for the candidate symbol, two methods are used. The first method is based on the prediction of the error symbol from the set of Galois field symbols which maximize an objective function. In the second method, individual bits are flipped based on the reliability information obtained from the channel. Algorithms 1 and 2 flip a single symbol per iteration whilst the other three algorithms 3, 4 and 5 flip multiple symbols in each iteration. The proposed voting based Algorithms 1, 2 and 5 first short list the unreliable positions using a majority voting scheme and then choose the candidate symbol value from the set of the symbols in ${GF(q)}$ while not violating the field order ${q}$ . These methods simplify the decoding complexity in terms of computation and memory. Results and analysis of these algorithms show an appealing tradeoff between computational complexity and bit error rate performance for NB LDPC codes.https://ieeexplore.ieee.org/document/9154416/Multiple votenon-binary LDPCiterative reliability decodingsymbol flippingsum product algorithmlow complexity decoding |
| spellingShingle | Waheed Ullah Ling Cheng Fambirai Takawira Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC Codes IEEE Access Multiple vote non-binary LDPC iterative reliability decoding symbol flipping sum product algorithm low complexity decoding |
| title | Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC Codes |
| title_full | Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC Codes |
| title_fullStr | Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC Codes |
| title_full_unstemmed | Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC Codes |
| title_short | Low Complexity Bit Reliability and Predication Based Symbol Value Selection Decoding Algorithms for Non-Binary LDPC Codes |
| title_sort | low complexity bit reliability and predication based symbol value selection decoding algorithms for non binary ldpc codes |
| topic | Multiple vote non-binary LDPC iterative reliability decoding symbol flipping sum product algorithm low complexity decoding |
| url | https://ieeexplore.ieee.org/document/9154416/ |
| work_keys_str_mv | AT waheedullah lowcomplexitybitreliabilityandpredicationbasedsymbolvalueselectiondecodingalgorithmsfornonbinaryldpccodes AT lingcheng lowcomplexitybitreliabilityandpredicationbasedsymbolvalueselectiondecodingalgorithmsfornonbinaryldpccodes AT fambiraitakawira lowcomplexitybitreliabilityandpredicationbasedsymbolvalueselectiondecodingalgorithmsfornonbinaryldpccodes |