Showing papers on "Channel state information published in 2006"

MIMO Broadcast Channels With Finite-Rate Feedback

Abstract: Multiple transmit antennas in a downlink channel can provide tremendous capacity (i.e., multiplexing) gains, even when receivers have only single antennas. However, receiver and transmitter channel state information is generally required. In this correspondence, a system where each receiver has perfect channel knowledge, but the transmitter only receives quantized information regarding the channel instantiation is analyzed. The well-known zero-forcing transmission technique is considered, and simple expressions for the throughput degradation due to finite-rate feedback are derived. A key finding is that the feedback rate per mobile must be increased linearly with the signal-to-noise ratio (SNR) (in decibels) in order to achieve the full multiplexing gain. This is in sharp contrast to point-to-point multiple-input multiple-output (MIMO) systems, in which it is not necessary to increase the feedback rate as a function of the SNR

Transmit beamforming for physical-layer multicasting

Abstract: This paper considers the problem of downlink transmit beamforming for wireless transmission and downstream precoding for digital subscriber wireline transmission, in the context of common information broadcasting or multicasting applications wherein channel state information (CSI) is available at the transmitter. Unlike the usual "blind" isotropic broadcasting scenario, the availability of CSI allows transmit optimization. A minimum transmission power criterion is adopted, subject to prescribed minimum received signal-to-noise ratios (SNRs) at each of the intended receivers. A related max-min SNR "fair" problem formulation is also considered subject to a transmitted power constraint. It is proven that both problems are NP-hard; however, suitable reformulation allows the successful application of semidefinite relaxation (SDR) techniques. SDR yields an approximate solution plus a bound on the optimum value of the associated cost/reward. SDR is motivated from a Lagrangian duality perspective, and its performance is assessed via pertinent simulations for the case of Rayleigh fading wireless channels. We find that SDR typically yields solutions that are within 3-4 dB of the optimum, which is often good enough in practice. In several scenarios, SDR generates exact solutions that meet the associated bound on the optimum value. This is illustrated using measured very-high-bit-rate Digital Subscriber line (VDSL) channel data, and far-field beamforming for a uniform linear transmit antenna array.

On the Secrecy Capacity of Fading Channels

Abstract: We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full Channel State Information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only the CSI of the legitimate receiver is known at the transmitter, which is characterized next. In each scenario, the perfect secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average SNR goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Remarkably, our results reveal the positive impact of fading on the secrecy capacity and establish the critical role of rate adaptation, based on the main channel CSI, in facilitating secure communications over slow fading channels.

Capacity scaling laws in MIMO relay networks

Abstract: The use of multiple antennas at both ends of a wireless link, popularly known as multiple-input multiple-output (MIMO) wireless, has been shown to offer significant improvements in spectral efficiency and link reliability through spatial multiplexing and space-time coding, respectively. This paper demonstrates that similar performance gains can be obtained in wireless relay networks employing terminals with MIMO capability. We consider a setup where a designated source terminal communicates with a designated destination terminal, both equipped with M antennas, assisted by K single-antenna or multiple-antenna relay terminals using a half-duplex protocol. Assuming perfect channel state information (CSI) at the destination and the relay terminals and no CSI at the source, we show that the corresponding network capacity scales as C = (M/2) log(K) + O(1) for fixed M, arbitrary (but fixed) number of (transmit and receive) antennas N at each of the relay terminals, and K rarr infin. We propose a protocol that assigns each relay terminal to one of the multiplexed data streams forwarded in a "doubly coherent" fashion (through matched filtering) to the destination terminal. It is shown that this protocol achieves the cut-set upper bound on network capacity for fixed M and K rarr infin (up to an O(1)-term) by employing independent stream decoding at the destination terminal. Our protocol performs inter-stream interference cancellation in a completely decentralized fashion, thereby orthogonalizing the effective MIMO channel between source and destination terminals. Finally, we discuss the case where the relay terminals do not have CSI and show that simple amplify-and-forward relaying, asymptotically in K, for fixed M and fixed N ges 1, turns the relay network into a point-to-point MIMO link with high-SNR capacity C = (M/2) log(SNR) + O(1), demonstrating that the use of relays as active scatterers can recover spatial multiplexing gain in poor scattering environments

Fusion of decisions transmitted over Rayleigh fading channels in wireless sensor networks

Abstract: In this paper, we revisit the problem of fusing decisions transmitted over fading channels in a wireless sensor network. Previous development relies on instantaneous channel state information (CSI). However, acquiring channel information may be too costly for resource constrained sensor networks. In this paper, we propose a new likelihood ratio (LR)-based fusion rule which requires only the knowledge of channel statistics instead of instantaneous CSI. Based on the assumption that all the sensors have the same detection performance and the same channel signal-to-noise ratio (SNR), we show that when the channel SNR is low, this fusion rule reduces to a statistic in the form of an equal gain combiner (EGC), which explains why EGC is a very good choice with low or medium SNR; at high-channel SNR, it is equivalent to the Chair-Varshney fusion rule. Performance evaluation shows that the new fusion rule exhibits only slight performance degradation compared with the optimal LR-based fusion rule using instantaneous CSI.

Transmit beamforming in multiple-antenna systems with finite rate feedback: a VQ-based approach

Abstract: This paper investigates quantization methods for feeding back the channel information through a low-rate feedback channel in the context of multiple-input single-output (MISO) systems. We propose a new quantizer design criterion for capacity maximization and develop the corresponding iterative vector quantization (VQ) design algorithm. The criterion is based on maximizing the mean-squared weighted inner product (MSwIP) between the optimum and the quantized beamforming vector. The performance of systems with quantized beamforming is analyzed for the independent fading case. This requires finding the density of the squared inner product between the optimum and the quantized beamforming vector, which is obtained by considering a simple approximation of the quantization cell. The approximate density function is used to lower-bound the capacity loss due to quantization, the outage probability, and the bit error probability. The resulting expressions provide insight into the dependence of the performance of transmit beamforming MISO systems on the number of transmit antennas and feedback rate. Computer simulations support the analytical results and indicate that the lower bounds are quite tight

Fast transfer of channel state information in wireless systems

Abstract: Knowledge of accurate and timely channel state information (CSI) at the transmitter is becoming increasingly important in wireless communication systems. While it is often assumed that the receiver (whether base station or mobile) needs to know the channel for accurate power control, scheduling, and data demodulation, it is now known that the transmitter (especially the base station) can also benefit greatly from this information. For example, recent results in multiantenna multiuser systems show that large throughput gains are possible when the base station uses multiple antennas and a known channel to transmit distinct messages simultaneously and selectively to many single-antenna users. In time-division duplex systems, where the base station and mobiles share the same frequency band for transmission, the base station can exploit reciprocity to obtain the forward channel from pilots received over the reverse channel. Frequency-division duplex systems are more difficult because the base station transmits and receives on different frequencies and therefore cannot use the received pilot to infer anything about the multiantenna transmit channel. Nevertheless, we show that the time occupied in frequency-duplex CSI transfer is generally less than one might expect and falls as the number of antennas increases. Thus, although the total amount of channel information increases with the number of antennas at the base station, the burden of learning this information at the base station paradoxically decreases. Thus, the advantages of having more antennas at the base station extend from having network gains to learning the channel information. We quantify our gains using linear analog modulation which avoids digitizing and coding the CSI and therefore can convey information very rapidly and can be readily analyzed. The old paradigm that it is not worth the effort to learn channel information at the transmitter should be revisited since the effort decreases and the gain increases with the number of antennas.

Capacity of MIMO Rician channels

Abstract: This paper presents exact results on the capacity of multiple-input-multiple-output (MIMO) Rician channels when perfect channel state information (CSI) is assumed at the receiver but the transmitter has neither instantaneous nor statistical CSI. It first derives the exact expression for the average mutual information (MI) rate of MIMO Rician fading channels when the fading coefficients are independent but not necessarily identically distributed. The results for the independent and identically distributed (i.i.d.) MIMO Rician and Rayleigh fading channels are also obtained as special cases. These results are derived using a different approach than the one used by Telatar for the i.i.d. Rayleigh case. The complementary cumulative distribution function (CCDF) of the MI is also obtained using a Gaussian approximation. The CDF of MI can serve as an upper bound to the outage probability of nonergodic MIMO Rician channels. Numerical results confirm that for a fixed channel gain, a strong tine-of-sight component decreases the channel capacity due to the lack of scattering.

Bandwidth- and power-efficient routing in linear wireless networks

Abstract: The goal of this paper is to establish which practical routing schemes for wireless networks are most suitable for power-limited and bandwidth-limited communication regimes. We regard channel state information (CSI) at the receiver and point-to-point capacity-achieving codes for the additive white Gaussian noise (AWGN) channel as practical features, interference cancellation (IC) as possible, but less practical, and synchronous cooperation (CSI at the transmitters) as impractical. We consider a communication network with a single source node, a single destination node, and N-1 intermediate nodes placed equidistantly on a line between them. We analyze the minimum total transmit power needed to achieve a desired end-to-end rate for several schemes and demonstrate that multihop communication with spatial reuse performs very well in the power-limited regime, even without IC. However, within a class of schemes not performing IC, single-hop transmission (directly from source to destination) is more suitable for the bandwidth-limited regime, especially when higher spectral efficiencies are required. At such higher spectral efficiencies, the gap between single-hop and multihop can be closed by employing IC, and we present a scheme based upon backward decoding that can remove all interference from the multihop system with an arbitrarily small rate loss. This new scheme is also used to demonstrate that rates of O(log N) are achievable over linear wireless networks even without synchronous cooperation.

On the Optimal Power Allocation for Nonregenerative OFDM Relay Links

Abstract: We consider a two-hop communication scheme using OFDM modulation. The relay is assumed to be nonregenerative (or amplify-and-forward). We examine the possibilities of power allocation (PA) over the frequency subchannels at source and relay, with respect to separate transmit power constraints, if channel state information at the transmitter (CSIT) is given. We provide the optimal PA at the relay (source) that maximizes the instantaneous rate for a given source (relay) PA. Furthermore, we show that alternate, separate optimization of source and relay PA converges to the solution of the joint optimization of source and relay PA. To further enhance the rate of the considered scheme, the OFDM subchannels of the source to relay and relay to destination channel can be paired according to their actual magnitude. In the case of a joint sum power constraint, we propose to allocate the transmit power between source and relay with respect to average channel attenuation of first and second hop. It is shown that this leads to a information rate that is near to the optimal rate achieved by a joint optimization of source and relay PA with joint transmit power constraint.

Rateless coding over fading channels

Abstract: We propose a framework for communication over fading channels utilizing rateless codes. An implementation using fountain codes is simulated, demonstrating that such a scheme has advantages in efficiency, reliability and robustness over conventional fixed-rate codes, particularly when channel state information is not available at the transmitter.

Optimized transmission for fading multiple-access and broadcast channels with multiple antennas

Abstract: In mobile wireless networks, dynamic allocation of resources such as transmit powers, bit-rates, and antenna beams based on the channel state information of mobile users is known to be the general strategy to explore the time-varying nature of the mobile environment. This paper looks at the problem of optimal resource allocation in wireless networks from different information-theoretic points of view and under the assumption that the channel state is completely known at the transmitter and the receiver. In particular, the fading multiple-access channel (MAC) and the fading broadcast channel (BC) with additive Gaussian noise and multiple transmit and receive antennas are focused. The fading MAC is considered first and a complete characterization of its capacity region and power region are provided under various power and rate constraints. The derived results can be considered as nontrivial extensions of the work done by Tse and Hanly from the case of single transmit and receive antenna to the more general scenario with multiple transmit and receive antennas. Efficient numerical algorithms are proposed, which demonstrate the usefulness of the convex optimization techniques in characterizing the capacity and power regions. Analogous results are also obtained for the fading BC thanks to the duality theory between the Gaussian MAC and the Gaussian BC

Securing wireless systems via lower layer enforcements

Abstract: Although conventional cryptographic security mechanisms are essential to the overall problem of securing wireless networks, these techniques do not directly leverage the unique properties of the wireless domain to address security threats. The properties of the wireless medium are a powerful source of domain-specific information that can complement and enhance traditional security mechanisms. In this paper, we propose to utilize the fact that the radio channel decorre-lates rapidly in space, time and frequency in order to to establish new forms of authentication and confidentiality that operate at the physical layer and can be used to facilitate cross-layer security paradigms. Specifically, for authentication services, we illustrate two channel probing techniques that can be used to verify the authenticity of a transmitter. Similarly, for confidentiality, we examine several strategies for establishing shared secrets/keys between two communicators using the wireless medium. These strategies range from extracting keys from channel state information, to utilizing the channel variability to secretly disseminate keys. We then validate the feasibility of using physical layer techniques for securing wireless systems by presenting results from experiments involving the USRP/GNURadio software defined radio platform.

On the Capacity of Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information

Abstract: A fading broadcast channel is considered where the transmitter employs two antennas and each of the two receivers employs a single receive antenna It is demonstrated that even if the realization of the fading is precisely known to the receivers, the high signal-to-noise (SNR) throughput is greatly reduced if, rather than knowing the fading realization \emph{precisely}, the trasmitter only knows the fading realization \emph{approximately} The results are general and are not limited to memoryless Gaussian fading

Novel Sum-of-Sinusoids Simulation Models for Rayleigh and Rician Fading Channels

Abstract: The statistical properties of Clarke's fading model with a finite number of sinusoids are analyzed, and an improved reference model is proposed for the simulation of Rayleigh fading channels. A novel statistical simulation model for Rician fading channels is examined. The new Rician fading simulation model employs a zero-mean stochastic sinusoid as the specular (line-of-sight) component, in contrast to existing Rician fading simulators that utilize a non-zero deterministic specular component. The statistical properties of the proposed Rician fading simulation model are analyzed in detail. It is shown that the probability density function of the Rician fading phase is not only independent of time but also uniformly distributed over [-pi, pi). This property is different from that of existing Rician fading simulators. The statistical properties of the new simulators are confirmed by extensive simulation results, showing good agreement with theoretical analysis in all cases. An explicit formula for the level-crossing rate is derived for general Rician fading when the specular component has non-zero Doppler frequency

Nonregenerative dual-hop cooperative links with selection diversity

Abstract: The end-to-end performance of dual-hop cooperative diversity systems equipped with nonregenerative relays and a selection combining receiver at the destination terminal over independent and nonidentical Nakagami-m fading channels is studied. Closed-form expressions for the cumulative distribution function and the probability density function of the end-to-end signal-to-noise ratio (SNR) are presented, while analytical formulae are derived for the moments and the moment generating function. Using these statistical results, closed-form expressions for the outage probability are presented for both channel state information and fixed gain relays. Furthermore, for the case of fixed gain relay, the average end-to-end SNR, the amount of fading, and the average bit error rate can be numerically evaluated. The proposed mathematical analysis is complemented by numerical examples, including the effects on the overall performance of the SNRs unbalancing as well as the fading severity.

Optimal linear precoders for MIMO wireless correlated channels with nonzero mean in space-time coded systems

Abstract: This paper proposes linear precoder designs exploiting statistical channel knowledge at the transmitter in a multiple-input multiple-output (MIMO) wireless system. The paper focuses on channel statistics, since obtaining real-time channel state information at the transmitter can be difficult due to channel dynamics. The considered channel statistics consist of the channel mean and transmit antenna correlation. The receiver is assumed to know the instantaneous channel precisely. The precoder operates along with a space-time block code (STBC) and aims to minimize the Chernoff bound on the pairwise error probability (PEP) between a pair of block codewords, averaged over channel fading statistics. Two PEP design criteria are studied-minimum distance and average distance. The optimal precoder with an orthogonal STBC is established, using a convex optimization framework. Different relaxations then extend the solution to systems with nonorthogonal STBCs. In both cases, the precoder is a function of both the channel mean and the transmit correlation. A linear precoder acts as a combination of a multimode beamformer and an input shaping matrix, matching each side to the channel and to the input signal structure, respectively. Both the optimal beam direction and the power of each mode, obtained via a dynamic water-filling process, depend on the signal-to-noise ratio (SNR). Asymptotic analyses of the results reveal that, for all STBCs, the precoder approaches a single-mode beamformer on the dominant right singular vector of the channel mean as the channel K factor increases. On the other hand, as the SNR increases, it approaches an equipower multiple-mode beamformer, matched to the eigenvectors of the transmit correlation. Design examples and numerical simulation results for both orthogonal and nonorthogonal STBC precoding solutions are provided, illustrating the precoding array gain.

Optimal transmission scheduling over a fading channel with energy and deadline constraints

Abstract: We seek to maximize the average data throughput of a single transmitter sending data over a fading channel to a single user class. The transmitter has a fixed amount of energy and a limited amount of time to send data. Given that the channel state determines the throughput obtained per unit of energy expended, the goal is to obtain a policy for scheduling transmissions that maximizes the expected data throughput. We develop a dynamic programming formulation that leads to an optimal transmission schedule, first where the present channel state is known just before transmission, and then to the case where the current channel state is unknown before transmission, but observed after transmission and evolves according to a Markov process. We then extend our approach to the problem of minimizing the expected energy required to send a fixed amount of data over a fading channel given deadline constraints.

Outage minimization with limited feedback for the fading relay channel

Abstract: In this paper, we consider practical methods to approach the theoretical performance limits in the fading relay channel under different assumptions of transmitter channel knowledge. Specifically, we consider two degrees of transmitter channel knowledge: 1) perfect feedback is available and power control is employed and 2) no channel state knowledge is available at the transmitters and only spatial power allocation is possible. First, when perfect feedback is available, the optimal power control policy determines the ultimate limits of performance for constant rate transmission in the slow fading environment. However, in practice, perfect channel knowledge is not possible at the transmitters due to the finite capacity of the feedback links. We find practical methods to approach this performance limit through the use of power control with finite rate feedback. The finite-rate feedback results are shown for the low-complexity, full-diversity amplify-and-forward (AF) protocol. Interestingly, we see that only a few feedback bits are needed to achieve most of the gains of the optimal perfect feedback power control algorithm. Second, we consider the performance limit when the transmitters have no channel state knowledge and derive the optimal spatial power allocation between the source and relay for a given sum power constraint for the AF protocol. For most practical cases of interest, equal power allocation between the source and relay is shown to be nearly optimal. Our work suggests that there is minimal power savings from using spatial power allocation at the transmitters. To obtain large performance improvements over constant power transmission, it is imperative to have feedback for each realization of the channel state to allow for temporal power control.

Adaptive OFDM Systems With Imperfect Channel State Information

Abstract: Adaptive modulation has been shown to have significant benefits for high-speed wireless data transmission when orthogonal frequency division multiplexing (OFDM) is employed. However, accurate channel state information (CSI) is required at the transmitter to achieve the benefits. Imperfect CSI arises from noisy channel estimates, which may also be outdated due to a delay in getting the CSI to the transmitter. In this paper, we study adaptive OFDM with imperfect CSI for the uncoded variable bit rate case, where a target bit error rate is set. A loading algorithm based on the statistics of the real channel is proposed. Performance results in terms of the average spectral efficiency are provided for adaptive OFDM systems when there is noisy channel estimation or CSI delay. The use of multiple estimates is then proposed to improve the performance. It is shown that multiple estimates from different frequencies or times can enhance the performance significantly, which enables the system to tolerate larger errors in channel estimation or longer delay in CSI

Interpolation Based Unitary Precoding for Spatial Multiplexing MIMO-OFDM With Limited Feedback

Abstract: Spatial multiplexing with linear precoding is a simple technique for achieving high spectral efficiency in multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. Linear precoding requires channel state information for each OFDM subcarrier, which can be achieved using feedback. To reduce the amount of feedback, this paper proposes a limited feedback architecture that combines precoder quantization with a special matrix interpolator. In the proposed system, the receiver sends information about a fraction of the precoding matrices to the transmitter and the transmitter reconstructs the precoding matrices for all the subcarriers. A new interpolator is proposed inspired by spherical interpolation that respects the orthogonal columns of the precoding matrices and the performance invariance to right multiplication by a unitary matrix. The interpolator is parameterized by a set of unitary matrices; a construction of a suitable set is briefly described. Simulations illustrate the performance of limited feedback precoding with coding, estimation or prediction error, and time variation for bit error rate (BER), mutual information, and mean squared error (MSE)

MIMO communications in ad hoc networks

Abstract: We study in this paper the network spectral efficiency of a multiple-input multiple-output (MIMO) ad hoc network with K simultaneous communicating transmitter-receiver pairs. Assuming that each transmitter is equipped with t antennas and each receiver with r antennas and each receiver implements single-user detection, we show that in the absence of channel state information (CSI) at the transmitters, the asymptotic network spectral efficiency is limited by r nats/s/Hz as Krarrinfin and is independent of t and the transmit power. With CSI corresponding to the intended receiver available at the transmitter, we demonstrate that the asymptotic spectral efficiency is at least t+r+2radictr nats/s/Hz. Asymptotically optimum signaling is also derived under the same CSI assumption, i.e., each transmitter knows the channel corresponding to its desired receiver only. Further capacity improvement is possible with stronger CSI assumption; we demonstrate this using a heuristic interference suppression transmit beamforming approach. The conventional orthogonal transmission approach is also analyzed. In particular, we show that with idealized medium access control, the channelized transmission has unbounded asymptotic spectral efficiency under the constant per-user power constraint. The impact of different power constraints on the asymptotic spectral efficiency is also carefully examined. Finally, numerical examples are given that confirm our analysis

Design and analysis of linear distributed MIMO relaying algorithms

Abstract: The use of multiple antennas at both ends of a wireless link, also known as multiple-input multiple-output (MIMO) wireless, has been shown to offer significant improvements in the quality of communication in terms of both higher data rates and better reliability at no additional cost of spectrum or power. In this paper, MIMO communication in a wireless network is considered where multiple MIMO source-destination pair terminals simultaneously communicate through a large common set of MIMO relay terminals. With ever increasing demands for tetherless, ubiquitous and high data rate applications, there has been great interest in developing novel decentralised communication methods through distributed relaying techniques to enhance performance and enable more efficient usage of system resources. Distributed MIMO linear relaying techiques are designed that take advantage of local channel state information (CSI) at the relay terminals to simultaneously beamform multiple users' signals to their intended destinations. The merits of distributed MIMO relaying over direct transmissions through the analytical characterisation of the signal-to-interference ratio (SIR) statistics in the high and low signal-to-noise ratio (SNR) regimes are demonstrated and theoretical predictions are verified by numerical simulations. Finally, relay beamforming based on the quantised finite-rate feedback of the channel states is considered and the SIR degradation through Monte-Carlo simulations is quantified.

A useful integral for wireless communication theory and its application to rectangular signaling constellation error rates

Abstract: A useful integral, representing the average over Rayleigh fading of the product of two Gaussian Q-functions, is solved in closed-form. A closed-form solution for the symbol-error probability of general rectangular quadrature amplitude modulation in Rayleigh fading is derived.

Adaptive downlink multi-user MIMO wireless systems for correlated channels with imperfect CSI

Abstract: Multiple-input multiple-output (MIMO) wireless antenna systems provide increases in capacity without the need for additional spectrum or power. However the capacity increase is limited when the number of antennas at the receiver is fixed or restricted (due to mobile size constraints for example). To overcome this limitation multi-user MIMO can be used, which allows several users to be served simultaneously in frequency and time. A disadvantage of these multi-user MIMO systems, when used in the downlink however, is that they need accurate channel state information (CSI) at the transmitter and also uncorrelated channels among users. In this paper we investigate methods to address the problems of multi-user MIMO systems in spatially correlated channels. We adopt the concept of angle between subspaces to characterize the inter-user spatial correlation and adapt the algorithm to those conditions. We also investigate the impact of the accuracy of CSI at the transmitter (CSIT) and whether more limited CSI such as channel correlation information alone can be used to provide good multi-user MIMO performance. Results are presented as various simulated capacity measures and we use them to make comparisons between the various multi-user MIMO configurations

Linear MMSE Multi-User MIMO Downlink Precoding for Users with Multiple Antennas

Abstract: In this paper, the multi-user MIMO downlink channel is considered, where a single transmitter (base station) sends data to several users within the same resource unit. Assuming perfect channel state information (CSI) at the transmitter, different linear precoding schemes are studied, aiming at mean square error minimizing transmission to all users. The exact MMSE solution can be obtained by exploiting up-link/downlink duality. A suboptimal solution based on necessary conditions for MMSE optimality may also be computed directly in the downlink domain. Our results indicate that the performance difference between the direct and duality-based method that is visible in uncoded BER curves vanishes when channel coding is introduced to the system. We also compare the MMSE-optimal approaches to other existing linear precoding schemes (BD, S-MMSE).

Diversity analysis of single and multiple beamforming

Abstract: In this letter, we study two techniques, known as single and multiple beamforming, to exploit the perfect channel state information (CSI) available both at the transmitter and the receiver of a multiantenna wireless system. Assuming N and M are the number of antennas at the transmitter and the receiver, respectively, we show that single beamforming (transmission of a single symbol from all transmit antennas at the same time, employing the best subchannel) can achieve the maximum spatial diversity order in the channel (NM). We extend our analytical results to multiple beamforming (transmission of S symbols simultaneously, S>1) and calculate that the diversity order achievable for this system is (N-S+1)(M-S+1)

Capacity of correlated MIMO Rayleigh channels

Abstract: -This paper presents some exact results on the capacity of multiple-input-multiple-output (MIMO) channels subject to correlated Rayleigh fading when perfect channel state information (CSI) is known at the receiver. The authors focus on the semicorrelated scenario in which correlation exists either at the transmitter or at the receiver., They consider two cases: 1) the transmitter does not have any CSI and as such allocates power equally among transmitter antennas and 2) the transmitter only knows the statistical distribution of the channel. The first case derives the moment generating function (MGF) of the mutual information (MI) and then deduces from this MGF the mean MI. The authors also study the cumulative distribution function (CDF) of the MI, which can serve as an upper bound to the outage probability under the capacity versus outage formulation when the channel is nonergodic. The second case studies the capacity achieved by optimum power-loading and beamforming schemes based on covariance feedback. Numerical results illustrate that the full capacity of MIMO systems can be preserved even for relatively high values of correlation coefficients.

Multipath fading in wireless sensor networks: measurements and interpretation

Abstract: Multipath fading heavily contributes to the unreliability of wireless links, causing fairly large deviations from link quality predictions based on path loss models; its impact on wireless sensor networks is considerable. Although analytical models provide a probabilistic description, multipath fading is a deterministic phenomenon. Moreover, in the case of static nodes, fading is time-invariant. We illustrate its spatial nature with experimental evidence obtained using lower-end sensing node hardware. We also show the limitations of the supposed immunity of wideband radios to multipath fading in indoor deployments.

Varying size coefficients in a wireless local area network return channel

Abstract: Sending channel related parameters known as channel state information (CSI) over a WLAN return channel. The size of these coefficients is not fixed. Rather, the coefficients are quantized in a certain resolution, which is determined adaptively according to a measure of the channel quality. This allows minimizing the component of the bandwidth of the wireless connection that is not used for payload transfer.