Results 51 to 60 of about 21,530 (259)
Construction of Quasi-Cyclic Low Density Parity Check Codes for Magnetic Induction Communication
IEEE Access, 2019 The magnetic induction (MI) communication has been proved to be an effective method in the wireless underground sensor networks (WUSN). MI communication system based on quasi-cyclic low density parity check (QC-LDPC) codes is expected to improve the ...
Hua Xu, Yanjing Sun, Wenjuan Shi
doaj +1 more source
Jointly designed quasi-cyclic LDPC-coded cooperation with diversity combining at receiver
International Journal of Distributed Sensor Networks, 2020 This correspondence proposes a jointly-designed quasi-cyclic (QC) low-density parity-check (LDPC)-coded multi-relay cooperation with a destination node realized by multiple receive antennas.
Muhammad Asif +5 more
doaj +1 more source
Tanner
IEEE Access, 2019 Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper ...
Hengzhou Xu +4 more
doaj +1 more source
Construction of multiple-rate QC-LDPC codes using hierarchical row-splitting [PDF]
, 2016 In this letter, we propose an improved method called hierarchical row-splitting with edge variation for designing multiple-rate quasi-cyclic low-density parity-check (QC-LDPC) codes, which constructs lower-rate codes from a high-rate mother code by row ...
Wang, Qi, Wang, Zhaocheng, Zhao, Peiyao
core +1 more source
On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes
IEEE Access, 2019 Girth is an important structural property of low-density parity-check (LDPC) codes. Motivated by the works on the girth of Tanner (3, 5), (3, 7), (3, 11), and (5, 7) quasi-cyclic (QC) LDPC codes, we, in this paper, study the girth of Tanner (3, 13) QC ...
Hengzhou Xu +4 more
doaj +1 more source
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel [PDF]
, 2010 In this paper, we show that Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding over the binary erasure channel. We demonstrate that the quasi-cyclic structure of the parity-check matrix can be advantageously used in ...
Cunche, Mathieu +2 more
core +3 more sources
Girth-Eight Reed-Solomon Based QC-LDPC Codes [PDF]
2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018 This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth at least eight. These codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes with minimum distance 5. Masking their parity-check matrices significantly reduces the numbers of short cycles in their Tanner graphs ...
Xin Xiao +4 more
openaire +1 more source
Some New Constructions of Girth-8 QC-LDPC Codes for Future GNSS
IEEE Communications Letters, 2021 In this letter, we propose a new construction of girth-8 Quasi-Cyclic Low-Density Parity-Check codes (QC-LDPC) with various lengths for the global navigation satellite systems (GNSS). This scheme combines two steps.
Inseon Kim, Hong‐Yeop Song
semanticscholar +1 more source
Wireless Communications and Mobile Computing, Volume 2020, Issue 1, 2020., 2020 Free space optical (FSO) communication systems provide wireless line of sight connectivity in the unlicensed spectrum, and wireless optical communication achieves higher data rates compared to their radio frequency (RF) counterparts. FSO systems are particularly attractive for last mile access problem by bridging fiber optic backbone connectivity to RF
Ibrahima Gueye +7 more
wiley +1 more source
Deriving Good LDPC Convolutional Codes from LDPC Block Codes [PDF]
, 2010 Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant and time ...
Ali E. Pusane +4 more
core +1 more source