检索结果-内蒙古大学图书馆

IEEE International Conference on Communications (IEEE ICC) / Workshop on NOMA for 5G and Beyond

作者： Deka, Kuntal Priyadarsini, Minerva Sharma, Sanjeev Beferull-Lozano, Baltasar Indian Inst Technol Goa Ponda Goa India Indian Inst Technol BHU Varanasi Uttar Pradesh India Univ Agder Dept Informat & Commun Technol N-4879 Grimstad Norway

ISBN: (纸本)9781728174402

Non-orthogonal multiple access (NOMA) is a promising technology which meets the demands of massive connectivity in future wireless networks. Sparse code multiple access (SCMA) is a popular code-domain NOMA technique. The effectiveness of SCMA comes from: (1) the multi-dimensional sparse codebooks offering high shaping gain and (2) sophisticated multi-user detection based on message passing algorithm (MPA). The codebooks of the users play the main role in determining the performance of SCMA system. This paper presents a framework to design the codebooks by taking into account the entire system including the SCMA encoder and the MPA-based detector. The symbol-error rate (SER) is considered as the design criterion which needs to be minimized. Differential evolution (DE) is used to carry out the minimization of the SER over the codebooks. The simulation results are presented for various channel models.

关键词： SCMA codebook design differential evolution message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

Quantum Search-Aided Multi-User Detection for Sparse Code Multiple Access

引用

IEEE ACCESS 2019年 7卷 52804-52817页

作者： Ye, Wenjing Chen, Wei Guo, Xin Sun, Chen Hanzo, Lajos Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Sony China Ltd Sony China Res Lab Beijing 100028 Peoples R China Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

With the explosive proliferation of mobile devices, the scarcity of communication resources has emerged as a critical issue in the next generation (NG) communication systems. To overcome this, non-orthogonal multiple access (NOMA) has been shown to provide a beneficial spectral effi ciency gain, while supporting massive connectivity. Sparse code multiple access (SCMA) is one of the NOMA schemes, but its application is hampered by its high-complexity multi-user detection. Fortunately, quantum search techniques were shown to substantially reduce the complexity of multi-user detectors (MUD). However, the quantum search-aided multiuser detection of SCMA is an open problem at the time of writing. Hence, we conceive a pair of quantum search-aided MUDs for SCMA, namely, a quantum-assisted message passing algorithm (Q-MPA)-based MUD and a quantum-assisted sphere decoder-based MPA (QSD-MPA) MUD.

关键词： Sparse code multiple access multiuser detection quantum search algorithm message passing algorithm sphere decoder

来源：评论

学校读者我要写书评

暂无评论

Partially Active message passing Receiver for MIMO-SCMA Systems

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2018年第2期7卷 222-225页

作者： Dai, Jincheng Chen, Guangjin Niu, Kai Lin, Jiaru Beijing Univ Posts & Telecommun Minist Educ Key Lab Universal Wireless Commun Beijing 100876 Peoples R China

Recently, sparse code multiple access (SCMA) and multiple-input multiple-output (MIMO) are viewed as two key techniques to address the high spectral efficiency and massive connectivity requirements for the 5G wireless system. Even though the sparse structure of each user's codewords has been exploited, the complexity of joint MIMO and multiuser detection (JMMD) in the MIMO-SCMA systems still grows exponentially with the number of antennas and accessed users. In this letter, to tackle this severe problem, based on the Gaussian approximation principle, we propose a partially active message passing receiver for the MIMO-SCMA systems. In this case, a sliding window is introduced to determine which users stay active during each detection and decoding process while others keep silent. By this means, the complexity of JMMD can be efficiently reduced while its performance just suffers a slight loss, which fascinates the practical implementation of MIMO-SCMA systems.

关键词： MIMO-SCMA message passing algorithm partially active Gaussian approximation

来源：评论

学校读者我要写书评

暂无评论

A message passing approach for decision fusion in adversarial multi-sensor networks

引用

INFORMATION FUSION 2018年 40卷 101-111页

作者： Abrardo, Andrea Barni, Mauro Kallas, Kassem Tondi, Benedetta Dept Informat Engn & Math Via Roma 56 Siena Italy

We consider a simple, yet widely studied, set-up in which a Fusion Center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by byzantine nodes, i.e. nodes which deliberately alter the result of the local decision to induce an error at the fusion center. When independent states are considered, the optimum fusion rule over a batch of observations has already been derived, however its complexity prevents its use in conjunction with large observation windows. In this paper, we propose a near-optimal algorithm based on message passing that greatly reduces the computational burden of the optimum fusion rule. In addition, the proposed algorithm retains very good performance also in the case of dependent system states. By first focusing on the case of small observation windows, we use numerical simulations to show that the proposed scheme introduces a negligible increase of the decision error probability compared to the optimum fusion rule. We then analyse the performance of the new scheme when the FC makes its decision by relying on long observation windows. We do so by considering both the case of independent and Markovian system states and show that the obtained performance are superior to those obtained with prior suboptimal schemes. As an additional result, we confirm the previous finding that, in some cases, it is preferable for the byzantine nodes to minimise the mutual information between the sequence system states and the reports submitted to the FC, rather than always flipping the local decision. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Adversarial signal processing Decision fusion in adversarial setting Decision fusion in the presence of Byzantines message passing algorithm Factor graph

来源：评论

学校读者我要写书评

暂无评论

Scheduling and Layer Selection Based Performance Improvement of Uplink SCMA System With Receive Beamforming

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第7期68卷 7209-7213页

作者： Kim, Nam-I Cho, Dong-Ho Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon 34141 South Korea

A modified uplink sparse code multiple access (SCMA) scheme with receive beamforming is herein proposed. Although a base station equipped with multiple antennas can support many users simultaneously using multi-beams, the complexity of the optimal SCMA system may be too large to be implemented in view of a practical system. Therefore, a two stage SCMA system with receive beamforming is proposed, based on uplink scheduling and three step layer selection. Analysis and simulation results of the proposed scheme showed the advantage of large complexity reduction with little performance degradation.

关键词： SCMA multiple access beamforming uplink message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Codebook Design for Uplink SCMA

引用

IEEE ACCESS 2020年 8卷 211665-211675页

作者： Gao, Mengyao Ge, Wenping Zhang, Pengju Zhang, Yongxing Xinjiang Univ Coll Informat Sci & Engn Key Lab Signal Detect & Proc Urumqi 830046 Peoples R China

Sparse code multiple access (SCMA) is one of the most intensively investigated non-orthogonal multiple access (NOMA) techniques for the fifth generation communication (5G) system. In this paper, a new multi-stage optimization approach for codebook design is proposed for the uplink SCMA system. The proposed schemes includes two parts: i) multi-dimensional mother constellation design ii) mapping matrix design. Firstly, the multi-dimensional complex mother constellation design is implemented by a series of two-dimensional real constellations which can be obtained by the lattice theory and the symbol switch algorithm (SSA). The Secondly, we construct user-specific mapping matrix by optimizing the phase rotation of the user constellation to effectively reduce the interference between the multi-user codewords superimposed on every single time-domain resource elements (REs). Finally, the multi-user codebooks are generated by combining the multi-dimensional mother constellation and the user-specific mapping matrix. The simulation results demonstrate that the proposed codebooks can greatly decrease bit error rate (BER) value compared to the existing codebooks under different channels, different codebook sizes and different overloading ratios, and the performance is also improved for the large-scale SCMA codebook. More importantly, in order to verify the proposed codebook applicability, two different message passing algorithm (MPA) are used to simulate the SCMA system with different codebook sizes, both of which obtain faster convergence speed and better BER performance than other existing codebooks.

关键词： SCMA codebook design mapping matrix BER message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

Massive Distributed Antenna Systems: Channel Estimation and Signal Detection

引用

IEEE ACCESS 2020年 8卷 186055-186070页

作者： Pan, Peng Zhang, Jiatian Yang, Lie-Liang Hangzhou Dianzi Univ Sch Commun Engn Hangzhou 310018 Peoples R China Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

This article addresses the uplink information transmission in the massive distributed antenna (mDA) systems, where the density of antenna elements (AEs) can be much higher than the density of users. We conceive that such mDA systems are user-centric and provide various advantages for practical operations, and that there are evident challenges in the signal detection, which is very different from that in the conventional cellular systems with co-located antennas at base-stations (BS). Therefore in this article, based on the theory of stochastic geometry, some insightful analysis for the achievable performance of mDA systems is first provided, to show that local detection can be more practical than global detection. Then, by exploiting the sparsity of the channel matrices describing mDA systems, a channel estimator is proposed based on the orthogonal matching pursuit (OMP) algorithm. We will show that the OMP-based channel estimation can not only provide channel state information (CSI), but also assist to select the users to be served by an AE. Furthermore, benefiting from the above-mentioned sparsity, we propose a distributed low-complexity message passing algorithm (MPA)-assisted multiuser detector. Finally, we investigate the performance of the mDA systems employing the proposed detection schemes and with various system settings. Our studies show that the OMP-based channel estimation and MPA-assisted detector are capable of achieving a good trade-off among BER performance, complexity and resource usage.

关键词： Channel estimation Antenna arrays Massive MIMO Matching pursuit algorithms Multiuser detection Massive distributed MIMO channel estimation sparse signal recovery orthogonal matching pursuit multiuser detection message passing algorithm stochastic geometry

来源：评论

学校读者我要写书评

暂无评论

Community Recovery in a Preferential Attachment Graph

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第11期65卷 6853-6874页

作者： Hajek, Bruce Sankagiri, Suryanarayana Univ Illinois Dept Elect & Comp Engn Coordinated Sci Lab Urbana IL 61801 USA

A message passing algorithm is derived for recovering communities within a graph generated by a variation of the Barabsi-Albert preferential attachment model. The estimator is assumed to know the arrival times, or order of attachment, of the vertices. The derivation of the algorithm is based on belief propagation under an independence assumption. Two precursors to the message passing algorithm are analyzed: the first is a degree thresholding (DT) algorithm and the second is an algorithm based on the arrival times of the children (C) of a given vertex, where the children of a given vertex are the vertices that attached to it. Comparison of the performance of the algorithms shows it is beneficial to know the arrival times, not just the number, of the children. The probability of correct classification of a vertex is asymptotically determined by the fraction of vertices arriving before it. Two extensions of algorithm C are given: the first is based on joint likelihood of the children of a fixed set of vertices;it can sometimes be used to seed the message passing algorithm. The second is the message passing algorithm. Simulation results are given.

关键词： Preferential attachment graph message passing algorithm graphical inference clustering community recovery

来源：评论

学校读者我要写书评

暂无评论

A Threshold-Based Max-log-MPA Low Complexity Multiuser Detection algorithm

引用

SENSORS 2020年第4期20卷 1016-1016页

作者： Zhang, Guanghua Gu, Zonglin Zhao, Qiannan Ren, Jingqiu Lu, Weidang Northeast Petr Univ Sch Elect Engn & Informat Daqing 163318 Peoples R China Zhejiang Univ Technol Coll Informat Engn Hangzhou 310014 Peoples R China

Sparse Code Multiple Access (SCMA) technology is a new multiple access scheme based on non-orthogonal spread spectrum technology, which was proposed by Huawei in 2014. In the algorithm application of this technology, the original message passing algorithm (MPA) has slow convergence speed and high algorithm complexity. The threshold-based MPA has a high Bit Error Ratio (BER) when the threshold is low. In the Maximum logarithm message passing algorithm (Max-log-MPA), the approximation method is used, which will cause some messages to be lost and the detection performance to be poor. Therefore, in order to solve the above problems, a Threshold-Based Max-log-MPA (T-Max-log-MPA) low complexity multiuser detection algorithm is proposed in this paper. The Maximum logarithm (Max-log) algorithm is combined with threshold setting, and the stability of user nodes is considered as a necessary condition for decision in the algorithm. Before message updating, the user information nodes are judged whether the necessary conditions for the stability of the user node have been met, and then the threshold is determined. Only users who meet the threshold condition and pass the necessary condition of user node stability can be decoded in advance. In the whole process, the logarithm domain MPA algorithm is used to convert an exp operation and a multiplication operation into a maximum value and addition operation. The simulation results show that the proposed algorithm can effectively reduce the computational complexity while ensuring the BER, and with the increase of signal-to-noise ratio, the effect of the Computational Complexity Reduction Ratio (CCRR) is more obvious.

关键词： sparse code multiple access threshold message passing algorithm multiuser detection maximum likelihood logarithm

来源：评论

学校读者我要写书评

暂无评论

Two Stage Detection for Uplink Massive MIMO MU-SCMA Systems 13th

Two Stage Detection for Uplink Massive MIMO MU-SCMA Systems

引用

13th European-Alliance-for-Innovation (EAI) International Conference on Communications and Networking in China (ChinaCom)

作者： Zhu, Cuitao Wei, Ning Li, Zhongjie Wang, Hanxin South Cent Univ Nationalities Coll Elect & Informat Engn Hubei Key Lab Intelligent Wireless Commun Wuhan Peoples R China

ISBN: (纸本)9783030061616;9783030061609

In this paper, we propose a two stage multiuser detection scheme: a linear pre-filtering and iteration removal based message passing algorithm (RM-MPA). As the first stage of the proposed detection, a linear pre-filtering based on Richardson method is proposed to avoid the complicated matrix inversion in an iterative way. Meanwhile, we also present a sub-optimum relaxation parameter to Richardson for lower-complexity. Then the RM-MPA is used for multiuser decoding, which compared the decoding advantages of users and sorted users according to decoding advantages. After the each iteration, the users with higher decoding advantages directly are decoded and removed. The removed users do not participate in the subsequent iterations, therefore, the complexity of subsequent iterations decrease gradually. Simulation results show that the proposed two stages multiuser detection can significantly reduce the computational complexity with better symbol error rate performance.

关键词： Massive MIMO Non-orthogonal multiple access message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：