| 1. |
|
|
| 2. |
- Brandt, Rasmus, 1985-
(författare)
-
Coordinated Precoding for Multicell MIMO Networks
- 2014
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Enabling multiple base stations to utilize the spatial dimension in a coordinated manner has been shown to be a fruitful technique for improving the spectral efficiency in wireless interference networks. This thesis considers multicell systems where base stations and mobile stations are equipped with multiple antennas. The base stations coordinate their spatial precoding, but individually serve their mobile stations with data. For such coordinated precoding systems, interference alignment (IA) is a useful theoretical tool, due to its ability to serve the maximum number of interference-free data streams. Three topics related to interference alignment and coordinated precoding are studied.First, the feasibility of IA over a joint space-frequency signal space is studied. A necessary condition for space-frequency IA feasibility is derived, and the possible gain over space-only IA is analyzed. An upper bound on the degree of freedom gain is shown to increase in the number of subcarriers, but decrease in the number of antennas. Numerical studies, using synthetically generated channels and real-world channels obtained from indoors and outdoors channel measurements, are used for sum rate performance evaluation. The results show that although a degree of freedom gain is noticeable due to the space-frequency precoding, the sum rate of the system is mainly improved due to a power gain.Second, distributed channel state information (CSI) acquisition techniques are proposed, which provide estimates of the information necessary to perform distributed coordinated precoding. The methods are based on pilot-assisted channel estimation in the uplink and downlink, and correspond to different tradeoffs between feedback and signaling, backhaul use, and computational complexity. Naively applying the existing WMMSE algorithm for distributed coordinated precoding together with the estimated CSI however results in poor performance. A robustification of the algorithm is therefore proposed, relying on the well known diagonal loading technique. An inherent property of the WMMSE solutions is derived and, when enforced onto solutions with imperfect CSI, results in diagonally loaded receive filters. Numerical simulations show the effectiveness of the proposed robustification. Further, the proposed robustified and distributed WMMSE algorithm performs well compared to existing state-of-the-art robust WMMSE algorithms. In contrast to our approach, the existing methods however rely on centralized CSI acquisition.Third, coordinated precoding systems with hardware impairments are studied. Assuming that impairment compensation techniques have been applied, a model is used to describe the aggregate effect of the residual hardware impairments. An iterative resource allocation method accounting for the residual hardware impairments is derived, based on an existing resource allocation framework. Numerical simulations show that the proposed method outperforms all benchmarks. In particular, the gain over impairments-aware time-division multiple access is substantial.
|
|
| 3. |
- Brandt, Rasmus, 1985-
(författare)
-
Distributed Coordination in Multiantenna Cellular Networks
- 2016
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Wireless communications are important in our highly connected world. The amount of data being transferred in cellular networks is steadily growing, and consequently more capacity is needed. This thesis considers the problem of downlink capacity improvement from the perspective of multicell coordination. By employing multiple antennas at the transmitters and receivers of a multicell network, the inherent spatial selectivity of the users can be exploited in order to increase the capacity through linear precoding and receive filtering. For the coordination between cells, distributed algorithms are often sought due to their low implementation complexity and robustness. In this context, the thesis considers two problem domains: base station clustering and coordinated precoding.Base station clustering corresponds to grouping the cell base stations into disjoint clusters in order to reduce the coordination overhead. This is needed in intermediate-sized to large networks, where the overhead otherwise would be overwhelmingly high. Two solution methods for the clustering problem are proposed: an optimal centralized method, as well as a heuristic distributed method. The optimal method applies to a family of throughput models and exploits the structure of the model to find bounds that can be used to focus the search for the optimal clustering into promising territories. The distributed method instead uses notions from coalitional game theory, where the base stations are modelled as rational and intelligent players in a game. By letting the players make individual deviations that benefit them in the game, i.e.\@ switching clusters, a distributed coalition formation algorithm is obtained.Coordinated precoding is the act of finding the linear precoders and receive filters that maximize the network performance, given a base station clustering. Four specific challenges are studied in this problem domain. First, coordinated precoding under intercluster interference is considered. The channels of the intercluster links are not explicitly estimated due to overhead reasons, and these links thus lead to intercluster interference. By exploiting the known statistics of the intercluster channels, a robust and distributed coordinated precoding algorithm is developed. Second, coordinated precoding under imperfect channel state information is considered. Relying on the channel reciprocity under time-division duplex operation, a distributed estimation framework is proposed. Given the estimated channels, a robust and distributed coordinated precoding algorithm is then derived. Third, coordinated precoding under imperfect radio hardware is considered. By modelling the radio frequency distortion noises, a distributed coordinated precoding method that accounts for the imperfections is proposed. Fourth, joint coordinated precoding and discrete rate selection is considered. By bounding and linearizing an originally intractable optimization problem, a heuristic algorithm is derived which selects the transmit rate from a finite set and simultaneously forms the linear precoders and receive filters.
|
|
| 4. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Distributed CSI Acquisition and Coordinated Precoding for TDD Multicell MIMO Systems
- 2016
-
Ingår i: IEEE Transactions on Vehicular Technology. - : IEEE Press. - 0018-9545 .- 1939-9359. ; 65:5, s. 2890-2906
-
Tidskriftsartikel (refereegranskat)abstract
- Several distributed coordinated precoding methods exist in the downlink multicell MIMO literature, many of which assume perfect knowledge of received signal covariance and local effective channels. In this work, we let the notion of channel state information (CSI) encompass this knowledge of covariances and effective channels. We analyze what local CSI is required in the WMMSE algorithm for distributed coordinated precoding, and study how this required CSI can be obtained in a distributed fashion. Based on pilot-assisted channel estimation, we propose three CSI acquisition methods with different tradeoffs between feedback and signaling, backhaul use, and computational complexity. One of the proposed methods is fully distributed, meaning that it only depends on over-the-air signaling but requires no backhaul, and results in a fully distributed joint system when coupled with the WMMSE algorithm. Naively applying the WMMSE algorithm together with the fully distributed CSI acquisition results in catastrophic performance however, and therefore we propose a robustified WMMSE algorithm based on the well known diagonal loading framework. By enforcing properties of the WMMSE solutions with perfect CSI onto the problem with imperfect CSI, the resulting diagonally loaded spatial filters are shown to perform significantly better than the naive filters. The proposed robust and distributed system is evaluated using numerical simulations, and shown to perform well compared with benchmarks. Under centralized CSI acquisition, the proposed algorithm performs on par with other existing centralized robust WMMSE algorithms. When evaluated in a large scale fading environment, the performance of the proposed system is promising.
|
|
| 5. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Distributed Long-Term Base Station Clustering in Cellular Networks using Coalition Formation
- 2016
-
Ingår i: IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS. - : IEEE. - 2373-776X. ; 2:3
-
Tidskriftsartikel (refereegranskat)abstract
- Interference alignment (IA) is a promising technique for interference mitigation in multicell networks due to its ability to completely cancel the intercell interference through linear precoding and receive filtering. In small networks, the amount of required channel state information (CSI) is modest and IA is therefore typically applied jointly over all base stations. In large networks, where the channel coherence time is short in comparison to the time needed to obtain the required CSI, base station clustering must be applied however. We model such clustered multicell networks as a set of coalitions, where CSI acquisition and IA precoding is performed independently within each coalition. We develop a long-term throughput model which includes both CSI acquisition overhead and the level of interference mitigation ability as a function of the coalition structure. Given the throughput model, we formulate a coalitional game where the involved base stations are the rational players. Allowing for individual deviations by the players, we formulate a distributed coalition formation algorithm with low complexity and low communication overhead that leads to an individually stable coalition structure. The dynamic clustering is performed using only long-term CSI, but we also provide a robust short-term precoding algorithm which accounts for the intercoalition interference when spectrum sharing is applied between coalitions. Numerical simulations show that the distributed coalition formation is generally able to reach long-term sum throughputs within 10 % of the global optimum.
|
|
| 6. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Fast-Convergent Distributed Coordinated Precoding for TDD Multicell MIMO Systems
- 2015
-
Ingår i: Proc. IEEE Int. Workshop Computational Advances in Multi-Sensor Adaptive Process. (CAMSAP'15).
-
Konferensbidrag (refereegranskat)abstract
- Several distributed coordinated precoding methods relying on over-the-air (OTA) iterations in time-division duplex (TDD) networks have recently been proposed. Each OTA iteration incurs overhead, which reduces the time available for data transmission. In this work, we therefore propose an algorithm which reaches good sum rate performance within just a few number of OTA iterations, partially due to non-overhead-incurring local iterations at the receivers. We formulate a scalarized multi-objective optimization problem where a linear combination of the weighted sum rate and the multiplexing gain is maximized. Using a well-known heuristic for smoothing the optimization problem together with a linearization step, the distributed algorithm is derived. When numerically compared to the state-of-the-art in a scenario with 1 to 3 OTA iterations allowed, the algorithm shows significant sum rate gains at high signal-to-noise ratios.
|
|
| 7. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Globally Optimal Base Station Clustering in Interference Alignment-Based Multicell Networks
- 2016
-
Ingår i: IEEE Signal Processing Letters. - : IEEE. - 1070-9908 .- 1558-2361. ; 23:4, s. 512-516
-
Tidskriftsartikel (refereegranskat)abstract
- Coordinated precoding based on interference alignment is a promising technique for improving the throughputs in future wireless multicell networks. In small networks, all base stations can typically jointly coordinate their precoding. In large networks however, base station clustering is necessary due to the otherwise overwhelmingly high channel state information (CSI) acquisition overhead. In this work, we provide a branch and bound algorithm for finding the globally optimal base station clustering. The algorithm is mainly intended for benchmarking existing suboptimal clustering schemes. We propose a general model for the user throughputs, which only depends on the long-term CSI statistics. The model assumes intracluster interference alignment and is able to account for the CSI acquisition overhead. By enumerating a search tree using a best-first search and pruning sub-trees in which the optimal solution provably cannot be, the proposed method converges to the optimal solution. The pruning is done using specifically derived bounds, which exploit some assumed structure in the throughput model. It is empirically shown that the proposed method has an average complexity which is orders of magnitude lower than that of exhaustive search.
|
|
| 8. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Interference Alignment-Aided Base Station Clustering using Coalition Formation
- 2015
-
Ingår i: Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers. - Pacific Grove, CA, USA : IEEE conference proceedings.
-
Konferensbidrag (refereegranskat)abstract
- Base station clustering is necessary in large interference networks, where the channel state information (CSI) acquisition overhead otherwise would be overwhelming. In this paper, we propose a novel long-term throughput model for the clustered users which addresses the balance between interference mitigation capability and CSI acquisition overhead. The model only depends on statistical CSI, thus enabling long-term clustering. Based on notions from coalitional game theory, we propose a low-complexity distributed clustering method. The algorithm converges in a couple of iterations, and only requires limited communication between base stations. Numerical simulations show the viability of the proposed approach.
|
|
| 9. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Interference Alignment in Frequency — a Measurement Based Performance Analysis
- 2012
-
Ingår i: 2012 19th International Conference on Systems, Signals and Image Processing, IWSSIP 2012. - : IEEE conference proceedings. - 9783200023284 ; , s. 227-230
-
Konferensbidrag (refereegranskat)abstract
- The idea of interference alignment (IA) has shown great promise in many theoretical studies. Yet it is not clear under what operating conditions it will perform better than traditional multiple access schemes under realistic network conditions. Here, we use measured channels to evaluate a number of different IA schemes and related methods, focusing on wideband single-antenna transmission, using frequency extensions for the IA. The radio channels were measured jointly from three base station sites in an urban macrocell scenario, over a 20 MHz bandwidth, allowing to emulate a scenario with 3 interfering cells (i.e. 3 interfering transmit/receive pairs). The numerical results show clear gains using IA related methods, compared to frequency planning with frequency reuse 3 and to uncoordinated transmission, even at low to moderate SNR.
|
|
| 10. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Interference Alignment over a Combination of Space and Frequency
- 2013
-
Ingår i: 2013 IEEE International Conference on Communications Workshops, ICC 2013. - : IEEE Communications Society. ; , s. 149-153
-
Konferensbidrag (refereegranskat)abstract
- Time or frequency extensions are integral in most information theoretic studies of interference alignment (IA), but a large majority of the more practically oriented studies have focused on narrowband space-only schemes. As wideband systems are now common, it is natural to investigate IA for frequency extended multiple antenna systems where precoding is performed over a combination of space and frequency dimensions. For this setting, we derive a necessary condition on IA feasibility using the properness framework and investigate the sum rate performance using simulations. Applying frequency extensions to multiple antenna systems allows for some additional users to be served interference-free, but our numerical results with synthetic channels indicate a practically more important improvement in terms of a power gain. Emulating a particular scenario using channel measurements, with real-world path losses and channel correlations, we see similar performance gains.
|
|
| 11. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Weighted Sum Rate Optimization for Multicell MIMO Systems with Hardware-Impaired Transceivers
- 2014
-
Konferensbidrag (refereegranskat)abstract
- Physical transceivers exhibit distortions from hardware impairments, of which traces remain even after compensation and calibration. Multicell MIMO coordinated beamforming methods that ignore these residual impairments may suffer from severely degraded performance. In this work, we consider a general model for the aggregate effect of the residual hardware impairments, and propose an iterative algorithm for finding locally optimal points to a weighted sum rate optimization problem. The importance of accounting for the residual hardware impairments is verified by numerical simulation, and a substantial gain over traditional time-division multiple access with impairments-aware resource allocation is observed.
|
|
| 12. |
- Brandt, Rasmus, 1985-, et al.
(författare)
-
Wideband MIMO Channel Diagonalization in the Time Domain
- 2011
-
Ingår i: 2011 IEEE 22nd International Symposium On Personal Indoor And Mobile Radio Communications (PIMRC). - New York : IEEE. - 9781457713484 ; , s. 1958-1962
-
Konferensbidrag (refereegranskat)abstract
- Methods for spatially diagonalizing wideband multiple-input multiple-output channels using linear finite impulse response (FIR) filters are investigated. The PSVD approach by applying the PQRD-BC algorithm for approximate singular value decomposition (SVD) of polynomial matrices is compared to the approach of performing a set of conventional SVDs in the Discrete Fourier Transform (DFT) domain, in terms of complexity and approximation error. Reduced order filters, based on the DFT-SVDs, are then obtained by optimizing the phases of the filters. Applying the phase optimized filters as linear filters then forms a benchmark on the accuracy attainable for any PSVD factorization, for the given filter length. Simulations show that the DFT-SVD method has significantly lower complexity than the PSVD by PQRD-BC, but results in higher order filters. On the other hand, the PSVD by PQRD-BC yields filters which are close to being perfectly unitary for all frequencies. To achieve good performance, the reduced order filters are around one order of magnitude longer than the channel impulse response length. Therefore there is no gain in performing time domain diagonalization using a polynomial SVD, compared to using a multicarrier solution.
|
|
