Edge Serial Message Passing Algorithm Based on Subgraph

JIA Zhi-hao; SUN Jun

doi:10.12263/DZXB.20200598

您当前的位置：

首页 >

文章列表页 >

Edge Serial Message Passing Algorithm Based on Subgraph

PAPERS | 更新时间：2025-12-08

- Edge Serial Message Passing Algorithm Based on Subgraph
- ACTA ELECTRONICA SINICA Vol. 49, Issue 11, Pages: 2146-2151(2021)
- 作者机构：
  
  南京邮电大学江苏省无线通信重点实验室，江苏南京210003
- 作者简介：
- 基金信息：
- DOI：10.12263/DZXB.20200598
  CLC： TN929.5
- Received：22 June 2020，
  
  Revised：2021-03-09，
  
  Published：25 November 2021
- 稿件说明：
移动端阅览
贾志豪,孙君.基于子图的边缘串行消息传递算法[J].电子学报,2021,49(11):2146-2151.

JIA Zhi-hao,SUN Jun.Edge Serial Message Passing Algorithm Based on Subgraph[J].ACTA ELECTRONICA SINICA,2021,49(11):2146-2151.
贾志豪,孙君.基于子图的边缘串行消息传递算法[J].电子学报,2021,49(11):2146-2151. DOI： 10.12263/DZXB.20200598.

JIA Zhi-hao,SUN Jun.Edge Serial Message Passing Algorithm Based on Subgraph[J].ACTA ELECTRONICA SINICA,2021,49(11):2146-2151. DOI： 10.12263/DZXB.20200598.

摘要

稀疏码分多址接入(Sparse Code Multiple Access，SCMA)作为一种重要的码域非正交多址技术，能够满足5G通信的海量机器接入需求，但是接收端采用的消息传递算法（Message Passing Algorithm，MPA）存在收敛速度慢、计算复杂度较高的问题.本文提出一种基于子图的边缘串行消息传递算法（SE-MPA），将原始因子图划分为多个不同子图，在子图的基础上优化消息更新顺序，利用边缘串行更新序列集，被更新的用户节点消息立刻用来更新相连的资源节点.仿真结果表明，该算法在少量系统BER性能损失条件下，能够有效加快消息收敛速度，降低计算复杂度.

Abstract

As an important code domain non orthogonal multiple access technology

sparse code division multiple access (SCMA) can meet the requirements of 5G communication for massive machine access. However

the message passing algorithm (MPA) adopted by the receiver has the problems of slow convergence speed and high computational complexity. This paper proposes an edge serial message passing algorithm based on subgraph (SE-MPA). The original factor graph is divided into several different subgraphs. Based on the subgraph

the message update sequence is optimized

and the edge serial update sequence set is adopted. The updated user node messages are used to update the connected resource nodes immediately. Simulation results show that the algorithm can effectively speed up the message convergence and reduce the computational complexity in the case of a small amount of BER performance loss.

关键词

Keywords

references

Andrews J G , et al . What will 5G be? [J]. IEEE Journal on Selected Areas in Communications , 2014 , 32 ( 6 ): 1065 - 1082 .

Dai L , Wang B , Yuan Y , et al . Non-orthogonal multiple access for 5G: solutions, challenges, opportunities, and future research trends [J]. IEEE Communications Magazine , 2015 , 53 ( 9 ): 74 - 81 .

Taherzadeh M , Nikopour H , Bayesteh A , et al . SCMA codebook design [A]. 2014 IEEE 80th Vehicular Technology Conference [C]. Vancouver, BC : IEEE , 2014 . 1 - 5 .

Nikopour H , Baligh H . Sparse code multiple access [A]. IEEE International Symposium on Personal Indoor & Mobile Radio Communications [C]. London, UK : IEEE , 2013 . 332 - 336 .

Mu H , Ma Z , Alhaji M , et al . A fixed low complexity message pass algorithm detector for up-link SCMA system [J]. IEEE Wireless Communications Letters , 2015 , 4 ( 6 ): 585 - 588 .

Du Y , Dong B , Chen Z , et al . Low-complexity detector in sparse code multiple access systems [J]. IEEE Communications Letters , 2016 , 20 ( 9 ): 1812 - 1815 .

杜洋 , 董彬虹 , 王显俊 , 等 . 基于串行策略的SCMA多用户检测算法 [J]. 电子与信息学报 , 2016 , 38 ( 8 ): 1888 - 1893 .

Du Y , Dong B H , Wang X J , et al . Multiuser detection scheme for SCMA systems based on serial strategy [J]. Journal of Electronics & Information Technology , 2016 , 38 ( 8 ): 1888 - 1893 . (in Chinese)

朱翠涛 , 韦宁 , 汪汉新 , 等 . 基于迭代剔除的SCMA多用户检测算法 [J]. 通信学报 , 2018 , 39 ( 6 ): 64 - 72 .

Zhu C T , Wei N , Wang H X , et al . Multi-user detection scheme for SCMA systems based on iteration removal [J]. Journal on Communications , 2018 , 39 ( 6 ): 64 - 72 . (in Chinese)

Du Y , Dong B , Chen Z , et al . Improved serial scheduling-based detection for sparse code multiple access systems [J]. IEEE Wireless Communications Letters , 2017 , 6 ( 5 ): 570 - 573 .

Tan Y , Gao Z , Guo S , et al . A dynamic multiuser detection scheme for uplink SCMA system [A]. 2017 IEEE 17th International Conference on Communication Technology (ICCT) [C]. Chengdu : IEEE , 2017 . 631 - 635 .

Ma L , Tong S , Zheng H , et al . Edgewise serial message passing detection of uplink SCMA systems for better user fairness and faster convergence rate [J]. IEEE Wireless Communications Letters , 2019 , 8 ( 4 ): 1285 - 1288 .

Ma Xinying , Yang Lin , Chen Zhi , et al . Low complexity detection based on dynamic factor graph for SCMA systems [J]. IEEE Communications Letters , 2017 , 21 ( 12 ): 2666 - 2669 .

Jia M , Wang L , Guo Q , et al . A low complexity detection algorithm for fixed up-link SCMA system in mission critical scenario [J]. IEEE Internet of Things Journal , 2017 , 5 ( 5 ): 3289 - 3297 .

Bayesteh A , Nikopour H , Taherzadeh M , et al . Low complexity techniques for SCMA detection [A]. 2015 IEEE Globecom Workshops [C]. CA, USA : IEEE , 2015 . 1 - 6 .

Zhang C , Luo Y , Chen Y . A low complexity SCMA detector based on discretization [J]. IEEE Transactions on Wireless Communications , 2018 , 17 ( 4 ): 2333 - 2345 .

Meng X , Wu Y , Chen Y , et al . Low complexity receiver for uplink SCMA system via expectation propagation [A]. 2017 IEEE Wireless Communications and Networking Conference(WCNC) [C]. San Francisco, CA : IEEE , 2017 . 1 - 5 .

Miao J , Hu X , Zhao Z . A low complexity multiuser detection scheme with dynamic factor graph for uplink SCMA systems [A]. 2019 IEEE/CIC International Conference on Communications in China (ICCC) [C]. Changchun, China : IEEE , 2019 . 846 - 851 .

Klimentyev V P , Sergienko A B . A low-complexity SCMA detector for AWGN channel based on solving overdetermined systems of linear equations [A]. 2016 International Symposium Problems of Redundancy in Information and Control Systems [C]. St Petersburg, Russia : 2016 . 61 - 65 .

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Generalization of Zero‑Padded Tri‑Mode OFDM with Index Modulation Based on Three‑Stage LLR Detection

An Dynamic Routing and Wavelength Assignment Algorithm Based on Key Links Forecasting

Dynamic Joint Nearest Neighbor Algorithm

An Analysis on Convergence and Convergence Rate Estimate of Genetic Algorithms in Noisy Environments

Related Author

CHEN Zhen‑xing

CHEN Zhi-hui

WANG Meng‑yi

FONT

LI Jian-ming

LIU De-ming

ZHU Guang-xi

SHAN Guang-jun

Related Institution

School of Mechanical Engineering and Electronic Information， China University of Geosciences

School of Artificial Intelligence， North China University of Science and Technology

School of Electronic Information， Wuhan University

湖北省电力信息通信中心

华中科技大学光电子科学与工程学院

⁰