اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCapacity of a Multiple-Antenna Fading Channel with a Quantized Precoding Matrix
234
0
0.0
(
0
)
نشر من قبل
Wiroonsak Santipach
تاريخ النشر
2009
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Given a multiple-input multiple-output (MIMO) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. Here we analyze the performance of Random Vector Quantization (RVQ), in which the precoding matrix is selected from a random codebook containing independent, isotropically distributed entries. We assume that channel elements are i.i.d. and known to the receiver, which relays the optimal (rate-maximizing) precoder codebook index to the transmitter using B bits. We first derive the large system capacity of beamforming (rank-one precoding matrix) as a function of B, where large system refers to the limit as B and the number of transmit and receive antennas all go to infinity with fixed ratios. With beamforming RVQ is asymptotically optimal, i.e., no other quantization scheme can achieve a larger asymptotic rate. The performance of RVQ is also compared with that of a simpler reduced-rank scalar quantization scheme in which the beamformer is constrained to lie in a random subspace. We subsequently consider a precoding matrix with arbitrary rank, and approximate the asymptotic RVQ performance with optimal and linear receivers (matched filter and Minimum Mean Squared Error (MMSE)). Numerical examples show that these approximations accurately predict the performance of finite-size systems of interest. Given a target spectral efficiency, numerical examples show that the amount of feedback required by the linear MMSE receiver is only slightly more than that required by the optimal receiver, whereas the matched filter can require significantly more feedback.
قيم البحث
اقرأ أيضاً
In this paper we consider the secure transmission over the fast fading multiple antenna Gaussian broadcast channels with confidential messages (FMGBC-CM), where a multiple-antenna transmitter sends independent confidential messages to two users with
information theoretic secrecy and only the statistics of the receivers channel state information are known at the transmitter. We first use the same marginal property of the FMGBC-CM to classify the non-trivial cases, i.e., those not degraded to the common wiretap channels. We then derive the achievable rate region for the FMGBC-CM by solving the channel input covariance matrices and the inflation factor. Due to the complicated rate region formulae, we resort to low SNR analysis to investigate the characteristics of the channel. Finally, the numerical examples show that under the information-theoretic secrecy requirement both users can achieve positive rates simultaneously.
Communication over the i.i.d. Rayleigh slow-fading MAC is considered, where all terminals are equipped with a single antenna. Further, a communication protocol is considered where all users transmit at (just below) the symmetric capacity (per user) o
f the channel, a rate which is fed back (dictated) to the users by the base station. Tight bounds are established on the distribution of the rate attained by the protocol. In particular, these bounds characterize the probability that the dominant face of the MAC capacity region contains a symmetric rate point, i.e., that the considered protocol strictly attains the sum capacity of the channel. The analysis provides a non-asymptotic counterpart to the diversity-multiplexing tradeoff of the multiple access channel. Finally, a practical scheme based on integer-forcing and space-time precoding is shown to be an effective coding architecture for this communication scenario.
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of s
ecret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multi-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound prove to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.
Recently, the secrecy capacity of the multi-antenna wiretap channel was characterized by Khisti and Wornell [1] using a Sato-like argument. This note presents an alternative characterization using a channel enhancement argument. This characterization
relies on an extremal entropy inequality recently proved in the context of multi-antenna broadcast channels, and is directly built on the physical intuition regarding to the optimal transmission strategy in this communication scenario.
The scaling of coherent and non-coherent channel capacity is studied in a single-input multiple-output (SIMO) block Rayleigh fading channel as both the bandwidth and the number of receiver antennas go to infinity jointly with the transmit power fixed
. The transmitter has no channel state information (CSI), while the receiver may have genie-provided CSI (coherent receiver), or the channel statistics only (non-coherent receiver). Our results show that if the available bandwidth is smaller than a threshold bandwidth which is proportional (up to leading order terms) to the square root of the number of antennas, there is no gap between the coherent capacity and the non-coherent capacity in terms of capacity scaling behavior. On the other hand, when the bandwidth is larger than this threshold, there is a capacity scaling gap. Since achievable rates using pilot symbols for channel estimation are subject to the non-coherent capacity bound, this work reveals that pilot-assisted coherent receivers in systems with a large number of receive antennas are unable to exploit excess spectrum above a given threshold for capacity gain.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
