Joint Shuffled Scheduling Decoding Algorithm for DP-LDPC Codes-Based JSCC Systems

In this letter, a joint shuffled scheduling decoding algorithm for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) schemes is presented. The proposed algorithm adopts the shuffled scheduling method to both source decoder and channel decoder, and ca...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE wireless communications letters Ročník 8; číslo 6; s. 1696 - 1699
Hlavní autoři: Xu, Zhiping, Wang, Lin, Hong, Shaohua, Lau, Francis C. M., Sham, Chiu-Wing
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.12.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
belief propagation
Binary system
Codes
Complexity theory
Convergence
Decoding
DP-LDPC codes
Error correcting codes
Iterative decoding
JSCC
Scheduling
Scheduling algorithms
shuffled scheduling
ISSN:2162-2337, 2162-2345
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this letter, a joint shuffled scheduling decoding algorithm for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) schemes is presented. The proposed algorithm adopts the shuffled scheduling method to both source decoder and channel decoder, and can improve convergence speed and reduce the decoding complexity. In addition, a unique phenomenon named unequal convergence rates is revealed at the same time. The proposed algorithm can terminate this phenomenon with faster decoding. The results show that this algorithm has faster convergence speed and better error performance, compared with the traditional joint belief propagation (BP) decoding algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2162-2337
2162-2345
DOI:10.1109/LWC.2019.2937766