Code designs for cooperative communication

Arnab Chakrabarti, Elza Erkip, Ashutosh Sabharwal, Behnaam Aazhang

Research output: Contribution to journalArticle

Abstract

The implementation of two cooperative protocols decode-and-forward (DF) and estimate-and-forward (EF) has been discussed. The starting point is an information theoretic random coding scheme that motivates a practical code construction. The relay in a DF protocol first decodes information received during the source broadcast, re-encodes it and then forwards it to the destination. In EF relaying, the relay estimates and compresses its received signals prior to channel coding and retransmission. The coding schemes used are for time-variant Gaussian channels. They can be observed in systems where the channel state, consisting of all channel gains, is known at all nodes, whether transmitting, receiving or relaying. Meanwhile, studies have shown that relaying can mimic multiple-antenna systems even when the cooperating terminals can individually only support a single antenna. It is possible to send multiple copies of the same signal with multiple terminals to improve reliability. Another way is to transmit several parallel data streams to increase rate, which is called the multiplexing gain. The key to building viable cooperative systems is to construct efficient protocols for initiating cooperation, synchronization and channel estimation, and to selectively choose network topologies and relay protocols where the cooperative gain is high enough to justify the additional overhead.

Original languageEnglish (US)
Pages (from-to)16-26
Number of pages11
JournalIEEE Signal Processing Magazine
Volume24
Issue number5
DOIs
StatePublished - 2007

Fingerprint

Cooperative communication
Cooperative Communication
Relay
Network protocols
Decode-and-forward
Coding
Estimate
Antennas
Channel Coding
Channel coding
Cooperative Systems
Multiple Antennas
Decode
Channel Estimation
Channel estimation
Multiplexing
Data Streams
Network Topology
Justify
Broadcast

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Code designs for cooperative communication. / Chakrabarti, Arnab; Erkip, Elza; Sabharwal, Ashutosh; Aazhang, Behnaam.

In: IEEE Signal Processing Magazine, Vol. 24, No. 5, 2007, p. 16-26.

Research output: Contribution to journalArticle

Chakrabarti, Arnab ; Erkip, Elza ; Sabharwal, Ashutosh ; Aazhang, Behnaam. / Code designs for cooperative communication. In: IEEE Signal Processing Magazine. 2007 ; Vol. 24, No. 5. pp. 16-26.
@article{24b9852b93d242c6b4ee6c0f4b1ae1c2,
title = "Code designs for cooperative communication",
abstract = "The implementation of two cooperative protocols decode-and-forward (DF) and estimate-and-forward (EF) has been discussed. The starting point is an information theoretic random coding scheme that motivates a practical code construction. The relay in a DF protocol first decodes information received during the source broadcast, re-encodes it and then forwards it to the destination. In EF relaying, the relay estimates and compresses its received signals prior to channel coding and retransmission. The coding schemes used are for time-variant Gaussian channels. They can be observed in systems where the channel state, consisting of all channel gains, is known at all nodes, whether transmitting, receiving or relaying. Meanwhile, studies have shown that relaying can mimic multiple-antenna systems even when the cooperating terminals can individually only support a single antenna. It is possible to send multiple copies of the same signal with multiple terminals to improve reliability. Another way is to transmit several parallel data streams to increase rate, which is called the multiplexing gain. The key to building viable cooperative systems is to construct efficient protocols for initiating cooperation, synchronization and channel estimation, and to selectively choose network topologies and relay protocols where the cooperative gain is high enough to justify the additional overhead.",
author = "Arnab Chakrabarti and Elza Erkip and Ashutosh Sabharwal and Behnaam Aazhang",
year = "2007",
doi = "10.1109/MSP.2007.904810",
language = "English (US)",
volume = "24",
pages = "16--26",
journal = "IEEE Signal Processing Magazine",
issn = "1053-5888",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Code designs for cooperative communication

AU - Chakrabarti, Arnab

AU - Erkip, Elza

AU - Sabharwal, Ashutosh

AU - Aazhang, Behnaam

PY - 2007

Y1 - 2007

N2 - The implementation of two cooperative protocols decode-and-forward (DF) and estimate-and-forward (EF) has been discussed. The starting point is an information theoretic random coding scheme that motivates a practical code construction. The relay in a DF protocol first decodes information received during the source broadcast, re-encodes it and then forwards it to the destination. In EF relaying, the relay estimates and compresses its received signals prior to channel coding and retransmission. The coding schemes used are for time-variant Gaussian channels. They can be observed in systems where the channel state, consisting of all channel gains, is known at all nodes, whether transmitting, receiving or relaying. Meanwhile, studies have shown that relaying can mimic multiple-antenna systems even when the cooperating terminals can individually only support a single antenna. It is possible to send multiple copies of the same signal with multiple terminals to improve reliability. Another way is to transmit several parallel data streams to increase rate, which is called the multiplexing gain. The key to building viable cooperative systems is to construct efficient protocols for initiating cooperation, synchronization and channel estimation, and to selectively choose network topologies and relay protocols where the cooperative gain is high enough to justify the additional overhead.

AB - The implementation of two cooperative protocols decode-and-forward (DF) and estimate-and-forward (EF) has been discussed. The starting point is an information theoretic random coding scheme that motivates a practical code construction. The relay in a DF protocol first decodes information received during the source broadcast, re-encodes it and then forwards it to the destination. In EF relaying, the relay estimates and compresses its received signals prior to channel coding and retransmission. The coding schemes used are for time-variant Gaussian channels. They can be observed in systems where the channel state, consisting of all channel gains, is known at all nodes, whether transmitting, receiving or relaying. Meanwhile, studies have shown that relaying can mimic multiple-antenna systems even when the cooperating terminals can individually only support a single antenna. It is possible to send multiple copies of the same signal with multiple terminals to improve reliability. Another way is to transmit several parallel data streams to increase rate, which is called the multiplexing gain. The key to building viable cooperative systems is to construct efficient protocols for initiating cooperation, synchronization and channel estimation, and to selectively choose network topologies and relay protocols where the cooperative gain is high enough to justify the additional overhead.

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

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

U2 - 10.1109/MSP.2007.904810

DO - 10.1109/MSP.2007.904810

M3 - Article

VL - 24

SP - 16

EP - 26

JO - IEEE Signal Processing Magazine

JF - IEEE Signal Processing Magazine

SN - 1053-5888

IS - 5

ER -