Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transfun.E92.A.2479 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
LDPC convolutional codes, time-varying, time period of 3 | Discrete mathematics,Parity bit,Convolutional code,Code rate,Polynomial,Serial concatenated convolutional codes,Turbo code,Theoretical computer science,Linear code,Mathematics,Bit error rate | Journal |
Volume | Issue | ISSN |
E92A | 10 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yutaka Murakami | 1 | 15 | 4.65 |
| Shutai Okamura | 2 | 0 | 0.34 |
| Shozo Okasaka | 3 | 4 | 0.86 |
| Takaaki Kishigami | 4 | 3 | 1.23 |
| Masayuki Orihashi | 5 | 11 | 4.17 |