Successive zero-forcing DPC with per-antenna power constraint: Optimal and suboptimal designs

in Proceedings of the 2012 IEEE International Conference on Communications (2012)

This paper considers the precoder designs for successive zero-forcing dirty paper coding (SZF-DPC), a suboptimal transmission technique for MIMO broadcast channels (MIMO BCs). Existing precoder designs ... [more ▼]

This paper considers the precoder designs for successive zero-forcing dirty paper coding (SZF-DPC), a suboptimal transmission technique for MIMO broadcast channels (MIMO BCs). Existing precoder designs for SZF-DPC often consider a sum power constraint. In this paper, we address the precoder design for SZF-DPC with per-antenna power constraints (PAPCs), which has not been well studied. First, we formulate the precoder design as a rank-constrained optimization problem, which is generally difficult to handle. To solve this problem, we follow a relaxation approach, and prove that the optimal solution of the relaxed problem is also optimal for the original problem. Considering the relaxed problem, we propose a numerically efficient algorithm to find the optimal solution, which exhibits a fast convergence rate. Suboptimal precoder designs, with lower computational complexity, are also presented, and compared with the optimal ones in terms of achievable sum rate and computational complexity. © 2012 IEEE. [less ▲]

Robust Monotonic Optimization Framework for Multicell MISO Systems

in IEEE Transactions on Signal Processing (2012), 60(5), 2508-2523

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

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

Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs

in 2012 IEEE International Conference on Communications, ICC 2012 (2012)

Successive zero-forcing dirty paper coding (SZF-DPC) is a simplified alternative to DPC for MIMO broadcast channels (MIMO BCs). In the SZF-DPC scheme, the noncausally-known interference is canceled by DPC ... [more ▼]

Successive zero-forcing dirty paper coding (SZF-DPC) is a simplified alternative to DPC for MIMO broadcast channels (MIMO BCs). In the SZF-DPC scheme, the noncausally-known interference is canceled by DPC, while the residual interference is suppressed by the ZF technique. Due to the ZF constraints, the precoders are constrained to lie in the null space of a matrix. For the sum rate maximization problem under a sum power constraint, the existing precoder designs naturally rely on the singular value decomposition (SVD). The SVD-based design is optimal but needs high computational complexity. Herein, we propose two low-complexity optimal precoder designs for SZF-DPC, all based on the QR decomposition (QRD), which requires lower complexity than SVD. The first design method is an iterative algorithm to find an orthonormal basis of the null space of a matrix that has a recursive structure. The second proposed method, which will be shown to require the lowest complexity, results from applying a single QRD to the matrix comprising all users' channel matrices. We analytically and numerically show that the two proposed precoder designs are optimal. © 2012 IEEE. [less ▲]

Spatio-temporal ToF data enhancement by fusion

in Proceedings - International Conference on Image Processing, ICIP (2012)

We propose an extension of our previous work on spatial domain Time-of-Flight (ToF) data enhancement to the temporal domain. Our goal is to generate enhanced depth maps at the same frame rate of the 2-D ... [more ▼]

We propose an extension of our previous work on spatial domain Time-of-Flight (ToF) data enhancement to the temporal domain. Our goal is to generate enhanced depth maps at the same frame rate of the 2-D camera that, coupled with a ToF camera, constitutes a hybrid ToF multi-camera rig. To that end, we first estimate the motion between consecutive 2-D frames, and then use it to predict their corresponding depth maps. The enhanced depth maps result from the fusion between the recorded 2-D frames and the predicted depth maps by using our previous contribution on ToF data enhancement. The experimental results show that the proposed approach overcomes the ToF camera drawbacks; namely, low resolution in space and time and high level of noise within depth measurements, providing enhanced depth maps at video frame rate. © 2012 IEEE. [less ▲]

Multi-objective Optimization Approach to Power Allocation in Multibeam Systems

in Proceedings of 30th AIAA International Communications Satellite Systems Conference (ICSSC), (2012)

Semidefinite Relaxations of Robust Binary Least Squares under Ellipsoidal Uncertainty Sets

in IEEE Transactions on Signal Processing (2011), 59(11), 5169-5180

The problem of finding the least squares solution s to a system of equations Hs = y is considered, when s is a vector of binary variables and the coefficient matrix H is unknown but of bounded uncertainty ... [more ▼]

The problem of finding the least squares solution s to a system of equations Hs = y is considered, when s is a vector of binary variables and the coefficient matrix H is unknown but of bounded uncertainty. Similar to previous approaches to robust binary least squares, we explore the potential of a min-max design with the aim to provide solutions that are less sensitive to the uncertainty in H. We concentrate on the important case of ellipsoidal uncertainty, i.e., the matrix H is assumed to be a deterministic unknown quantity which lies in a given uncertainty ellipsoid. The resulting problem is NP-hard, yet amenable to convex approximation techniques: Starting from a convenient reformulation of the original problem, we propose an approximation algorithm based on semidefinite relaxation that explicitly accounts for the ellipsoidal uncertainty in the coefficient matrix. Next, we show that it is possible to construct a tighter relaxation by suitably changing the description of the feasible region of the problem, and formulate an approximation algorithm that performs better in practice. Interestingly, both relaxations are derived as Lagrange bidual problems corresponding to the two equivalent problem reformulations. The strength of the proposed tightened relaxation is demonstrated by pertinent simulations. [less ▲]

Exploiting Long-Term Channel Correlation in Limited Feddback SDMA through Channel Phase Codebook

in IEEE Transactions on Signal Processing (2011), 59(3), 1217-1228

Improving channel information quality at the base station (BS) is crucial for the optimization of frequency division duplexed (FDD) multi-antenna multiuser downlink systems with limited feedback. To this ... [more ▼]

Improving channel information quality at the base station (BS) is crucial for the optimization of frequency division duplexed (FDD) multi-antenna multiuser downlink systems with limited feedback. To this end, this paper proposes to estimate a particular representation of channel state information (CSI) at the BS through channel norm feedback and a newly developed channel phase codebook, where the long-term channel correlation is efficiently exploited to improve performance. In particular, the channel representation is decomposed into a gain-related part and a phase-related part, with each of them estimated separately. More specifically, the gain-related part is estimated from the channel norm and channel correlation matrix, while the phase-related part is determined using a channel phase codebook, constructed with the generalized Lloyd algorithm. Using the estimated channel representation, joint optimization of multiuser precoding and opportunistic scheduling is performed to obtain an SDMA transmit scheme. Computer simulation results confirm the advantage of the proposed scheme over state of the art limited feedback SDMA schemes under correlated channel environment. [less ▲]

Golden Codes for Dual Polarized MIMO-OFDM Transmissions in Hybrid Satellite/Terrestrial Mobile Systems

in Communications (ICC), 2011 IEEE International Conference on (2011)

This paper discusses the performance of Golden codes in a hybrid satellite/terrestrial system framework employing dual polarized MIMO-OFDM transmissions. Although the use of Golden codes in satellite and ... [more ▼]

This paper discusses the performance of Golden codes in a hybrid satellite/terrestrial system framework employing dual polarized MIMO-OFDM transmissions. Although the use of Golden codes in satellite and terrestrial scenarios has been studied independently, a realistic performance assessment must involve both components taking into account the relative delay between their reception. In fact, this work exploits the relative delay to create a multipath scenario and further improve the coding gain of the Golden codes, which is otherwise fixed. This is made possible by utilizing the Golden code in a Space-Frequency coding framework instead of the traditional Space-Time paradigm. The separation between the subcarriers constituting a Golden code is shown to be central to the coding gain enhancement and an algorithm to choose this separation is provided. [less ▲]

Optimal V-BLAST Ordering in Fast Rayleigh Fading: A Linear Assignment Problem

in Signal Processing Advances in Wireless Communications (SPAWC), 2011 IEEE 12th International Workshop on (2011)

We explore a novel approach to perform decoding-order optimization in the vertical Bell Labs layered space-time (V-BLAST) architecture. Allowing for simultaneous transmission of multiple, separately ... [more ▼]

We explore a novel approach to perform decoding-order optimization in the vertical Bell Labs layered space-time (V-BLAST) architecture. Allowing for simultaneous transmission of multiple, separately encoded data streams, the V-BLAST transmit-receive scheme applies to the uplink of a multi-user communication system. A multi-antenna receiver decodes data streams successively, dealing with inter-stream interference by means of cancelling and nulling; interference from previously decoded streams is cancelled by subtraction, and remaining interference is nulled by linear equalization. The order in which the streams are decoded can have a noticeable impact on system performance. We consider the optimization of a fixed decoding order in fast Rayleigh fading, based on long-term channel-fading parameters. For a wide range of performance measures, we show that the fast-fading ordering problem can be treated as a classical linear assignment problem, allowing a solution using existing, efficient algorithms. [less ▲]

Clustered Multicell Joint Decoding under Cochannel Interference

in Clustered Multicell Joint Decoding under Cochannel Interference (2011)