Error probability of coded multi-antenna systems in block fading environments

A union bound on the error probability of coded multi-antenna systems over block fading channels is proposed. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. Using the uniform interleaving argument the distribution of error bits over the fading blocks is computed. The pair-wise error probability is derived for a specific distribution pattern of the error bits over the fading blocks. We consider coded systems that concatenate a binary code with a space-time block code (STBC). The tradeoff between channel diversity and channel estimation is investigated assuming pilot-aided channel estimation and the optimal channel memory is approximated analytically. Results show that the optimal channel memory increases with increasing the number of transmit antennas

Error probability of coded multi-antenna systems in block fading environments

A union bound on the error probability of coded multi-antenna systems over block fading channels is proposed. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. Using the uniform interleaving argument the distribution of error bits over the fading blocks is computed. The pair-wise error probability is derived for a specific distribution pattern of the error bits over the fading blocks. We consider coded systems that concatenate a binary code with a space-time block code (STBC). The tradeoff between channel diversity and channel estimation is investigated assuming pilot-aided channel estimation and the optimal channel memory is approximated analytically. Results show that the optimal channel memory increases with increasing the number of transmit antennas

Error probability of coded STBC systems in block fading environments

In this letter, a union bound on the error probability of coded multi-antenna systems over block fading channels is derived. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. Using this argument the distribution of error bits over the fading blocks is computed and the corresponding pair wise error probability (PEP) is derived. We consider coded systems that concatenate a binary code with a space-time block code (STBC). Coherent detection is assumed with perfect and imperfect channel state information (CSI) at the receiver, where imperfect CSI is obtained using pilot-aided estimation. Under channel estimation environments, the tradeoff between channel diversity and channel estimation is investigated and the optimal channel memory is approximated analytically. Results show that the performance degradation due to channel memory decreases as the number of transmit antennas is increased. Moreover, the optimal channel memory increases with increasing the number of transmit antennas

Error probability of coded STBC systems in block fading environments

In this letter, a union bound on the error probability of coded multi-antenna systems over block fading channels is derived. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. Using this argument the distribution of error bits over the fading blocks is computed and the corresponding pair wise error probability (PEP) is derived. We consider coded systems that concatenate a binary code with a space-time block code (STBC). Coherent detection is assumed with perfect and imperfect channel state information (CSI) at the receiver, where imperfect CSI is obtained using pilot-aided estimation. Under channel estimation environments, the tradeoff between channel diversity and channel estimation is investigated and the optimal channel memory is approximated analytically. Results show that the performance degradation due to channel memory decreases as the number of transmit antennas is increased. Moreover, the optimal channel memory increases with increasing the number of transmit antennas

Efficient space-frequency block coded pilot-aided channel estimation method for multiple-input-multiple-output orthogonal frequency division multiplexing systems over mobile frequency-selective fading channels

© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.An iterative pilot-aided channel estimation technique for space-frequency block coded (SFBC) multiple-input multiple-output orthogonal frequency division multiplexing systems is proposed. Traditionally, when channel estimation techniques are utilised, the SFBC information signals are decoded one block at a time. In the proposed algorithm, multiple blocks of SFBC information signals are decoded simultaneously. The proposed channel estimation method can thus significantly reduce the amount of time required to decode information signals compared to similar channel estimation methods proposed in the literature. The proposed method is based on the maximum likelihood approach that offers linearity and simplicity of implementation. An expression for the pairwise error probability (PEP) is derived based on the estimated channel. The derived PEP is then used to determine the optimal power allocation for the pilot sequence. The performance of the proposed algorithm is demonstrated in high frequency selective channels, for different number of pilot symbols, using different modulation schemes. The algorithm is also tested under different levels of Doppler shift and for different number of transmit and receive antennas. The results show that the proposed scheme minimises the error margin between slow and high speed receivers compared to similar channel estimation methods in the literature.Peer reviewe

Successive interference cancellation schemes for time-reversal space-time block codes

In this paper, we propose two simple signal detectors that are based on successive interference cancellation (SIC) for time-reversal space-time block codes to combat intersymbol interference in frequency-selective fading environments. The main idea is to treat undetected symbols and noise together as Gaussian noise with matching mean and variance and use the already-detected symbols to help current signal recovery. The first scheme is a simple SIC signal detector whose ordering is based on the channel powers. The second proposed SIC scheme, which is denoted parallel arbitrated SIC (PA-SIC), is a structure that concatenates in parallel a certain number of SIC detectors with different ordering sequences and then combines the soft output of each individual SIC to achieve performance gains. For the proposed PA-SIC, we describe the optimal ordering algorithm as a combinatorial problem and present a low-complexity ordering technique for signal decoding. Simulations show that the new schemes can provide a performance that is very close to maximum-likelihood sequence estimation (MLSE) decoding under time-invariant conditions. Results for frequency-selective and doubly selective fading channels show that the proposed schemes significantly outperform the conventional minimum mean square error-(MMSE) like receiver and that the new PA-SIC performs much better than the proposed conventional SIC and is not far in performance from the MLSE. The computational complexity of the SIC algorithms is only linear with the number of transmit antennas and transmission rates, which is very close to the MMSE and much lower than the MLSE. The PA-SIC also has a complexity that is linear with the number of SIC components that are in parallel, and the optimum tradeoff between performance and complexity can be easily determined according to the number of SIC detectors

MIMO-aided near-capacity turbo transceivers: taxonomy and performance versus complexity

In this treatise, we firstly review the associated Multiple-Input Multiple-Output (MIMO) system theory and review the family of hard-decision and soft-decision based detection algorithms in the context of Spatial Division Multiplexing (SDM) systems. Our discussions culminate in the introduction of a range of powerful novel MIMO detectors, such as for example Markov Chain assisted Minimum Bit-Error Rate (MC-MBER) detectors, which are capable of reliably operating in the challenging high-importance rank-deficient scenarios, where there are more transmitters than receivers and hence the resultant channel-matrix becomes non-invertible. As a result, conventional detectors would exhibit a high residual error floor. We then invoke the Soft-Input Soft-Output (SISO) MIMO detectors for creating turbo-detected two- or three-stage concatenated SDM schemes and investigate their attainable performance in the light of their computational complexity. Finally, we introduce the powerful design tools of EXtrinsic Information Transfer (EXIT)-charts and characterize the achievable performance of the diverse near- capacity SISO detectors with the aid of EXIT charts

Dispensing with channel estimation: differentially modulated cooperative wireless communications

As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective