Mats Bengtsson

Mats Bengtsson

Auto-generated profile, based on publicly available information

Mats Bengtsson

School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 June 2014 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
EBEmil Björnson
Emil Björnson
MBMats Bengtsson
Mats Bengtsson
BOBjorn Ottersten
Bjorn Ottersten
Transmit beamforming is a versatile technique for signal transmission from an array of antennas to one or multiple users [1]. In wireless communications, the goal is to increase the signal power at the intended user and reduce interference to nonintended users. A high signal power is achieved by transmitting the same data signal from all antennas but with different amplitudes and phases, such that the signal components add coherently at the user. Low interference is accomplished by making the signal components add destructively at nonintended users. This corresponds mathematically to designing beamforming vectors (that describe the amplitudes and phases) to have large inner products with the vectors describing the intended channels and small inner products with nonintended user channels.

15 April 2010 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
AGAlex B. Gershman
Alex B. Gershman
NSNicholas D. Sidiropoulos
Nicholas D. Sidiropoulos
SSShahram Shahbazpanahi
Shahram Shahbazpanahi
MBMats Bengtsson
Mats Bengtsson
BOBjorn Ottersten
Bjorn Ottersten
In this article, an overview of advanced convex optimization approaches to multisensor beamforming is presented, and connections are drawn between different types of optimization-based beamformers that apply to a broad class of receive, transmit, and network beamformer design problems. It is demonstrated that convex optimization provides an indispensable set of tools for beamforming, enabling rigorous formulation and effective solution of both long-standing and emerging design problems.

27 November 2012 in IEEE Communications Letters
Verified
Journal Article
Closed access
EBEmil Björnson
Emil Björnson
PZPer Zetterberg
Per Zetterberg
MBMats Bengtsson
Mats Bengtsson
BOBjorn Ottersten
Bjorn Ottersten
The capacity of ideal MIMO channels has a high-SNR slope that equals the minimum of the number of transmit and receive antennas. This letter analyzes if this result holds when there are distortions from physical transceiver impairments. We prove analytically that such physical MIMO channels have a finite upper capacity limit, for any channel distribution and SNR. The high-SNR slope thus collapses to zero. This appears discouraging, but we prove the encouraging result that the relative capacity gain of employing MIMO is at least as large as with ideal transceivers.

7 April 2014 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
NSNafiseh Shariati
Nafiseh Shariati
EBEmil Björnson
Emil Björnson
MBMats Bengtsson
Mats Bengtsson
MDMerouane Debbah
Merouane Debbah
This paper considers pilot-based channel estimation in large-scale multiple-input multiple-output (MIMO) communication systems, also known as “massive MIMO,” where there are hundreds of antennas at one side of the link. Motivated by the fact that computational complexity is one of the main challenges in such systems, a set of low-complexity Bayesian channel estimators, coined Polynomial ExpAnsion CHannel (PEACH) estimators, are introduced for arbitrary channel and interference statistics. While the conventional minimum mean square error (MMSE) estimator has cubic complexity in the dimension of the covariance matrices, due to an inversion operation, our proposed estimators significantly reduce this to square complexity by approximating the inverse by a L-degree matrix polynomial. The coefficients of the polynomial are optimized to minimize the mean square error (MSE) of the estimate. We show numerically that near-optimal MSEs are achieved with low polynomial degrees. We also derive the exact computational complexity of the proposed estimators, in terms of the floating-point operations (FLOPs), by which we prove that the proposed estimators outperform the conventional estimators in large-scale MIMO systems of practical dimensions while providing a reasonable MSEs. Moreover, we show that L needs not scale with the system dimensions to maintain a certain normalized MSE. By analyzing different interference scenarios, we observe that the relative MSE loss of using the low-complexity PEACH estimators is smaller in realistic scenarios with pilot contamination. On the other hand, PEACH estimators are not well suited for noise-limited scenarios with high pilot power; therefore, we also introduce the low-complexity diagonalized estimator that performs well in this regime. Finally, we also investigate numerically how the estimation performance is affected by having imperfect statistical knowledge. High robustness is achieved for large-dimensional matrices by using a new covariance estimate which is an affine function of the sample covariance matrix and a regularization term.

22 August 2011 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
EBEmil Björnson
Emil Björnson
NJNiklas Jalden
Niklas Jalden
MBMats Bengtsson
Mats Bengtsson
BOBjörn Ottersten
Björn Ottersten
The throughput of multicell systems is inherently limited by interference and the available communication resources. Coordinated resource allocation is the key to efficient performance, but the demand on backhaul signaling and computational resources grows rapidly with number of cells, terminals, and subcarriers. To handle this, we propose a novel multicell framework with dynamic cooperation clusters where each terminal is jointly served by a small set of base stations. Each base station coordinates interference to neighboring terminals only, thus limiting backhaul signalling and making the framework scalable. This framework can describe anything from interference channels to ideal joint multicell transmission. The resource allocation (i.e., precoding and scheduling) is formulated as an optimization problem (P1) with performance described by arbitrary monotonic functions of the signal-to-interference-and-noise ratios (SINRs) and arbitrary linear power constraints. Although (P1) is nonconvex and difficult to solve optimally, we are able to prove: 1) optimality of single-stream beamforming; 2) conditions for full power usage; and 3) a precoding parametrization based on a few parameters between zero and one. These optimality properties are used to propose low-complexity strategies: both a centralized scheme and a distributed version that only requires local channel knowledge and processing. We evaluate the performance on measured multicell channels and observe that the proposed strategies achieve close-to-optimal performance among centralized and distributed solutions, respectively. In addition, we show that multicell interference coordination can give substantial improvements in sum performance, but that joint transmission is very sensitive to synchronization errors and that some terminals can experience performance degradations.

12 January 2012 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
EBEmil Björnson
Emil Björnson
GZGan Zheng
Gan Zheng
MBMats Bengtsson
Mats Bengtsson
BOBjörn Ottersten
Björn Ottersten
The performance of multiuser systems is both difficult to measure fairly and to optimize. Most resource allocation problems are nonconvex and NP-hard, even under simplifying assumptions such as perfect channel knowledge, homogeneous channel properties among users, and simple power constraints. We establish a general optimization framework that systematically solves these problems to global optimality. The proposed branch-reduce-and-bound (BRB) algorithm handles general multicell downlink systems with single-antenna users, multiantenna transmitters, arbitrary quadratic power constraints, and robust- ness to channel uncertainty. A robust fairness-profile optimization (RFO) problem is solved at each iteration, which is a quasiconvex problem and a novel generalization of max-min fairness. The BRB algorithm is computationally costly, but it shows better convergence than the previously proposed outer polyblock approximation algorithm. Our framework is suitable for computing benchmarks in general multicell systems with or without channel uncertainty. We illustrate this by deriving and evaluating a zero-forcing solution to the general problem.