arXiv subjects

Björn Ottersten

Publications and source records attributed to Björn Ottersten.

At least 91 records · Page 5Linked to original sources

arXiv2021

User Scheduling and Power Allocation for Precoded Multi-Beam High Throughput Satellite Systems with Individual Quality of Service Constraints

For extensive coverage areas, multi-beam high throughput satellite (MB-HTS) communication is a promising technology that plays a crucial role in delivering broadband services to many users with diverse Quality of Service (QoS) requirements. This paper focuses on MB-HTS systems where all beams reuse the same spectrum. In particular, we propose a novel user scheduling and power allocation design capable of providing guarantees in terms of the individual QoS requirements while maximizing the system throughput under a limited power budget. Precoding is employed in the forward link to mitigate mutual interference at the users in multiple-access scenarios over different coherence time intervals. The combinatorial optimization structure from user scheduling requires an extremely high cost to obtain the global optimum even when a reduced number of users fit into a time slot. Therefore, we propose a heuristic algorithm yielding good trade-off between performance and computational complexity, applicable to a static operation framework of geostationary (GEO) satellite networks. Although the power allocation optimization is signomial programming, non-convex on a standard form, the solution can be lower bounded by the global optimum of a geometric program with a hidden convex structure. A local solution to the joint user scheduling and power allocation problem is consequently obtained by a successive optimization approach. Numerical results demonstrate the effectiveness of our algorithms on large-scale systems by providing better QoS satisfaction combined with outstanding overall system throughput.

cs.IT↗

arXiv2021

RIS and Cell-Free Massive MIMO: A Marriage For Harsh Propagation Environments

This paper considers Cell-Free Massive Multiple Input Multiple Output (MIMO) systems with the assistance of an RIS for enhancing the system performance. Distributed maximum-ratio combining (MRC) is considered at the access points (APs). We introduce an aggregated channel estimation method that provides sufficient information for data processing. The considered system is studied by using asymptotic analysis which lets the number of APs and/or the number of RIS elements grow large. A lower bound for the channel capacity is obtained for a finite number of APs and engineered scattering elements of the RIS, and closed-form expression for the uplink ergodic net throughput is formulated. In addition, a simple scheme for controlling the configuration of the RIS scattering elements is proposed. Numerical results verify the effectiveness of the proposed system design and the benefits of using RISs in Cell-Free Massive MIMO systems are quantified.

cs.IT↗

arXiv2021

Uplink Power Control in Massive MIMO with Double Scattering Channels

Massive multiple-input multiple-output (MIMO) is a key technology for improving the spectral and energy efficiency in 5G-and-beyond wireless networks. For a tractable analysis, most of the previous works on Massive MIMO have been focused on the system performance with complex Gaussian channel impulse responses under rich-scattering environments. In contrast, this paper investigates the uplink ergodic spectral efficiency (SE) of each user under the double scattering channel model. We derive a closed-form expression of the uplink ergodic SE by exploiting the maximum ratio (MR) combining technique based on imperfect channel state information. We further study the asymptotic SE behaviors as a function of the number of antennas at each base station (BS) and the number of scatterers available at each radio channel. We then formulate and solve a total energy optimization problem for the uplink data transmission that aims at simultaneously satisfying the required SEs from all the users with limited data power resource. Notably, our proposed algorithms can cope with the congestion issue appearing when at least one user is served by lower SE than requested. Numerical results illustrate the effectiveness of the closed-form ergodic SE over Monte-Carlo simulations. Besides, the system can still provide the required SEs to many users even under congestion.

cs.IT↗

arXiv2021

Reconfigurable Intelligent Surface-Assisted Massive MIMO: Favorable Propagation, Channel Hardening, and Rank Deficiency

Massive multiple-input multiple-output (MIMO) and reconfigurable intelligent surface (RIS) are two promising technologies for 5G-and-beyond wireless networks, capable of providing large array gain and multiuser spatial multiplexing. Without requiring additional frequency bands, those technologies offer significant improvements in both spectral and energy efficiency by simultaneously serving many users. The performance analysis of an RIS-assisted Massive MIMO system as a function of the channel statistics relies heavily on fundamental properties including favorable propagation, channel hardening, and rank deficiency. The coexistence of both direct and indirect links results in aggregated channels, whose properties are the main concerns of this lecture note. For practical systems with a finite number of antennas and scattering elements of the RIS, we evaluate the corresponding deterministic metrics with Rayleigh fading channels as a typical example.

cs.IT↗

arXiv2021

Simultaneous Control Information and Power Transmission for Reconfigurable Intelligent Surfaces

Reconfigurable intelligent surfaces (RISs) are planar structures with attached electronic circuitry that enable a partially programmable communication environment. RIS operation can be regarded as nearly passive since it acts by simply reflecting the impinging traveling waves towards desired directions, thus requiring energy only for the reconfiguration of its reflective elements (REs). This paper tackles the problem of wirelessly powering RIS circuitry via control signaling. Simultaneous wireless information and power transfer (SWIPT) is considered by taking into account two basic principles: that signal quality of the control signals is sufficient for information detection, and that there is enough harvested energy for the reconfiguration. Some of the most common SWIPT receivers (time sharing, power splitting, dynamic power splitting, and antenna selection) are studied and the corresponding proposed optimization problems implementing the aforementioned principles are formulated and solved in closed form. Numerical results show the effectiveness of the proposed methods in the presence of received power fluctuations.

cs.IT↗

arXiv2021

Frequency-packed Faster-than-Nyquist Signaling via Symbol-level Precoding for Multi-user MISO Redundant Transmissions

This work addresses the issue of interference generated by co-channel users in downlink multi-antenna multicarrier systems with frequency-packed faster-than-Nyquist (FTN) signaling. The resulting interference stems from an aggressive strategy for enhancing the throughput via frequency reuse across different users and the squeezing of signals in the time-frequency plane beyond the Nyquist limit. The error-free spectral efficiency is proved to be increasing with the frequency packing and FTN acceleration factors. The lower bound for the FTN sampling period that guarantees information losslesness is derived as a function of the transmitting-filter roll-off factor, the frequency-packing factor, and the number of subcarriers. Space-time-frequency symbol-level precoders (SLPs) that trade off constructive and destructive interblock interference (IBI) at the single-antenna user terminals are proposed. Redundant elements are added as guard interval to cope with vestigial destructive IBI effects. The proposals can handle channels with delay spread longer than the multicarrier-symbol duration. The receiver architecture is simple, for it does not require digital multicarrier demodulation. Simulations indicate that the proposed SLP outperforms zero-forcing precoding and achieves a target balance between spectral and energy efficiencies by controlling the amount of added redundancy from zero (full IBI) to half (destructive IBI-free) the group delay of the equivalent channel.

eess.SP↗

arXiv2021

On the Secrecy Capacity of MIMO Wiretap Channels: Convex Reformulation and Efficient Numerical Methods

This paper presents novel numerical approaches to finding the secrecy capacity of the multiple-input multiple-output (MIMO) wiretap channel subject to multiple linear transmit covariance constraints, including sum power constraint, per antenna power constraints and interference power constraint. An analytical solution to this problem is not known and existing numerical solutions suffer from slow convergence rate and/or high per-iteration complexity. Deriving computationally efficient solutions to the secrecy capacity problem is challenging since the secrecy rate is expressed as a difference of convex functions (DC) of the transmit covariance matrix, for which its convexity is only known for some special cases. In this paper we propose two low-complexity methods to compute the secrecy capacity along with a convex reformulation for degraded channels. In the first method we capitalize on the accelerated DC algorithm which requires solving a sequence of convex subproblems, for which we propose an efficient iterative algorithm where each iteration admits a closed-form solution. In the second method, we rely on the concave-convex equivalent reformulation of the secrecy capacity problem which allows us to derive the so-called partial best response algorithm to obtain an optimal solution. Notably, each iteration of the second method can also be done in closed form. The simulation results demonstrate a faster convergence rate of our methods compared to other known solutions. We carry out extensive numerical experiments to evaluate the impact of various parameters on the achieved secrecy capacity.

cs.IT↗

arXiv2021

User Scheduling for Precoded Satellite Systems with Individual Quality of Service Constraints

Multibeam high throughput satellite (MB-HTS) systems will play a key role in delivering broadband services to a large number of users with diverse Quality of Service (QoS) requirements. This paper focuses on MB-HTS where the same spectrum is re-used by all user links and, in particular, we propose a novel user scheduling design capable to provide guarantees in terms of individual QoS requirements while maximizing the system throughput. This is achieved by precoding to mitigate mutual interference. The combinatorial optimization structure requires an extremely high cost to obtain the global optimum even with a reduced number of users. We, therefore, propose a heuristic algorithm yielding a good local solution and tolerable computational complexity, applicable for large-scale networks. Numerical results demonstrate the effectiveness of our proposed algorithm on scheduling many users with better sum throughput than the other benchmarks. Besides, the QoS requirements for all scheduled users are guaranteed.

cs.IT↗

arXiv2021

Satellite- and Cache-assisted UAV: A Joint Cache Placement, Resource Allocation, and Trajectory Optimization for 6G Aerial Networks

This paper considers LEO satellite- and cache-assisted UAV communications for content delivery in terrestrial networks, which shows great potential for next-generation systems to provide ubiquitous connectivity and high capacity. Specifically, caching is provided by the UAV to reduce backhaul congestion, and the LEO satellite supports the UAV's backhaul link. In this context, we aim to maximize the minimum achievable throughput per ground user (GU) by jointly optimizing cache placement, the UAV's resource allocation, and trajectory while cache capacity and flight time are limited. The formulated problem is challenging to solve directly due to its non-convexity and combinatorial nature. To find a solution, the problem is decomposed into three sub-problems: (1) cache placement optimization with fixed UAV resources and trajectory, followed by (2) the UAV resources optimization with fixed cache placement vector and trajectory, and finally, (3) we optimize the UAV trajectory with fixed cache placement and UAV resources. Based on the solutions of sub-problems, an efficient alternating algorithm is proposed utilizing the block coordinate descent (BCD) and successive convex approximation (SCA) methods. Simulation results show that the max-min throughput and total achievable throughput enhancement can be achieved by applying our proposed algorithm instead of other benchmark schemes.

cs.IT↗

arXiv2021

On the Optimality of the Stationary Solution of Secrecy Rate Maximization for MIMO Wiretap Channel

To achieve perfect secrecy in a multiple-input multiple-output (MIMO) Gaussian wiretap channel (WTC), we need to find its secrecy capacity and optimal signaling, which involves solving a difference of convex functions program known to be non-convex for the non-degraded case. To deal with this, a class of existing solutions have been developed but only local optimality is guaranteed by standard convergence analysis. Interestingly, our extensive numerical experiments have shown that these local optimization methods indeed achieve global optimality. In this paper, we provide an analytical proof for this observation. To achieve this, we show that the Karush-Kuhn-Tucker (KKT) conditions of the secrecy rate maximization problem admit a unique solution for both degraded and non-degraded cases. Motivated by this, we also propose a low-complexity algorithm to find a stationary point. Numerical results are presented to verify the theoretical analysis.

cs.IT↗

arXiv2021

Outage Probability Analysis of IRS-Assisted Systems Under Spatially Correlated Channels

This paper investigates the impact of spatial channel correlation on the outage probability of intelligent reflecting surface (IRS)-assisted single-input single-output (SISO) communication systems. In particular, we derive a novel closed-form expression of the outage probability for arbitrary phase shifts and correlation matrices of the indirect channels. To shed light on the impact of the spatial correlation, we further attain the closed-form expressions for two common scenarios met in the literature when the large-scale fading coefficients are expressed by the loss over a propagation distance. Numerical results validate the tightness and effectiveness of the closed-form expressions. Furthermore, the spatial correlation offers significant decreases in the outage probability as the direct channel is blocked.

cs.IT↗

arXiv2021

Localization with One-Bit Passive Radars in Narrowband Internet-of-Things using Multivariate Polynomial Optimization

Several Internet-of-Things (IoT) applications provide location-based services, wherein it is critical to obtain accurate position estimates by aggregating information from individual sensors. In the recently proposed narrowband IoT (NB-IoT) standard, which trades off bandwidth to gain wide coverage, the location estimation is compounded by the low sampling rate receivers and limited-capacity links. We address both of these NB-IoT drawbacks in the framework of passive sensing devices that receive signals from the target-of-interest. We consider the limiting case where each node receiver employs one-bit analog-to-digital-converters and propose a novel low-complexity nodal delay estimation method using constrained-weighted least squares minimization. To support the low-capacity links to the fusion center (FC), the range estimates obtained at individual sensors are then converted to one-bit data. At the FC, we propose target localization with the aggregated one-bit range vector using both optimal and sub-optimal techniques. The computationally expensive former approach is based on Lasserre's method for multivariate polynomial optimization while the latter employs our less complex iterative joint r\textit{an}ge-\textit{tar}get location \textit{es}timation (ANTARES) algorithm. Our overall one-bit framework not only complements the low NB-IoT bandwidth but also supports the design goal of inexpensive NB-IoT location sensing. Numerical experiments demonstrate feasibility of the proposed one-bit approach with a $0.6$\% increase in the normalized localization error for the small set of $20$-$60$ nodes over the full-precision case. When the number of nodes is sufficiently large ($>80$), the one-bit methods yield the same performance as the full precision.

eess.SP↗

arXiv2021

Efficient Numerical Methods for Secrecy Capacity of Gaussian MIMO Wiretap Channel

This paper presents two different low-complexity methods for obtaining the secrecy capacity of multiple-input multiple-output (MIMO) wiretap channel subject to a sum power constraint (SPC). The challenges in deriving computationally efficient solutions to the secrecy capacity problem are due to the fact that the secrecy rate is a difference of convex functions (DC) of the transmit covariance matrix, for which its convexity is only known for \emph{the degraded case}. In the first method, we capitalize on the accelerated DC algorithm, which requires solving a sequence of convex subproblems. In particular, we show that each subproblem indeed admits a water-filling solution. In the second method, based on the equivalent convex-concave reformulation of the secrecy capacity problem, we develop a so-called partial best response algorithm (PBRA). Each iteration of the PBRA is also done in closed form. Simulation results are provided to demonstrate the superior performance of the proposed methods.

cs.IT↗

arXiv2021

Massive MIMO under Double Scattering Channels: Power Minimization and Congestion Controls

This paper considers a massive MIMO system under the double scattering channels. We derive a closed-form expression of the uplink ergodic spectral efficiency (SE) by exploiting the maximum-ratio combining technique with imperfect channel state information. We then formulate and solve a total uplink data power optimization problem that aims at simultaneously satisfying the required SEs from all the users with limited power resources. We further propose algorithms to cope with the congestion issue appearing when at least one user is served by lower SE than requested. Numerical results illustrate the effectiveness of our proposed power optimization. More importantly, our proposed congestion-handling algorithms can guarantee the required SEs to many users under congestion, even when the SE requirement is high.

cs.IT↗

arXiv2021

Broadband Non-Geostationary Satellite Communication Systems: Research Challenges and Key Opportunities

Besides conventional geostationary (GSO) satellite broadband communication services, non-geostationary (NGSO) satellites are envisioned to support various new communication use cases from countless industries. These new scenarios bring many unprecedented challenges that will be discussed in this paper alongside with several potential future research opportunities. NGSO systems are known for various advantages, including their important features of low cost, lower propagation delay, smaller size, and lower losses in comparison to GSO satellites. However, there are still many deployment challenges to be tackled to ensure seamless integration not only with GSO systems but also with terrestrial networks. In this paper, we discuss several key challenges including satellite constellation and architecture designs, coexistence with GSO systems in terms of spectrum access and regulatory issues, resource management algorithms, and NGSO networking requirements. Additionally, the latest progress in provisioning secure communication via NGSO systems is discussed. Finally, this paper identifies multiple important open issues and research directions to inspire further studies towards the next generation of satellite networks.

eess.SP↗

arXiv2020

An Overview of Generic Tools for Information-Theoretic Secrecy Performance Analysis over Wiretap Fading Channels

An alternative or supplementary approach named as physical layer security has been proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance investigations over the classic Alice-Bob-Eve wiretap fading channels is conducted. On the basis of the classic wiretap channel model, we have comprehensively listed and thereafter compared the existing works on physical layer secrecy analysis considering the small-scale, large-scale, composite, and cascaded fading channel models. Exact secrecy metrics expressions, including secrecy outage probability (SOP), the probability of non-zero secrecy capacity (PNZ), average secrecy capacity (ASC), and secrecy bounds, including the lower bound of SOP and ergodic secrecy capacity, are presented. In order to encompass the aforementioned four kinds of fading channel models with a more generic and flexible distribution, the mixture gamma (MG), mixture of Gaussian (MoG), and Fox's $H$-function distributions are three useful candidates to largely include the above-mentioned four kinds of fading channel models. It is shown that they are flexible and general when assisting the secrecy analysis to obtain closed-form expressions. Their advantages and limitations are also highlighted. Conclusively, these three approaches are proven to provide a unified secrecy analysis framework and can cover all types of independent wiretap fading channel models. Apart from those, revisiting the existing secrecy enhancement techniques based on our system configuration, the on-off transmission scheme, jamming approach (including artificial noise (AN) & artificial fast fading (AFF)), antenna selection, and security region are presented.

cs.IT↗

arXiv2020

Secure Vehicular Communications through Reconfigurable Intelligent Surfaces

Reconfigurable intelligent surfaces (RIS) is considered as a revolutionary technique to improve the wireless system performance by reconfiguring the radio wave propagation environment artificially. Motivated by the potential of RIS in vehicular networks, we analyze the secrecy outage performance of RIS-aided vehicular communications in this paper. More specifically, two vehicular communication scenarios are considered, i.e., a vehicular-to-vehicular (V2V) communication where the RIS acts as a relay and a vehicular-to-infrastructure (V2I) scenario where the RIS functions as the receiver. In both scenarios, a passive eavesdropper is present attempting to retrieve the transmitted information. Closed-form expressions for the secrecy outage probability (SOP) are derived and verified. The results demonstrate the potential of improving secrecy with the aid of RIS under both V2V and V2I communications.

eess.SP↗

arXiv2020

Widely-distributed Radar Imaging Based on Consensus ADMM

A widely-distributed radar system is a promising architecture to enhance radar imaging performance. However, most existing algorithms rely on isotropic scattering assumption, which is only satisfied in collocated radar systems. Moreover, due to noise and imaging model imperfections, artifacts such as layovers are common in radar images. In this paper, a novel $l_1$-regularized, consensus alternating direction method of multipliers (CADMM) based algorithm is proposed to mitigate artifacts by exploiting a widely-distributed radar system's spatial diversity. By imposing the consensus constraints on the local images formed by distributed antenna clusters and solving the resulting distributed optimization problem, the scenario's spatial-invariant common features are retained. Simultaneously, the spatial-variant artifacts are mitigated, and it will finally converge to a high-quality global image in the consensus of all distributed measurements. The proposed algorithm outperforms the joint sparsity-based composite imaging (JSC) algorithm in terms of artifacts mitigation. It can also reduce the computation and storage burden of large-scale imaging problems through its distributed and parallelizable optimization scheme.

eess.SP↗