An improved space-time decoder under MIMO system

Authors:
Menglong Wu;Kai Chen;Danpu Liu;Guangxin Yue
Affiliations:
School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China and Institute of Information Engineering, North China University of Technolo ...;School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 4
Cited 0

On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas

Wireless Personal Communications: An International Journal
Space-time codes for high data rate wireless communication: performance criterion and code construction

IEEE Transactions on Information Theory
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading

IEEE Transactions on Information Theory
On the theory of space-time codes for PSK modulation

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimum space-time convolution code, which provides maximum diversity and coding gain, are produced for cases with PSK modulation and various numbers of states and antennas. In this paper, we modify the conventional Viterbi algorithm used in space-time encoder under the MIMO system, and give the recursive metric equation. The modified Viterbi algorithm can be used in the receiver when the MIMO channel information is known a prior. The new approach provides an efficient method that allows a search for optimum path. Compared with the conventional decoding algorithm, the improved algorithm can be used in the every receiver respectively. It is shown that the improved algorithm is also an optimal algorithm, however, its metric convergence speed is faster than the standard Viterbi algorithm.