Name
Abstract | ||
|---|---|---|
In this study, we propose a robust transceiver scheme with switched preprocessing (SP) for K-user multiple-input multiple-output (MIMO) interference channels. The channel state information (CSI) available is assumed to be imperfect under norm-bounded errors (NBE). Each transmitter is provided with a codebook of permutation matrices, so that each arrangement of permutation matrices among the K transmitters will generate a group of K parallel transceivers. The optimum transceiver group within the class of all possible such groups is chosen by a suitable selection mechanism for data transmission. To design each transceiver group, we adopt a worst-case design approach to minimize the maximum per user MSE. We show that the proposed transceiver design problem can be partitioned into an alternating sequence of optimization and worst-case analysis subproblems, which involves solving Second-Order Cone Programming (SOCP) problems. Simulation results show that the performance of the proposed SP-based transceiver is significantly better than existing methods in the presence of imperfect CSI.
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1.</sup> |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/PIMRC.2014.7136159 | 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC) |
Keywords | Field | DocType |
Robust transceiver,MIMO interference channel,switched preprocessing,Min-Max,SOCP | Transmitter,Transceiver,Data transmission,Control theory,Computer science,Permutation matrix,Algorithm,MIMO,Real-time computing,Interference (wave propagation),Channel state information,Codebook | Conference |
ISSN | Citations | PageRank |
2166-9570 | 1 | 0.35 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming-Min Zhao | 1 | 109 | 12.08 |
| Yunlong Cai | 2 | 86 | 11.26 |
| Benoît Champagne | 3 | 19 | 1.89 |
| Minjian Zhao | 4 | 118 | 27.18 |