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

Performance analysis and iterative decoding of I-Q trellis space-time codes

I-Q trellis codes are known to increase the time diversity of coded systems. When I-Q codes are used with multiple transmit antennas, the decoding and performance evaluation requires the construction of the high-complexity super-trellis of the component codes. In the paper, the bit error probability and the design criteria of I-Q ST codes are derived using the transfer functions of the component codes. Conditions for the geometrical uniformity of I-Q space-time (ST) codes are derived from the geometrical uniformity of the component codes. In addition, a low-complexity iterative receiver for I-Q ST codes is presented. The receiver essentially performs iterative detection and decoding. Results show that three iterations of the iterative receiver performs very close to the optimal decoding

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

Performance analysis and iterative decoding of I-Q trellis space-time codes

I-Q trellis codes are known to increase the time diversity of coded systems. When I-Q codes are used with multiple transmit antennas, the decoding and performance evaluation requires the construction of the high-complexity super-trellis of the component codes. In the paper, the bit error probability and the design criteria of I-Q ST codes are derived using the transfer functions of the component codes. Conditions for the geometrical uniformity of I-Q space-time (ST) codes are derived from the geometrical uniformity of the component codes. In addition, a low-complexity iterative receiver for I-Q ST codes is presented. The receiver essentially performs iterative detection and decoding. Results show that three iterations of the iterative receiver performs very close to the optimal decoding

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

A union bound on the error probability of binary codes over block-fading channels

Block-fading is a popular channel model that approximates the behavior of different wireless communication systems. In this paper, a union bound on the error probability of binary-coded systems over block-fading channels is proposed. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. The distribution of error bits over the fading blocks is computed. For a specific distribution pattern, the pairwise error probability is derived. Block-fading channels modeled as Rician and Nakagami distributions are studied. We consider coherent receivers with perfect and imperfect channel side information (SI) as well as noncoherent receivers employing square-law combining. Throughout the paper, imperfect SI is obtained using pilot-aided estimation. A lower bound on the performance of iterative receivers that perform joint decoding and channel estimation is obtained assuming the receiver knows the correct data and uses them as pilots. From this, the tradeoff between channel diversity and channel estimation is investigated and the optimal channel memory is approximated analytically. Furthermore, the optimal energy allocation for pilot signals is found for different channel memory lengths

Bit error probability of bit-interleaved coded modulation (BICM) in wireless environments

In this paper a union bound on the bit error probability of bit-interleaved coded modulation (BICM) is derived. In the derivation we assume that the bit errors in a codeword are uniformly distributed over the transmitted symbols. We derive the bound for BICM systems over AWGN, Rician and Nakagami fading channels. The proposed bound is general to any signal constellation and coding scheme with a known distance spectru

Performance Analysis of Bit-Interleaved Space-Time (BI-ST) Coded Systems Over Wireless Channels

In this paper a union bound on the bit error probability of bit-interleaved space-time (BI-ST) coded systems is derived. The derivation is based on the uniform interleaving assumption of the coded sequence prior to transmission over the multiple antennas. The performance of a BI-ST coded system is a function of how the bit errors are distributed over the signals in the codeword. In this paper, we derive this distribution as well as the corresponding pairwise error probability. The bound is a function of the distance spectrum of the code, the signal constellation used and the space-time (ST) encoding scheme. The bound is derived for a general BI-ST coded system and applied to two specific examples; namely, the BI space-time coded modulation (BI-STCM) and the BI space-time block codes (BI-STBC). Results show that the analysis provides a close approximation to the performance for a wide range of signal-to-noise ratios (SNR)

Performance Analysis of Bit-Interleaved Space-Time (BI-ST) Coded Systems Over Wireless Channels

In this paper a union bound on the bit error probability of bit-interleaved space-time (BI-ST) coded systems is derived. The derivation is based on the uniform interleaving assumption of the coded sequence prior to transmission over the multiple antennas. The performance of a BI-ST coded system is a function of how the bit errors are distributed over the signals in the codeword. In this paper, we derive this distribution as well as the corresponding pairwise error probability. The bound is a function of the distance spectrum of the code, the signal constellation used and the space-time (ST) encoding scheme. The bound is derived for a general BI-ST coded system and applied to two specific examples; namely, the BI space-time coded modulation (BI-STCM) and the BI space-time block codes (BI-STBC). Results show that the analysis provides a close approximation to the performance for a wide range of signal-to-noise ratios (SNR)