New union bound on the error probability of bit-interleaved space-time codes with finite interleaver sizes

作     者：Zummo, S. A. Yeh, P. -C. Stark, W. E. 

作者机构：KFUPM Dept Elect Engn Dhahran 31261 Saudi Arabia Natl Taiwan Univ Dept Elect Engn Taipei 10764 Taiwan Natl Taiwan Univ Grad Inst Commun Engn Taipei 10764 Taiwan Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA 

出 版 物：《IET COMMUNICATIONS》 (IET Commun.)

年 卷 期：2008年第2卷第10期

页      面：1230-1238页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 

基　　金：KFUPM [JF050009] 

主　　题：interleaved codes multiple antennas signal constellation finite interleaver sizes space-time mapping scheme block codes space-time codes error probability uniform interleaving assumption bit-interleaved space-time codes coded sequence signal-to-noise ratios error statistics modulation coding coded modulation antenna arrays 

摘      要：A new union bound on the bit error probability of bit-interleaved space-time (BI-ST) coded systems is derived. Unlike existing performance analysis tools for BI-ST systems, the new bound provides a general framework for analysing the performance of BI-ST systems employing finite interleaver sizes. The derivation is based on the uniform interleaving assumption of the coded sequence prior to transmission over multiple antennas. The new bound is a function of the distance spectrum of the code, the signal constellation used and the space-time (ST) mapping 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 and the BI space-time block codes. Results show that the analysis provides a close approximation to the BI-ST performance for a wide range of signal-to-noise ratios. The analysis can also accurately characterise the performance differences between different interleaver sizes, which is a breakthrough in the analysis of BI-ST coded systems.