Low Complexity Decoding Algorithms for Rate Compatible Modulation

Rate compatible modulation (RCM) has high spectrum efficiency and achieves seamless and blind rate adaptation in wide range of channel conditions. However, due to many convolution operations at symbol nodes, the belief propagation decoding algorithm of RCM has a high level of computational complexit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 6; s. 31417 - 31429
Hlavní autoři: Lu, Fang, Dong, Yan, Rao, Wengui, Chen, Chang Wen
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Approximation algorithms
belief propagation
Codes
Complexity
Complexity theory
Computation
Convolution
Decoding
Domains
Jacobian logarithm
Jacobian matrices
log likelihood ratio
Logarithms
Modulation
Nodes
Parity check codes
rate adaptation
Rate compatible modulation
ISSN:2169-3536, 2169-3536
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í:Rate compatible modulation (RCM) has high spectrum efficiency and achieves seamless and blind rate adaptation in wide range of channel conditions. However, due to many convolution operations at symbol nodes, the belief propagation decoding algorithm of RCM has a high level of computational complexity. In this paper, we investigate the low complexity algorithms for fast decoding of RCM. Instead of computing the outgoing messages at symbol nodes via multi-level convolutions, we first design a novel two-level computing structure (2L-RCM) for symbol nodes in the probability-domain, each level is composed of one set of multiplications followed by one set of additions. Based on 2L-RCM, we derive Log-2L-RCM decoding algorithm in the log-domain, which converts the multiplications and additions of 2L-RCM into additions and Jacobian logarithms, respectively. Furthermore, we propose some approximate algorithms to reduce the complexity of Jacobian logarithms. In particular, the improved Max-Log-RCM (IMax-Log-RCM) algorithm obtains good performance-complexity trade-off. The simulation results and the numerical analyses show that IMax-Log-RCM achieves only 0.3-dB worse decoding performance than the original decoding algorithm with much fewer additions.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2842095