Multisource SWIPT-based coded cooperation:rate compatible codes and codeword splitting protocol
EURASIP Journal on Wireless Communications and Networking, 2020 To achieve a high reliable and energy-saving green communication, we investigate a multisource simultaneous wireless information and power transfer (SWIPT)-based coded cooperation where the relay can realize information decoding and energy harvesting ...
Shunwai Zhang, Lingjun Kong, Jun Li
doaj +1 more source
Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix [PDF]
, 2005 An iterative algorithm is presented for soft-input-soft-output (SISO) decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the sum product algorithm (SPA) in conjunction with a binary parity check matrix of the RS code.
Jiang, Jing, Narayanan, Krishna R.
core +5 more sources
Parity Check Matrix Recognition from Noisy Codewords
, 2012 22 ...
Karimian, Yasser +2 more
openaire +2 more sources
A Construction of Optimal
IEEE Access, 2019 Locally recoverable codes (LRCs) play a significant role in distributed and cloud storage systems. The key ingredient for constructing such optimal LRCs is to characterize the parity-check matrix for LRCs.
Bocong Chen, Jing Huang
doaj +1 more source
Refined Upper Bounds on Stopping Redundancy of Binary Linear Codes [PDF]
, 2015 The $l$-th stopping redundancy $\rho_l(\mathcal C)$ of the binary $[n, k, d]$ code $\mathcal C$, $1 \le l \le d$, is defined as the minimum number of rows in the parity-check matrix of $\mathcal C$, such that the smallest stopping set is of size at least
Skachek, Vitaly, Yakimenka, Yauhen
core +1 more source
Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix
Journal of Engineering, 2016 the encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure.
Mohammed Kasim Mohammed Al-Haddad
doaj +2 more sources
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
, 2008 In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented.
Chiani, M., Paolini, E.
core +1 more source
Carrier phase recovery of LDPC-coded systems based on the likelihood difference algorithm
EURASIP Journal on Advances in Signal Processing, 2023 The problem of blind phase offset recovery of low density parity-check (LDPC)-coded systems is considered in this paper. We propose a new algorithm of phase offset estimation that involves the computation and maximization of a likelihood difference (LD ...
Rodrigue Imad, Sebastien Houcke
doaj +1 more source
Design and Analysis of Time-Invariant SC-LDPC Convolutional Codes With Small Constraint Length
, 2017 In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check (QC-LDPC) block codes and exploit suitable ...
Baldi, Marco +4 more
core +1 more source
Iterative decoding of Gold sequences [PDF]
, 2015 International audienceGold sequences are widely used in communications and positioning systems for synchronization purposes or spread spectrum transmissions. This paper addresses the decoding of the initial state of a Gold sequence.
Brossier, Jean-Marc +3 more
core +2 more sources