Showing papers on "Channel state information published in 2003"

A performance study of dual-hop transmissions with fixed gain relays

Abstract: The paper presents a study on the end-to-end performance of dual-hop wireless communication systems equipped with non-regenerative fixed gain relays and operating over flat Rayleigh fading channels. More specifically, it first derives generic closed-form expressions for the outage probability and the average probability of error when the relays have arbitrary fixed gains. It then proposes a specific fixed gain relay that benefits from the knowledge of the first hop's average fading power and compares its performance with previously proposed relay gains that, in contrast, require knowledge of the instantaneous channel state information of the first hop. Finally, the paper investigates the effect of the relay saturation on the performance of the systems under consideration. Numerical results show that non-regenerative systems with fixed gain relays have a comparable performance to non-regenerative systems with variable gain relays. These results also show that relay saturation of these systems results in a minimal loss in performance.

Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels

Abstract: A technique is proposed for the derivation of upper bounds on channel capacity. It is based on a dual expression for channel capacity where the maximization (of mutual information) over distributions on the channel input alphabet is replaced with a minimization (of average relative entropy) over distributions on the channel output alphabet. We also propose a technique for the analysis of the asymptotic capacity of cost-constrained channels. The technique is based on the observation that under fairly mild conditions capacity achieving input distributions "escape to infinity." The above techniques are applied to multiple-antenna flat-fading channels with memory where the realization of the fading process is unknown at the transmitter and unknown (or only partially known) at the receiver. It is demonstrated that, for high signal-to-noise ratio (SNR), the capacity of such channels typically grows only double-logarithmically in the SNR. To better understand this phenomenon and the rates at which it occurs, we introduce the fading number as the second-order term in the high-SNR asymptotic expansion of capacity, and derive estimates on its value for various systems. It is suggested that at rates that are significantly higher than the fading number, communication becomes extremely power inefficient, thus posing a practical limit on practically achievable rates. Upper and lower bounds on the fading number are also presented. For single-input-single-output (SISO) systems the bounds coincide, thus yielding a complete characterization of the fading number for general stationary and ergodic fading processes. We also demonstrate that for memoryless multiple-input single-output (MISO) channels, the fading number is achievable using beam-forming, and we derive an expression for the optimal beam direction. This direction depends on the fading law and is, in general, not the direction that maximizes the SNR on the induced SISO channel. Using a new closed-form expression for the expectation of the logarithm of a noncentral chi-square distributed random variable we provide some closed-form expressions for the fading number of some systems with Gaussian fading, including SISO systems with circularly symmetric stationary and ergodic Gaussian fading. The fading number of the latter is determined by the fading mean, fading variance, and the mean squared error in predicting the present fading from its past; it is not directly related to the Doppler spread. For the Rayleigh, Ricean, and multiple-antenna Rayleigh-fading channels we also present firm (nonasymptotic) upper and lower bounds on channel capacity. These bounds are asymptotically tight in the sense that their difference from capacity approaches zero at high SNR, and their ratio to capacity approaches one at low SNR.

MIMO capacity with interference

Abstract: System capacity is considered for a group of interfering users employing single-user detection and multiple transmit and receive antennas for flat Rayleigh-fading channels with independent fading coefficients for each path. The focus is on the case where there is no channel state information at the transmitter, but channel state information is assumed at the receiver. It is shown that the optimum signaling is sometimes different from cases where the users do not interfere with each other. In particular, the optimum signaling will sometimes put all power into a single transmitting antenna, rather than divide power equally between independent streams from the different antennas. If the interference is either sufficiently weak or sufficiently strong, we show that either the optimum interference-free approach, which puts equal power into each antenna, or the approach that puts all power into a single antenna is optimum and we show how to find the regions where each approach is best.

Optimized signaling for MIMO interference systems with feedback

Abstract: The system mutual information of a multiple-input multiple-output (MIMO) system with multiple users which mutually interfere is considered. Perfect channel state information is assumed to be known to both transmitters and receivers. Asymptotic performance analysis shows that the system mutual information changes behavior as the interference becomes sufficiently strong. In particular, beamforming is the optimum signaling for all users when the interference is large. We propose several numerical approaches to decide the covariance matrices of the transmitted signals and compare their performance in terms of the system mutual information. We model the system as a noncooperative game and perform iterative water-filling to find the Nash equilibrium distributively. A centralized global approach and a distributed iterative approach based on the gradient projection method are also proposed. Numerical results show that all proposed approaches give better performance than the standard signaling, which is optimum for the case without interference. Both the global and the iterative gradient projection methods are shown to outperform the Nash equilibrium significantly.

A broadcast approach for a single-user slowly fading MIMO channel

Abstract: A broadcast transmission strategy for the slowly fading Gaussian multiple-input multiple-output (MIMO) channel is introduced. This broadcast strategy is an extension of the single-input single-output (SISO) broadcast approach. Perfect channel state information (CSI) is assumed known at the receiver end only. This strategy facilitates to adapt the reliably decoded rate to the actual channel state without having any feedback link to the transmitter. Transmission of layered coded information is motivated by the theory of majorization. We derive the basic equations characterizing achievable rates of the strategy. Several ad hoc approximations to the achievable region are considered and their performance is compared with the SISO setting and the ergodic capacity. It has been demonstrated that a single-layer outage approach is reasonably efficient in the MIMO setting in terms of the average reliably decoded rate. A multiple-access channel (MAC) broadcast approach is also applied for the MIMO case, and demonstrated to be relatively efficient.

On the capacity of MIMO broadcast channel with partial side information

Abstract: Since having full channel state information in the transmitter is not reasonable in many applications and lack of channel knowledge does not lead to linear growth of the sum rate capacity as the number transmit antennas increases, it is therefore of interest to investigate transmission schemes that employ only partial CSI. In this paper, we propose a scheme that constructs M random beams and that transmits information to the users with the highest signal-to-noise-plus-interference ratios (SINRs), which can be made available to the transmitter with very little feedback. For fixed M and n increasing, the sum-rate capacity of our scheme scales as M log log n, which is precisely the same scaling obtained with perfect channel information. We furthermore show that linear increase in capacity can be obtained provided that M does not grow faster than O(log n). We also study the fairness of our scheduling scheme and show that, when M is large enough, the system becomes interference-dominated and the probability of transmitting to any user converges to 1/n, irrespective of its path-loss. In fact, using M = /spl alpha/ log n transmit antennas emerges as a desirable operating point, both in terms of providing linear increase in capacity as well as in guaranteeing fairness.

Optimal transmitter eigen-beamforming and space-time block coding based on channel correlations

Abstract: Optimal transmitter designs obeying the water-filling principle are well-documented, and widely applied, when the propagation channel is deterministically known and regularly updated at the transmitter. Because channel state information (CSI) may be costly or impossible to acquire in rapidly varying wireless environments, we develop in this paper statistical water-filling approaches for stationary random fading channels. These approaches require only knowledge of the channel correlations that do not necessitate frequent updates, and can be easily acquired. Applied to a multiple transmit-antenna paradigm, our optimal transmitter design turns out to be an eigen-beamformer with multiple beams pointing to orthogonal directions along the eigenvectors of the channel's correlation matrix, and with proper power loading across the beams. The optimality pertains to minimizing a tight bound on the symbol error rate. The resulting loaded eigen-beamforming outperforms not only the equal-power allocation across all antennas, but also the conventional beamformer that transmits the available power along the strongest direction. Coupled with orthogonal space-time block codes, two-dimensional (2-D) eigen-beamforming emerges as a more attractive choice than conventional one-dimensional (1-D) beamforming with uniformly better performance, without rate reduction, and without complexity increase.

Fading correlations in wireless MIMO communication systems

Abstract: We investigate the effects of fading correlations on wireless communication systems employing multiple antennas at both the receiver and the transmitter side of the link, so called multiple-input multiple-output (MIMO) systems. It turns out that the amount of transmitter sided channel knowledge plays an important part when dealing with fading correlations. Furthermore, the possible availability of time diversity in a time-selective channel can have essential influence on performance. To study the influence of time-selectivity, the concept of sample-mean outage is introduced and applied to information theoretic measures, like capacity or cutoff rate. It will be shown, that in some cases correlated fading may offer better performance than uncorrelated fading permits, which is due to exploitable antenna gain, that will also be defined in a general form for MIMO systems.

Measurements of small-scale fading and path loss for long range RF tags

Abstract: RF modulated backscatter (RFMB), also known as modulated radar cross section or sigma modulation, is a RF transmission technique useful for short-range, low-data-rate applications, such as nonstop toll collection, electronic shelf tags, freight container identification and chassis identification in automobile manufacturing, that are constrained to have extremely low power requirements. The small-scale fading observed on the backscattered signal has deeper fades than the signal from a traditional one-way link of the same range in the same environment because the fading on the backscattered signal is the product of the fading on the off-board-generated carrier times the fading on the reflected signal. This paper considers the continuous wave (CW) type of RFMB, in which the interrogator transmitter and receiver antennas are different. This two-way link also doubles the path loss exponent of the one-way link. This paper presents the cumulative distribution functions for the measured small-scale fading and the measured path loss for short ranges in an indoor environment at 2.4 GHz over this type of link.

Uniform power allocation in mimo channels: a came-theoretic approach

Abstract: When transmitting over multiple-input-multiple-output (MIMO) channels, there are additional degrees of freedom with respect to single-input-single-output (SISO) channels: the distribution of the available power over the transmit dimensions. If channel state information (CSI) is available, the optimum solution is well known and is based on diagonalizing the channel matrix and then distributing the power over the channel eigenmodes in a "water-filling" fashion. When CSI is not available at the transmitter, but the channel statistics are a priori known, an optimal fixed power allocation can be precomputed. This paper considers the case in which not even the channel statistics are available, obtaining a robust solution under channel uncertainty by formulating the problem within a game-theoretic framework. The payoff function of the game is the mutual information and the players are the transmitter and a malicious nature. The problem turns out to be the characterization of the capacity of a compound channel which is mathematically formulated as a maximin problem. The uniform power allocation is obtained as a robust solution (under a mild isotropy condition). The loss incurred by the uniform distribution is assessed using the duality gap concept from convex optimization theory. Interestingly, the robustness of the uniform power allocation also holds for the more general case of the multiple-access channel.

Performance of multicode DS-CDMA using frequency domain equalisation in frequency selective fading channel

Abstract: For the reception of multicode direct sequence (DS)-CDMA signals, the MMSE frequency domain equalisation is applied instead of RAKE combining. The achievable BER performance in a frequency selective Rayleigh fading channel is evaluated by computer simulation. It is shown by computer simulation that the DS-CDMA with MMSE frequency domain equalisation outperforms the DS-CDMA with RAKE combining and shows only slight performance degradation compared to the MC-CDMA with minimum mean square error combining (MMSEC).

Antenna selection for multiple-antenna transmission systems: performance analysis and code construction

Abstract: This correspondence studies antenna selection for wireless communications systems that employ multiple transmit and receive antennas. We assume that (1) the channel is characterized by quasi-static Rayleigh flat fading, and the subchannels fade independently, (2) the channel state information (CSI) is exactly known at the receiver, (3) the selection is available only at the receiver, and it is based on the instantaneous signal-to-noise ratio (SNR) at each receive antenna, and (4) space-time codes are used at the transmitter. We analyze the performance of such systems by deriving explicit upper bounds on the pairwise error probability (PEP). This performance analysis shows that (1) by selecting the set of antennas that observe the largest instantaneous SNR, one can achieve the same diversity gain as the one obtained by using all the receive antennas, provided that the underlying space-time code has full spatial diversity, and (2) in the case of rank-deficient space-time codes, the diversity gain may be dramatically reduced when antenna selection is used. However, we emphasize that in both cases the coding gain is reduced with antenna selection compared to the full complexity system. Based on the upper bounds derived, we describe code design principles suitable for antenna selection. Specifically, for systems with two transmit antennas, we design space-time codes that perform better than the known ones when antenna selection is employed. Finally, we present numerical examples and simulation results that validate our analysis and code design principles.

Performance of adaptive MC-CDMA detectors in rapidly fading Rayleigh channels

Abstract: Multicarrier code-division multiple access (MC-CDMA) combines multicarrier transmission with direct sequence spread spectrum. Different approaches have been adopted which do not assume a perfectly known channel. We examine the forward-link performance of decision-directed adaptive detection schemes, with and without explicit channel estimation, for MC-CDMA systems operating in fast fading channels. We analyze theoretically the impact of channel estimation errors by first considering a simpler system employing a threshold orthogonality restoring combining (TORC) detector with a Kalman channel estimator. We show that the performance deteriorates significantly as the channel fading rate increases and that the fading rate affects the selection of system parameters. We examine the performance of more realistic schemes based on the minimum mean square error (MMSE) criterion using least mean square (LMS) and recursive least square (RLS) adaptation. We present a discussion which compares the decision-directed and pilot-aided approaches and explores the tradeoffs between channel estimation overhead and performance. We find that there is a fading rate range where each method provides a good tradeoff between performance and overhead. We conclude that the MMSE per carrier decision-directed detector with RLS estimation combines good performance in low to moderate fading rates, robustness in parameter variations, and relatively low complexity and overhead. For higher fading rates, however, only pilot-symbol-aided detectors are appropriate.

Asymptotic performance of MIMO wireless channels with limited feedback

Abstract: We consider a single-user, point-to-point communication system with M transmit and N receive antennas with independent flat Rayleigh fading between antenna pairs. The mutual information of the multi-input/multi-output (MlMO) channel is maximized when the transmitted symbol vector is a Gaussian random vector with covariance matrix Q. The optimal Q depends on how much channel state information is available at the transmitter. Namely, in the absence of any channel state information, the optimal Q is full-rank and isotropic, whereas with perfect channel knowledge, the optimal Q has columns which are the eigenvectors of the channel, and has rank at most min {M, N}. We assume that the receiver can feed back B bits to the transmitter (per codeword). The feedback bits are used to choose the columns of Q from a random set of i.i.d. vectors. We compute the mutual information as a function of both B and the rank of Q. Our results are asymptotic in the number of antennas, and show how much feedback is needed to achieve a rate, which is close to the capacity with perfect channel knowledge at the transmitter.

Degrees of freedom in some underspread MIMO fading channels

Abstract: Consider a multiple-input multiple-output (MIMO) fading channel in which the fading process varies slowly over time. Assuming that neither the transmitter nor the receiver have knowledge of the fading process, do multiple transmit and receive antennas provide significant capacity improvements at high signal-to-noise ratio (SNR)? For regular fading processes, recent results show that capacity ultimately grows doubly logarithmically with the SNR independently of the number of transmit and receive antennas used. We show that for the Gauss-Markov fading process in all regimes of practical interest the use of multiple antennas provides large capacity improvements. Nonregular fading processes show completely different high-SNR behaviors due to the perfect predictability of the process from noiseless observations. We analyze the capacity of MIMO channels with nonregular fading by presenting a lower bound, which we specialize to the case of band-limited slowly varying fading processes to show that the use of multiple antennas is still highly beneficial. In both cases, regular and nonregular fading, this capacity improvement can be seen as the benefit of having multiple spatial degrees of freedom. For the Gauss-Markov fading model and all regimes of practical interest, we present a communication scheme that achieves the full number of degrees of freedom of the channel with tractable complexity. Our results for underspread Gauss-Markov and band-limited nonregular fading channels suggest that multiple antennas are useful at high SNR.

Capacity of multiple-antenna systems with both receiver and transmitter channel state information

Abstract: The capacity of multiple-antenna systems operating in Rayleigh flat fading is considered under the assumptions that channel state information (CSI) is available at both transmitter and receiver, and that the transmitter is subjected to an average power constraint. First, the capacity of such systems is derived for the special case of multiple transmit antennas and a single receive antenna. The optimal power-allocation scheme for such a system is shown to be a water-filling algorithm, and the corresponding capacity is seen to be the same as that of a system having multiple receive antennas (with a single transmitter antenna) whose outputs are combined via maximal ratio combining. A suboptimal adaptive transmission technique that transmits only over the antenna having the best channel is also proposed for this special case. It is shown that the capacity of such a system under the proposed suboptimal adaptive transmission scheme is the same as the capacity of a system having multiple receiver antennas (with a single transmitter antenna) combined via selection combining. Next, the capacity of a general system of multiple transmitter and receiver antennas is derived together with an equation that determines the cutoff value for such a system. The optimal power allocation scheme for such a multiple-antenna system is given by a matrix water-filling algorithm. In order to eliminate the need for cumbersome numerical techniques in solving the cutoff equation, approximate expressions for the cutoff transmission value are also provided. It is shown that, compared to the case in which there is only receiver CSI, large capacity gains are available with optimal power and rate adaptation schemes. The increased capacity is shown to come at the price of channel outage, and bounds are derived for this outage probability.

Power control for partial channel-state information (csi) multiple-input, multiple-output (mimo) systems

Abstract: Techniques for controlling the transmit power for a number of data streams in a wireless multi-channel (e.g., MIMO) communication system. In one method, a number of received symbol streams are initially processed in accordance with a particular (e.g., CCMI, CCMI-SC, MMSE, or MMSE-SC) receiver processing technique to provide a number of detected data streams. The post-detection SNRs of the detected data streams are estimated, and each SNR that exceeds a setpoint is identified. This setpoint may correspond to (1) the SNR needed to achieve the maximum allowed spectral efficiency or (2) the target SNR needed to achieve a specified spectral efficiency. A new (or adjusted) transmit power for each detected data stream associated with a post-detection SNR that exceeds the setpoint is determined and used for the data stream. Different power control schemes are provided for different classes of receiver processing techniques with different characteristics.

Soft quasi-maximum-likelihood detection for multiple-antenna wireless channels

Abstract: The paper addresses soft maximum-likelihood (ML) detection for multiple-antenna wireless communication channels. We propose a soft quasi-ML detector that maximizes the log-likelihood function by deploying a semi-definite relaxation (SDR). Given perfect channel state information at the receiver, the quasi-ML SDR detector closely approximates the performance of the optimal ML detector in both coded and uncoded multiple-input, multiple-output (MIMO) channels with quadrature phase-shift keying (QPSK) modulation and frequency-flat Rayleigh fading. The complexity of the quasi-ML SDR detector is much less than that of the optimal ML detector, thus offering more favorable performance/complexity characteristics. In contrast to the existing sphere decoder, the new quasi-ML detector enjoys guaranteed polynomial worst-case complexity. The two detectors exhibit quite comparable performance in a variety of ergodic QPSK MIMO channels, but the complexity of the quasi-ML detector scales better with increasing number of transmit and receive antennas, especially in the region of low signal-to-noise ratio (SNR).

On the capacity of multiuser wireless channels with multiple antennas

Abstract: The advantages of multiuser communication, where many users are allowed to simultaneously transmit or receive in a common bandwidth, are considered for multiple-antenna systems in a high signal-to-noise ratio (SNR) regime. Assuming channel state information at receiver (CSIR) to be available, the ergodic capacity is characterized for both unbiased and biased channels, and the quantitative capacity gain of a multiple-antenna multiuser system is analyzed for multiple-access channels. For highly biased (correlated) channels, a multiuser system is shown to be inherently superior to a single-user system (a time- or frequency-division multiple-access (TDMA or FDMA) based system) due to the underlying multiuser diversity, and the sum capacity is shown to scale linearly with the number of antennas. For unbiased channels, the characteristics of ergodic capacity are shown to transfer to outage capacity when a large degree of space diversity exists, and to deterministic capacity when the number of receive antennas is large. Also, a brief discussion on the multiuser multiple-antenna communication in broadcast channel is provided.

Spatial multiplexing in correlated fading via the virtual channel representation

Abstract: Spatial multiplexing techniques send independent data streams on different transmit antennas to maximally exploit the capacity of multiple-input multiple-output (MIMO) fading channels. Most existing multiplexing techniques are based on an idealized MIMO channel model representing a rich scattering environment. Realistic channels corresponding to scattering clusters exhibit correlated fading and can significantly compromise the performance of such techniques. In this paper, we study the design and performance of spatial multiplexing techniques based on a virtual representation of realistic MIMO fading channels. Since the nonvanishing elements of the virtual channel matrix are uncorrelated, they capture the essential degrees of freedom in the channel and provide a simple characterization of channel statistics. In particular, the pairwise-error probability (PEP) analysis for correlated channels is greatly simplified in the virtual representation. Using the PEP analysis, various precoding schemes are introduced to improve performance in virtual channels. Unitary precoding is proposed to provide robustness to unknown channel statistics. Nonunitary precoding techniques are proposed to exploit channel structure when channel statistics are known at the transmitter. Numerical results are presented to illustrate the attractive performance of the precoding techniques.

Adaptive modulation for multi-antenna transmissions with channel mean feedback

Abstract: Adaptive modulation has the potential to increase the system throughput significantly by matching transmitter parameters to time-varying channel conditions. However, adaptive modulation assuming perfect channel state information (CSI) is sensitive to CSI imperfections induced by estimation errors and feedback delays. In this paper, we design adaptive modulation schemes for multi-antenna transmission based on partial CSI, that models the spatial fading channels as Gaussian random variables with non-zero mean and white covariance, conditioned on feedback information. Based on a two-directional beamformer, our proposed transmitter optimally adapts the beam directions, the power allocation between two beams, and the signal constellation, to maximize the transmission rate while maintaining a target bit error rate (BER). Numerical results demonstrate the rate improvement, and illustrate an interesting tradeoff that emerges between feedback quality and hardware complexity.

Pilot-assisted estimation of MIMO fading channel response and achievable data rates

Abstract: We analyze the effects of pilot-assisted channel estimation on achievable data rates (lower bound on information capacity) over a frequency flat time-varying channel. Under a block-fading channel model, the effects of the estimation error are evaluated in the case of the estimates being available at the receiver only (open loop) and in the case when the estimates are fed back to the transmitter allowing water pouring transmitter optimization (closed loop). Using a characterization of the effective noise due to estimation error, we analyze the achievable rates as a function of the power allocated to the pilot, the channel coherence time, the background noise level, as well as the number of transmit and receive antennas. The analysis presented here can be used to optimally allocate pilot power for various system and channel operating conditions, and to also determine the effectiveness of closed loop feedback.

Nakagami-m fading modeling in the frequency domain for OFDM system analysis

Abstract: Nakagami-m fading modeling in the frequency domain is investigated. For frequency-selective Nakagami-m fading channels, we show the magnitudes of the channel frequency responses to be also Nakagami-m distributed random variables with fading and mean power parameters as explicit functions of the fading and mean power parameters of the channel impulse responses. Based on this new model, the bit error rate performance of an orthogonal frequency-division multiplexing system with receive diversity over correlated Nakagami-m fading channels is analytically evaluated and some numerical results are given.

Reallocation of excess power for full channel-state information (CSI) multiple-input, multiple-output (MIMO) systems

Abstract: Techniques to allocate the total transmit power to the transmission channels in a multi-channel communication system such that higher overall system spectral efficiency and/or other benefits may be achieved. The total transmit power may be initially allocated to the transmission channels based on a particular power allocation scheme (e.g., the water-filling scheme). The initial allocation may result in more power being allocated to some transmission channels than needed to achieve the required SNR (e.g., the SNR needed to achieve the maximum allowed data rate), which would then result in these transmission channels being operated in the saturation region. In such situations, the techniques reallocate the excess transmit power of transmission channels operated in the saturation region to other transmission channels operated below the saturation region. In this way, higher data rate may be achieved for the “poorer” transmission channels without sacrificing the performance of the “better” transmission channels.

On the performance of cooperative diversity protocols in practical wireless systems

Abstract: The concepts of cooperative diversity promise to offer the benefits of spatial diversity gains to handheld wireless devices with single antennas. The information-theoretic bounds that have been established recently serve as basic guidelines; yet, the performance of such protocols should additionally be examined for more realistic assumptions. Towards this end, we study cooperative diversity protocols for systems employing limited modulation alphabets and realistic receiver structures regarding the knowledge of channel state information. Our findings imply that under these conditions full second order diversity can only be achieved by using adaptive versions of cooperative protocols. As with other diversity schemes (e.g. space time block codes), our results for uncoded transmission can easily be combined with FEC techniques to obtain excellent error rate performance.

Capacity and optimal power allocation for fading broadcast channels with minimum rates

Abstract: We derive the capacity region and optimal power allocation scheme for a slowly fading broadcast channel in which minimum rates must be maintained for each user in all fading states, assuming perfect channel state information at the transmitter and at all receivers. We show that the minimum-rate capacity region can be written in terms of the ergodic capacity region of a broadcast channel with an effective noise determined by the minimum rate requirements. This allows us to characterize the optimal power allocation schemes for minimum-rate capacity in terms of the optimal power allocations schemes that maximize ergodic capacity of the broadcast channel with effective noise. Numerical results are provided for different fading broadcast channel models.

On the capacity of a multiple-antenna communication link with channel side information

Abstract: We investigate the capacity of a system with multiple transmit and receive antennas, assuming that the transmitter and receiver both have access to (possibly defective) channel-state information. Two different special cases of a general system are studied in detail. Our main results are capacity expressions for these cases and a general conclusion that the encoder can be split into separate "space-time coding" and "direction weighting" or "beamforming," without capacity loss. We also present numerical results illustrating the dependence of capacity on the parameters of a quantization scheme providing channel-state information to the transmitter from the receiver. These results have high practical value since the assumptions behind them are closely related to the ones of the closed-loop mode in the UMTS/WCDMA standard.

Analysis of K -Transmit Dual-Receive Diversity withCochannel Interferers over a Rayleigh Fading Channel

Abstract: The need to combat the severe effects of fading and interference in the rapidly increasing number of communication systems providing wireless services has motivated the study of diversity in the presence of interference. Hence the analysis of wireless systems with both transmit and receive diversity and subject to cochannel interference is an important tool for system design. We consider here a K-transmit dual-receive diversity communication system employing K antennas for transmission and two antennas for reception. The desired signal is corrupted by N interfering sources apart from additive white Gaussian noise. The channel is Rayleigh fading. As a result, the channel matrix for the desired signal and the propagation vectors of the interferers have zero-mean complex Gaussian entries; the entries are assumed to be independent and identically distributed. The complex receive weight vector used for combining the received signals is chosen so as to maximize the output signal-to-interference-plus-noise ratio (SINR). From the statistics of the channel matrix and the propagation vectors of the interferers, we derive a closed-form expression for the probability density function (p.d.f.) of the maximum output SINR. This p.d.f. can be used to obtain the symbol error probability for different digital modulation schemes.

Reliability-based type II hybrid ARQ schemes

Abstract: Hybrid ARQ (HARQ) schemes use a combination of forward error correction and retransmissions to guarantee reliable packet data communications. In this work, we propose a HARQ scheme that exploits channel state information and received packet quality to improve system performance. Specifically, the receiver uses the average magnitude of the log-likelihood ratios corresponding to the received information bits, in order to determine the sizes of subsequent retransmissions. The proposed retransmission strategy attempts to maximize user throughput while satisfying a maximum packet delay constraint. The performance of our reliability-based type II HARQ (RBHARQ) scheme is evaluated in static and time-varying channels through simulations.

On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel

Abstract: We consider the problem of lossy joint source-channel coding in a communication system where the encoder has access to channel state information (CSI) and the decoder has access to side information that is correlated to the source. This configuration combines the Wyner-Ziv (1976) model of pure lossy source coding with side information at the decoder and the Shannon/Gel'fand-Pinsker (1958, 1980) model of pure channel coding with CSI at the encoder. We prove a separation theorem for this communication system, which asserts that there is no loss in asymptotic optimality in applying, first, an optimal Wyner-Ziv source code and, then, an optimal Gel'fand-Pinsker channel code. We then derive conditions for the optimality of a symbol-by-symbol (scalar) source-channel code, and demonstrate situations where these conditions are met. Finally, we discuss a few practical applications, including overlaid communication where the model under discussion is useful.