Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Finite-Alphabet Constant-Amplitude Training Sequences for Multiple-Antennas Broadband Transmissions
 
conference paper

Finite-Alphabet Constant-Amplitude Training Sequences for Multiple-Antennas Broadband Transmissions

Fragouli, C.  
•
Al-Dhahir, N.
•
Turin, W.
2002
2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002
IEEE International Conference on Communications (ICC 2002)

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 2m-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.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

spacetime_6.ps

Access type

openaccess

Size

246.55 KB

Format

Postscript

Checksum (MD5)

537c00ecdcdbe4c01b97aae9c9468577

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés