Results 1 
8 of
8
Spacetime codes for high data rate wireless communication: Performance criterion and code construction
 IEEE TRANS. INFORM. THEORY
, 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract

Cited by 1762 (28 self)
 Add to MetaCart
We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. We derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective. Performance is shown to be determined by matrices constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2–3 dB of the outage capacity for these channels using only 64 state encoders.
On the error performance analysis of spacetime trellis codes: an analytical framework
 in Proc. IEEE Wireless Communcations and Networking Conference WCNC, 2002
"... Abstract—We present analytical performance results for space–time trellis codes over spatially correlated Rayleigh fading channels. Biterrorprobability estimates are obtained based on the derivation of an exact pairwise error probability expression using a residue technique combined with a charact ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
Abstract—We present analytical performance results for space–time trellis codes over spatially correlated Rayleigh fading channels. Biterrorprobability estimates are obtained based on the derivation of an exact pairwise error probability expression using a residue technique combined with a characteristic function approach. We investigate both quasistatic and interleaved channels and demonstrate how the spatial fading correlation affects the performance of space–time codes over these two different channel models. Simulation results are also included to confirm the accuracy of analytical estimates. Index Terms—Biterror rate, fading channels, pairwise error probability (PEP), space–time trellis coding. I.
Evaluation of the exact union bound for trelliscoded modulations over fading channels
 IEEE Trans. Commun
, 1996
"... AbstractAn analytical technique is presented for computing the exact union bound on the average bit error probability of trellis coded modulation schemes over Rayleigh, Rician, or shadowed Ricianfading channels. To this end, an integral expression is derived fior the painvise error event probabi ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
AbstractAn analytical technique is presented for computing the exact union bound on the average bit error probability of trellis coded modulation schemes over Rayleigh, Rician, or shadowed Ricianfading channels. To this end, an integral expression is derived fior the painvise error event probability (PEP). Existing bounds can be obtained as special cases of this expression. It turns out that a GaussChebysev quadrature rule offers excellent accuracy for this integral. By extension, the exact union bound (Le., the weighted sum of all exact PEP’S of a code) can readily be evaluated. This method has the same complexity as the unionChernoff hound, and a few examples are given to show its application. I.
Performance Analysis of Spacetime Codes in Realistic Propagation Environments: A Moment Generating FunctionBased Approach
 Journal Of Communication and Networks
, 2004
"... In this paper, we derive analytical expressions for the exact pairwise error probability (PEP) of a spacetime coded system operating over spatially correlated fast (constant over the duration of a symbol) and slow (constant over the length of a code word) fading channels using a momentgenerating ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
In this paper, we derive analytical expressions for the exact pairwise error probability (PEP) of a spacetime coded system operating over spatially correlated fast (constant over the duration of a symbol) and slow (constant over the length of a code word) fading channels using a momentgenerating functionbased approach. We discuss two analytical techniques that can be used to evaluate the exactPEPs (and therefore approximate the average bit error probability (BEP)) in closed form. These analytical expressions are more realistic than previously published PEP expressions as they fully account for antenna spacing, antenna geometries (Uniform Linear Array, Uniform Grid Array, Uniform Circular Array, etc.) and scattering models (Uniform, Gaussian, Laplacian, Vonmises, etc). Inclusion of spatial information in these expressions provides valuable insights into the physical factors determining the performance of a spacetime code. Using these new PEP expressions, we investigate the effect of antenna spacing, antenna geometries and azimuth power This work was supported by the Australian Research Council Discovery Grant DP0343804.
Truncation for Low Complexity MIMO Signal Detection
"... Abstract–Joint maximumlikelihood (JML) detector may be used in memoryless multiple input multiple output (MIMO) systems to obtain optimal detection performance. However, the JML detector needs an exhaustive search and causes prohibitively large decoding complexity. To reduce the complexity of MIMO ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract–Joint maximumlikelihood (JML) detector may be used in memoryless multiple input multiple output (MIMO) systems to obtain optimal detection performance. However, the JML detector needs an exhaustive search and causes prohibitively large decoding complexity. To reduce the complexity of MIMO signal detection, minimum meansquareerror (MMSE) linear detector (LD), decisionfeedback detector (DFD) and sphere detector (SD) may be used. In this paper, we propose a truncation based detector for low complexity MIMO signal detection, and give theoretical insight into the design and performance. We study bitruncation in detail and present two bitruncation approaches. These approaches have lowcomplexity, and computer simulation results show that they outperform MMSELD and MMSEDFD. Keywords–MIMO signal detection, channel truncation, bitruncation, Viterbi Algorithm. I.
The Performance of Trellis Coded qary PSK in Rayleigh Fading and Nakagami Fading with Dual Diversity Reception
"... Abstract An analvtic techniaue is Dresented for com where Q, is the channel rrain. and w, is an additive Gaus" I puting the performance of trellis coded qary PSK in Rayleigh fading. A contourintegral expression for the pairwise error probability (PEP) is used to define a transfer function ..."
Abstract
 Add to MetaCart
Abstract An analvtic techniaue is Dresented for com where Q, is the channel rrain. and w, is an additive Gaus" I puting the performance of trellis coded qary PSK in Rayleigh fading. A contourintegral expression for the pairwise error probability (PEP) is used to define a transfer function, enabling the union bound to be evaluated exactly for the ideal CSI (channel state information) case and imperfectCSI case. The case of TCM in Nakagami fading and dual diversity reception is also analysed. sian noise sample. The following is used throughout the presentation: Z n is a qary Phase Shift Keying (PSK) symbol (i.e., z, E {ej2nklq I k = 0,1,..., q l} and j = a). ~2 ~ ; ~ h an is a variable (RV). The an's are independent (i.e., ideal intercomplex, ~~~~~i~~ I.
STUDY OF REDUCED COMPLEXITY SYNDROME BASED TTCM DECODER
"... Abstract – Turbo codes were a major milestone in the forward error correction codes which can even achieve an excellent bit error rates at low SNR. The original proposal was for the BPSK scheme but were soon successful with multilevel coded as well. The Turbo Trellis Coded Modulation employing two ..."
Abstract
 Add to MetaCart
Abstract – Turbo codes were a major milestone in the forward error correction codes which can even achieve an excellent bit error rates at low SNR. The original proposal was for the BPSK scheme but were soon successful with multilevel coded as well. The Turbo Trellis Coded Modulation employing two TCM codes as parallel concatenation of two recursive TCM encoder, and adapted puncturing mechanism to avoid the obvious disadvantage of the rate loss The iterative decoder of Turbo Trellis Coded Modulation (TTCM) exchanges extrinsic information between the constituent TCM decoders, which imposes a high computational complexity at the receiver. Therefore we conceive the syndromebased block decoding of TTCM, which is capable of reducing the decoding complexity by disabling the decoder, when syndrome becomes zero. Quantitatively, we demonstrate that a decoding complexity reduction of at least 17 % is attained at high SNRs, with at least 20 % and 45% reduction in the 5th and 6th iterations, respectively.
Exact Pairwise Error Probability Analysis of SpaceTime Codes in Realistic Propagation Environments
, 2004
"... In this paper, we derive an analytical expression for the exact pairwise error probability (PEP) of a spacetime coded system operating over a spatially correlated slow fading channel using a momentgenerating functionbased approach. This analytical PEP expression is more realistic than previously ..."
Abstract
 Add to MetaCart
In this paper, we derive an analytical expression for the exact pairwise error probability (PEP) of a spacetime coded system operating over a spatially correlated slow fading channel using a momentgenerating functionbased approach. This analytical PEP expression is more realistic than previously published exactPEP expressions as it fully accounts for antenna spacing, antenna geometries (Uniform Linear Array, Uniform Grid Array, Uniform Circular Array, etc.) and scattering models (Uniform, Gaussian, Laplacian, Vonmises, etc). Inclusion of spatial information provides valuable insights into the physical factors determining the performance of a spacetime code. We demonstrate the strength of our new analytical PEP expression by evaluating the performance of two spacetime trellis codes proposed in the literature for different spatial scenarios.