A Parallel Belief Propagation Decoding Algorithm for Rate Compatible Modulation

This letter proposes a parallel belief propagation algorithm for fast iterative decoding of rate compatible modulation. In this proposed algorithm, the processing at symbol node is partitioned into several low complexity sub-processors. All sub-processors have similar structures and work in parallel...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 21; číslo 8; s. 1735 - 1738
Hlavní autoři: Lu, Fang, Dong, Yan, Rao, Wengui
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.08.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Belief propagation
Codes
Complexity
Computational complexity
Computer simulation
Decoding
Iterative decoding
Iterative methods
Modulation
parallel decoding
Partitioning algorithms
Performance degradation
Probability density function
Processors
Propagation
Rate compatible modulation
ISSN:1089-7798, 1558-2558
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í:This letter proposes a parallel belief propagation algorithm for fast iterative decoding of rate compatible modulation. In this proposed algorithm, the processing at symbol node is partitioned into several low complexity sub-processors. All sub-processors have similar structures and work in parallel without cross connections among them. Numerical and simulation results show that proper partition results in significant reduction of the computational complexity without decoding performance degradation.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2017.2692762