Randomized space-time coding for distributed cooperative communication

Birsen Sirkeci-Mergen, Anna Scaglione

Research output: Contribution to journalArticle

154 Citations (Scopus)

Abstract

We study the design of distributed space-time codes for cooperative communication. We assume that each node is equipped with a single antenna; however, to obtain diversity and coding gains, the cooperating nodes act as elements of a multiantenna system. With few exceptions, most of the literature on the subject proposes coding rules in which each node emulates a predetermined antenna of a multiantenna system. Since the nodes need to know their specific antenna index, either internode communication or a central control unit is required. Our design objective is to obtain diversity and coding gains while eliminating the need for code or antenna allocation. We achieve our objective by introducing novel randomized strategies that decentralize the transmission of a space time code from a set of distributed relays. Our simple idea is to let each node transmit an independent random linear combination of the codewords that would have been transmitted by all the elements of a multiantenna system. In addition to introducing this new class of designs, we fully characterize the diversity order of the corresponding symbol error probability and also analyze how the performance is linked to different choices of the statistics of the random coefficients. We show that the proposed scheme achieves full diversity (N) if N <L, where N is the number of transmitters and L is the number of antennas assumed in the underlying space-time code structure. The diversity order L is achieved if N > L. Interestingly, in certain cases (e.g., N=L=2), we show that the achieved diversity order is fractional (d*=1.5)!

Original languageEnglish (US)
Pages (from-to)5003-5017
Number of pages15
JournalIEEE Transactions on Signal Processing
Volume55
Issue number10
DOIs
StatePublished - Oct 2007
Externally publishedYes

Fingerprint

Cooperative communication
Antennas
Space time codes
Statistics
Communication

Keywords

  • Cooperative transmission
  • Distributed networks
  • Diversity
  • Space-time coding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

Randomized space-time coding for distributed cooperative communication. / Sirkeci-Mergen, Birsen; Scaglione, Anna.

In: IEEE Transactions on Signal Processing, Vol. 55, No. 10, 10.2007, p. 5003-5017.

Research output: Contribution to journalArticle

@article{b429fc6c37704581a578bea2c1def71c,
title = "Randomized space-time coding for distributed cooperative communication",
abstract = "We study the design of distributed space-time codes for cooperative communication. We assume that each node is equipped with a single antenna; however, to obtain diversity and coding gains, the cooperating nodes act as elements of a multiantenna system. With few exceptions, most of the literature on the subject proposes coding rules in which each node emulates a predetermined antenna of a multiantenna system. Since the nodes need to know their specific antenna index, either internode communication or a central control unit is required. Our design objective is to obtain diversity and coding gains while eliminating the need for code or antenna allocation. We achieve our objective by introducing novel randomized strategies that decentralize the transmission of a space time code from a set of distributed relays. Our simple idea is to let each node transmit an independent random linear combination of the codewords that would have been transmitted by all the elements of a multiantenna system. In addition to introducing this new class of designs, we fully characterize the diversity order of the corresponding symbol error probability and also analyze how the performance is linked to different choices of the statistics of the random coefficients. We show that the proposed scheme achieves full diversity (N) if N <L, where N is the number of transmitters and L is the number of antennas assumed in the underlying space-time code structure. The diversity order L is achieved if N > L. Interestingly, in certain cases (e.g., N=L=2), we show that the achieved diversity order is fractional (d*=1.5)!",
keywords = "Cooperative transmission, Distributed networks, Diversity, Space-time coding",
author = "Birsen Sirkeci-Mergen and Anna Scaglione",
year = "2007",
month = "10",
doi = "10.1109/TSP.2007.896061",
language = "English (US)",
volume = "55",
pages = "5003--5017",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Randomized space-time coding for distributed cooperative communication

AU - Sirkeci-Mergen, Birsen

AU - Scaglione, Anna

PY - 2007/10

Y1 - 2007/10

N2 - We study the design of distributed space-time codes for cooperative communication. We assume that each node is equipped with a single antenna; however, to obtain diversity and coding gains, the cooperating nodes act as elements of a multiantenna system. With few exceptions, most of the literature on the subject proposes coding rules in which each node emulates a predetermined antenna of a multiantenna system. Since the nodes need to know their specific antenna index, either internode communication or a central control unit is required. Our design objective is to obtain diversity and coding gains while eliminating the need for code or antenna allocation. We achieve our objective by introducing novel randomized strategies that decentralize the transmission of a space time code from a set of distributed relays. Our simple idea is to let each node transmit an independent random linear combination of the codewords that would have been transmitted by all the elements of a multiantenna system. In addition to introducing this new class of designs, we fully characterize the diversity order of the corresponding symbol error probability and also analyze how the performance is linked to different choices of the statistics of the random coefficients. We show that the proposed scheme achieves full diversity (N) if N <L, where N is the number of transmitters and L is the number of antennas assumed in the underlying space-time code structure. The diversity order L is achieved if N > L. Interestingly, in certain cases (e.g., N=L=2), we show that the achieved diversity order is fractional (d*=1.5)!

AB - We study the design of distributed space-time codes for cooperative communication. We assume that each node is equipped with a single antenna; however, to obtain diversity and coding gains, the cooperating nodes act as elements of a multiantenna system. With few exceptions, most of the literature on the subject proposes coding rules in which each node emulates a predetermined antenna of a multiantenna system. Since the nodes need to know their specific antenna index, either internode communication or a central control unit is required. Our design objective is to obtain diversity and coding gains while eliminating the need for code or antenna allocation. We achieve our objective by introducing novel randomized strategies that decentralize the transmission of a space time code from a set of distributed relays. Our simple idea is to let each node transmit an independent random linear combination of the codewords that would have been transmitted by all the elements of a multiantenna system. In addition to introducing this new class of designs, we fully characterize the diversity order of the corresponding symbol error probability and also analyze how the performance is linked to different choices of the statistics of the random coefficients. We show that the proposed scheme achieves full diversity (N) if N <L, where N is the number of transmitters and L is the number of antennas assumed in the underlying space-time code structure. The diversity order L is achieved if N > L. Interestingly, in certain cases (e.g., N=L=2), we show that the achieved diversity order is fractional (d*=1.5)!

KW - Cooperative transmission

KW - Distributed networks

KW - Diversity

KW - Space-time coding

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

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

U2 - 10.1109/TSP.2007.896061

DO - 10.1109/TSP.2007.896061

M3 - Article

AN - SCOPUS:35148841393

VL - 55

SP - 5003

EP - 5017

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 10

ER -