Low-Complexity Detectors for Uplink SCMA: Symbol Flipping and Dynamic Partial Marginalization-Based MPA
Authors:
- Li WeiLWLi Wei
- Bo HuangBHBo Huang
- Jianping ZhengJZJianping Zheng
- 1 June 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
In this paper, two low-complexity detectors for uplink sparse code multiple access (SCMA) systems are proposed. The first, called symbol flipping algorithm (SFA), is an analogy of the bit-flipping decoding algorithm in the low-density parity check code field. Specifically, the local hard-decision detection is first performed at each resource node, and the decided signal in the least reliable resource node is flipped. The second is an improved partial marginalization (PM)- based message passing algorithm (MPA). Based on the reliability definition introduced in SFA, the variable nodes to be marginalized are determined dynamically during the MPA iteration procedure, and the resulted detector is termed as dynamic PM-based MPA. Simulation results show that the proposed hard-decision SFA can achieve a numerous complexity reduction and the proposed dynamic PM-based MPA has better performance than the conventional PM-based MPA.Keywords
This publication has 14 references indexed in Scilit:
- Low Complexity Iterative Receiver Design for Sparse Code Multiple AccessIEEE Transactions on Communications, 2016
- Joint Sparse Graph-Detector Design for Downlink MIMO-SCMA SystemsIEEE Wireless Communications Letters, 2016
- Low Complexity Message Passing Algorithm for SCMA SystemIEEE Communications Letters, 2016
- Shuffled Multiuser Detection Schemes for Uplink Sparse Code Multiple Access SystemsIEEE Communications Letters, 2016
- Low Complexity Techniques for SCMA Detection2015
- A Fixed Low Complexity Message Pass Algorithm Detector for Up-Link SCMA SystemIEEE Wireless Communications Letters, 2015
- SCMA Codebook Design2014
- Blind detection of SCMA for uplink grant-free multiple-access2014
- Sparse code multiple access2013
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001