Results 1  10
of
225
Linear precoding via conic optimization for fixed mimo receivers
 IEEE Trans. on Signal Processing
, 2006
"... We consider the problem of designing linear precoders for fixed multiple input multiple output (MIMO) receivers. Two different design criteria are considered. In the first, we minimize the transmitted power subject to signal to interference plus noise ratio (SINR) constraints. In the second, we maxi ..."
Abstract

Cited by 114 (3 self)
 Add to MetaCart
(Show Context)
We consider the problem of designing linear precoders for fixed multiple input multiple output (MIMO) receivers. Two different design criteria are considered. In the first, we minimize the transmitted power subject to signal to interference plus noise ratio (SINR) constraints. In the second, we maximize the worst case SINR subject to a power constraint. We show that both problems can be solved using standard conic optimization packages. In addition, we develop conditions for the optimal precoder for both of these problems, and propose two simple fixed point iterations to find the solutions which satisfy these conditions. The relation to the well known downlink uplink duality in the context of joint downlink beamforming and power control is also explored. Our precoder design is general, and as a special case it solves the beamforming problem. In contrast to most of the existing precoders, it is not limited to full rank systems. Simulation results in a multiuser system show that the resulting precoders can significantly outperform existing linear precoders. 1
Gradient of mutual information in linear vector Gaussian channels
 IEEE Trans. Inf. Theory
, 2006
"... Abstract — This paper considers a general linear vector Gaussian channel with arbitrary signaling and pursues two closely related goals: i) closedform expressions for the gradient of the mutual information with respect to arbitrary parameters of the system, and ii) fundamental connections between i ..."
Abstract

Cited by 85 (12 self)
 Add to MetaCart
(Show Context)
Abstract — This paper considers a general linear vector Gaussian channel with arbitrary signaling and pursues two closely related goals: i) closedform expressions for the gradient of the mutual information with respect to arbitrary parameters of the system, and ii) fundamental connections between information theory and estimation theory. Generalizing the fundamental relationship recently unveiled by Guo, Shamai, and Verdú [1], we show that the gradient of the mutual information with respect to the channel matrix is equal to the product of the channel matrix and the error covariance matrix of the estimate of the input given the output. I.
A unified framework for optimizing linear nonregenerative multicarrier MIMO relay communication systems
 IEEE TRANS. SIGNAL PROCESS
, 2009
"... In this paper, we develop a unified framework for linear nonregenerative multicarrier multipleinput multipleoutput (MIMO) relay communications in the absence of the direct source–destination link. This unified framework classifies most commonly used design objectives such as the minimal meansqu ..."
Abstract

Cited by 82 (46 self)
 Add to MetaCart
(Show Context)
In this paper, we develop a unified framework for linear nonregenerative multicarrier multipleinput multipleoutput (MIMO) relay communications in the absence of the direct source–destination link. This unified framework classifies most commonly used design objectives such as the minimal meansquare error and the maximal mutual information into two categories: Schurconcave and Schurconvex functions. We prove that for Schurconcave objective functions, the optimal source precoding matrix and relay amplifying matrix jointly diagonalize the source–relay–destination channel matrix and convert the multicarrier MIMO relay channel into parallel singleinput singleoutput (SISO) relay channels. While for Schurconvex objectives, such joint diagonalization occurs after a specific rotation of the source precoding matrix. After the optimal structure of the source and relay matrices is determined, the linear nonregenerative relay design problem boils down to the issue of power loading among the resulting SISO relay channels. We show that this power loading problem can be efficiently solved by an alternating technique. Numerical examples demonstrate the effectiveness of the proposed framework.
Optimal linear precoding strategies for wideband noncooperative systems based on game theory – Part II: Algorithms
 IEEE Trans. Signal Process
, 2008
"... In this twoparts paper we propose a decentralized strategy, based on a gametheoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipointtomultipoint communication system composed of a set of wideband links sharing the same physical resources, i.e., time and band ..."
Abstract

Cited by 72 (11 self)
 Add to MetaCart
(Show Context)
In this twoparts paper we propose a decentralized strategy, based on a gametheoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipointtomultipoint communication system composed of a set of wideband links sharing the same physical resources, i.e., time and bandwidth. We assume, as optimality criterion, the achievement of a Nash equilibrium and consider two alternative optimization problems: 1) the competitive maximization of mutual information on each link, given constraints on the transmit power and on the spectral mask imposed by the radio spectrum regulatory bodies; and 2) the competitive maximization of the transmission rate, using finite order constellations, under the same constraints as above, plus a constraint on the average error probability. In Part I of the paper, we start by showing that the solution set of both noncooperative games is always nonempty and contains only pure strategies. Then, we prove that the optimal precoding/multiplexing scheme for both games leads to a channel diagonalizing structure, so that both matrixvalued problems can be recast in a simpler unified vector power control game, with no performance penalty. Thus, we study this simpler game and derive sufficient conditions ensuring the uniqueness of the Nash equilibrium. Interestingly, although derived under stronger constraints,
Optimum power allocation for parallel Gaussian channels with arbitrary input distributions
 IEEE TRANS. INF. THEORY
, 2006
"... The mutual information of independent parallel Gaussiannoise channels is maximized, under an average power constraint, by independent Gaussian inputs whose power is allocated according to the waterfilling policy. In practice, discrete signaling constellations with limited peaktoaverage ratios (m ..."
Abstract

Cited by 72 (9 self)
 Add to MetaCart
The mutual information of independent parallel Gaussiannoise channels is maximized, under an average power constraint, by independent Gaussian inputs whose power is allocated according to the waterfilling policy. In practice, discrete signaling constellations with limited peaktoaverage ratios (mPSK, mQAM, etc.) are used in lieu of the ideal Gaussian signals. This paper gives the power allocation policy that maximizes the mutual information over parallel channels with arbitrary input distributions. Such policy admits a graphical interpretation, referred to as mercury/waterfilling, which generalizes the waterfilling solution and allows retaining some of its intuition. The relationship between mutual information of Gaussian channels and nonlinear minimum meansquare error (MMSE) proves key to solving the power allocation problem.
Joint transceiver design for MIMO communications using geometric mean decomposition
 IEEE Trans. Signal Process
, 2005
"... Abstract—In recent years, considerable attention has been paid to the joint optimal transceiver design for multiinput multioutput (MIMO) communication systems. In this paper, we propose a joint transceiver design that combines the geometric mean decomposition (GMD) with either the conventional zer ..."
Abstract

Cited by 49 (7 self)
 Add to MetaCart
(Show Context)
Abstract—In recent years, considerable attention has been paid to the joint optimal transceiver design for multiinput multioutput (MIMO) communication systems. In this paper, we propose a joint transceiver design that combines the geometric mean decomposition (GMD) with either the conventional zeroforcing VBLAST decoder or the more recent zeroforcing dirty paper precoder (ZFDP). Our scheme decomposes a MIMO channel into multiple identical parallel subchannels, which can make it rather convenient to design modulation/demodulation and coding/decoding schemes. Moreover, we prove that our scheme is asymptotically optimal for (moderately) high SNR in terms of both channel throughput and bit error rate (BER) performance. This desirable property is not shared by any other conventional schemes. We also consider the subchannel selection issues when some of the subchannels are too poor to be useful. Our scheme can also be combined with orthogonal frequency division multiplexing (OFDM) for intersymbol interference (ISI) suppression. The effectiveness of our approaches has been validated by both theoretical analyses and numerical simulations. Index Terms—Channel capacity, dirty paper precoding, intersymbol interference suppression, joint transceiver design, matrix
Optimum linear joint transmitreceive processing for MIMO channels with QoS constraints
 IEEE Transactions on Signal Processing
, 2004
"... Abstract—This paper considers vector communications through multipleinput multipleoutput (MIMO) channels with a set of quality of service (QoS) requirements for the simultaneously established substreams. Linear transmitreceive processing (also termed linear precoder at the transmitter and linear ..."
Abstract

Cited by 47 (8 self)
 Add to MetaCart
(Show Context)
Abstract—This paper considers vector communications through multipleinput multipleoutput (MIMO) channels with a set of quality of service (QoS) requirements for the simultaneously established substreams. Linear transmitreceive processing (also termed linear precoder at the transmitter and linear equalizer at the receiver) is designed to satisfy the QoS constraints with minimum transmitted power (the exact conditions under which the problem becomes unfeasible are given). Although the original problem is a complicated nonconvex problem with matrixvalued variables, with the aid of majorization theory, we reformulate it as a simple convex optimization problem with scalar variables. We then propose a practical and efficient multilevel waterfilling algorithm to optimally solve the problem for the general case of different QoS requirements. The optimal transmitreceive processing is shown to diagonalize the channel matrix only after a very specific prerotation of the data symbols. For situations in which the resulting transmit power is too large, we give the precise way to relax the QoS constraints in order to reduce the required power based on a perturbation analysis. We also propose a robust design under channel estimation errors that has an important interest for practical systems. Numerical results from simulations are given to support the mathematical development of the problem. Index Terms—Array signal processing, beamforming, joint transmitreceive equalization, linear precoding, MIMO channels, spacetime filtering, waterfilling. I.
Uniform channel decomposition for MIMO communications
 IEEE Transactions on Signal Processing
, 2005
"... Abstract—Assuming the availability of the channel state information at the transmitter (CSIT) and receiver (CSIR), we consider the joint optimal transceiver design for multiinput multioutput (MIMO) communication systems. Using the geometric mean decomposition (GMD), we propose a transceiver design ..."
Abstract

Cited by 47 (8 self)
 Add to MetaCart
(Show Context)
Abstract—Assuming the availability of the channel state information at the transmitter (CSIT) and receiver (CSIR), we consider the joint optimal transceiver design for multiinput multioutput (MIMO) communication systems. Using the geometric mean decomposition (GMD), we propose a transceiver design that can decompose, in a strictly capacity lossless manner, a MIMO channel into multiple subchannels with identical capacities. This uniform channel decomposition (UCD) scheme has two implementation forms. One is the combination of a linear precoder and a minimum meansquarederror VBLAST (MMSEVBLAST) detector, which is referred to as UCDVBLAST, and the other includes a dirty paper (DP) precoder and a linear equalizer followed by a DP decoder, which we refer to as UCDDP. The UCD scheme can provide much convenience for the modulation/demodulation and coding/decoding procedures due to obviating the need for bit allocation. We also show that UCD can achieve the maximal diversity gain. The simulation results show that the UCD scheme exhibits excellent performance, even without the use of any error correcting codes. Index Terms—Channel capacity, DBLAST, dirty paper precoder, diversity gain, geometric mean decomposition, joint transceiver
A robust maximin approach for MIMO communications with imperfect channel state information based on convex optimization
 IEEE Trans. Signal Processing
, 2006
"... Abstract—This paper considers a wireless communication system with multiple transmit and receive antennas, i.e., a multipleinputmultipleoutput (MIMO) channel. The objective is to design the transmitter according to an imperfect channel estimate, where the errors are explicitly taken into account ..."
Abstract

Cited by 46 (5 self)
 Add to MetaCart
(Show Context)
Abstract—This paper considers a wireless communication system with multiple transmit and receive antennas, i.e., a multipleinputmultipleoutput (MIMO) channel. The objective is to design the transmitter according to an imperfect channel estimate, where the errors are explicitly taken into account to obtain a robust design under the maximin or worst case philosophy. The robust transmission scheme is composed of an orthogonal space–time block code (OSTBC), whose outputs are transmitted through the eigenmodes of the channel estimate with an appropriate power allocation among them. At the receiver, the signal is detected assuming a perfect channel knowledge. The optimization problem corresponding to the design of the power allocation among the estimated eigenmodes, whose goal is the maximization of the signaltonoise ratio (SNR), is transformed to a simple convex problem that can be easily solved. Different sources of errors are considered in the channel estimate, such as the Gaussian noise from the estimation process and the errors from the quantization of the channel estimate, among others. For the case of Gaussian noise, the robust power allocation admits a closedform expression. Finally, the benefits of the proposed design are evaluated and compared with the pure OSTBC and nonrobust approaches. Index Terms—Antenna arrays, beamforming, convex optimization theory, maximum optimization problems, multipleinput multipleoutput (MIMO) systems, saddle point, space–time coding, worstcase robust designs. I.
Robust design of linear MIMO transceivers
 IEEE Journal on Selected Areas in Communications
, 2005
"... This paper considers the robust design of a linear transceiver with imperfect channel state information (CSI) at the transmitter of a MIMO link. The framework embraces the design problem when CSI at the transmitter consists of the channel mean and covariance matrix or, equivalently, the channel esti ..."
Abstract

Cited by 45 (2 self)
 Add to MetaCart
(Show Context)
This paper considers the robust design of a linear transceiver with imperfect channel state information (CSI) at the transmitter of a MIMO link. The framework embraces the design problem when CSI at the transmitter consists of the channel mean and covariance matrix or, equivalently, the channel estimate and the estimation error covariance matrix. The design of the linear MIMO transceiver is based on a general cost function covering several well known performance criteria. In particular, two families are considered in detail: Schurconvex and Schurconcave functions. Approximations are used in the low SNR and high SNR regimes separately to obtain simple optimization problems that can be readily solved. Numerical examples show gains compared to other suboptimal methods. 1.