Randomized space-time coding for distributed cooperative communication

Birsen Sirkeci Mergen, Anna Scaglione

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

Abstract

In this paper, we study the problem of designing distributed space-time codes for cooperative communication. We introduce randomized strategies that decentralize the transmission of a space time code from a set of distributed relays and analyze their performance. In our methods, as in other cooperative transmission strategies, the relay signals are encoded so as to provide diversity and coding gains. However, our methods enable the relays to act independently and to achieve such gains in a decentralized fashion. The simple idea we propose is to let each node transmit a random linear combination of the codewords that would be transmitted by all the antennas in a centralized space time coding scheme. Different decentralized strategies correspond to different choices for the statistics of the random coefficients. We provide sufficient conditions on the distributions of the random coefficients and on the number of nodes that guarantee to achieve the maximum diversity gain. 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 in the underlying space-time code. The diversity order L is achieved for N > L.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages4501-4506
Number of pages6
Volume10
DOIs
StatePublished - 2006
Externally publishedYes
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: Jul 11 2006Jul 15 2006

Other

Other2006 IEEE International Conference on Communications, ICC 2006
CountryTurkey
CityIstanbul
Period7/11/067/15/06

Fingerprint

Cooperative communication
Space time codes
Statistics
Antennas

ASJC Scopus subject areas

  • Media Technology

Cite this

Mergen, B. S., & Scaglione, A. (2006). Randomized space-time coding for distributed cooperative communication. In IEEE International Conference on Communications (Vol. 10, pp. 4501-4506). [4024746] https://doi.org/10.1109/ICC.2006.255348

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

IEEE International Conference on Communications. Vol. 10 2006. p. 4501-4506 4024746.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mergen, BS & Scaglione, A 2006, Randomized space-time coding for distributed cooperative communication. in IEEE International Conference on Communications. vol. 10, 4024746, pp. 4501-4506, 2006 IEEE International Conference on Communications, ICC 2006, Istanbul, Turkey, 7/11/06. https://doi.org/10.1109/ICC.2006.255348
Mergen BS, Scaglione A. Randomized space-time coding for distributed cooperative communication. In IEEE International Conference on Communications. Vol. 10. 2006. p. 4501-4506. 4024746 https://doi.org/10.1109/ICC.2006.255348
Mergen, Birsen Sirkeci ; Scaglione, Anna. / Randomized space-time coding for distributed cooperative communication. IEEE International Conference on Communications. Vol. 10 2006. pp. 4501-4506
@inproceedings{102af63b3de540e59a2db67032c7db75,
title = "Randomized space-time coding for distributed cooperative communication",
abstract = "In this paper, we study the problem of designing distributed space-time codes for cooperative communication. We introduce randomized strategies that decentralize the transmission of a space time code from a set of distributed relays and analyze their performance. In our methods, as in other cooperative transmission strategies, the relay signals are encoded so as to provide diversity and coding gains. However, our methods enable the relays to act independently and to achieve such gains in a decentralized fashion. The simple idea we propose is to let each node transmit a random linear combination of the codewords that would be transmitted by all the antennas in a centralized space time coding scheme. Different decentralized strategies correspond to different choices for the statistics of the random coefficients. We provide sufficient conditions on the distributions of the random coefficients and on the number of nodes that guarantee to achieve the maximum diversity gain. 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 in the underlying space-time code. The diversity order L is achieved for N > L.",
author = "Mergen, {Birsen Sirkeci} and Anna Scaglione",
year = "2006",
doi = "10.1109/ICC.2006.255348",
language = "English (US)",
isbn = "1424403553",
volume = "10",
pages = "4501--4506",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Randomized space-time coding for distributed cooperative communication

AU - Mergen, Birsen Sirkeci

AU - Scaglione, Anna

PY - 2006

Y1 - 2006

N2 - In this paper, we study the problem of designing distributed space-time codes for cooperative communication. We introduce randomized strategies that decentralize the transmission of a space time code from a set of distributed relays and analyze their performance. In our methods, as in other cooperative transmission strategies, the relay signals are encoded so as to provide diversity and coding gains. However, our methods enable the relays to act independently and to achieve such gains in a decentralized fashion. The simple idea we propose is to let each node transmit a random linear combination of the codewords that would be transmitted by all the antennas in a centralized space time coding scheme. Different decentralized strategies correspond to different choices for the statistics of the random coefficients. We provide sufficient conditions on the distributions of the random coefficients and on the number of nodes that guarantee to achieve the maximum diversity gain. 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 in the underlying space-time code. The diversity order L is achieved for N > L.

AB - In this paper, we study the problem of designing distributed space-time codes for cooperative communication. We introduce randomized strategies that decentralize the transmission of a space time code from a set of distributed relays and analyze their performance. In our methods, as in other cooperative transmission strategies, the relay signals are encoded so as to provide diversity and coding gains. However, our methods enable the relays to act independently and to achieve such gains in a decentralized fashion. The simple idea we propose is to let each node transmit a random linear combination of the codewords that would be transmitted by all the antennas in a centralized space time coding scheme. Different decentralized strategies correspond to different choices for the statistics of the random coefficients. We provide sufficient conditions on the distributions of the random coefficients and on the number of nodes that guarantee to achieve the maximum diversity gain. 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 in the underlying space-time code. The diversity order L is achieved for N > L.

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

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

U2 - 10.1109/ICC.2006.255348

DO - 10.1109/ICC.2006.255348

M3 - Conference contribution

AN - SCOPUS:36248944804

SN - 1424403553

SN - 9781424403554

VL - 10

SP - 4501

EP - 4506

BT - IEEE International Conference on Communications

ER -