arXiv subjects

Björn Ottersten

Publications and source records attributed to Björn Ottersten.

At least 109 records · Page 6Linked to original sources

arXiv2020

Joint Constellation Rotation and Symbol-level Precoding Optimization in the Downlink of Multiuser MISO Channels

This paper tackles the problem of the simultaneous interference among the multiple users in the downlink of a wireless multiantenna system. In order to exploit the multiuser interference and transform it into useful power at the receiver side, symbol-level precoding is utilized through joint exploitation of the data from each individual user and the channel state information. This paper introduces a complexity reduction scheme that exploits the constellations symmetry to reduce the number of possible calculations and the number of constraints in the symbol-level optimization problem. This paper also proposes a new transmission technique that jointly optimizes the transmit symbol-level precoding and the constellation rotation of the data stream for each user. The purpose is to increase the probability of having constructive interference, and thus better performance. We focus on improving the energy efficiency by reducing the required power to satisfy certain quality of service constraints through solving a symbol-level precoding problem and finding the optimal phase by which each user constellation should be rotated. This problem is non-convex, therefore, we propose an efficient branch-and-bound algorithm combined with semidefinite relaxation to solve the problem and find an efficient solution. Numerical results are presented in a comparative fashion to show the effectiveness of the proposed technique, which outperforms the state-of-the-art symbol-level precoding schemes in terms of energy efficiency, and power consumption.

eess.SP↗

arXiv2020

Multi-Antenna Data-Driven Eavesdropping Attacks and Symbol-Level Precoding Countermeasures

In this work, we consider secure communications in wireless multi-user (MU) multiple-input single-output (MISO) systems with channel coding in the presence of a multi-antenna eavesdropper (Eve). In this setting, we exploit machine learning (ML) tools to design soft and hard decoding schemes by using precoded pilot symbols as training data. In this context, we propose ML frameworks for decoders that allow an Eve to determine the transmitted message with high accuracy. We thereby show that MU-MISO systems are vulnerable to such eavesdropping attacks even when relatively secure transmission techniques are employed, such as symbol-level precoding (SLP). To counteract this attack, we propose two novel SLP-based schemes that increase the bit-error rate at Eve by impeding the learning process. We design these two security-enhanced schemes to meet different requirements regarding complexity, security, and power consumption. Simulation results validate both the ML-based eavesdropping attacks as well as the countermeasures, and show that the gain in security is achieved without affecting the decoding performance at the intended users.

eess.SP↗

arXiv2020

Transfer Learning and Meta Learning Based Fast Downlink Beamforming Adaptation

This paper studies fast adaptive beamforming optimization for the signal-to-interference-plus-noise ratio balancing problem in a multiuser multiple-input single-output downlink system. Existing deep learning based approaches to predict beamforming rely on the assumption that the training and testing channels follow the same distribution which may not hold in practice. As a result, a trained model may lead to performance deterioration when the testing network environment changes. To deal with this task mismatch issue, we propose two offline adaptive algorithms based on deep transfer learning and meta-learning, which are able to achieve fast adaptation with the limited new labelled data when the testing wireless environment changes. Furthermore, we propose an online algorithm to enhance the adaptation capability of the offline meta algorithm in realistic non-stationary environments. Simulation results demonstrate that the proposed adaptive algorithms achieve much better performance than the direct deep learning algorithm without adaptation in new environments. The meta-learning algorithm outperforms the deep transfer learning algorithm and achieves near optimal performance. In addition, compared to the offline meta-learning algorithm, the proposed online meta-learning algorithm shows superior adaption performance in changing environments.

cs.IT↗

arXiv2020

Resource Optimization with Load Coupling in Multi-cell NOMA

Optimizing non-orthogonal multiple access (NOMA) in multi-cell scenarios is much more challenging than the single-cell case because inter-cell interference must be considered. Most papers addressing NOMA consider a single cell. We take a significant step of analyzing NOMA in multi-cell scenarios. We explore the potential of NOMA networks in achieving optimal resource utilization with arbitrary topologies. Towards this goal, we investigate a broad class of problems consisting in optimizing power allocation and user pairing for any cost function that is monotonically increasing in time-frequency resource consumption. We propose an algorithm that achieves global optimality for this problem class. The basic idea is to prove that solving the joint optimization problem of power allocation, user pair selection, and time-frequency resource allocation amounts to solving a so-called iterated function without a closed form. We prove that the algorithm approaches optimality with fast convergence. Numerically, we evaluate and demonstrate the performance of NOMA for multi-cell scenarios in terms of resource efficiency and load balancing.

cs.IT↗

arXiv2020

Radio Resource Management Techniques for Multibeam Satellite Systems

Next-generation of satellite communication (SatCom) networks are expected to support extremely high data rates for a seamless integration into future large satellite-terrestrial networks. In view of the coming spectral limitations, the main challenge is to reduce the cost per bit, which can only be achieved by enhancing the spectral efficiency. In addition, the capability to quickly and flexibly assign radio resources according to the traffic demand distribution has become a must for future multibeam broadband satellite systems. This article presents the radio resource management problems encountered in the design of future broadband SatComs and provides a comprehensive overview of the available techniques to address such challenges. Firstly, we focus on the demand-matching formulation of the power and bandwidth assignment. Secondly, we present the scheduling design in practical multibeam satellite systems. Finally, a number of future challenges and the respective open research topics are described.

cs.IT↗

arXiv2020

Coverage Probability and Ergodic Capacity of Intelligent Reflecting Surface-Enhanced Communication Systems

This paper studies the performance of a single-input single-output (SISO) system enhanced by the assistance of an intelligent reflecting surface (IRS), which is equipped with a finite number of elements under Rayleigh fading channels. From the instantaneous channel capacity, we compute a closed-form expression of the coverage probability as a function of statistical channel information only. A scaling law of the coverage probability and the number of phase shifts is further obtained. The ergodic capacity is derived, then a simple upper bound to simplify matters of utilizing the symbolic functions and can be applied for a long period of time. Numerical results manifest the tightness and effectiveness of our closed-form expressions compared with Monte-Carlo simulations.

cs.IT↗

arXiv2020

Reconfigurable Intelligent Surfaces for Smart Cities: Research Challenges and Opportunities

The concept of Smart Cities has been introduced as a way to benefit from the digitization of various ecosystems at a city level. To support this concept, future communication networks need to be carefully designed with respect to the city infrastructure and utilization of resources. Recently, the idea of 'smart' environment, which takes advantage of the infrastructure for better performance of wireless networks, has been proposed. This idea is aligned with the recent advances in design of reconfigurable intelligent surfaces (RISs), which are planar structures with the capability to reflect impinging electromagnetic waves toward preferred directions. Thus, RISs are expected to provide the necessary flexibility for the design of the 'smart' communication environment, which can be optimally shaped to enable cost- and energy-efficient signal transmissions where needed. Upon deployment of RISs, the ecosystem of the Smart Cities would become even more controllable and adaptable, which would subsequently ease the implementation of future communication networks in urban areas and boost the interconnection among private households and public services. In this paper, we describe our vision of the application of RISs in future Smart Cities. In particular, the research challenges and opportunities are addressed. The contribution paves the road to a systematic design of RIS-assisted communication networks for Smart Cities in the years to come.

eess.SP↗

arXiv2020

Short-Packet Communications for MIMO NOMA Systems over Nakagami-m Fading: BLER and Minimum Blocklength Analysis

Recently, ultra-reliable and low-latency communications (URLLC) using short-packets has been proposed to fulfill the stringent requirements regarding reliability and latency of emerging applications in 5G and beyond networks. In addition, multiple-input multiple-output non-orthogonal multiple access (MIMO NOMA) is a potential candidate to improve the spectral efficiency, reliability, latency, and connectivity of wireless systems. In this paper, we investigate short-packet communications (SPC) in a multiuser downlink MIMO NOMA system over Nakagami-m fading, and propose two antenna-user selection methods considering two clusters of users having different priority levels. In contrast to the widely-used long data-packet assumption, the SPC analysis requires the redesign of the communication protocols and novel performance metrics. Given this context, we analyze the SPC performance of MIMO NOMA systems using the average block error rate (BLER) and minimum blocklength, instead of the conventional metrics such as ergodic capacity and outage capacity. More specifically, to characterize the system performance regarding SPC, asymptotic (in the high signal-to-noise ratio regime) and approximate closed-form expressions of the average BLER at the users are derived. Based on the asymptotic behavior of the average BLER, an analysis of the diversity order, minimum blocklength, and optimal power allocation is carried out. The achieved results show that MIMO NOMA can serve multiple users simultaneously using a smaller blocklength compared with MIMO OMA, thus demonstrating the benefits of MIMO NOMA for SPC in minimizing the transmission latency. Furthermore, our results indicate that the proposed methods not only improve the BLER performance but also guarantee full diversity gains for the respective users.

eess.SP↗

arXiv2020

A Novel Heap-based Pilot Assignment for Full Duplex Cell-Free Massive MIMO with Zero-Forcing

This paper investigates the combined benefits of full-duplex (FD) and cell-free massive multiple-input multipleoutput (CF-mMIMO), where a large number of distributed access points (APs) having FD capability simultaneously serve numerous uplink and downlink user equipments (UEs) on the same time-frequency resources. To enable the incorporation of FD technology in CF-mMIMO systems, we propose a novel heapbased pilot assignment algorithm, which not only can mitigate the effects of pilot contamination but also reduce the involved computational complexity. Then, we formulate a robust design problem for spectral efficiency (SE) maximization in which the power control and AP-UE association are jointly optimized, resulting in a difficult mixed-integer nonconvex programming. To solve this problem, we derive a more tractable problem before developing a very simple iterative algorithm based on inner approximation method with polynomial computational complexity. Numerical results show that our proposed methods with realistic parameters significantly outperform the existing approaches in terms of the quality of channel estimate and SE.

eess.SP↗

arXiv2020

Trajectory Design for Energy Minimization in UAV-enabled Wireless Communications with Latency Constraints

This paper studies energy-efficient unmanned aerial vehicle (UAV)-enabled wireless communications, where the UAV acts as a flying base station (BS) to serve the ground users (GUs) within some predetermined latency constraints, e.g., requested timeout (RT). Our goal is to design the UAV trajectory to minimize the total energy consumption while satisfying the RT requirement and energy budget, which is accomplished via jointly optimizing the trajectory and UAV's velocities along subsequent hops. The corresponding optimization problem is difficult to solve due to its non-convexity and combinatorial nature. To overcome this difficulty, we solve the original problem via two consecutive steps. Firstly, we propose two algorithms, namely heuristic search, and dynamic programming (DP) to obtain a feasible set of trajectories without violating the GU's RT requirements based on the traveling salesman problem with time window (TSPTW). Then, they are compared with exhaustive search and traveling salesman problem (TSP) used as reference methods. While the exhaustive algorithm achieves the best performance at a high computation cost, the heuristic algorithm exhibits poorer performance with low complexity. As a result, the DP is proposed as a practical trade-off between the exhaustive and heuristic algorithms. Specifically, the DP algorithm results in near-optimal performance at a much lower complexity. Secondly, for given feasible trajectories, we propose an energy minimization problem via a joint optimization of the UAV's velocities along subsequent hops. Finally, numerical results are presented to demonstrate the effectiveness of our proposed algorithms. ...

cs.IT↗

arXiv2020

Joint Forecasting and Interpolation of Graph Signals Using Deep Learning

We tackle the problem of forecasting network-signal snapshots using past signal measurements acquired by a subset of network nodes. This task can be seen as a combination of multivariate time-series prediction and graph-signal interpolation. This is a fundamental problem for many applications wherein deploying a high granularity network is impractical. Our solution combines recurrent neural networks with frequency-analysis tools from graph signal processing, and assumes that data is sufficiently smooth with respect to the underlying graph. The proposed approach outperforms state-of-the-art deep learning techniques, especially when only a small fraction of the graph signals is accessible, considering two distinct real world datasets: temperatures in the US and speed flow in Seattle. The results also indicate that our method can handle noisy signals and missing data, making it suitable to many practical applications.

eess.SP↗

arXiv2020

Joint User Grouping, Scheduling, and Precoding for Multicast Energy Efficiency in Multigroup Multicast Systems

This paper studies the joint design of user grouping, scheduling (or admission control) and precoding to optimize energy efficiency (EE) for multigroup multicast scenarios in single-cell multiuser MISO downlink channels. Noticing that the existing definition of EE fails to account for group sizes, a new metric called multicast energy efficiency (MEE) is proposed. In this context, the joint design is considered for the maximization of MEE, EE, and scheduled users. Firstly, with the help of binary variables (associated with grouping and scheduling) the joint design problem is formulated as a mixed-Boolean fractional programming problem such that it facilitates the joint update of grouping, scheduling and precoding variables. Further, several novel optimization formulations are proposed to reveal the hidden difference of convex/ concave structure in the objective and associated constraints. Thereafter, we propose a convex-concave procedure framework based iterative algorithm for each optimization criteria where grouping, scheduling, and precoding variables are updated jointly in each iteration. Finally, we compare the performance of the three design criteria concerning three performance metrics namely MEE, EE, and scheduled users through Monte-Carlo simulations. These simulations establish the need for MEE and the improvement from the system optimization.

eess.SP↗

arXiv2020

Random Access based Reliable Uplink Communication and Power Transfer using Dynamic Power Splitting

Large communication networks, e.g. Internet of Things (IoT), are known to be vulnerable to co-channel interference. One possibility to address this issue is the use of orthogonal multiple access (OMA) techniques. However, due to a potentially very long duty cycle, OMA is not well suited for such schemes. Instead, random medium access (RMA) appears more promising. An RMA scheme is based on transmission of short data packets with random scheduling, which is typically unknown to the receiver. The received signal, which consists of the overlapping packets, can be used for energy harvesting and powering of a relay device. Such an energy harvesting relay may utilize the energy for further information processing and uplink transmission. In this paper, we address the design of a simultaneous information and power transfer scheme based on randomly scheduled packet transmissions and reliable symbol detection. We formulate a prediction problem with the goal to maximize the harvested power for an RMA scenario. In order to solve this problem, we propose a new prediction method, which shows a significant performance improvement compared to the straightforward baseline scheme. Furthermore, we investigate the complexity of the proposed method and its vulnerability to imperfect channel state information.

cs.IT↗

arXiv2020

Massive MIMO Transmission for LEO Satellite Communications

Low earth orbit (LEO) satellite communications are expected to be incorporated in future wireless networks, in particular 5G and beyond networks, to provide global wireless access with enhanced data rates. Massive MIMO techniques, though widely used in terrestrial communication systems, have not been applied to LEO satellite communication systems. In this paper, we propose a massive MIMO transmission scheme with full frequency reuse (FFR) for LEO satellite communication systems and exploit statistical channel state information (sCSI) to address the difficulty of obtaining instantaneous CSI (iCSI) at the transmitter. We first establish the massive MIMO channel model for LEO satellite communications and simplify the transmission designs via performing Doppler and delay compensations at user terminals (UTs). Then, we develop the low-complexity sCSI based downlink (DL) precoder and uplink (UL) receiver in closed-form, aiming to maximize the average signal-to-leakage-plus-noise ratio (ASLNR) and the average signal-to-interference-plus-noise ratio (ASINR), respectively. It is shown that the DL ASLNRs and UL ASINRs of all UTs reach their upper bounds under some channel condition. Motivated by this, we propose a space angle based user grouping (SAUG) algorithm to schedule the served UTs into different groups, where each group of UTs use the same time and frequency resource. The proposed algorithm is asymptotically optimal in the sense that the lower and upper bounds of the achievable rate coincide when the number of satellite antennas or UT groups is sufficiently large. Numerical results demonstrate that the proposed massive MIMO transmission scheme with FFR significantly enhances the data rate of LEO satellite communication systems. Notably, the proposed sCSI based precoder and receiver achieve the similar performance with the iCSI based ones that are often infeasible in practice.

cs.IT↗

arXiv2020

Towards Power-Efficient Aerial Communications via Dynamic Multi-UAV Cooperation

Aerial base stations (BSs) attached to unmanned aerial vehicles (UAVs) constitute a new paradigm for next-generation cellular communications. However, the flight range and communication capacity of aerial BSs are usually limited due to the UAVs' size, weight, and power (SWAP) constraints. To address this challenge, in this paper, we consider dynamic cooperative transmission among multiple aerial BSs for power-efficient aerial communications. Thereby, a central controller intelligently selects the aerial BSs navigating in the air for cooperation. Consequently, the large virtual array of moving antennas formed by the cooperating aerial BSs can be exploited for low-power information transmission and navigation, taking into account the channel conditions, energy availability, and user demands. Considering both the fronthauling and the data transmission links, we jointly optimize the trajectories, cooperation decisions, and transmit beamformers of the aerial BSs for minimization of the weighted sum of the power consumptions required by all BSs. Since obtaining the global optimal solution of the formulated problem is difficult, we propose a low-complexity iterative algorithm that can efficiently find a Karush-Kuhn-Tucker (KKT) solution to the problem. Simulation results show that, compared with several baseline schemes, dynamic multi-UAV cooperation can significantly reduce the communication and navigation powers of the UAVs to overcome the SWAP limitations, while requiring only a small increase of the transmit power over the fronthauling links.

cs.IT↗

arXiv2020

On the Spectral and Energy Efficiencies of Full-Duplex Cell-Free Massive MIMO

In-band full-duplex (FD) operation is practically more suited for short-range communications such as WiFi and small-cell networks, due to its current practical limitations on the self-interference cancellation. In addition, cell-free massive multiple-input multiple-output (CF-mMIMO) is a new and scalable version of MIMO networks, which is designed to bring service antennas closer to end user equipments (UEs). To achieve higher spectral and energy efficiencies (SE-EE) of a wireless network, it is of practical interest to incorporate FD capability into CF-mMIMO systems to utilize their combined benefits. We formulate a novel and comprehensive optimization problem for the maximization of SE and EE in which power control, access point-UE (AP-UE) association and AP selection are jointly optimized under a realistic power consumption model, resulting in a difficult class of mixed-integer nonconvex programming. To tackle the binary nature of the formulated problem, we propose an efficient approach by exploiting a strong coupling between binary and continuous variables, leading to a more tractable problem. In this regard, two low-complexity transmission designs based on zero-forcing (ZF) are proposed. Combining tools from inner approximation framework and Dinkelbach method, we develop simple iterative algorithms with polynomial computational complexity in each iteration and strong theoretical performance guaranteed. Furthermore, towards a robust design for FD CF-mMIMO, a novel heap-based pilot assignment algorithm is proposed to mitigate effects of pilot contamination. Numerical results show that our proposed designs with realistic parameters significantly outperform the well-known approaches (i.e., small-cell and collocated mMIMO) in terms of the SE and EE. Notably, the proposed ZF designs require much less execution time than the simple maximum ratio transmission/combining.

eess.SP↗

arXiv2019

Vertex Feature Encoding and Hierarchical Temporal Modeling in a Spatial-Temporal Graph Convolutional Network for Action Recognition

This paper extends the Spatial-Temporal Graph Convolutional Network (ST-GCN) for skeleton-based action recognition by introducing two novel modules, namely, the Graph Vertex Feature Encoder (GVFE) and the Dilated Hierarchical Temporal Convolutional Network (DH-TCN). On the one hand, the GVFE module learns appropriate vertex features for action recognition by encoding raw skeleton data into a new feature space. On the other hand, the DH-TCN module is capable of capturing both short-term and long-term temporal dependencies using a hierarchical dilated convolutional network. Experiments have been conducted on the challenging NTU RGB-D-60 and NTU RGB-D 120 datasets. The obtained results show that our method competes with state-of-the-art approaches while using a smaller number of layers and parameters; thus reducing the required training time and memory.

cs.CV↗

arXiv2019

Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization

In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is selected and updated by inexactly solving the original optimization problem with respect to that block variable. More precisely, a local approximation of the original optimization problem is solved. The proposed algorithm has several attractive features, namely, i) high flexibility, as the approximation function only needs to be strictly convex and it does not have to be a global upper bound of the original function; ii) fast convergence, as the approximation function can be designed to exploit the problem structure at hand and the stepsize is calculated by the line search; iii) low complexity, as the approximation subproblems are much easier to solve and the line search scheme is carried out over a properly constructed differentiable function; iv) guaranteed convergence of a subsequence to a stationary point, even when the objective function does not have a Lipschitz continuous gradient. Interestingly, when the approximation subproblem is solved by a descent algorithm, convergence of a subsequence to a stationary point is still guaranteed even if the approximation subproblem is solved inexactly by terminating the descent algorithm after a finite number of iterations. These features make the proposed algorithm suitable for large-scale problems where the dimension exceeds the memory and/or the processing capability of the existing hardware. These features are also illustrated by several applications in signal processing and machine learning, for instance, network anomaly detection and phase retrieval.

math.OC↗