Results 111 to 120 of about 253 (177)

Exploring the key technologies and applications of 6G wireless communication network. [PDF]

iScience
Li P, Fan J, Wu J.
europepmc   +1 more source

Adaptive Rate-Compatible Non-Binary LDPC Coding Scheme for the B5G Mobile System. [PDF]

Sensors (Basel), 2019
Zhao DF, Tian H, Xue R.
europepmc   +1 more source

Design and Analysis of Non-Binary LDPC-CPM System for Hybrid Check Matrix Construction Algorithm of WSN. [PDF]

Sensors (Basel), 2018
Meng J, Zhao D, Zhang L.
europepmc   +1 more source

From quantum communication fundamentals to decoherence mitigation strategies: Addressing global quantum network challenges and projected applications. [PDF]

Heliyon
Khan MA, Ghafoor S, Zaidi SMH, Khan H, Ahmad A.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Shortening for irregular QC-LDPC codes

IEEE Communications Letters, 2009
Shortening is a technique to obtain codes of shorter length and lower rate from a given LDPC code by putting infinite reliability on some variable nodes, whose positions are assumed to be available to both encoder and decoder. In this paper, we propose a shortening algorithm suitable for irregular QC-LDPC codes. The efficiency of the proposed algorithm
Xiaojian Liu, Xiaofu Wu, Chunming Zhao 0001   +2 more
openaire   +1 more source

A new construction of UEP QC-LDPC codes

2010 IEEE International Symposium on Information Theory, 2010
In this paper, a new construction of quasi-cyclic low-density parity-check (QC-LDPC) codes for unequal error protection (UEP) is proposed. We first give a new class of UEP block codes. QC-LDPC codes with binomial-term parity-check matrices which can avoid girths less than 8 and achieve an enlarged upper bound on the minimum distance are also introduced.
Chi-Jen Wu, Chung-Hsuan Wang, Chi-Chao Chao   +2 more
openaire   +1 more source

Analysis of balanced cycles of QC-LDPC codes

2011 Eighth International Conference on Wireless and Optical Communications Networks, 2011
In this paper, we analyze balanced cycles of quasi-cyclic low-density parity-check (QC-LDPC) codes. We show the structure of balanced cycles and their necessary and sufficient existence conditions. Furthermore, we determine the minimal matrices of balanced cycle. Meanwhile we propose the property of B-girth in its mother matrix.
Gao Xiao, Zhang Nan
openaire   +1 more source

Generalization of floor lifting for QC-LDPC codes

2017 IEEE East-West Design & Test Symposium (EWDTS), 2017
The given paper presents a method for constructing a QC-LDPC code of shorter length by length adaption from a given QC-LDPC code of maximal length. The proposed method can be considered as a generalization of floor lifting. Making some offline calculation it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated ...
Vasiliy Usatyuk, Sergey Egorov
openaire   +1 more source

Design of masking matrix for QC-LDPC codes

2013 IEEE Information Theory Workshop (ITW), 2013
The masking matrix plays an important role in constructing new classes of regular and irregular quasi-cyclic low density parity check (QC-LDPC) codes. By coupling two identical graphs in a special way, we present a new structure of the masking matrix, whose Tanner graph can be seen as a protograph.
Yang Liu, Ying Li
openaire   +1 more source

Compressing construction of QC-LDPC codes

2008 11th IEEE Singapore International Conference on Communication Systems, 2008
Two compressing construction methods of quasi-cyclic LDPC (QC-LDPC) codes are proposed, which can be called recursive-compressing and single-compressing respectively. Selecting a good QC-LDPC code as the Mother, the son codes constructed through the compressing methods are still good codes, i.e., have high girth and few short cycles, moreover, they ...
null Shuqi Sun, null Wuyang Zhou
openaire   +1 more source