Results 61 to 70 of about 595,487 (209)

Low-rate coding using incremental redundancy for GLDPC codes [PDF]

, 2008
In this paper we propose a low-rate coding method, suited for application-layer forward error correction. Depending on channel conditions, the coding scheme we propose can switch from a fixed-rate LDPC code to various low-rate GLDPC codes.
Savin, Valentin, Lacan, Jérôme, Jerome Lacan, Soro, Alexandre, Alexandre Soro, Cunche, Mathieu, Kraidy, Ghassan, Mathieu Cunche, Vincent Roca, Roca, Vincent, Ghassan Kraidy, Valentin Savin, Kraidy, G.   +12 more
core   +1 more source

Derived dynamic scheduling for belief propagation decoding of LDPC codes

Electronics Letters, Volume 60, Issue 4, February 2024.
Our article introduces two innovative dynamic scheduling strategies, derived informed variable‐to‐check residual belief propagation and derived variable‐node and variable‐to‐check‐edge residual belief propagation, for low‐density parity‐check (LDPC) codes.
Xiaotian Xu, Hua Zhou, Jiayi Zhao
wiley   +1 more source

Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution

IEEE Access
This paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang, Jingping Che, Huaan Li, Zhen Luo, Bo Zhang, Hui Liu   +5 more
doaj   +1 more source

Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

IEEE Access, 2017
For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code.
Xue-Qin Jiang, Han Hai, Hui-Ming Wang, Moon Ho Lee   +3 more
doaj   +1 more source

Energy‐Efficiency Maximization in Backscatter Communication‐Based Non‐Orthogonal Multiple Access System: Dinkelbach and Successive Convex Approximation Approaches

IET Signal Processing, Volume 2024, Issue 1, 2024.
This paper investigates a backscatter communication (BackCom) based non‐orthogonal multiple access (NOMA) system in a multiple‐input and single‐output (MISO) scenario, where two decoding methods are deployed, including the sum‐capacity approach and QR decomposition.
Dingjia Lin, Tianqi Wang, Kaidi Wang, Zhiguo Ding, Hasan Mir   +4 more
wiley   +1 more source

Erasure codes with a banded structure for hybrid iterative-ML decoding [PDF]

, 2009
This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding.
Soro, Alexandre, Alexandre Soro, Lacan, Jérôme, Cunche, Mathieu, Mathieu Cunche, Vincent Roca, Roca, Vincent, Jerome Lacan   +7 more
core   +1 more source

A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes

Electronics Letters, Volume 60, Issue 2, January 2024.
This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and proposes a simple and novel method for counting cycles of QC‐LDPC codes based on the improved condition. Compared with the existing methods, the presented method is effective and feasible and can enumerate cycles of QC‐LDPC codes in a
Hengzhou Xu, Xiao‐Dong Zhang, Huaan Li, Hai Zhu, Bo Zhang, Hui Liu   +5 more
wiley   +1 more source

Efficient Helicopter-Satellite Communication Scheme Based on Check-Hybrid LDPC Coding

Tsinghua Science and Technology, 2018
When implementing helicopter-satellite communications, periodical interruption of the received signal is a challenging problem because the communication antenna is intermittently blocked by the rotating blades of the helicopter.
Ping Wang, Liuguo Yin, Jianhua Lu
doaj   +1 more source

High-Rate QC LDPC Codes of Short and Moderate Length with Good Girth Profile [PDF]

, 2011
Irregular QC LDPC codes with parity-check matrices having different degree distributions are studied. A new algorithm for finding regular and irregular QC LDPC codes with a good girth profile as well as a good sliding-window girth is presented.
Kudryashov, Boris,, Bocharova, Irina, Rolf Johannesson, Kudryashov, Boris, Irina E. Bocharova, Florian Hug, Boris D. Kudryashov, Johannesson, Rolf,, Bocharova, Irina,, Johannesson, Rolf, Lund University., Hug, Florian, Hug, Florian,   +12 more
core   +1 more source

Counting short cycles of QC‐LDPC codes in base graph

Electronics Letters, Volume 60, Issue 2, January 2024.
Here, a method for using the base matrix to count the number of short cycles of quasi‐cyclic low‐density parity‐check codes is proposed. The time complexity of the proposed algorithm is not directly related to the length of the codes, but only to the number of edges in the base graph. Moreover, as the lifting degree of the codes increases, the proposed
Liqian Wang, Jingke Zou, Miao Zhu, Yatong Zhao   +3 more
wiley   +1 more source