A Common Function of Different Union Bounds for Optimization and BER Evaluation of Space---Time codes

Authors:
Z. Zhang;X. G. Dai;S. W. Cheung;T. I. Yuk
Affiliations:
Department of Electrical & Electronic Engineering, the University of Hong Kong, Hong Kong, Hong Kong;Department of Electrical & Electronic Engineering, the University of Hong Kong, Hong Kong, Hong Kong;Department of Electrical & Electronic Engineering, the University of Hong Kong, Hong Kong, Hong Kong;Department of Electrical & Electronic Engineering, the University of Hong Kong, Hong Kong, Hong Kong
Venue:
Wireless Personal Communications: An International Journal
Year:
2008

Citing 6
Cited 1

Principles of Digital Transmission: With Wireless Applications

Principles of Digital Transmission: With Wireless Applications
Linear dispersion codes for MIMO systems based on frame theory

IEEE Transactions on Signal Processing
On the error performance analysis of space-time trellis codes

IEEE Transactions on Wireless Communications
Space-time codes for high data rate wireless communication: performance criterion and code construction

IEEE Transactions on Information Theory
Exact pairwise error probability of space-time codes

IEEE Transactions on Information Theory
Remarks on space-time codes including a new lower bound and an improved code

IEEE Transactions on Information Theory

A new union bound based on Hölder inequality for space-time codes

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimizing Space-Time (S---T) codes, in terms of minimum error rates, based on Union bounds often produces results which vary with signal-to-noise ratio (SNR) and so are not easy to use. Error-rate evaluation of S---T codes using Union bounds sometimes requires very heavy computational loads and so is impractical. In this paper, a Common function shared by different Union bounds is derived and proposed for optimization of S---T codes. The Common function produces the optimization results which are SNR independent and so requires a substantially lower computation load. Results of Monte-Carlo simulation on two 2 脳 2 rotation-based diagonal S---T codes (D codes) and two Linear-Dispersion codes (LDCs) show that the bit-error-rate (BER) performances using the optimization results based on the Common function, the exact Union bound (EUB) and Chernoff Union bound (CUB) are all nearly identical. The Common function is subsequently used to develop a modified Union bound (MUB) and modified Chernoff Union bound (MCUB). Results of numerical calculations show that the MUB can provide a good compromise between the accuracy and computational load for BER evaluation.