Results 211 to 220 of about 108,131 (252)

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   +1 more source

VLSI Design for High-Speed Sparse Parity-Check Matrix Decoders

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005., 2006
In this paper, the design of high-speed iterative decoders for sparse parity-check matrix (SPCM) codes such as LDPC, repeat-accumulate and turbo-like codes is addressed. The random nature of the underlying Tanner graph associated with these codes is problematic for a high-speed decoder implementation.
openaire   +1 more source

Decreasing error floor in LDPC codes by parity-check matrix extensions

2009 IEEE International Symposium on Information Theory, 2009
High error floors in optimized irregular LDPC codes limit their usage in applications that require low error rates. We introduce new methods for lowering the error floor of LDPC codes, based on enhancing the code's parity-check matrix with additional linearly dependent and independent parity-checks. We prove NP hardness of certain optimization problems
Omer Fainzilber, Eran Sharon, Simon Litsyn   +2 more
openaire   +1 more source

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 ...
openaire   +1 more source

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   +1 more source

Construct Parity-check Matrix H of QC LDPC Codes via Arithmetic Progression

Proceedings of the Fifth International Conference on Network, Communication and Computing, 2016
In this correspondence, the construction of quasi-cyclic low-density parity-check(QC LDPC) codes via Arithmetic Progression(AP) is investigated. A mild necessary and sufficient condition is derived for the QC LDPC code to remove specifically circles whose girth equal to 6.
Xue Zhang, Lu Peng, Chenyan Li, Qing Li
openaire   +1 more source

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   +1 more source

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   +1 more source

The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes

The new developments in coding theory research have revolutionized the application of coding to practical systems. Low-Density Parity Check (LDPC) codes form a class of Shannon limit approaching codes opted for digital communication systems that require high reliability.
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   +2 more sources