Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences (Q1723448)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences |
scientific article; zbMATH DE number 7025439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences |
scientific article; zbMATH DE number 7025439 |
Statements
Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences (English)
0 references
19 February 2019
0 references
Summary: This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC) codes with mathematical theory. The paper introduces the procedure of the coding principle and coding. Four different integer sequences constructing QC-LDPC code are compared with LDPC codes by using PEG algorithm, array codes, and the Mackey codes, respectively. Then, the integer sequence QC-LDPC codes are used in coded cooperative communication. Simulation results show that the integer sequence constructed QC-LDPC codes are effective, and overall performance is better than that of other types of LDPC codes in the coded cooperative communication. The performance of Dayan integer sequence constructed QC-LDPC is the most excellent performance.
0 references
0 references
0.8765877
0 references
0.8386332
0 references
0.8367925
0 references
0.8355485
0 references
0.8289944
0 references
0.8276593
0 references
0.8205623
0 references