1,375 research outputs found
Asymptotic Mutual Information Statistics of Separately-Correlated Rician Fading MIMO Channels
Precise characterization of the mutual information of MIMO systems is
required to assess the throughput of wireless communication channels in the
presence of Rician fading and spatial correlation. Here, we present an
asymptotic approach allowing to approximate the distribution of the mutual
information as a Gaussian distribution in order to provide both the average
achievable rate and the outage probability. More precisely, the mean and
variance of the mutual information of the separatelycorrelated Rician fading
MIMO channel are derived when the number of transmit and receive antennas grows
asymptotically large and their ratio approaches a finite constant. The
derivation is based on the replica method, an asymptotic technique widely used
in theoretical physics and, more recently, in the performance analysis of
communication (CDMA and MIMO) systems. The replica method allows to analyze
very difficult system cases in a comparatively simple way though some authors
pointed out that its assumptions are not always rigorous. Being aware of this,
we underline the key assumptions made in this setting, quite similar to the
assumptions made in the technical literature using the replica method in their
asymptotic analyses. As far as concerns the convergence of the mutual
information to the Gaussian distribution, it is shown that it holds under some
mild technical conditions, which are tantamount to assuming that the spatial
correlation structure has no asymptotically dominant eigenmodes. The accuracy
of the asymptotic approach is assessed by providing a sizeable number of
numerical results. It is shown that the approximation is very accurate in a
wide variety of system settings even when the number of transmit and receive
antennas is as small as a few units.Comment: - submitted to the IEEE Transactions on Information Theory on Nov.
19, 2006 - revised and submitted to the IEEE Transactions on Information
Theory on Dec. 19, 200
Indoor wireless communications and applications
Chapter 3 addresses challenges in radio link and system design in indoor scenarios. Given the fact that most human activities take place in indoor environments, the need for supporting ubiquitous indoor data connectivity and location/tracking service becomes even more important than in the previous decades. Specific technical challenges addressed in this section are(i), modelling complex indoor radio channels for effective antenna deployment, (ii), potential of millimeter-wave (mm-wave) radios for supporting higher data rates, and (iii), feasible indoor localisation and tracking techniques, which are summarised in three dedicated sections of this chapter
Code designs for MIMO broadcast channels
Recent information-theoretic results show the optimality of dirty-paper coding (DPC) in achieving the full capacity region of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). This paper presents a DPC based code design for BCs. We consider the case in which there is an individual rate/signal-to-interference-plus-noise ratio (SINR) constraint for each user. For a fixed transmitter power, we choose the linear transmit precoding matrix such that the SINRs at users are uniformly maximized, thus ensuring the best bit-error rate performance. We start with Cover's simplest two-user Gaussian BC and present a coding scheme that operates 1.44 dB from the boundary of the capacity region at the rate of one bit per real sample (b/s) for each user. We then extend the coding strategy to a two-user MIMO Gaussian BC with two transmit antennas at the base-station and develop the first limit-approaching code design using nested turbo codes for DPC. At the rate of 1 b/s for each user, our design operates 1.48 dB from the capacity region boundary. We also consider the performance of our scheme over a slow fading BC. For two transmit antennas, simulation results indicate a performance loss of only 1.4 dB, 1.64 dB and 1.99 dB from the theoretical limit in terms of the total transmission power for the two, three and four user case, respectively
Optimal Transmit Covariance for Ergodic MIMO Channels
In this paper we consider the computation of channel capacity for ergodic
multiple-input multiple-output channels with additive white Gaussian noise. Two
scenarios are considered. Firstly, a time-varying channel is considered in
which both the transmitter and the receiver have knowledge of the channel
realization. The optimal transmission strategy is water-filling over space and
time. It is shown that this may be achieved in a causal, indeed instantaneous
fashion. In the second scenario, only the receiver has perfect knowledge of the
channel realization, while the transmitter has knowledge of the channel gain
probability law. In this case we determine an optimality condition on the input
covariance for ergodic Gaussian vector channels with arbitrary channel
distribution under the condition that the channel gains are independent of the
transmit signal. Using this optimality condition, we find an iterative
algorithm for numerical computation of optimal input covariance matrices.
Applications to correlated Rayleigh and Ricean channels are given.Comment: 22 pages, 14 figures, Submitted to IEEE Transactions on Information
Theor
Compressive Sensing for Feedback Reduction in MIMO Broadcast Channels
We propose a generalized feedback model and compressive sensing based
opportunistic feedback schemes for feedback resource reduction in MIMO
Broadcast Channels under the assumption that both uplink and downlink channels
undergo block Rayleigh fading. Feedback resources are shared and are
opportunistically accessed by users who are strong, i.e. users whose channel
quality information is above a certain fixed threshold. Strong users send same
feedback information on all shared channels. They are identified by the base
station via compressive sensing. Both analog and digital feedbacks are
considered. The proposed analog & digital opportunistic feedback schemes are
shown to achieve the same sum-rate throughput as that achieved by dedicated
feedback schemes, but with feedback channels growing only logarithmically with
number of users. Moreover, there is also a reduction in the feedback load. In
the analog feedback case, we show that the propose scheme reduces the feedback
noise which eventually results in better throughput, whereas in the digital
feedback case the proposed scheme in a noisy scenario achieves almost the
throughput obtained in a noiseless dedicated feedback scenario. We also show
that for a fixed given budget of feedback bits, there exist a trade-off between
the number of shared channels and thresholds accuracy of the feedback SINR.Comment: Submitted to IEEE Transactions on Wireless Communications, April 200
Efficient Optimal Joint Channel Estimation and Data Detection for Massive MIMO Systems
In this paper, we propose an efficient optimal joint channel estimation and
data detection algorithm for massive MIMO wireless systems. Our algorithm is
optimal in terms of the generalized likelihood ratio test (GLRT). For massive
MIMO systems, we show that the expected complexity of our algorithm grows
polynomially in the channel coherence time. Simulation results demonstrate
significant performance gains of our algorithm compared with suboptimal
non-coherent detection algorithms. To the best of our knowledge, this is the
first algorithm which efficiently achieves GLRT-optimal non-coherent detections
for massive MIMO systems with general constellations.Comment: 5 pages, 4 figures, Conferenc
- …