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

International Conference on Advanced Computation and Telecommunication (ICACAT)

作者： Doneriya, Archana Panchal, Manish Lal, Jaya Dipti Shri GS Inst Technol & Sci Indore 452003 MP India

ISBN: (纸本)9781538654729

Fast and continues development Wireless communication requires enhancement of capacity of system. To improve the capacity of system multiuser multiple inputs multiple outputs (MU-MIMO) is considered. It has ability system capacity improvement without additional bandwidth. In the implementation of MU-MIMO Multi User Interference (MUI) created and this interference degrade the system performance. Thus to minimize or suppress the interference, precoding technique used before signal transmission. Due to low complexity linear precoding preferred. For the massive system dimension, an appropriate precoding algorithm designing is difficult with less computing complexity and better error rate performance simultaneously over fading channels. This paper convey sum rate performance and bit error rate (BER) performance of linear precoding techniques above fading channels with assuming that the transmitter has perfect channel state information (CSI). To valuation of the bit error rate performance, different fading surroundings namely, Rician, Nakagami, and Rayleigh fading channel distributions offered.

关键词： MU-MIMO MUI fading channel linear precoding

来源：评论

学校读者我要写书评

暂无评论

linear precoding for Fading Cognitive Multiple-Access Wiretap Channel With Finite-Alphabet Inputs

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2017年第4期66卷 3059-3070页

作者： Jin, Juening Xiao, Chengshan Tao, Meixia Chen, Wen Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Missouri Univ Sci & Technol Dept Elect & Comp Engn Rolla MO 65409 USA Shanghai Jiao Tong Univ Shanghai Key Lab Nav & Locat Based Serv Shanghai 200240 Peoples R China Guilin Univ Elect Technol Sch Elect Engn & Automat Guilin 541004 Peoples R China

We investigate the fading cognitive multiple-access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a secondary-user receiver (SR) in the presence of an eavesdropper and subject to interference threshold constraints at multiple primary-user receivers (PRs). We design linear precoders to maximize the average secrecy sum rate for a multiple-input-multiple-output (MIMO) fading CMAC-WT under finite-alphabet inputs and statistical channel state information at STs. For this nondeterministic polynomialtime NP-hard problem, we utilize an accurate approximation of the average secrecy sum rate to reduce the computational complexity and then present a two-layer algorithm by embedding the convex-concave procedure into an outer-approximation framework. The idea behind this algorithm is to reformulate the approximated average secrecy sum rate as a difference of convex functions and then generate a sequence of simpler relaxed sets to approach the nonconvex feasible set. Subsequently, we maximize the approximated average secrecy sum rate over the sequence of relaxed sets by using the convex-concave procedure. Numerical results indicate that our proposed precoding algorithm is superior to the conventional Gaussian precoding method in the medium and high signal-to-noise ratio (SNR) regimes.

关键词： Cognitive multiple-access wiretap channel (CMAC-WT) finite-alphabet inputs linear precoding multiple-input multiple-output (MIMO) physical-layer security statistical channel state information (CSI)

来源：评论

学校读者我要写书评

暂无评论

Blind Channel Estimation Based linear precoding using MIMO-OFCDM

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第4期97卷 5969-5981页

作者： Sujitha, J. Baskaran, K. Sri Ramakrishna Engn Coll Elect & Commun Engn Dept Coimbatore Tamil Nadu India Govt Coll Technol Dept Elect Engn Coimbatore Tamil Nadu India

MIMO-OFCDM is one of the emerging wireless communication technologies which provide very high data rate transmission with multicarrier modulation technique. OFCDM utilizes spatial diversity method that uses many transmitters and receivers to transmit more than one data in the same frequency at the same time. This paper proposes blind channel estimation based on linear precoding (LP) approach for 2 by 2 MIMO-OFCDM broadband communication system. The uniqueness of the proposed method is to estimate the channel response in blind fashion and minimize the BER in MIMO-OFCDM. linear precoding based blind channel estimation is implemented to estimate the performance of the MIMO-OFCDM for various parameters including different number of users, three different modulations such as BPSK, QPSK and 16 QAM, two types of Spreading Factors over AWGN and Rayleigh channels. The system performance is then compared with the other existing methods. It is found that the blind channel estimation provides better performance with minimum BER. It also suggests that the LP based blind channel estimation in MIMO OFCDM system outperforms with QPSK modulation with more users and high spreading factor over Rayleigh channel.

关键词： Blind channel estimation linear precoding Spreading factor MIMO OFCDM Walsh-Hadamard code

来源：评论

学校读者我要写书评

暂无评论

Generalized Quadratic Matrix Programming: A Unified Framework for linear precoding With Arbitrary Input Distributions

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2017年第18期65卷 4887-4901页

作者： Jin, Juening Zheng, Yahong Rosa Chen, Wen Xiao, Chengshan Missouri Univ Sci & Technol Rolla MO 65409 USA Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Missouri Univ Sci & Technol Dept Elect & Comp Engn Rolla MO 65409 USA Shanghai Jiao Tong Univ Shanghai Key Lab Nav & Locat Based Serv Shanghai 200240 Peoples R China Guilin Univ Elect Technol Sch Elect Engn & Automat Guilin 541004 Peoples R China

This paper investigates a new class of nonconvex optimization, which provides a unified framework for linear precoding in single/multiuser multiple-input multiple-output channels with arbitrary input distributions. The new optimization is called generalized quadratic matrix programming (GQMP). Due to the nondeterministic polynomial time hardness of GQMP problems, instead of seeking globally optimal solutions, we propose an efficient algorithm that is guaranteed to converge to a Karush-Kuhn-Tucker point. The idea behind this algorithm is to construct explicit concave lower bounds for nonconvex objective and constraint functions, and then solve a sequence of concave maximization problems until convergence. In terms of application, we consider a downlink underlay secure cognitive radio network, where each node has multiple antennas. We design linear precoders to maximize the average secrecy (sum) rate with finite-alphabet inputs and statistical channel state information at the transmitter. The precoding problems under secure multicast/broadcast scenarios are GQMP problems, and thus, they can be solved efficiently by our proposed algorithm. Several numerical examples are provided to show the efficacy of our algorithm.

关键词： Generalized quadratic matrix programming non-convex optimization MIMO linear precoding secrecy sum rate maximization arbitrary input distributions

来源：评论

学校读者我要写书评

暂无评论

linear precoding based on polynomial expansion: reducing complexity in massive MIMO

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2016年第1期2016卷 63页

作者： Mueller, Axel Kammoun, Abla Bjornson, Emil Debbah, Merouane Huawei Technol Co Ltd France Res Ctr Math & Algorithm Sci Lab Arcs Seine Batiment A20 Quai Point Jour F-92100 Boulogne France SUPELEC Alcatel Lucent Flexible Radio 3 Rue Joliot Curie F-91190 Gif Sur Yvette France King Abdullah Univ Sci & Technol Thuwal 239556900 Makkah Province Saudi Arabia Linkoping Univ Dept Elect Engn SE-58183 Linkoping Sweden

Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal non-linear precoding are solved more or less automatically by enlarging system dimensions. However, the computational precoding complexity grows with the system dimensions. For example, the close-to-optimal and relatively "antenna-efficient" regularized zero-forcing (RZF) precoding is very complicated to implement in practice, since it requires fast inversions of large matrices in every coherence period. Motivated by the high performance of RZF, we propose to replace the matrix inversion and multiplication by a truncated polynomial expansion (TPE), thereby obtaining the new TPE precoding scheme which is more suitable for real-time hardware implementation and significantly reduces the delay to the first transmitted symbol. The degree of the matrix polynomial can be adapted to the available hardware resources and enables smooth transition between simple maximum ratio transmission and more advanced RZF. By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.

关键词： Massive MIMO linear precoding Multiuser systems Polynomial expansion Random matrix theory

来源：评论

学校读者我要写书评

暂无评论

linear precoding Gain for Large MIMO Configurations With QAM and Reduced Complexity

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第10期64卷 4196-4208页

作者： Ketseoglou, Thomas Ayanoglu, Ender Calif State Polytech Univ Pomona Elect & Comp Engn Dept Pomona CA 91768 USA Univ Calif Irvine Dept Elect Engn & Comp Sci Ctr Pervas Commun & Comp Irvine CA 92697 USA

In this paper, the problem of designing a linear precoder for multiple-input multiple-output (MIMO) systems in conjunction with quadrature amplitude modulation (QAM) is addressed. First, a novel and efficient methodology to evaluate the input-output mutual information for a general MIMO system as well as its corresponding gradients is presented, based on the Gauss-Hermite quadrature rule. Then, the method is exploited in a block coordinate gradient ascent optimization process to determine the globally optimal linear precoder with respect to the MIMO input-output mutual information for QAM systems with relatively moderate MIMO channel sizes. The proposed methodology is next applied in conjunction with the complexity-reducing per-group processing technique to both perfect channel state information (CSI) at the transmitter as well as statistical CSI (Statistical CSI) scenarios, with large transmitting and receiving antenna sizes, and for constellation size up to M = 64. We show by the numerical results that the precoders developed offer significantly better performance than the configuration with no precoder as well as the maximum diversity precoder for QAM with constellation sizes M = 16, 32, and 64 and for MIMO channel size up to 100 x 100.

关键词： linear precoding MIMO mutual information quadrature amplitude modulation

来源：评论

学校读者我要写书评

暂无评论

Robust Interference Management via linear precoding and linear/Non-linear Equalization

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2016年第2期83卷 133-149页

作者： Park, Seok-Hwan Fouladgar, Ali M. Elkourdi, Tariq Simeone, Osvaldo Sahin, Onur Shamai (Shitz), Shlomo Chonbuk Natl Univ Jeonju Si 561756 Jeonbuk South Korea New Jersey Inst Technol Proc Res CWCSPR ECE Dept Ctr Wireless Commun & Signal Newark NJ 07102 USA InterDigital Inc Melville NY 11747 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

This work studies the robust design of linear precoding and linear/ non-linear equalization for multi-cell MIMO systems in the presence of imperfect channel state information (CSI). A worst-case design approach is adopted whereby the CSI error is assumed to lie within spherical sets of known radius. First, the optimal robust design of linear precoders is tackled for a MIMO interference broadcast channel (MIMO-IBC) with general unicast/multicast messages in each cell and operating over multiple time-frequency resources. This problem is formulated as the maximization of the worst-case sum-rate assuming optimal detection at the mobile stations (MSs). Then, symbol-by-symbol non-linear equalization at the MSs is considered. In this case, the problem of jointly optimizing linear precoding and decision-feedback (DF) equalization is investigated for a MIMO interference channel (MIMO-IC) with the goal of minimizing the worst-case sum-mean squared error (MSE). Both problems are addressed by proposing iterative algorithms with descent properties. The algorithms are also shown to be implementable in a distributed fashion on processors that have only local and partial CSI by means of the Alternating Direction Method of Multipliers (ADMM). From numerical results, it is shown that the proposed robust solutions significantly improve over conventional non-robust schemes in terms of sum-rate or symbol error rate. Moreover, it is seen that the proposed joint design of linear precoding and DF equalization outperforms existing separate solutions.

关键词： Multi-cell MIMO linear precoding Sum-rate maximization Robust optimization Bounded uncertainty Decision-feedback equalization ADMM

来源：评论

学校读者我要写书评

暂无评论

linear precoding Game for MIMO MAC With Dynamic Access Point Selection

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2015年第2期4卷 153-156页

作者： Mai, Ruikai Nguyen, Duy H. N. Le-Ngoc, Tho McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 0E9 Canada

This paper examines a non-cooperative game in pre-coding design for MIMO multiple-access channels with dynamic access point (AP) selection. This game is first shown to be a potential game, where the potential function is the sum rate achieved by successive interference cancellation. Due to the mixed-integer nature of the optimization variable, it is challenging to directly characterize the maximum of the potential function, which are closely related to the Nash equilibrium (NE) of the game. Instead, we establish the existence and achievability of the maximum through non-decreasing and upperbounded properties of the potential function as a direct result of our proposed update scheme. A distributed algorithm is designed where each player selfishly optimizes its AP selection and linear precoding strategy in a sequential manner. Convergence is a by-product of the established properties of the potential function which are materialized by an iterative waterfilling algorithm. Numerical results show that the algorithm is able to reach fast convergence and provides a system sum rate nearing that of the optimal centralized solution.

关键词： Resource allocation access point selection linear precoding potential games MIMO-OFDM

来源：评论

学校读者我要写书评

暂无评论

linear precoding for the MIMO Multiple Access Channel With Finite Alphabet Inputs and Statistical CSI

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2015年第2期14卷 983-997页

作者： Wu, Yongpeng Wen, Chao-Kai Xiao, Chengshan Gao, Xiqi Schober, Robert Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China Natl Sun Yat Sen Univ Inst Commun Engn Kaohsiung 804 Taiwan Missouri Univ Sci & Technol Dept Elect & Comp Engn Rolla MO 65409 USA Univ Erlangen Nurnberg Inst Digital Commun D-91058 Erlangen Germany

In this paper, we investigate the design of linear precoders for the multiple-input-multiple-output (MIMO) multiple access channel (MAC). We assume that statistical channel state information (CSI) is available at the transmitters and consider the problem under the practical finite alphabet input assumption. First, we derive an asymptotic (in the large system limit) expression for the weighted sum rate (WSR) of the MIMO MAC with finite alphabet inputs and Weichselberger's MIMO channel model. Subsequently, we obtain the optimal structures of the linear precoders of the users maximizing the asymptotic WSR and an iterative algorithm for determining the precoders. We show that the complexity of the proposed precoder design is significantly lower than that of MIMO MAC precoders designed for finite alphabet inputs and instantaneous CSI. Simulation results for finite alphabet signaling indicate that the proposed precoder achieves significant performance gains over existing precoder designs.

关键词： Finite alphabet linear precoding MIMO MAC statistical CSI

来源：评论

学校读者我要写书评

暂无评论

Multicast linear precoding for MIMO-OFDM Systems

引用

IEEE COMMUNICATIONS LETTERS 2015年第6期19卷 993-996页

作者： Joung, Jingon Hieu Duy Nguyen Tan, Peng Hui Sun, Sumei ASTAR Inst Infocomm Res I2R Singapore 138632 Singapore

Multiple-input multiple-output (MIMO) orthogonal-frequency division multiplexing (OFDM) multicasting system is considered. For a real-time multicast MIMO-OFDM system, we propose a non-iterative and simple linear precoding that consists of a linear sum (LS) of the corresponding channels. Through numerical results, we show that a minimum user rate of the proposed LS precoding is almost identical to its performance upper bound, which can be obtained through max-min rate maximization.

关键词： Multicast linear precoding multiple-input multiple-output (MIMO) orthogonal-frequency division multiplexing (OFDM)

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：