Optimizing the Bit-flipping Method for Decoding Low-density Parity-check Codes in Wireless Networks by Using the Artificial Spider Algorithm
نویسندگان
چکیده
منابع مشابه
Modified Multi-bit Flipping Decoding Algorithm for Low-density Parity-check Codes
Aiming at seeking a low complexity decoder of the low-density parity-check (LDPC) codes, we present one modified multi-bit flipping (MMBF) algorithm. For those LDPC codes whose parity check matrices have light column weight, both the bootstrap step and a novel delay-handling step are included in MMBF, based on one framework which is the combination of conventional PWBF and IWBF. On the other ha...
متن کاملSelf Reliability based Weighted Bit-Flipping Decoding for Low-density Parity-check Codes
Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF), the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme...
متن کاملReliability ratio based weighted bit-flipping decoding for low-density parity-check codes - Electronics Letters
Introduction: The family of low-density parity-check (LDPC) codes proposed by Gallager [1] has attracted substantial research interest in the information theory community. LDPC codes can be decoded using various decoding schemes [1–4] such as hard-decisions, softdecisions and hybrid decoding schemes. The high-complexity sum-product algorithm (SPA) was shown to achieve a near-capacity performanc...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics and Telecommunications
سال: 2023
ISSN: ['2300-1933', '2081-8491']
DOI: https://doi.org/10.24425/ijet.2022.139857