Optimal Design of Non-Regenerative MIMO Wireless Relays

Tang, Xiaojun; Hua, Yingbo

doi:10.1109/twc.2007.348336

Cited by 665 publications

(647 citation statements)

References 17 publications

Supporting

Mentioning

623

Contrasting

Unclassified

Order By: Relevance

“…We compare the performance of the proposed OPT-COV algorithm with the naive amplify-and-forward (NAF) algorithm [5], the pseudo match-and-forward (PMF) algorithm [5], SUB algorithm [9], the JMMSE-COV algorithm [15], OPT algorithm [9] and the suboptimal covariance (SUB-COV) algorithm. The full CSI scheme, also known as OPT algorithm [9] provides the lower-bound of the proposed scheme.…”

Section: Simulation Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Channel covariance information based transceiver design for AF MIMO relay systems with direct link

Gopal

Rong

Zang

2012

2012 18th Asia-Pacific Conference on Communications (APCC)

View full text Add to dashboard Cite

Abstract-In this paper, we propose a design scheme for amplify-and-forward multiple-input multiple-output (AF MIMO) relay system with direct link to minimize the mean-squared error (MSE) of the signal estimation at the destination. In the proposed design scheme, an optimal precoding matrix is derived with the assumption that the full channel state information (CSI) of the source-relay link and partial channel state information such as channel covariance information (CCI) of the relay-destination link are available at the relay. In practical cases, if the destination is closer to the source, the source-destination link cannot be ignored. Hence, in this paper, we assume that the relay knows the partial channel state information of the source-destination link. Based on this assumption, an iterative optimal covariance algorithm is developed to achieve the minimum MSE of the signal estimation at the destination. In order to reduce computational complexity of the proposed optimal covariance algorithm, a suboptimal covariance algorithm is proposed. A numerical example shows that the developed optimal covariance algorithm outperforms the conventional CCI based MSE algorithms.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

“…A relay precoding algorithm [4] and [5] for AF based multiple-input multiple-output (AF MIMO) relay has been developed to maximize the capacity of the source-destination link. In this algorithm, a precoding matrix is multiplied with the received signal at the relay for further signal processing.…”

Section: Introductionmentioning

confidence: 99%

Channel covariance information based transceiver design for AF MIMO relay systems with direct link

Gopal

Rong

Zang

2012

2012 18th Asia-Pacific Conference on Communications (APCC)

View full text Add to dashboard Cite

show abstract

“…We also assume that the number of antennas at each node is , = 1, ⋅ ⋅ ⋅ , + 1, and the number of source symbols in each transmission is . Like [5], [6], [11]- [14], a linear nonregenerative relay matrix is used at each relay. The system block diagram is shown in Fig.…”

Section: System Modelmentioning

confidence: 99%

Optimality of diagonalization of multi-hop MIMO relays

Rong

Hua

2009

IEEE Trans. Wireless Commun.

113

167

View full text Add to dashboard Cite

Abstract-For a two-hop linear non-regenerative multipleinput multiple-output (MIMO) relay system where the direct link between source and destination is negligible, the optimal design of the source and relay matrices has been recently established for a broad class of objective functions. The optimal source and relay matrices jointly diagonalize the MIMO relay system into a set of parallel scalar channels. In this paper, we show that this diagonalization is also optimal for a multihop MIMO relay system with any number of hops, which is a further generalization of several previously established results. Specifically, for Schur-concave objective functions, the optimal source precoding matrix, the optimal relay amplifying matrices and the optimal receiving matrix jointly diagonalize the multihop MIMO relay channel. And for Schur-convex objectives, such joint diagonalization along with a rotation of the source precoding matrix is also shown to be optimal. We also analyze the system performance when each node has the same transmission power budget and the same asymptotically large number of antennas. The asymptotic analysis shows a good agreement with numerical results under a finite number of antennas.Index Terms-MIMO relay network, multi-hop relay, linear non-regenerative relay, majorization.

show abstract

“…Note that the number of parallel channels that can be utilized is min{r, t}, i.e., the minimum number of parallel streams of the first-and second hop. In (9), it is shown that the strategy given by (6) is optimal if the relay mapping is constrained to be linear. However as we show, AF is in general suboptimal for the underlying channel.…”

Section: Linear Relayingmentioning

confidence: 99%

“…The work in (7; 8) investigates linear relay processing for the MIMO relay channel. In this paper, in contrast to (6)(7)(8)(9), we study an uncoded system, and we propose a nonlinear relaying scheme which is superior to linear relaying and performs close to the theoretical bound. Our proposed scheme is based on constellation permutation (10; 11) at the relay over different streams obtained by channel orthogonalization.…”

Section: Introductionmentioning

confidence: 99%