Results 151 to 160 of about 139,535 (196)

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 ...
Shuqi Sun, Wuyang Zhou
openaire   +2 more sources

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
Xiaofu Wu, Xiao-Jian Liu, Chunming Zhao
openaire   +2 more sources

Efficient Decoder Implementation for QC-LDPC Codes

2006 International Conference on Communications, Circuits and Systems, 2006
Channel coding is an important building block in communication systems. Low-density parity-check codes is one kind of prominent error correcting codes being considered in next generation industry standards. This paper presents a memory efficient, very high speed decoder architecture suited for quasi-cyclic low-density parity-check codes using modified ...
Jin Sha   +4 more
openaire   +2 more sources

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   +2 more sources

Construction of high-girth QC-LDPC codes

2008 5th International Symposium on Turbo Codes and Related Topics, 2008
We describe a hill-climbing algorithm that constructs high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. Given a desired girth, the algorithm can find QC-LDPC codes of shorter block-length in much less time compared with the previously proposed ldquoguess-and-testrdquo algorithm.
Jonathan S. Yedidia   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy