Results 211 to 220 of about 143,981 (279)

Parity Check Matrix Approach to Linear Block Codes

2014
The parity check matrix can be assumed for an alternative description of a linear code. The relationship with the generator matrix is not univocal, except when such matrices are systematic. Upper triangular generator matrices and lower triangular parity check matrices are presented, showing the advantage of a clear recognition of information and ...
G. Cancellieri
openaire   +2 more sources

Time-varying periodic convolutional codes with low-density parity-check matrix

IEEE Transactions on Information Theory, 1999
Summary: We present a class of convolutional codes defined by a low-density parity-check matrix and an iterative algorithm of the decoding of these codes. The performance of this decoding is close to the performance of turbo decoding. Our simulation shows that for the rate \(R= 1/2\) binary codes, the performance is substantially better than for ...
Jiménez Felström, Alberto, Zigangirov, Kamil Sh.   +1 more
openaire   +3 more sources

Early termination belief propagation decoder with parity check matrix for polar codes

2018 27th Wireless and Optical Communication Conference (WOCC), 2018
In this paper, a belief propagation (BP) decoding algorithm with early termination is proposed for polar code. The early termination is accomplished using the syndrome generated by the parity-check matrix, which can be transferred from the generator matrix.
Hsin-Fu Yu, Huang-Chang Lee, Shih-Kai Lee   +2 more
openaire   +2 more sources

PN Code Acquisition Using Belief Propagation with Adaptive Parity Check Matrix

Wireless Personal Communications, 2013
Pseudonoise (PN) code acquisition technique based on iterative message passing algorithm (iMPA) has been proposed due to its short acquisition time and low complexity. However, the cyclic and regular nature of constructed tanner graph makes it difficult to achieve promising performance.
Jiaqi Zhang, Yukui Pei, Ning Ge
openaire   +2 more sources

Stopping Set Elimination by Parity-Check Matrix Extension via Integer Linear Programming

IEEE Transactions on Communications, 2015
Error-rate floor phenomenon is known to be a serious impediment to the use of low-density parity-check (LDPC) codes for some practical applications that demand high data reliability. In the case of binary erasure channels (BECs), certain error-prone patterns, known as stopping sets, are proven to cause this performance degradation.
Hossein Falsafain, Sayyed Rasoul Mousavi
openaire   +2 more sources

A design of parity check matrix for Irregular LDPC codes

2009 9th International Symposium on Communications and Information Technology, 2009
This paper outlines a work on a design of parity check matrix for Irregular LDPC codes. The design is based on the adjustment of the modified array LDPC codes and interleave-modified array LDPC codes. The code rate of 0.930 is obtained. LDPC Codes based on this design suits the short and medium block length.
Chutima Prasartkaew, Somsak Choomchuay
openaire   +2 more sources

On the parity-check matrix of generalized concatenated code

Science China Information Sciences, 2019
Sha Shi, Yang Liu, Junzhi Yan, Jingliang Gao, Yunjiang Wang   +4 more
openaire   +2 more sources

Designing parity check matrix to achieve linear encoding time in LDPC codes

Digital Signal Processing, 2013
Abstract Low-density parity-check (LDPC) codes have become the part of various communication standards due to their excellent error correcting performance. Existing methods require matrix inverse computation for obtaining a systematic generator matrix from parity check matrix.
Honey Durga Tiwari, Harsh Durga Tiwari, Kang-Yoon Lee   +2 more
openaire   +2 more sources

Improved Stopping Set Elimination by Parity-Check Matrix Extension of LDPC Codes

IEEE Communications Letters, 2011
Stopping sets associated with a parity-check matrix of low-density parity-check codes limit the performance of iterative decoding over the binary erasure channel. In this letter, we propose a parity-check matrix extension scheme that eliminates stopping sets of small sizes.
Kim, S Kim, Saejoon, Heo, J Heo, Jun, Park, H Park, Hyuncheol   +2 more
openaire   +3 more sources

A Turbo-Decoding Message-Passing Algorithm for Sparse Parity-Check Matrix Codes

IEEE Transactions on Signal Processing, 2006
A turbo-decoding message-passing (TDMP) algorithm for sparse parity-check matrix (SPCM) codes such as low-density parity-check, repeat-accumulate, and turbo-like codes is presented. The main advantages of the proposed algorithm over the standard decoding algorithm are 1) its faster convergence speed by a factor of two in terms of decoding iterations, 2)
Mohammad M. Mansour
openaire   +2 more sources