ترغب بنشر مسار تعليمي؟ اضغط هنا

Joint Unitary Triangularization for Gaussian Multi-User MIMO Networks

123   0   0.0 ( 0 )
 نشر من قبل Anatoly Khina
 تاريخ النشر 2013
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

The problem of transmitting a common message to multiple users over the Gaussian multiple-input multiple-output broadcast channel is considered, where each user is equipped with an arbitrary number of antennas. A closed-loop scenario is assumed, for which a practical capacity-approaching scheme is developed. By applying judiciously chosen unitary operations at the transmit and receive nodes, the channel matrices are triangularized so that the resulting matrices have equal diagonals, up to a possible multiplicative scalar factor. This, along with the utilization of successive interference cancellation, reduces the coding and decoding tasks to those of coding and decoding over the single-antenna additive white Gaussian noise channel. Over the resulting effective channel, any off-the-shelf code may be used. For the two-user case, it was recently shown that such joint unitary triangularization is always possible. In this paper, it is shown that for more than two users, it is necessary to carry out the unitary linear processing jointly over multiple channel uses, i.e., space-time processing is employed. It is further shown that exact triangularization, where all resulting diagonals are equal, is still not always possible, and appropriate conditions for the existence of such are established for certain cases. When exact triangularization is not possible, an asymptotic construction is proposed, that achieves the desired property of equal diagonals up to edge effects that can be made arbitrarily small, at the price of processing a sufficiently large number of channel uses together.



قيم البحث

اقرأ أيضاً

77 - You Chen , Guyue Li , Chen Sun 2020
Physical-layer key generation (PKG) in multi-user massive MIMO networks faces great challenges due to the large length of pilots and the high dimension of channel matrix. To tackle these problems, we propose a novel massive MIMO key generation scheme with pilot reuse based on the beam domain channel model and derive close-form expression of secret key rate. Specifically, we present two algorithms, i.e., beam-domain based channel probing (BCP) algorithm and interference neutralization based multi-user beam allocation (IMBA) algorithm for the purpose of channel dimension reduction and multi-user pilot reuse, respectively. Numerical results verify that the proposed PKG scheme can achieve the secret key rate that approximates the perfect case, and significantly reduce the dimension of the channel estimation and pilot overhead.
Physical-layer key generation (PKG) based on channel reciprocity has recently emerged as a new technique to establish secret keys between devices. Most works focus on pairwise communication scenarios with single or small-scale antennas. However, the fifth generation (5G) wireless communications employ massive multiple-input multiple-output (MIMO) to support multiple users simultaneously, bringing serious overhead of reciprocal channel acquisition. This paper presents a multi-user secret key generation in massive MIMO wireless networks. We provide a beam domain channel model, in which different elements represent the channel gains from different transmit directions to different receive directions. Based on this channel model, we analyze the secret key rate and derive a closed-form expression under independent channel conditions. To maximize the sum secret key rate, we provide the optimal conditions for the Kronecker product of the precoding and receiving matrices and propose an algorithm to generate these matrices with pilot reuse. The proposed optimization design can significantly reduce the pilot overhead of the reciprocal channel state information acquisition. Furthermore, we analyze the security under the channel correlation between user terminals (UTs), and propose a low overhead multi-user secret key generation with non-overlapping beams between UTs. Simulation results demonstrate the near optimal performance of the proposed precoding and receiving matrices design and the advantages of the non-overlapping beam allocation.
By means of the emerging technique of dynamic Time Division Duplex (TDD), the switching point between uplink and downlink transmissions can be optimized across a multi-cell system in order to reduce the impact of inter-cell interference. It has been recently recognized that optimizing also the order in which uplink and downlink transmissions, or more generally the two directions of a two-way link, are scheduled can lead to significant benefits in terms of interference reduction. In this work, the optimization of bi-directional scheduling is investigated in conjunction with the design of linear precoding and equalization for a general multi-link MIMO two-way system. A simple algorithm is proposed that performs the joint optimization of the ordering of the transmissions in the two directions of the two-way links and of the linear transceivers, with the aim of minimizing the interference leakage power. Numerical results demonstrate the effectiveness of the proposed strategy.
Joint user selection (US) and vector precoding (US-VP) is proposed for multiuser multiple-input multiple-output (MU-MIMO) downlink. The main difference between joint US-VP and conventional US is that US depends on data symbols for joint US-VP, wherea s conventional US is independent of data symbols. The replica method is used to analyze the performance of joint US-VP in the large-system limit, where the numbers of transmit antennas, users, and selected users tend to infinity while their ratios are kept constant. The analysis under the assumptions of replica symmetry (RS) and 1-step replica symmetry breaking (1RSB) implies that optimal data-independent US provides nothing but the same performance as random US in the large-system limit, whereas data-independent US is capacity-achieving as only the number of users tends to infinity. It is shown that joint US-VP can provide a substantial reduction of the energy penalty in the large-system limit. Consequently, joint US-VP outperforms separate US-VP in terms of the achievable sum rate, which consists of a combination of vector precoding (VP) and data-independent US. In particular, data-dependent US can be applied to general modulation, and implemented with a greedy algorithm.
Large number of antennas and radio frequency (RF) chains at the base stations (BSs) lead to high energy consumption in massive MIMO systems. Thus, how to improve the energy efficiency (EE) with a computationally efficient approach is a significant ch allenge in the design of massive MIMO systems. With this motivation, a learning-based stochastic gradient descent algorithm is proposed in this paper to obtain the optimal joint uplink and downlink EE with joint antenna selection and user scheduling in single-cell massive MIMO systems. Using Jensens inequality and the characteristics of wireless channels, a lower bound on the system throughput is obtained. Subsequently, incorporating the power consumption model, the corresponding lower bound on the EE of the system is identified. Finally, learning-based stochastic gradient descent method is used to solve the joint antenna selection and user scheduling problem, which is a combinatorial optimization problem. Rare event simulation is embedded in the learning-based stochastic gradient descent method to generate samples with very small probabilities. In the analysis, both perfect and imperfect channel side information (CSI) at the BS are considered. Minimum mean-square error (MMSE) channel estimation is employed in the study of the imperfect CSI case. In addition, the effect of a constraint on the number of available RF chains in massive MIMO system is investigated considering both perfect and imperfect CSI at the BS.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا