A low-complexity energy-minimization-based SCMA detector and its convergence analysis

Weijie YUAN; Nan WU; Chaoxing YAN; Yonghui LI; Xiaojing HUANG; Lajos HANZO

doi:10.1109/TVT.2018.2876121

A low-complexity energy-minimization-based SCMA detector and its convergence analysis

Weijie YUAN, Nan WU^*, Chaoxing YAN, Yonghui LI, Xiaojing HUANG, Lajos HANZO

^*Corresponding author for this work

Research output: Journal Publications › Journal Article (refereed) › peer-review

9 Citations (Scopus)

Abstract

Sparse code multiple access (SCMA) has emerged as a promising non-orthogonal multiple access technique for the next-generation wireless communication systems. Since the signal of multiple users is mapped to the same resources in SCMA, its detection imposes a higher complexity than that of the orthogonal schemes, where each resource slot is dedicated to a single user. In this paper, we propose a low-complexity receiver for SCMA systems based on the radical variational free energy framework. By exploiting the pairwise structure of the likelihood function, the Bethe approximation is utilized for estimating the data symbols. The complexity of the proposed algorithm only increases linearly with the number of users, which is much lower than that of the maximum a posteriori detector associated with exponentially increased complexity. Furthermore, the convergence of the proposed algorithm is analyzed, and its convergence conditions are derived. Simulation results demonstrate that the proposed receiver is capable of approaching the error probability performance of the conventional message-passing-based receiver.

Original language	English
Article number	8509164
Pages (from-to)	12398-12403
Number of pages	6
Journal	IEEE Transactions on Vehicular Technology
Volume	67
Issue number	12
Early online date	25 Oct 2018
DOIs	https://doi.org/10.1109/TVT.2018.2876121
Publication status	Published - Dec 2018
Externally published	Yes

Funding

This work was supported in part by the National Science Foundation of China (NSFC) under Grants 61471037 and 61571041 and in part by the Foundation for the Author of National Excellent Doctoral Dissertation of China under Grant 201445. The work of Y. Li was supported in part by the Australian Research Council under Grant DP150104019 and in part by the NSFC under Grants 61531006 and 61772233. The work of L. Hanzo was supported by the Engineering and Physical Sciences Research Council through Projects EP/Noo4558/1 and EP/PO34284/1 of the Royal Society’s Global Challenges Research Fund as well as of the European Research Council’s Advanced Fellow Grant QuantCom.

Keywords

Bethe approximation
convergence analysis
Sparse code multiple access
variational free energy

Access to Document

10.1109/TVT.2018.2876121Licence: CC BY

Cite this

@article{e3bcebc5660c4d0a95a1ec49086a30bd,

title = "A low-complexity energy-minimization-based SCMA detector and its convergence analysis",

abstract = "Sparse code multiple access (SCMA) has emerged as a promising non-orthogonal multiple access technique for the next-generation wireless communication systems. Since the signal of multiple users is mapped to the same resources in SCMA, its detection imposes a higher complexity than that of the orthogonal schemes, where each resource slot is dedicated to a single user. In this paper, we propose a low-complexity receiver for SCMA systems based on the radical variational free energy framework. By exploiting the pairwise structure of the likelihood function, the Bethe approximation is utilized for estimating the data symbols. The complexity of the proposed algorithm only increases linearly with the number of users, which is much lower than that of the maximum a posteriori detector associated with exponentially increased complexity. Furthermore, the convergence of the proposed algorithm is analyzed, and its convergence conditions are derived. Simulation results demonstrate that the proposed receiver is capable of approaching the error probability performance of the conventional message-passing-based receiver.",

keywords = "Bethe approximation, convergence analysis, Sparse code multiple access, variational free energy",

author = "Weijie YUAN and Nan WU and Chaoxing YAN and Yonghui LI and Xiaojing HUANG and Lajos HANZO",

year = "2018",

month = dec,

doi = "10.1109/TVT.2018.2876121",

language = "English",

volume = "67",

pages = "12398--12403",

journal = "IEEE Transactions on Vehicular Technology",

issn = "0018-9545",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "12",

}

TY - JOUR

T1 - A low-complexity energy-minimization-based SCMA detector and its convergence analysis

AU - YUAN, Weijie

AU - WU, Nan

AU - YAN, Chaoxing

AU - LI, Yonghui

AU - HUANG, Xiaojing

AU - HANZO, Lajos

PY - 2018/12

Y1 - 2018/12

N2 - Sparse code multiple access (SCMA) has emerged as a promising non-orthogonal multiple access technique for the next-generation wireless communication systems. Since the signal of multiple users is mapped to the same resources in SCMA, its detection imposes a higher complexity than that of the orthogonal schemes, where each resource slot is dedicated to a single user. In this paper, we propose a low-complexity receiver for SCMA systems based on the radical variational free energy framework. By exploiting the pairwise structure of the likelihood function, the Bethe approximation is utilized for estimating the data symbols. The complexity of the proposed algorithm only increases linearly with the number of users, which is much lower than that of the maximum a posteriori detector associated with exponentially increased complexity. Furthermore, the convergence of the proposed algorithm is analyzed, and its convergence conditions are derived. Simulation results demonstrate that the proposed receiver is capable of approaching the error probability performance of the conventional message-passing-based receiver.

AB - Sparse code multiple access (SCMA) has emerged as a promising non-orthogonal multiple access technique for the next-generation wireless communication systems. Since the signal of multiple users is mapped to the same resources in SCMA, its detection imposes a higher complexity than that of the orthogonal schemes, where each resource slot is dedicated to a single user. In this paper, we propose a low-complexity receiver for SCMA systems based on the radical variational free energy framework. By exploiting the pairwise structure of the likelihood function, the Bethe approximation is utilized for estimating the data symbols. The complexity of the proposed algorithm only increases linearly with the number of users, which is much lower than that of the maximum a posteriori detector associated with exponentially increased complexity. Furthermore, the convergence of the proposed algorithm is analyzed, and its convergence conditions are derived. Simulation results demonstrate that the proposed receiver is capable of approaching the error probability performance of the conventional message-passing-based receiver.

KW - Bethe approximation

KW - convergence analysis

KW - Sparse code multiple access

KW - variational free energy

UR - http://www.scopus.com/inward/record.url?scp=85055673222&partnerID=8YFLogxK

U2 - 10.1109/TVT.2018.2876121

DO - 10.1109/TVT.2018.2876121

M3 - Journal Article (refereed)

AN - SCOPUS:85055673222

SN - 0018-9545

VL - 67

SP - 12398

EP - 12403

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

IS - 12

M1 - 8509164

ER -

A low-complexity energy-minimization-based SCMA detector and its convergence analysis

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this