The Experts below are selected from a list of 39 Experts worldwide ranked by ideXlab platform
Dimitris A Pados - One of the best experts on this subject based on the ideXlab platform.
-
a decoding algorithm for finite geometry ldpc codes
IEEE Transactions on Communications, 2005Co-Authors: Zhenyu Liu, Dimitris A PadosAbstract:In this paper, we develop a new low-complexity algorithm to decode low-density parity-check (LDPC) codes. The developments are oriented specifically toward low-cost, yet effective, decoding of (high-rate) finite-geometry (FG) LDPC codes. The decoding procedure updates iteratively the hard-decision received vector in search of a Valid Codeword in the vector space. Only one bit is changed in each iteration, and the bit-selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optional mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.
Guangzeng Feng - One of the best experts on this subject based on the ideXlab platform.
-
Minimum-weight Codewords for LDPC Codes
2024Co-Authors: Guangzeng FengAbstract:Despite the NP hardness of acquiring minimum distance dm for linear codes theoretically, in this paper we propose one experimental method of finding minimum-weight Codewords, the weight of which is equal to dm for LDPC codes. One existing syndrome decoding method, called serial belief propagation (BP) with ordered statistic decoding (OSD), is adapted to serve our purpose. We hold the conjecture that among many candidate error patterns in OSD reprocessing, modulo 2 addition of the lightest error pattern with one of the left error patterns may generate a light Codeword. When the decoding syndrome changes to all-zero state, the lightest error pattern reduces to all-zero, the lightest non-zero error pattern is a Valid Codeword to update lightest Codeword list. Given sufficient Codewords sending, the survived lightest Codewords are likely to be the target. Compared with existing techniques, our method demonstrates its efficiency in the simulation of several interested LDPC codes. Fast Reliability-based Algorithm of Findin
Zhenyu Liu - One of the best experts on this subject based on the ideXlab platform.
-
a decoding algorithm for finite geometry ldpc codes
IEEE Transactions on Communications, 2005Co-Authors: Zhenyu Liu, Dimitris A PadosAbstract:In this paper, we develop a new low-complexity algorithm to decode low-density parity-check (LDPC) codes. The developments are oriented specifically toward low-cost, yet effective, decoding of (high-rate) finite-geometry (FG) LDPC codes. The decoding procedure updates iteratively the hard-decision received vector in search of a Valid Codeword in the vector space. Only one bit is changed in each iteration, and the bit-selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optional mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.
Bhabani P Sinha - One of the best experts on this subject based on the ideXlab platform.
-
a new number system using alternate fibonacci numbers as the positional weights with some engineering applications
International Conference on Distributed Computing and Internet Technology, 2014Co-Authors: Koushik Sinha, Rabindranath Ghosh, Bhabani P SinhaAbstract:Fibonaccian number system FNS that uses {0,1} as the digit set with Fibonacci numbers as the positional weights, has many interesting properties which can be exploited for various applications. We propose here a new number system, termed as the Tri-digit Fibonaccian Number System TFNS, with alternate Fibonacci numbers as the positional weights for the various digits in the representation. We show that TFNS provides asymmetric distribution of the three digits 0, 1 and 2 in representing numbers with a pair of consecutive 2's never appearing in a Valid Codeword. These properties can conveniently be utilized for typical engineering applications, e.g., message encoding for low-energy communication systems and variable length encoding with self-delimiting code.
Feng Guangzeng - One of the best experts on this subject based on the ideXlab platform.
-
Fast Reliability-based Algorithm of Finding Minimum-weight Codewords for LDPC Codes
2007Co-Authors: Li Guangwen, Feng GuangzengAbstract:Despite the NP hardness of acquiring minimum distance $d_m$ for linear codes theoretically, in this paper we propose one experimental method of finding minimum-weight Codewords, the weight of which is equal to $d_m$ for LDPC codes. One existing syndrome decoding method, called serial belief propagation (BP) with ordered statistic decoding (OSD), is adapted to serve our purpose. We hold the conjecture that among many candidate error patterns in OSD reprocessing, modulo 2 addition of the lightest error pattern with one of the left error patterns may generate a light Codeword. When the decoding syndrome changes to all-zero state, the lightest error pattern reduces to all-zero, the lightest non-zero error pattern is a Valid Codeword to update lightest Codeword list. Given sufficient Codewords sending, the survived lightest Codewords are likely to be the target. Compared with existing techniques, our method demonstrates its efficiency in the simulation of several interested LDPC codes.Comment: 8 pages, 1 tabl
