Union bound on error probability of linear space-time block codes
نویسندگان
چکیده
Design of practical coding techniques for the multiple antenna wireless channel is a challenging problem. A number of interesting solutions have been proposed recently ranging from block codes to trellis codes for the MIMO (multiple input, multiple output) channel. Here we consider linear block codes for the quasi-static, flat-fading, coherent MIMO channel. A linear code refers to an encoder that is linear with respect to scalar input symbols. We assume maximum likelihood decoding at the receiver. We provide a cohesive framework for analysis of linear codes in terms of a union bound on the conditional probability of symbol error. The error bound is a function of the instantaneous channel realization and does not make any assumptions on channel statistics. We show that the orthogonal block codes in [1] achieve the lowest error bound among all unitary codes and are in fact optimal.
منابع مشابه
Unified design of linear space-time block codes
A number of space-time codes have been recently proposed for the quasi-static, flat-fading, multipleantenna wireless channel with coherent receiver. In this paper we will focus on design of space-time codes that are linear in the scalar input symbols. We provide design criteria that take into account both the error probability and the channel capacity. We consider the error probability via the ...
متن کاملGeneralized Union Bound for Space-Time Codes
⎯Gallager’s second bounding technique, also known as the generalized union bound, is employed to derive a new upper bound on the error probability of space-time codes with maximum-likelihood (ML) decoding on quasi-static Rayleigh fading channels. The new bound is distinguished by two characteristics: unlike the classical union bound, the new bound is rapidly convergent and is only a few decibel...
متن کاملPacket error rates of terminated and tailbiting convolutional codes
When a convolutional code is used to provide forward error correction for packet data transmission, the standard performance measures of convolutional codes, i.e., bit error rate and first-event error rate, become less useful. Instead we are interested in the average probability of block (or packet) error. In this paper a modified transfer function approach is used to obtain a union bound on th...
متن کاملNew union bound on the error probability of bit-interleaved space-time codes with finite interleaver sizes
In this paper 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 analyzing the performance of BI-ST systems employing finite interleaver sizes. The derivation is based on the uniform interleaving assumption of the coded sequence...
متن کاملSpace-time code performance bounds on quasistatic fading channels
We evaluate truncated union bounds on the frame error rate performance of space-time (ST) codes operating over the quasistatic fading channel and compare them to results of computer simulation. Both ST trellis and block codes are considered. We calculate these bounds by characterizing the set of codeword differences from a general expression for the exact pairwise error probability (PEP). We de...
متن کامل