Simplified sparse code multiple access receiver by using truncated messages

Sparse code multiple access (SCMA) is a promising candidate air interface of the next generation mobile networks. However, the decoding complexity of current message passing algorithm for SCMA is very high. In this study, the authors map SCMA constellation to q-order Galois field ($GF(q)$GF(q)) and...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IET communications Ročník 12; číslo 16; s. 1937 - 1945
Hlavní autori: Lai, Ke, Wen, Lei, Lei, Jing, Zhong, Jie, Chen, GaoJie, Zhou, XiaoTian
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: The Institution of Engineering and Technology 09.10.2018
Predmet:
air interface
channel coding
channel‐adaptive EML algorithm
computational complexity
current message passing algorithm
decoding
extended max‐log algorithm
Galois fields
low computational complexity
low‐complexity decoding algorithms
message passing
mobile radio
multi‐access systems
next generation mobile networks
next generation networks
q‐order Galois field
Research Article
SCMA constellation
simplified sparse code multiple access receiver
trellis codes
trellis representation
truncated length
truncated messages
SCMA constellation
trellis representation
message passing
mobile radio
next generation mobile networks
extended max-log algorithm
channel coding
next generation networks
truncated messages
low-complexity decoding algorithms
truncated length
Galois fields
decoding
trellis codes
low computational complexity
q-order Galois field
current message passing algorithm
multi-access systems
simplified sparse code multiple access receiver
air interface
channel-adaptive EML algorithm
computational complexity
ISSN:1751-8628, 1751-8636
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Sparse code multiple access (SCMA) is a promising candidate air interface of the next generation mobile networks. However, the decoding complexity of current message passing algorithm for SCMA is very high. In this study, the authors map SCMA constellation to q-order Galois field ($GF(q)$GF(q)) and introduce a trellis representation to SCMA. Based on the trellis representation, they propose low-complexity decoding algorithms for SCMA by using truncated messages, which is referred as extended max-log (EML) algorithm. As the truncated length of EML is unitary for each user, they further propose a channel-adaptive EMLalgorithm to truncate the messages with a rule that can be adaptive to the channel state. Simulation results show that the proposed schemes obtain a low computational complexity with only a slight performance degradation when the truncated length is selected appropriately.
ISSN:1751-8628
1751-8636
DOI:10.1049/iet-com.2017.0774