Precoding Design and User Selection for Multibeam Satellite Channels

in 16th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2015 (2015, June 28)

Precoding for the downlink of a multibeam satellite system has been recently shown, under ideal conditions, to be promising technique towards employing aggressive frequency reuse gainfully. However, time ... [more ▼]

Precoding for the downlink of a multibeam satellite system has been recently shown, under ideal conditions, to be promising technique towards employing aggressive frequency reuse gainfully. However, time varying phase uncertainties imposed by the components and the channel, combined with delayed feedback perturbs the channel state information at the transmitter (CSIT). In this paper, we consider a power constrained robust formulation of the downlink precoding problem to counter the phase uncertainties. In particular it considers imposing conditions on the average signal to interference plus noise ratio (SINR), to deal with imperfect CSIT. In addition to the robust formulation, the primacy of user selection is highlighted and a new approach exploiting the satellite system design is proposed. Performance of the derived robust precoder in conjunction with the proposed location based user selection is then evaluated and the gains are tabulated. [less ▲]

Iterative Precoder Design and User Scheduling for Block-Diagonalized Systems

in IEEE Transactions on Signal Processing (2012), 60(7), 3726-3739

The block diagonalization (BD) scheme is a low-complexity suboptimal precoding technique for multiuser multiple input-multiple output (MIMO) downlink channels, which completely precancels the multiuser ... [more ▼]

The block diagonalization (BD) scheme is a low-complexity suboptimal precoding technique for multiuser multiple input-multiple output (MIMO) downlink channels, which completely precancels the multiuser interference. Accordingly, the precoder of each user lies in the null space of other users' channel matrices. In this paper, we propose an iterative algorithm using QR decompositions (QRDs) to compute the precoders. Specifically, to avoid dealing with a large concatenated matrix, we apply the QRD to a sequence of matrices of lower dimensions. One problem of BD schemes is that the number of users that can be simultaneously supported is limited due to zero interference constraints. When the number of users is large, a set of users must be selected, and selection algorithms should be designed to exploit the multiuser diversity gain. Finding the optimal set of users requires an exhaustive search, which has too high computational complexity to be practically useful. Based on the iterative precoder design, this paper proposes a low-complexity user selection algorithm using a greedy method, in which the precoders of selected users are recursively updated after each selection step. The selection metric of the proposed scheduling algorithm relies on the product of the squared row norms of the effective channel matrices, which is related to the eigenvalues by the Hadamard and Schur inequalities. An asymptotic analysis is provided to show that the proposed algorithm can achieve the optimal sum rate scaling of the MIMO broadcast channel. The numerical results show that the proposed algorithm achieves a good trade-off between sum rate performance and computational complexity. When users suffer different channel conditions, providing fairness among users is of critical importance. To address this problem, we also propose two fair scheduling (FS) algorithms, one imposing fairness in the approximation of the data rate, and another directly imposing fairness in the product of the sq- ared row norms of the effective channel matrices. [less ▲]

Pareto Characterization of the Multicell MIMO Performance Region With Simple Receivers

in IEEE Transactions on Signal Processing (2012), 60(8), 4464-4469

We study the performance region of a general multicell downlink scenario with multiantenna transmitters, hardware impairments, and low-complexity receivers that treat interference as noise. The Pareto ... [more ▼]

We study the performance region of a general multicell downlink scenario with multiantenna transmitters, hardware impairments, and low-complexity receivers that treat interference as noise. The Pareto boundary of this region describes all efficient resource allocations, but is generally hard to compute. We propose a novel explicit characterization that gives Pareto optimal transmit strategies using a set of positive parameters-fewer than in prior work. We also propose an implicit characterization that requires even fewer parameters and guarantees to find the Pareto boundary for every choice of parameters, but at the expense of solving quasi-convex optimization problems. The merits of the two characterizations are illustrated for interference channels and ideal network multiple-input multiple-output (MIMO). [less ▲]

Investigation of Simple Algorithms for Estimation of Delay-Spread and Angle-Spread

Scientific journal (2012)

In this paper we describe two simple methods for estimation of delay-spread and angle-spread, respectively. The algorithms are simple in the sense that the transmitted signal may consist of only three ... [more ▼]

In this paper we describe two simple methods for estimation of delay-spread and angle-spread, respectively. The algorithms are simple in the sense that the transmitted signal may consist of only three superimposed CW tones -and the receiver need only two antennas. The algorithms are also simple in the sense that the computational cost is very low. We verify the algorithms by applying them to wideband and multi-antenna measurement data, respectively. [less ▲]

Optimality Properties,Distributed Strategies, and Measurement-Based Evaluation of Coordinated Multicell OFDMA Transmission

in IEEE Transactions on Signal Processing (2011), 59(12), 6086-6101

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 ... [more ▼]

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. [less ▲]

Distributed Multicell Beamforming with Limited Intercell Coordination

in IEEE Transactions on Signal Processing (2011), 59(2), 728-738

This paper studies distributed optimization schemes for multicell joint beamforming and power allocation in time-division-duplex (TDD) multicell downlink systems where only limited-capacity intercell ... [more ▼]

This paper studies distributed optimization schemes for multicell joint beamforming and power allocation in time-division-duplex (TDD) multicell downlink systems where only limited-capacity intercell information exchange is permitted. With an aim to maximize the worst-user signal-to-interference-and-noise ratio (SINR), we devise a hierarchical iterative algorithm to optimize downlink beamforming and intercell power allocation jointly in a distributed manner. The proposed scheme is proved to converge to the global optimum. For fast convergence and to reduce the burden of intercell parameter exchange, we further propose to exploit previous iterations adaptively. Results illustrate that the proposed scheme can achieve near-optimal performance even with a few iterations, hence providing a good tradeoff between performance and backhaul consumption. The performance under quantized parameter exchange is also examined. [less ▲]

Convex Optimization-based Beamforming: From Receive to Transmit and Network Designs

in IEEE Signal Processing Magazine (2010), 27(3), 62-75

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 ... [more ▼]

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. [less ▲]

Optimality Properties and Low-Complexity Solutions to Coordinated Multicell Transmission

in Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE (2010)

Base station cooperation can theoretically improve the throughput of multicell systems by coordinating interference and serving cell edge terminals through multiple base stations. In practice, the extent ... [more ▼]

Base station cooperation can theoretically improve the throughput of multicell systems by coordinating interference and serving cell edge terminals through multiple base stations. In practice, the extent of cooperation is limited by the increase in backhaul signaling and computational demands. To address these concerns, we propose a novel distributed cooperation structure where each base station has responsibility for the interference towards a set of terminals, while only serving a subset of them with data. Weighted sum rate maximization is considered, and conditions for beamforming optimality and the optimal transmission structure are derived using Lagrange duality theory. This leads to distributed low-complexity transmission strategies, which are evaluated on measured multiantenna channels in a typical urban multicell environment. [less ▲]

Convergence of the Iterative Water-Filling Algorithm in Multiple User Spectrum Sharing Scenarios

in Communication Technologies Workshop (Swe-CTW), 2011 IEEE Swedish (2009)

Spectrum sharing between multiple independent, coexisting transmit-receive pairs (TRPs, also termed as users) is formulated as a non-cooperative game with the TRPs as players, their individual link rates ... [more ▼]

Spectrum sharing between multiple independent, coexisting transmit-receive pairs (TRPs, also termed as users) is formulated as a non-cooperative game with the TRPs as players, their individual link rates as payoffs and the iterative water-filling algorithm (IWFA) as the strategy for each TRP. The dynamics of this distributed algorithm are studied for sequential and simultaneous update mechanisms to determine the nature of convergence. Global convergence to unique Nash Equilibrium (NE) is considered and sufficient conditions tighter than those in the literature are derived. Necessary conditions are also derived to complement the sufficient conditions. The necessary conditions serve as tools for characterizing the structure of NE and also highlight the sensitivity of convergence to update orders in sequential IWFA. [less ▲]

A Limited Feedback SDMA scheme with Dynamic Multiplexing

in Signal Processing Advances in Wireless Communications, 2009. SPAWC '09. IEEE 10th Workshop on (2009)

This paper proposes a new codebook-based SDMA scheme, which employs a variable number of active beams, i.e., a dynamic multiplexing order, to target a good tradeoff between the multiplexing gain and the ... [more ▼]

This paper proposes a new codebook-based SDMA scheme, which employs a variable number of active beams, i.e., a dynamic multiplexing order, to target a good tradeoff between the multiplexing gain and the inter-user interference. The new transmit scheme consist of a modification of the conventional feedback information and the development of a novel scheduling algorithm, where the new scheduling algorithm utilizes a merging of the channel correlation with limited feedback information, and is based on a proposed ML estimate of the possible user interferences. Simulation results demonstrate that in sparse networks the proposed SDMA scheme considerably outperforms some conventional SDMA schemes in terms of the sum throughput, with a comparable feedback overhead. [less ▲]