Residential Collegefalse
Status已發表Published
On Capacity-Based Codebook Design and Advanced Decoding for Sparse Code Multiple Access Systems
Xiao, Kexin1; Xia, Bin1,2; Chen, Zhiyong1,3; Xiao, Baicen; Chen, Dageng4; Ma, Shaodan5
2018-06
Source PublicationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
ISSN1536-1276
Volume17Issue:6Pages:3834-3849
Abstract

Sparse code multiple access (SCMA) is a promising non-orthogonal air-interface technology for its ability to support massive connections. In this paper, we design the multiuser codebook and the advanced decoding from the perspective of the theoretical capacity and the system feasibility. First, different from the lattice-based constellation in point-to-point channels, we propose a novel codebook for maximizing the constellation constrained capacity. We optimize a series of 1-D superimposed constellations to construct multi-dimensional codewords. An effective dimensional permutation switching algorithm is proposed to further obtain the capacity gain. Consequently, it shows that the performance of the proposed codebook approaches the Shannon limit and achieves significant gains over the other existing ones. Furthermore, we provide a symbol-based extrinsic information transfer tool to analyze the convergence of SCMA iterative detection, where the complex codewords are considered in modeling the a priori probabilities instead of assuming the binary inputs in previous literature. Finally, to approach the capacity, we develop a low-density parity-check code-based SCMA receiver. Most importantly, by utilizing the EXIT charts, we propose an iterative joint detection and decoding scheme with only partial inner iterations, which exhibits significant performance gain over the traditional one with separate detection and decoding.

KeywordSparse Code Multiple Access Multi-dimensional Codebook Converge Analysis Iterative Decoding
DOI10.1109/TWC.2018.2816929
URLView the original
Indexed BySCIE
Language英語English
WOS Research AreaEngineering ; Telecommunications
WOS SubjectEngineering, Electrical & Electronic ; Telecommunications
WOS IDWOS:000435196200024
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
The Source to ArticleWOS
Scopus ID2-s2.0-85044731266
Fulltext Access
Citation statistics
Document TypeJournal article
CollectionDEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING
Faculty of Science and Technology
Corresponding AuthorXia, Bin
Affiliation1.Shanghai Jiao Tong Univ, Dept Elect Engn, Inst Wireless Commun Technol, Shanghai Inst Adv Commun & Data Sci, Shanghai 200240, Peoples R China
2.Univ Washington, Dept Elect Engn, Seattle, WA 98105 USA
3.Shanghai Key Lab Digital Media Proc & Transmiss
4.Huawei Technol Co Ltd, Commun Technol Lab, Shanghai 201206, Peoples R China
5.Univ Macau, Dept Elect & Comp Engn, Macau 999078, Peoples R China
Recommended Citation
GB/T 7714
Xiao, Kexin,Xia, Bin,Chen, Zhiyong,et al. On Capacity-Based Codebook Design and Advanced Decoding for Sparse Code Multiple Access Systems[J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17(6), 3834-3849.
APA Xiao, Kexin., Xia, Bin., Chen, Zhiyong., Xiao, Baicen., Chen, Dageng., & Ma, Shaodan (2018). On Capacity-Based Codebook Design and Advanced Decoding for Sparse Code Multiple Access Systems. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 17(6), 3834-3849.
MLA Xiao, Kexin,et al."On Capacity-Based Codebook Design and Advanced Decoding for Sparse Code Multiple Access Systems".IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 17.6(2018):3834-3849.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Xiao, Kexin]'s Articles
[Xia, Bin]'s Articles
[Chen, Zhiyong]'s Articles
Baidu academic
Similar articles in Baidu academic
[Xiao, Kexin]'s Articles
[Xia, Bin]'s Articles
[Chen, Zhiyong]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Xiao, Kexin]'s Articles
[Xia, Bin]'s Articles
[Chen, Zhiyong]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.