Myung-Kwang Byun

New Bounds of Pairwise Error Probability for Space-Time Codes in Rayleigh Fading Channels

In this paper, we present new upper and lower bounds of the pairwise error probabilities (PEPs) for space-time codes over Rayleigh channels with independent fading. In support of this, we derive a new expression of the PEP using an alternative form of the Gaussian tail function, which is very simple and descriptive. The new bounds are very accurate, and suitable for easy estimation and application to the performance analysis based on distance spectrum. According to numerical examples, they turn out to be much closer to the exact PEP than other existing bounds. In addition, they help to envision the behavior of the space-time codes for the cases of more than one receive antennas.

New bounds of pairwise error probability for space-time codes in Rayleigh fading channels

In this paper we present new upper and lower bounds of the pairwise error probabilities (PEP) for space-time codes over Rayleigh channels with independent fading. We first derive a new expression of the PEP using an alternative form of the Gaussian tail function, based on which we then derive new upper and lower bounds. The new bounds are very accurate and suitable for easy estimation and application to the performance analysis based on distance spectrum. According to numerical examples, the new bounds turn out to be much closer to the exact PEP than other existing bounds. In addition, they help to envision the behavior of the space-time codes for the cases or more than one receive antennas.

Performance analysis of space-time trellis coded modulations in quasi-static Rayleigh fading channels

We analyze the performance of space-time codes. In particular, we derive an upper bound of the frame error probabilities for space-time trellis coded modulations over quasi-static Rayleigh fading channels. Two techniques, modified bounding and limiting before averaging, are used to derive the new bound. The newly derived upper bound is very accurate, needs only the distance spectrum of the space-time code, and can be computed through single numerical integration. Numerical results show that the new upper bound is much tighter than other existing bounds, especially in the case of one receive antenna.

Properties and performance of space-time bit-interleaved coded modulation systems in fast Rayleigh fading channels

In this paper, we investigate the properties and performance of space-time bit-interleaved coded modulation (ST-BICM) systems in fast Rayleigh fading channels. We first show that ST-BICM with QPSK signaling in fast fading channels possesses the uniform distance property, which makes performance analysis tractable. We also derive the probability distribution of the squared Euclidean distance between space-time symbols assuming uniform bit-interleaving. Based on the distribution, we show that the diversity order for each codeword pair becomes maximized as the frame length becomes sufficiently long. This maximum diversity order property implies that the bit-interleaver transforms an ST-BICM system over transmit diversity channels into an equivalent coded BPSK system over independent fading channels. We analyze the performance of ST-BICM in fast fading channels by deriving an FER upper bound. The derived bound turns out very accurate, requiring only the distance spectrum of the binary channel codes of ST-BICM. Numerical results demonstrate that the bound is tight enough to render an accurate estimate of performance of ST-BICM systems.

On the performance analysis of space-time codes in quasi-static Rayleigh-fading channels

In this paper, we analyze the performance of space-time codes by deriving a new approximation of the frame error probabilities for space-time trellis-coded modulations over quasi-static Rayleigh-fading channels. We take advantage of two techniques, the modified bounding technique and the limiting-before-averaging technique, to tighten the upper bound. In addition, we establish a theorem that enables us to reduce the computation and memory needed to calculate the frame error rate (FER) approximation. The newly derived approximation is very tight, requires only the distance spectrum of the space-time code, and can be computed through single numerical integration. Numerical results exhibit that the new approximation is much closer to the simulation results than other existing bounds are, especially in the case of one receive antenna.

Performance and distance spectrum of space-time codes in fast rayleigh fading channels

In this paper, we analyze the performance of spacetime codes and propose a distance spectrum computation method in fast Rayleigh fading channels. We first derive a new FER upper bound using the union bound and the PEP upper bound in the fast fading environment. The derived FER upper bound is very accurate, requires only the distance spectrum of the spacetime code, and takes a closed-form expression. Then we propose a distance spectrum computation method of space-time codes in fast fading channels, which exploits the symmetric property of the error state diagram in space-time trellis coded MPSK modulation to reduce the computation complexity. Numerical results illustrate that the derived FER bound is tight enough to estimate the performance of space-time codes in fast fading channels with sufficient accuracy.

Performance and distance spectrum of space-time codes in fast Rayleigh fading channels

In this paper, we analyze the performance of spacetime codes and propose a distance spectrum computation method in fast Rayleigh fading channels. We first derive a new FER upper bound using the union bound and the PEP upper bound in the fast fading environment. The derived FER upper bound is very accurate, requires only the distance spectrum of the spacetime code, and takes a closed-form expression. Then we propose a distance spectrum computation method of space-time codes in fast fading channels, which exploits the symmetric property of the error state diagram in space-time trellis coded MPSK modulation to reduce the computation complexity. Numerical results illustrate that the derived FER bound is tight enough to estimate the performance of space-time codes in fast fading channels with sufficient accuracy.In this paper, we analyze the performance of space-time codes and propose a distance spectrum computation method in fast Rayleigh fading channels. We first derive a new FER upper bound using the union bound and the PEP upper bound in the fast fading environment. The derived FER upper bound is very accurate, requires only the distance spectrum of the space-time code, and takes a closed-form expression. Then we propose a complexity reduction method of computing the distance spectrum of space-time codes in fast fading channels, which exploits the symmetric property of the error state diagram. Numerical results exhibit that the derived FER bound is tight enough to estimate the performance of space-time codes in fast fading channels with sufficient accuracy.

Properties of space-time bit-interleaved coded modulation systems in fast Rayleigh fading channels

This paper investigate the properties of space-time bit-interleaved coded modulation (ST-BICM) systems in fast Rayleigh fading channels. We first show that ST-BICM with QPSK signaling in fast fading channels possesses the uniform distance property, which makes performance analysis tractable. We also derive the probability distribution of the squared Euclidean distance between space-time symbols assuming uniform bit-interleaving. Based on the distribution, we show that the diversity order for each codeword pair becomes maximized as the frame length becomes sufficiently long. We analyze the performance of ST-BICM in fast fading channels by deriving an FER upper bound. The derived bound turns out very accurate, requiring only the distance spectrum of the binary channel codes of ST-BICM. Numerical results demonstrate that the bound is tight enough to render an accurate estimate of performance of ST-BICM systems.