Achievable rate analysis and feedback design for multiuser relay with imperfect CSI

In this paper, a comprehensive comparison analysis in terms of outage probability and average symbol error ratio (SER) is presented for cooperative cognitive multiple-input and multiple-output (CC-MIMO) multiuser systems with amplify-and-forward (AF) protocol. Specially, we consider two scenarios where the CC-MIMO multiuser systems have the perfect and imperfect channel state information (CSI). The CC-MIMO multiuser systems consist of one multi-antenna source, one single-antenna relay, and multiple multi-antenna destinations. At the secondary source and destinations, the maximal ratio transmission (MRT) and maximal ratio combining (MRC) are employed, respectively. For such CC-MIMO multiuser systems, we first obtain the exact closed-form expressions of outage probability under the two cases where the CC-MIMO multiuser systems have the perfect and imperfect CSI. Then, to reduce the implementation complexity, the tight lower bounds of outage probability and average SER are derived. Finally, to obtain insight, by using the high signal-to-noise ratio (SNR) approximation, the asymptotic estimations of outage probability are achieved. The numerical results show that the derivations are agreed with the simulations, which validate our derivations. At the same time, the results show that, for the systems without perfect CSI, the achievable diversity order reduces to one, regardless of the number of antennas at the cognitive source and destinations as well as the number of the cognitive destinations. Nevertheless, these key parameters affect the coding gain of the CC-MIMO multiuser systems. When the systems have the perfect CSI (or without feedback delay), the achievable diversity gain is determined by the minimum between the number of source’s antennas and the product of the number of destinations and the number of destination’s antennas. For the effect of PU’s parameters, our results indicate that primary systems only affect the coding gain but not the diversity gain.

In this letter, we analyze the ergodic capacity of bidirectional amplify-and-forward relay selection network. The imperfect channel state information (CSI) is taken into account, which includes outdated CSI and channel estimation error, caused by the time-variation of channel and the imperfect channel estimation, respectively. The lower bound of the ergodic capacity for this network is derived in a closed-form, and verified by the Monte-Carlo simulations. Furthermore, the effects of the imperfect CSI and the number of relays on the ergodic capacity are investigated. The results manifest that imperfect CSI will jeopardize the capacity, and increasing the number of relays contributes to enhance the capacity with imperfect CSI.

Multiple input multiple output (MIMO) processing techniques are of interest for the next generation wireless communication systems due to their potential ability to dramatically improve the system capacity. There have been existed several multi-user MIMO (MU-MIMO) transmit schemes such as zero-forcing dirty paper coding (ZF-DPC), and zero-forcing beamforming (ZFBF). In this paper, we analysis and compare the dynamic transmission schemes based on TDMA and SDMA under perfect and imperfect channel state information (CSI). The system throughput (sum data rate), the optimal user number that can be supported are evaluated under perfect CSI by computer simulations. The effect of imperfect CSI on the throughput of TDMA and SDMA is also investigated. The results show that under perfect channel state information at both transmitter and receiver, the SDMA schemes can achieve a larger throughput than the TDMA scheme because SDMA can fully explore the multiuser diversity by transmitting to the optimal set of users. In contrast, the results show that the system performance of SDMA scheme is sensitive to the channel error.

The advantages envisioned from using large antenna arrays have made massive multiple- input multiple-output systems (also known as massive MIMO) a promising technology for future wireless standards. Despite the advantages that massive MIMO systems provide, increasing the number of antennas introduces new technical challenges that need to be resolved. In particular, symbol detection is one of the key challenges in massive MIMO. Obtaining accurate channel state information (CSI) for the extremely large number of chan- nels involved is a difficult task and consumes significant resources. Therefore for Massive MIMO systems coherent detectors must be able to cope with highly imperfect CSI. More importantly, non-coherent schemes which do not rely on CSI for symbol detection become very attractive. Expectation propagation (EP) has been recently proposed as a low complexity algo- rithm for symbol detection in massive MIMO systems , where its performance is evaluated on the premise that perfect channel state information (CSI) is available at the receiver. However, in practical systems, exact CSI is not available due to a variety of reasons in- cluding channel estimation errors, quantization errors and aging. In this work we study the performance of EP in the presence of imperfect CSI due to channel estimation er- rors and show that in this case the EP detector experiences significant performance loss. Moreover, the EP detector shows a higher sensitivity to channel estimation errors in the high signal-to-noise ratio (SNR) regions where the rate of its performance improvement decreases. We investigate this behavior of the EP detector and propose a Modified EP detector for colored noise which utilizes the correlation matrix of the channel estimation error. Simulation results verify that the modified algorithm is robust against imperfect CSI and its performance is significantly improved over the EP algorithm, particularly in the higher SNR regions, and that for the modified detector, the slope of the symbol error rate (SER) vs. SNR plots are similar to the case of perfect CSI. Next, an algorithm based on expectation propagation is proposed for noncoherent symbol detection in large-scale SIMO systems. It is verified through simulation that in terms of SER, the proposed detector outperforms the pilotbased coherent MMSE detector for blocks as small as two symbols. This makes the proposed detector suitable for fast fading channels with very short coherence times. In addition, the SER performance of this detec- tor converges to that of the optimum ML receiver when the size

In this paper, with the aid of new analytical method, we present a new closed-form expression for the ergodic capacity of full-duplex relaying (FDR) systems, with multiple antenna amplify-and-forward (AF) cooperative networks and imperfect channel state information (CSI). At the relay, the loopback self-interfernce (LI) is mitigated by using receive zero-forcing (ZF) precoding scheme, then steering the signal to the destination by using the maximum-ratio transmission (MRT) technique. To facilitate comparison, a closed-form expression for the ergodic capacity of half-duplex relaying (HDR) systems with multiple antenna AF cooperative networks is also addressed, when maximum-ratio combining (MRC)/MRT precoding schemes are performed at the relay input/output, respectively. Therefore, since perfect CSI is not available in practice, this paper investigates the impact of channel estimation errors on the performance of receive ZF/MRT and MRC/MRT schemes. These expressions are exact in the case of perfect CSI and form a very tight indistinguishable lower-bound in the case of imperfect CSI. Numerical results sustained by Monte-Carlo simulations show the exactness of the proposed analytical expressions in perfect CSI and the tightness of the lower-bounds in imperfect CSI. In addition, it is seen here that the FDR AF cooperative systems outperforms the HDR AF cooperative systems in terms of capacity. Furthermore, in contrast to perfect CSI, in the presence of imperfect CSI, an ergodic capacity ceiling is seen as SNR increases. Besides, it is seen that the ergodic capacity degradation due to imperfect CSI is higher in the FDR case because of the extra LI estimation errors.

This paper proposes a robust transceiver design against the effect of channel state information (CSI) estimation error to optimize precoded uplink (UL) multi-user multiple-input multiple-output (MU-MIMO) transmission in limited feedback system under the consideration of the least-square technique on CSI estimation. To improve this limited feedback precoding, the constrained minimum variance (MV) approach with quadratic form to realize the computationally-efficient optimization problem, advantageously invoking the characteristics of the CSI estimation error, is proposed to suppress the effect of CSI estimation error, multiple user interference and noise. According to the Lagrange multiplier method on this MV approach, the deterministic function to resist uncertain CSI can be obtained to optimize design of the precoder and adaptive matrices jointly. With these optimum adaptive and precoder matrices, an optimum robust weighting matrix can be obtained to facilitate the user-wise detection in precoded UL MU-MIMO system. Performance analysis shows that the proposed robust weighting matrix is an unbiased design and it also can regularize the diagonal loading factor technique, and the detection performance of the proposed robust transceiver design can be predicted simplistically by applying our derived signal-to-interference-plus-noise ratio formulation. Computer simulations are conducted to confirm the efficacy of the proposed design in both perfect and imperfect CSI estimation.

In this paper, we investigate the capacity performance of non-orthogonal transmission schemes under imperfect channel state information (CSI) caused by feedback delay and thermal noise for various values of the signal to noise ratio (SNRinput). We use orthogonal transmission, i.e. singular value decomposition (SVD), as a benchmark. With perfect CSI, the multiplexing schemes achieve higher capacity than single data stream transmission under high SNRinput (30dB). In terms of the delayed CSI, the capacity of all multiplexing schemes converges and multiplexing schemes are only beneficial for large antenna systems (4times2) and high SNRinput (20dB). When the CSI is corrupted by thermal noise, a 20dB SNR can be tolerated in the CSI estimation.

In wireless communication systems, the intended receiver is able to obtain the perfect channel state information (CSI) as long as the training sequence is sufficiently long, and then through a quantized feedback channel (QFC), the transmitter gets imperfect CSI caused by the quantized noise. In general, the design of efficient coding schemes for wireless channels with imperfect CSI at the transmitter (I-CSIT) is difficult and challenging, and one possible method is to construct such a scheme by using channel feedback. In the literature, it has already been shown that the classical Schalkwijk-Kailath (SK) scheme for the additive white Gaussian noise (AWGN) channel with noiseless feedback is a highly efficient coding scheme since its coding complexity is extremely low and the decoding error doubly exponentially decays as the coding blocklength tends to infinity. Existing SK-type schemes mainly focus on the case that perfect CSI is known at the transceiver, and adopt modulo lattice function to eliminate the impact of feedback channel noise (often considered as AWGN) on the performance of SK-type schemes. However, for channels with I-CSIT and QFC, this does not work since the distribution of quantized noise is unknown and I-CSIT brings additional non-convergence estimation error to the transceiver, leading to the application of SK-type schemes to practical wireless scenarios becomes challenging. In this paper, first, for the quasi-static fading channel with I-CSIT and QFC, we design a modulo lattice based SK-type scheme where the receiver adopts an auxiliary signal to decode the message, and numerical results show that the rate of our scheme almost approaches that of the same model with perfect CSI at the transceiver and noise-free feedback for some cases. Next, we further extend the above scheme to the two-path fading scenario, which is modeled as the two-ray channel with I-CSIT and QFC. Treating the signal of the second path as a relay, our extended scheme combines the amplify-and-forward relay strategy and the previously proposed scheme for the same model without ISI. However, this extended scheme cannot be applied to multi-path fading scenario, to this end, we propose a new SK-type scheme for the multi-path fading case. The intuition behind this scheme is to transform the multi-path fading channel into a fading MIMO channel by discrete fourier transform (DFT), and then apply the SK-type scheme to the MIMO channel in frequency domain and use inverse DFT to obtain the codeword in time domain. The study of this paper may provide a way to design efficient coding scheme for fading channels in the presence of imperfect CSI and quantized feedback.

To achieve reasonable bit error rate (BER) perfor- mance, accurate channel state information (CSI) is required for linear minimum mean squared error turbo equalizer(LMMSE- TE), which is hard to be obtained under the circumstance that long training sequence is not available or channel is time-varying. Soft and hard iterative channel estimation (HICE) algorithms were proposed as fine channel estimation schemes after coarse estimation. In this paper, a new iterative channel correction (ICC) algorithm that belongs to the HICE based on the least mean square (LMS) algorithm is proposed. A cost function using hard decision variables on the output of TE is formed. We show that the gradient descent (GD) algorithm is effective to iteratively minimize the cost function. Furthermore, the iterative step-size to guarantee the convergence for the ICC is analyzed, the mean squared error (MSE) lower bound of the estimated channels for the ICC is derived and validated by the simulations. Our simulations show that, given an imperfect CSI with MSE below the upper bound, the LMMSE-TE incorporated with the ICC yields small performance degradation compared to that with perfect CSI, while the traditional LMMSE-TE suffers from severe error floor even with more iterations, thus showing the robustness of our proposed algorithm to the imperfect channel estimations.

In the presence of perfect channel state information (CSI), the achievable degrees of freedom (DoF) in wireless interference networks can be linearly scaled up with the number of users. Achievability is based on the idea of interference alignment (IA). However, in the presence of imperfect CSI, the sum rate becomes degraded, and full DoF may no longer be achievable. In this paper, the authors propose novel least squares (LS)- and minimum mean square error (MMSE)-based IA schemes that adaptively design beamformers by relying on the availability of imperfect CSI and knowledge of the channel estimation error variance in advance. Interestingly and unlike the other robust algorithms, the proposed adaptive schemes do not impose extra computational complexity compared to their nonadaptive counterparts. It is shown that the LS-based IA is able to outperform interference leakage minimization algorithms under both perfect and imperfect CSI. Furthermore, the authors compare the performance of the proposed MMSE-based IA with maximum signal-to-interference-plus-noise ratio (Max-SINR) algorithm. The authors show that while under perfect CSI, the MMSE-based IA achieves the same performance as that of Max-SINR, the former outperforms the latter under CSI mismatch. Meanwhile, it is shown that the proposed MMSE-based IA needs less CSI to be available and has less computational complexity compared to Max-SINR.

The joint effects of feedback delay, limited feedback and channel estimation errors on the secrecy performance of a multiple-input–single-output (MISO) system employing transmit beamforming against passive eavesdropping are investigated. Closed-form expressions of the effective secrecy throughput which characterise the average rate of achieving reliable and secure transmissions are derived. Simulation results verify the theoretical analysis and show that different from feedback delay and limited feedback which degrade performance, imperfect channel estimation may not always harm the secrecy throughput. Furthermore, it is interesting to find that there exists an optimal transmit signal-to-noise ratio (SNR) for achieving the maximal secrecy throughput and channel state information imperfections will increase the optimal value of the transmit SNR.

In wireless communications, the assumption that the transmitter has perfect channel state information (CSI) is often unreasonable, due to feedback delays, estimation errors, and quantization errors. In order to accurately assess system performance, a more careful analysis with imperfect CSI is needed. In this paper, the impact of partial CSI due to feedback delays in a multiuser Orthogonal Frequency Division Multiplexing (MU-OFDM) cognitive radio (CR) system is investigated. The effect of partial CSI on the bit error rate (BER) is analyzed. A relationship between the transmit power and the number of bits loaded on a subcarrier is derived which takes into account the target BER requirement. With this relationship, existing resource allocation schemes which are based on perfect CSI being available can be applied when only partial CSI is available. Simulation results are provided to illustrate how the system performance degrades with increasingly poor CSI.

In wireless interference networks, orthogonal medium access techniques like time division multiple access (TDMA) and frequency division multiple access (FDMA) achieve merely one degree of freedom (DoF). However, by using interference alignment (IA) the achievable DoF can be linearly scaled up with the number of users. Nevertheless, this outperformance of IA heavily depends on the availability of perfect channel state information (CSI), which is not a realistic assumption in practice. Since under imperfect CSI, the performance of IA may become severely degraded, design of enhanced IA algorithms by relying on the availability of merely imperfect CSI is of particular interest. In this paper, we propose a least squares (LS)-based IA algorithm which adaptively designs the beamformers based on the knowledge of the channel estimation error variance, which is possible to be known in advance. Then, we compare the performance of the proposed scheme with interference leakage minimization algorithms. It is shown that under both perfect and imperfect CSI, the proposed LS-based IA outperforms interference leakage minimization algorithms.

This letter considers the effect of channel estimation errors on the performance of space-time coded (STC) systems with transmit and receive antenna selection over quasi-static flat fading channels. By performing pairwise error probability analysis and presenting numerical examples, we show that the diversity order achieved with perfect channel state information (CSI) is still achievable with imperfect CSI used both at the antenna selection and the space-time decoding processes. We note that our results apply to general STC systems with both transmit and/or receive antenna selection based on largest received powers which can be estimated by any channel estimator.

Interference alignment (IA) is a multi-user wireless communication strategy that enables several transmitters simultaneous communicate with their paired receivers without interfering each other. IA is a multiplexing gain optimal strategy at the expense of requiring the global channel state information (CSI) at the transmitters. Most previous works assume the availability of perfect CSI which is not possible in practice. The performance of IA algorithms based on perfect CSI drop dramatically in circumstance where CSI errors exist. In this paper we propose a robust minimum mean square error (MMSE) IA algorithm with imperfect CSI. Based on a Gaussian statistic channel error model, we give the mean square error objective function with per transmitter power constraint. The objective function is not joint convex in precoders and decoders, but convex in precoders with fixed decoders and vice versa. We convert the problem to two convex sub problems and iteratively find the solutions. Numerical results are presented to validate the effectiveness of proposed algorithm when CSI errors exist.