arXiv subjects

Lajos Hanzo

Publications and source records attributed to Lajos Hanzo.

At least 307 records · Page 17Linked to original sources

arXiv2019

On the Performance Gain of NOMA over OMA in Uplink Communication Systems

In this paper, we investigate and reveal the ergodic sum-rate gain (ESG) of non-orthogonal multiple access (NOMA) over orthogonal multiple access (OMA) in uplink cellular communication systems. A base station equipped with a single-antenna, with multiple antennas, and with massive antenna arrays is considered both in single-cell and multi-cell deployments. In particular, in single-antenna systems, we identify two types of gains brought about by NOMA: 1) a large-scale near-far gain arising from the distance discrepancy between the base station and users; 2) a small-scale fading gain originating from the multipath channel fading. Furthermore, we reveal that the large-scale near-far gain increases with the normalized cell size, while the small-scale fading gain is a constant, given by $γ$ = 0.57721 nat/s/Hz, in Rayleigh fading channels. When extending single-antenna NOMA to $M$-antenna NOMA, we prove that both the large-scale near-far gain and small-scale fading gain achieved by single-antenna NOMA can be increased by a factor of $M$ for a large number of users. Moreover, given a massive antenna array at the base station and considering a fixed ratio between the number of antennas, $M$, and the number of users, $K$, the ESG of NOMA over OMA increases linearly with both $M$ and $K$. We then further extend the analysis to a multi-cell scenario. Compared to the single-cell case, the ESG in multi-cell systems degrades as NOMA faces more severe inter-cell interference due to the non-orthogonal transmissions. Besides, we unveil that a large cell size is always beneficial to the ergodic sum-rate performance of NOMA in both single-cell and multi-cell systems. Numerical results verify the accuracy of the analytical results derived and confirm the insights revealed about the ESG of NOMA over OMA in different scenarios.

cs.IT↗

arXiv2018

Boosting Fronthaul Capacity: Global Optimization of Power Sharing for Centralized Radio Access Network

The limited fronthaul capacity imposes a challenge on the uplink of centralized radio access network (C-RAN). We propose to boost the fronthaul capacity of massive multiple-input multiple-output (MIMO) aided C-RAN by globally optimizing the power sharing between channel estimation and data transmission both for the user devices (UDs) and the remote radio units (RRUs). Intuitively, allocating more power to the channel estimation will result in more accurate channel estimates, which increases the achievable throughput. However, increasing the power allocated to the pilot training will reduce the power assigned to data transmission, which reduces the achievable throughput. In order to optimize the powers allocated to the pilot training and to the data transmission of both the UDs and the RRUs, we assign an individual power sharing factor to each of them and derive an asymptotic closed-form expression of the signal-to-interference-plus-noise for the massive MIMO aided C-RAN consisting of both the UD-to-RRU links and the RRU-to-baseband unit (BBU) links. We then exploit the C-RAN architecture's central computing and control capability for jointly optimizing the UDs' power sharing factors and the RRUs' power sharing factors aiming for maximizing the fronthaul capacity. Our simulation results show that the fronthaul capacity is significantly boosted by the proposed global optimization of the power allocation between channel estimation and data transmission both for the UDs and for their host RRUs. As a specific example of 32 receive antennas (RAs) deployed by RRU and 128 RAs deployed by BBU, the sum-rate of 10 UDs achieved with the optimal power sharing factors improves 33\% compared with the one attained without optimizing power sharing factors.

cs.IT↗

arXiv2018

Unified Framework of KKT Conditions Based Matrix Optimizations for MIMO Communications

For multi-input multi-output (MIMO) communication systems, many transceiver design problems involve the optimization of the covariance matrices of the transmitted signals. The derivation of the optimal solutions based on Karush-Kuhn-Tucker (KKT) conditions is a most popular method, and many results have been reported for different scenarios of MIMO systems. In this overview paper, we propose a unified framework in formulating the KKT conditions for general MIMO systems. Based on this framework, the optimal water-filling structures of the transmission covariance matrices are derived rigorously, which are applicable to a wide range of MIMO systems. Our results show that for seemingly different MIMO systems with various power constraints and objective functions, the derivations and water-filling structures for the optimal covariance matrix solutions are fundamentally the same. Thus, our unified framework and solution reveal the underlying relationships among the different water-filling structures of the covariance matrices. Furthermore, our results provide new solutions to the covariance matrix optimization of many complicated MIMO systems with multiple users and imperfect channel state information which were unknown before.

cs.IT↗

arXiv2018

Channel-Envelope Differencing Eliminates Secret Key Correlation: LoRa-Based Key Generation in Low Power Wide Area Networks

This paper presents automatic key generation for long-range wireless communications in low power wide area networks (LPWANs), employing LoRa as a case study. Differential quantization is adopted to extract a high level of randomness. Experiments conducted both in an outdoor urban environment and in an indoor environment demonstrate that this key generation technique is applicable for LPWANs, and shows that it is able to reliably generate secure keys.

cs.CR↗

arXiv2018

Learning-Aided Physical Layer Authentication as an Intelligent Process

Performance of the existing physical layer authentication schemes could be severely affected by the imperfect estimates and variations of the communication link attributes used. The commonly adopted static hypothesis testing for physical layer authentication faces significant challenges in time-varying communication channels due to the changing propagation and interference conditions, which are typically unknown at the design stage. To circumvent this impediment, we propose an adaptive physical layer authentication scheme based on machine-learning as an intelligent process to learn and utilize the complex and time-varying environment, and hence to improve the reliability and robustness of physical layer authentication. Explicitly, a physical layer attribute fusion model based on a kernel machine is designed for dealing with multiple attributes without requiring the knowledge of their statistical properties. By modeling the physical layer authentication as a linear system, the proposed technique directly reduces the authentication scope from a combined N-dimensional feature space to a single dimensional (scalar) space, hence leading to reduced authentication complexity. By formulating the learning (training) objective of the physical layer authentication as a convex problem, an adaptive algorithm based on kernel least-mean-square is then proposed as an intelligent process to learn and track the variations of multiple attributes, and therefore to enhance the authentication performance. Both the convergence and the authentication performance of the proposed intelligent authentication process are theoretically analyzed. Our simulations demonstrate that our solution significantly improves the authentication performance in time-varying environments.

cs.CR↗

arXiv2018

Non-Orthogonal Multiple Access for 5G and Beyond

Driven by the rapid escalation of the wireless capacity requirements imposed by advanced multimedia applications (e.g., ultra-high-definition video, virtual reality etc.), as well as the dramatically increasing demand for user access required for the Internet of Things (IoT), the fifth generation (5G) networks face challenges in terms of supporting large-scale heterogeneous data traffic. Non-orthogonal multiple access (NOMA), which has been recently proposed for the 3rd generation partnership projects long-term evolution advanced (3GPP-LTE-A), constitutes a promising technology of addressing the above-mentioned challenges in 5G networks by accommodating several users within the same orthogonal resource block. By doing so, significant bandwidth efficiency enhancement can be attained over conventional orthogonal multiple access (OMA) techniques. This motivated numerous researchers to dedicate substantial research contributions to this field. In this context, we provide a comprehensive overview of the state-of-the-art in power-domain multiplexing aided NOMA, with a focus on the theoretical NOMA principles, multiple antenna aided NOMA design, on the interplay between NOMA and cooperative transmission, on the resource control of NOMA, on the co-existence of NOMA with other emerging potential 5G techniques and on the comparison with other NOMA variants. We highlight the main advantages of power-domain multiplexing NOMA compared to other existing NOMA techniques. We summarize the challenges of existing research contributions of NOMA and provide potential solutions. Finally, we offer some design guidelines for NOMA systems and identify promising research opportunities for the future.

cs.IT↗

arXiv2018

Regularized Zero-Forcing Precoding Aided Adaptive Coding and Modulation for Large-Scale Antenna Array Based Air-to-Air Communications

We propose a regularized zero-forcing transmit precoding (RZF-TPC) aided and distance-based adaptive coding and modulation (ACM) scheme to support aeronautical communication applications, by exploiting the high spectral efficiency of large-scale antenna arrays and link adaption. Our RZF-TPC aided and distance-based ACM scheme switches its mode according to the distance between the communicating aircraft. We derive the closed-form asymptotic signal-to-interference-plus-noise ratio (SINR) expression of the RZF-TPC for the aeronautical channel, which is Rician, relying on a non-centered channel matrix that is dominated by the deterministic line-of-sight component. The effects of both realistic channel estimation errors and of the co-channel interference are considered in the derivation of this approximate closed-form SINR formula. Furthermore, we derive the analytical expression of the optimal regularization parameter that minimizes the mean square detection error. The achievable throughput expression based on our asymptotic approximate SINR formula is then utilized as the design metric for the proposed RZF-TPC aided and distance-based ACM scheme. Monte-Carlo simulation results are presented for validating our theoretical analysis as well as for investigating the impact of the key system parameters. The simulation results closely match the theoretical results. In the specific example that two communicating aircraft fly at a typical cruising speed of 920 km/h, heading in opposite direction over the distance up to 740 km taking a period of about 24 minutes, the RZF-TPC aided and distance-based ACM is capable of transmitting a total of 77 Gigabyte of data with the aid of 64 transmit antennas and 4 receive antennas, which is significantly higher than that of our previous eigen-beamforming transmit precoding aided and distance-based ACM benchmark.

cs.IT↗

arXiv2018

Robust Beamforming Design in a NOMA Cognitive Radio Network Relying on SWIPT

This paper studies a multiple-input single-output non-orthogonal multiple access cognitive radio network relying on simultaneous wireless information and power transfer. A realistic non-linear energy harvesting model is applied and a power splitting architecture is adopted at each secondary user (SU). Since it is difficult to obtain perfect channel state information (CSI) in practice, instead either a bounded or gaussian CSI error model is considered. Our robust beamforming and power splitting ratio are jointly designed for two problems with different objectives, namely that of minimizing the transmission power of the cognitive base station and that of maximizing the total harvested energy of the SUs, respectively. The optimization problems are challenging to solve, mainly because of the non-linear structure of the energy harvesting and CSI errors models. We converted them into convex forms by using semi-definite relaxation. For the minimum transmission power problem, we obtain the rank-2 solution under the bounded CSI error model, while for the maximum energy harvesting problem, a two-loop procedure using a one-dimensional search is proposed. Our simulation results show that the proposed scheme significantly outperforms its traditional orthogonal multiple access counterpart. Furthermore, the performance using the gaussian CSI error model is generally better than that using the bounded CSI error model.

eess.SP↗

arXiv2018

Differential Evolution Algorithm Aided Turbo Channel Estimation and Multi-User Detection for G.Fast Systems in the Presence of FEXT

The ever-increasing demand for broadband Internet access has motivated the further development of the digital subscriber line to the G.fast standard in order to expand its operational band from 106 MHz to 212 MHz. Conventional far-end crosstalk (FEXT) based cancellers falter in the upstream transmission of this emerging G.fast system. In this paper, we propose a novel differential evolution algorithm (DEA) aided turbo channel estimation (CE) and multi-user detection (MUD) scheme for the G.fast upstream including the frequency band up to 212 MHz, which is capable of approaching the optimal Cramer-Rao lower bound of the channel estimate, whilst approaching the optimal maximum likelihood (ML) MUD's performance associated with perfect channel state information, and yet only imposing about 5% of its computational complexity. Explicitly, the turbo concept is exploited by iteratively exchanging information between the continuous value-based DEA assisted channel estimator and the discrete value-based DEA MUD. Our extensive simulations show that 18 dB normalized mean square error gain is attained by the channel estimator and 10 dB signal-to-noise ratio gain can be achieved by the MUD upon exploiting this iteration gain. We also quantify the influence of the CE error, of the copper length and of the impulse noise. Our study demonstrates that the proposed DEA aided turbo CE and MUD scheme is capable of offering near-capacity performance at an affordable complexity for the emerging G.fast systems.

cs.IT↗

arXiv2018

Power-and Rate-Adaptation Improves the Effective Capacity of C-RAN for Nakagami-$m$ Fading Channels

We propose a power-and rate-adaptation scheme for cloud radio access networks (C-RANs), where each radio remote head (RRH) is connected to the baseband unit (BBU) pool through optical links. The RRHs jointly support the users by efficiently exploiting the enhanced spatial degrees of freedom. Our proposed scheme aims for maximizing the effective capacity (EC) of the user subject to both per-RRH average-and peak-power constraints, where the EC is defined as the maximum arrival rate that can be supported by the C-RAN under the statistical delay requirement. We first transform the EC maximization problem into an equivalent convex optimization problem. By using the Lagrange dual decomposition method and solving the Karush-Kuhn-Tucker (KKT) equations, the optimal transmission power of each RRH can be obtained in closed-form. Furthermore, an online tracking method is provided for approximating the average power of each RRH for the sake of updating the Lagrange dual variables. For the special case of two RRHs, the expression of the average power of each RRH can be calculated in explicit form. Hence, the Lagrange dual variables can be computed in advance in this special case. Furthermore, we derive the power allocation for two important extreme cases: 1) no delay constraint; 2) extremely stringent delay-requirements. Our simulation results show that the proposed scheme significantly outperforms the conventional algorithm without considering the delay requirements. Furthermore, when appropriately tuning the value of the delay exponent, our proposed algorithm is capable of guaranteeing a delay outage probability below $10^{-9}$ when the maximum tolerable delay is 1 ms. This is suitable for the future ultra-reliable low latency communications (URLLC).

cs.IT↗

arXiv2018

Robust Beamforming Design for Ultra-dense User-Centric C-RAN in the Face of Realistic Pilot Contamination and Limited Feedback

The ultra-dense cloud radio access network (UD-CRAN), in which remote radio heads (RRHs) are densely deployed in the network, is considered. To reduce the channel estimation overhead, we focus on the design of robust transmit beamforming for user-centric frequency division duplex (FDD) UD-CRANs, where only limited channel state information (CSI) is available. Specifically, we conceive a complete procedure for acquiring the CSI that includes two key steps: channel estimation and channel quantization. The phase ambiguity (PA) is also quantized for coherent cooperative transmission. Based on the imperfect CSI, we aim for optimizing the beamforming vectors in order to minimize the total transmit power subject to users' rate requirements and fronthaul capacity constraints. We derive the closed-form expression of the achievable data rate by exploiting the statistical properties of multiple uncertain terms. Then, we propose a low-complexity iterative algorithm for solving this problem based on the successive convex approximation technique. In each iteration, the Lagrange dual decomposition method is employed for obtaining the optimal beamforming vector. Furthermore, a pair of low-complexity user selection algorithms are provided to guarantee the feasibility of the problem. Simulation results confirm the accuracy of our robust algorithm in terms of meeting the rate requirements. Finally, our simulation results verify that using a single bit for quantizing the PA is capable of achieving good performance.

eess.SP↗

arXiv2018

Quantum-aided Multi-Objective Routing Optimization Using Back-Tracing-Aided Dynamic Programming

Pareto optimality is capable of striking the optimal trade-off amongst the diverse conflicting QoS requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multi-objective search-space. We will demonstrate that the powerful quantum-assisted dynamic programming optimization framework is capable of circumventing this problem. In this context, the so-called Evolutionary Quantum Pareto Optimization (EQPO) algorithm has been proposed, which is capable of identifying most of the optimal routes at a near-polynomial complexity versus the number of nodes. As a benefit, we improve both the the EQPO algorithm by introducing a back-tracing process. We also demonstrate that the improved algorithm, namely the Back-Tracing-Aided EQPO (BTA-EQPO) algorithm, imposes a negligible complexity overhead, while substantially improving our performance metrics, namely the relative frequency of finding all Pareto-optimal solutions and the probability that the Pareto-optimal solutions are indeed part of the optimal Pareto front

quant-ph↗

arXiv2018

On Low-Resolution ADCs in Practical 5G Millimeter-Wave Massive MIMO Systems

Nowadays, millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems is a favorable candidate for the fifth generation (5G) cellular systems. However, a key challenge is the high power consumption imposed by its numerous radio frequency (RF) chains, which may be mitigated by opting for low-resolution analog-to-digital converters (ADCs), whilst tolerating a moderate performance loss. In this article, we discuss several important issues based on the most recent research on mmWave massive MIMO systems relying on low-resolution ADCs. We discuss the key transceiver design challenges including channel estimation, signal detector, channel information feedback and transmit precoding. Furthermore, we introduce a mixed-ADC architecture as an alternative technique of improving the overall system performance. Finally, the associated challenges and potential implementations of the practical 5G mmWave massive MIMO system {with ADC quantizers} are discussed.

cs.IT↗

arXiv2018

50 Years of Permutation, Spatial and Index Modulation: From Classic RF to Visible Light Communications and Data Storage

In this treatise, we provide an interdisciplinary survey on spatial modulation (SM), where multiple-input multiple-output microwave and visible light, as well as single and multicarrier communications are considered. Specifically, we first review the permutation modulation (PM) concept, which was originally proposed by Slepian in 1965. The PM concept has been applied to a wide range of applications, including wired and wireless communications and data storage. By introducing a three-dimensional signal representation, which consists of spatial, temporal and frequency axes, the hybrid PM concept is shown to be equivalent to the recently proposed SM family. In contrast to other survey papers, this treatise aims for celebrating the hitherto overlooked studies, including papers and patents that date back to the 1960s, before the invention of SM. We also provide simulation results that demonstrate the pros and cons of PM-aided low-complexity schemes over conventional multiplexing schemes.

eess.SP↗

arXiv2018

Artificial Noise Aided Secure Cognitive Beamforming for Cooperative MISO-NOMA Using SWIPT

Cognitive radio (CR) and non-orthogonal multiple access (NOMA) have been deemed two promising technologies due to their potential to achieve high spectral efficiency and massive connectivity. This paper studies a multiple-input single-output NOMA CR network relying on simultaneous wireless information and power transfer (SWIPT) conceived for supporting a massive population of power limited battery-driven devices. In contrast to most of the existing works, which use an ideally linear energy harvesting model, this study applies a more practical non-linear energy harvesting model. In order to improve the security of the primary network, an artificial-noise-aided cooperative jamming scheme is proposed. The artificial-noise-aided beamforming design problems are investigated subject to the practical secrecy rate and energy harvesting constraints. Specifically, the transmission power minimization problems are formulated under both perfect channel state information (CSI) and the bounded CSI error model. The problems formulated are non-convex, hence they are challenging to solve. A pair of algorithms either using semidefinite relaxation (SDR) or a cost function are proposed for solving these problems. Our simulation results show that the proposed cooperative jamming scheme succeeds in establishing secure communications and NOMA is capable of outperforming the conventional orthogonal multiple access in terms of its power efficiency. Finally, we demonstrate that the cost function algorithm outperforms the SDR-based algorithm.

eess.SP↗

arXiv2018

Multiple Antenna Assisted Non-Orthogonal Multiple Access

Non-orthogonal multiple access (NOMA) is potentially capable of circumventing the limitations of the classic orthogonal multiple access schemes, hence it has recently received significant research attention both in industry and academia. This article is focused on exploiting multiple antenna techniques in NOMA networks, with an emphasis on investigating the rate region of multiple-input multiple-output (MIMO)-NOMA, whist reviewing two popular multiple antennas aided NOMA structures, as well as underlining resource management problems of both single-carrier and multi-carrier MIMO-NOMA networks. This article also points out several effective methods of tackling the practical implementation constraints of multiple antenna NOMA networks. Finally, some promising open research directions are provided in context of multiple antenna aided NOMA.

cs.IT↗

arXiv2018

Satellite-Based Continuous-Variable Quantum Communications: State-of-the-Art and a Predictive Outlook

The recent launch of the Micius quantum-enabled satellite heralds a major step forward for long-range quantum communication. Using single-photon discrete-variable quantum states, this exciting new development proves beyond any doubt that all of the quantum protocols previously deployed over limited ranges in terrestrial experiments can, in fact, be translated to global distances via the use of low-orbit satellites. In this work, we survey the imminent extension of space-based quantum communication to the continuous-variable regime - the quantum regime perhaps most closely related to classical wireless communications. The CV regime offers the potential for increased communication performance and represents the next major step forward for quantum communications and the development of the global quantum internet.

quant-ph↗

arXiv2017

Adaptive Coding and Modulation for Large-Scale Antenna Array Based Aeronautical Communications in the Presence of Co-channel Interference

In order to meet the demands of `Internet above the clouds', we propose a multiple-antenna aided adaptive coding and modulation (ACM) for aeronautical communications. The proposed ACM scheme switches its coding and modulation mode according to the distance between the communicating aircraft, which is readily available with the aid of the airborne radar or the global positioning system. We derive an asymptotic closed-form expression of the signal-to-interference-plus-noise ratio (SINR) as the number of transmitting antennas tends to infinity, in the presence of realistic co-channel interference and channel estimation errors. The achievable transmission rates and the corresponding mode-switching distance-thresholds are readily obtained based on this closed-form SINR formula. Monte-Carlo simulation results are used to validate our theoretical analysis. For the specific example of 32 transmit antennas and 4 receive antennas communicating at a 5 GHz carrier frequency and using 6 MHz bandwidth, which are reused by multiple other pairs of communicating aircraft, the proposed distance-based ACM is capable of providing as high as 65.928 Mbps data rate when the communication distance is less than 25\,km.

cs.IT↗