Yi Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yi Jiang has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Mahesh K. Varanasi
Electrical, Computer and Energy Engineering Department, University of Colorado Boulder, Boulder, CO, USA
2 shared publications - Daniel Pérez Palomar
Hong Kong University of Science and Technology (HKUST), Kowloon, Hong Kong
1 shared publication - Jian Li
Tsinghua University, Beijing, China
1 shared publication - William W. Hager
University of Florida 32611 Gainesville FL
1 shared publication
Latest Publications
- Open Access
- 1 October 2007
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 77 (262) , 1037-1056
The generalized triangular decomposition
Given a complex matrix H \mathbf {H} , we consider the decomposition H = Q R P ∗ \mathbf {H} = \mathbf {QRP}^* , where R \mathbf {R} is upper triangular and Q \mathbf {Q} and P \mathbf {P} have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where R \mathbf {R} is an upper triangular matrix with the eigenvalues of H \mathbf {H} on the diagonal. We show that any diagonal for R \mathbf {R} can be achieved that satisfies Weyl’s multiplicative majorization conditions: \[ ∏ i = 1 k | r i | ≤ ∏ i = 1 k σ i , 1 ≤ k > K , ∏ i = 1 K | r i | = ∏ i = 1 K σ i , \prod _{i=1}^k |r_{i}| \le \prod _{i=1}^k \sigma _i, \; \; 1 \le k > K, \quad \prod _{i=1}^K |r_{i}| = \prod _{i=1}^K \sigma _i, \] where K K is the rank of H \mathbf {H} , σ i \sigma _i is the i i -th largest singular value of H \mathbf {H} , and r i r_{i} is the i i -th largest (in magnitude) diagonal element of R \mathbf {R} . Given a vector r \mathbf {r} which satisfies Weyl’s conditions, we call the decomposition H = Q R P ∗ \mathbf {H} = \mathbf {QRP}^* , where R \mathbf {R} is upper triangular with prescribed diagonal r \mathbf {r} , the generalized triangular decomposition (GTD). A direct (nonrecursive) algorithm is developed for computing the GTD. This algorithm starts with the SVD and applies a series of permutations and Givens rotations to obtain the GTD. The numerical stability of the GTD update step is established. The GTD can be used to optimize the power utilization of a communication channel, while taking into account quality of service requirements for subchannels. Another application of the GTD is to inverse eigenvalue problems where the goal is to construct matrices with prescribed eigenvalues and singular values.
- 1 October 2007
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 77 (262) , 1037-1056
Open AccessThe generalized triangular decomposition
Given a complex matrix H \mathbf {H} , we consider the decomposition H = Q R P ∗ \mathbf {H} = \mathbf {QRP}^* , where R \mathbf {R} is upper triangular and Q \mathbf {Q} and P \mathbf {P} have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where R \mathbf {R} is an upper triangular matrix with the eigenvalues of H \mathbf {H} on the diagonal. We show that any diagonal for R \mathbf {R} can be achieved that satisfies Weyl’s multiplicative majorization conditions: \[ ∏ i = 1 k | r i | ≤ ∏ i = 1 k σ i , 1 ≤ k > K , ∏ i = 1 K | r i | = ∏ i = 1 K σ i , \prod _{i=1}^k |r_{i}| \le \prod _{i=1}^k \sigma _i, \; \; 1 \le k > K, \quad \prod _{i=1}^K |r_{i}| = \prod _{i=1}^K \sigma _i, \] where K K is the rank of H \mathbf {H} , σ i \sigma _i is the i i -th largest singular value of H \mathbf {H} , and r i r_{i} is the i i -th largest (in magnitude) diagonal element of R \mathbf {R} . Given a vector r \mathbf {r} which satisfies Weyl’s conditions, we call the decomposition H = Q R P ∗ \mathbf {H} = \mathbf {QRP}^* , where R \mathbf {R} is upper triangular with prescribed diagonal r \mathbf {r} , the generalized triangular decomposition (GTD). A direct (nonrecursive) algorithm is developed for computing the GTD. This algorithm starts with the SVD and applies a series of permutations and Givens rotations to obtain the GTD. The numerical stability of the GTD update step is established. The GTD can be used to optimize the power utilization of a communication channel, while taking into account quality of service requirements for subchannels. Another application of the GTD is to inverse eigenvalue problems where the goal is to construct matrices with prescribed eigenvalues and singular values.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2836-2840
Diversity-Multiplexing Tradeoff of MIMO Systems with Antenna Selection
The diversity-multiplexing (D-M) gain tradeoff is a popular benchmark for measuring the performance of multi-input multi-output (MIMO) systems. This paper studies the fundamental D-M gain tradeoff of a pruned MIMO system where Lt transmit and Lr receive antennas are selected out of the full system with Mt transmit and Mr receive antennas (Lt les Mt and Lr les Mr). It is shown that a MIMO system with the optimal antenna selection (AS) has the same D-M tradeoff as the full system if the multiplexing gain is less than some threshold P, although it suffers from some diversity gain loss for the multiplexing gain larger than P. On the other hand, this paper quantifies, in terms of the D-M tradeoff, the gain of introducing additional transmit/receive antennas without increasing the number of RF chains and coding complexity. We also propose a fast and D-M tradeoff-optimal AS algorithm as a byproduct of our analysis.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2836-2840
Diversity-Multiplexing Tradeoff of MIMO Systems with Antenna Selection
The diversity-multiplexing (D-M) gain tradeoff is a popular benchmark for measuring the performance of multi-input multi-output (MIMO) systems. This paper studies the fundamental D-M gain tradeoff of a pruned MIMO system where Lt transmit and Lr receive antennas are selected out of the full system with Mt transmit and Mr receive antennas (Lt les Mt and Lr les Mr). It is shown that a MIMO system with the optimal antenna selection (AS) has the same D-M tradeoff as the full system if the multiplexing gain is less than some threshold P, although it suffers from some diversity gain loss for the multiplexing gain larger than P. On the other hand, this paper quantifies, in terms of the D-M tradeoff, the gain of introducing additional transmit/receive antennas without increasing the number of RF chains and coding complexity. We also propose a fast and D-M tradeoff-optimal AS algorithm as a byproduct of our analysis.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 119-124
Precoder Optimization for Nonlinear MIMO Transceiver Based on Arbitrary Cost Function
Assuming full channel state information (CSI) at both transmitter (CSIT) and receiver (CSIR), we consider optimizing a nonlinear MIMO transceiver with decision feedback equalizer (DFE) with respect to some global cost function f0. Setting the receiver to be a minimum mean-squared error (MMSE) DFE, the MIMO transceiver optimization problem reduces to optimizing a linear precoder. Based on the generalized triangular decomposition (GTD) and majorization theory, we prove that for any cost function f0 the optimum precoder is of the same special structure and hence the original complicated matrix optimization problem can be significantly simplified to an optimization problem with scalar-valued variables. Furthermore, if the cost function is specialized to the cases where the composite function f0 o exp is either Schur-convex or Schur-concave, then the nonlinear transceiver design becomes exceedingly simple. In particular, when f0 o oexp is Schur-convex, the optimum nonlinear transceiver design turns out to be the uniform channel decomposition (UCD) scheme; when f0 o exp is Schur-concave, the optimum nonlinear design degenerates to linear diagonal transmission.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 119-124
Precoder Optimization for Nonlinear MIMO Transceiver Based on Arbitrary Cost Function
Assuming full channel state information (CSI) at both transmitter (CSIT) and receiver (CSIR), we consider optimizing a nonlinear MIMO transceiver with decision feedback equalizer (DFE) with respect to some global cost function f0. Setting the receiver to be a minimum mean-squared error (MMSE) DFE, the MIMO transceiver optimization problem reduces to optimizing a linear precoder. Based on the generalized triangular decomposition (GTD) and majorization theory, we prove that for any cost function f0 the optimum precoder is of the same special structure and hence the original complicated matrix optimization problem can be significantly simplified to an optimization problem with scalar-valued variables. Furthermore, if the cost function is specialized to the cases where the composite function f0 o exp is either Schur-convex or Schur-concave, then the nonlinear transceiver design becomes exceedingly simple. In particular, when f0 o oexp is Schur-convex, the optimum nonlinear transceiver design turns out to be the uniform channel decomposition (UCD) scheme; when f0 o exp is Schur-concave, the optimum nonlinear design degenerates to linear diagonal transmission.