A fast reconstruction of the parity-check matrices of LDPC codes in a noisy environment
In non-cooperative communications, blind identification of the widely used LDPC codes is an emerging research hot spot. This is different from and more difficult than blind identification of channel coding in cooperative communications. Common disadvantages of the existing algorithms are poor fault...
Saved in:
Published in | Computer communications Vol. 176; pp. 163 - 172 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.08.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!