Full diversity distributed space-time trellis codes for asynchronous cooperative communications

Yabo Li; Xiang Gen Xia

doi:10.1109/ISIT.2005.1523470

Full diversity distributed space-time trellis codes for asynchronous cooperative communications

Yabo Li, Xiang Gen Xia

University of Delaware

Research output: Contribution to journal › Conference article › peer-review

47 Citations (Scopus)

Abstract

In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each terminal has its own local oscillator. In this paper, based on the stack construction proposed by Hammons and El Gamal, we first construct a family of space-time trellis codes for BPSK modulation scheme that is characterized to possess the full cooperative diversity order without the synchronization assumption. We then generalize this family of space-time trellis codes from BPSK to higher order QAM and PSK modulation schemes based on the unified construction proposed by Lu and Kumar. And also, simplified decoding methods are discussed. Simulation results are given to illustrate the performance of the newly proposed codes.

Original language	English
Article number	1523470
Journal	IEEE International Symposium on Information Theory - Proceedings
Volume	2005-January
DOIs	https://doi.org/10.1109/ISIT.2005.1523470
Publication status	Published - 2005
Externally published	Yes
Event	2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: 4 Sept 2005 → 9 Sept 2005

Keywords

Asynchronous cooperative diversity
MIMO
Sensor networks
Space-time trellis codes

Access to Document

10.1109/ISIT.2005.1523470

Cite this

@article{282da96e5fac42c6a67565cdc84e1f99,

title = "Full diversity distributed space-time trellis codes for asynchronous cooperative communications",

abstract = "In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each terminal has its own local oscillator. In this paper, based on the stack construction proposed by Hammons and El Gamal, we first construct a family of space-time trellis codes for BPSK modulation scheme that is characterized to possess the full cooperative diversity order without the synchronization assumption. We then generalize this family of space-time trellis codes from BPSK to higher order QAM and PSK modulation schemes based on the unified construction proposed by Lu and Kumar. And also, simplified decoding methods are discussed. Simulation results are given to illustrate the performance of the newly proposed codes.",

keywords = "Asynchronous cooperative diversity, MIMO, Sensor networks, Space-time trellis codes",

author = "Yabo Li and Xia, {Xiang Gen}",

note = "Publisher Copyright: {\textcopyright} 2005 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.; 2005 IEEE International Symposium on Information Theory, ISIT 05 ; Conference date: 04-09-2005 Through 09-09-2005",

year = "2005",

doi = "10.1109/ISIT.2005.1523470",

language = "English",

volume = "2005-January",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Full diversity distributed space-time trellis codes for asynchronous cooperative communications

AU - Li, Yabo

AU - Xia, Xiang Gen

PY - 2005

Y1 - 2005

N2 - In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each terminal has its own local oscillator. In this paper, based on the stack construction proposed by Hammons and El Gamal, we first construct a family of space-time trellis codes for BPSK modulation scheme that is characterized to possess the full cooperative diversity order without the synchronization assumption. We then generalize this family of space-time trellis codes from BPSK to higher order QAM and PSK modulation schemes based on the unified construction proposed by Lu and Kumar. And also, simplified decoding methods are discussed. Simulation results are given to illustrate the performance of the newly proposed codes.

AB - In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each terminal has its own local oscillator. In this paper, based on the stack construction proposed by Hammons and El Gamal, we first construct a family of space-time trellis codes for BPSK modulation scheme that is characterized to possess the full cooperative diversity order without the synchronization assumption. We then generalize this family of space-time trellis codes from BPSK to higher order QAM and PSK modulation schemes based on the unified construction proposed by Lu and Kumar. And also, simplified decoding methods are discussed. Simulation results are given to illustrate the performance of the newly proposed codes.

KW - Asynchronous cooperative diversity

KW - MIMO

KW - Sensor networks

KW - Space-time trellis codes

UR - http://www.scopus.com/inward/record.url?scp=85114356487&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2005.1523470

DO - 10.1109/ISIT.2005.1523470

M3 - Conference article

AN - SCOPUS:85114356487

SN - 2157-8095

VL - 2005-January

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

M1 - 1523470

T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05

Y2 - 4 September 2005 through 9 September 2005

ER -

Full diversity distributed space-time trellis codes for asynchronous cooperative communications

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this