For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
LDPC Convolutional Codes Based on Parity Check Polynomials with a Time Period of 3
Yutaka MURAKAMI Shutai OKAMURA Shozo OKASAKA Takaaki KISHIGAMI Masayuki ORIHASHI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/10/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
LDPC convolutional codes, time-varying, time period of 3,
Full Text: PDF>>
We newly design time-varying low-density parity-check convolutional codes (LDPC-CCs) based on parity check polynomials of the convolutional codes with a time period of 3, and show that BER (Bit Error Rate) performance in the time-varying LDPC-CCs with a time period of 3 is better than that in the conventional time-varying LDPC-CCs with a time period of 2 in the same coding rate with the nearly equal constraint length.