| Autor: |
Sina Vafi, Narges Rezvani Majid |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
Digital Communications and Networks, Vol 4, Iss 4, Pp 296-300 (2018) |
| Druh dokumentu: |
article |
| ISSN: |
2352-8648 |
| DOI: |
10.1016/j.dcan.2018.01.001 |
| Popis: |
This paper presents a novel regular Quasi-Cyclic (QC) Low Density Parity Check (LDPC) codes with column-weight three and girth at least eight. These are designed on the basis of combinatorial design in which subsets applied for the construction of circulant matrices are determined by a particular subset. Considering the non-existence of cycles four and six in the structure of the parity check matrix, a bound for their minimum weight is proposed. The simulations conducted confirm that without applying a masking technique, the newly implemented codes have a performance similar to or better than other well-known codes. This is evident in the waterfall region, while their error floor at very low Bit Error Rate (BER) is expected. Keywords: Quasi-cyclic LDPC codes, Combinatorial design, Minimum weight, Girth |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
