Check out RSS, or use RSS reader to subscribe this item
Confirmation
Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China
Time-invariant low-density parity-check convolutional codes (LDPC-CCs) can be represented by a polynomial-domain parity-check matrix derived from the corresponding quasi-cyclic (QC) LDPC block codes (LDPC-BCs). Based on the analysis of the graphical structure of short cycles in $ extbf{H}^T(D)$, we propose a method to design the polynomial syndrome former matrix $ extbf{H}_{CR}^T(D)$ for LDPC-CCs. It eliminates short cycles and shows better decoding performance on an additive white Gaussian noise (AWGN) channel with lower bit error ratio (BER) curves.
Keywords:Communication and information system; LDPC convolutional codes; girth; eliminating short cycles