Finite-alphabet constant-amplitude training sequence for multiple-antenna broadband transmissions

Author

Fragouli, C. ; Al-Dhahir, N. ; Turin, W.

Author_Institution

AT&T Shannon Lab., Florham Park, NJ, USA

Volume

1

fYear

2002

fDate

2002

Firstpage

6

Lastpage

10

Abstract

We propose a method to identify training sequences for multiple-antenna transmissions over quasi-static frequency-selective channels. These sequences are constructed to belong to a standard constant-amplitude 2^m-PSK constellation (such as BPSK, QPSK etc) to simplify the transmitter/receiver implementation. Many practical systems use training of predetermined length. Optimal sequences do not exist for all training sequence lengths and constellation alphabets. The proposed method allows us to identify training sequences that belong to a standard constellation for an arbitrary training sequence length and an arbitrary number of unknown channel taps. Performance bounds derived indicate that these sequences achieve near-optimum performance

Keywords

antenna arrays; broadband networks; fading channels; mean square error methods; optimisation; quadrature phase shift keying; sequences; BPSK; MMSE; QPSK; channel taps; constant-amplitude 2^m-PSK constellation; constellation alphabet; finite-alphabet constant-amplitude training sequence; multiple-antenna broadband transmissions; multiple-antenna transmissions; near-optimum performance; optimal sequences; performance bounds; quasi-static frequency-selective channels; training sequence length; training sequences identification; Binary phase shift keying; Channel estimation; Constellation diagram; Fading; Frequency; Laboratories; Mean square error methods; Quadrature phase shift keying; Transmitters; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2002. ICC 2002. IEEE International Conference on

Conference_Location

New York, NY

Print_ISBN

0-7803-7400-2

Type

conf

DOI

10.1109/ICC.2002.996806

Filename

996806