检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:朱翠涛[1] 韦宁 汪汉新[1] 李中捷[1] ZHU Cuitao;WEI Ning;WANG Hanxin;LI Zhongjie(Hubei Key Laboratory of Intelligent Wireless Communication,South-Center University for Nationalities,Wuhan 430074,China)
机构地区:[1]中南民族大学智能无线通信湖北省重点实验室,湖北武汉430074
出 处:《通信学报》2018年第6期64-72,共9页Journal on Communications
基 金:国家自然科学基金资助项目(No.61671483;No.61379028);湖北省自然科学基金资助项目(No.2016CFA089)~~
摘 要:针对稀疏码多址接入(SCMA)系统中译码算法复杂度高问题,提出一种基于迭代剔除的多用户检测算法(RM-MPA)。首先基于串行消息传播机制提出了一种简单直观的方法用于比较用户间的译码优势,然后在每轮迭代过后,对译码优势高的前n个用户直接进行译码并剔除,不再参与后继迭代过程,从而使后续每轮迭代的复杂度依次降低。在此基础上提出了译码优势用户排序和正交用户分组2种剔除策略。实验结果表明,基于正交用户分组剔除策略的RM-MPA算法在降低译码复杂度的前提下,能够保证译码性能,同时由于每轮迭代的复杂度依次降低,也减小了译码时延。A multi-user detection scheme based on iteration removal(RM-MPA) was proposed to solve the problem of high complexity of decoding algorithm for sparse code multiple access(SCMA) systems. Firstly, a simple and novel method to compare the decoding advantages between users was proposed. Then n users in front of them with higher decoding advantages directly decoded and removed after each iteration, the users removed no longer participate in the subsequent iteration, so the complexity of subsequent iterations decreased gradually. Moreover, two iteration removed strategies based on decoding advantages of users and orthogonal user grouped were proposed respectively. Simulation results show that the RM-MPA with removed strategies based on orthogonal user grouped, which can reduce the decoding complexity with well decoding performance, and the decoding delay is also decreased.
关 键 词:稀疏码多址接入 消息传播算法 多用户检测 迭代剔除策略
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70