Relay search algorithms for coded cooperative systems

Zinan Lin, Elza Erkip

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

Abstract

Cooperation provides an efficient form of diversity in wireless communications. In this paper we consider a coded cooperative system where the source and the relays may have multiple antennas. We describe two simple algorithms for choosing a good relay: Blind-Selection-Algorithm and Informed-Selection-Algorithm. These algorithms only require the knowledge of average received signal to noise ratios at the destination. Simulation results, carried out for a cellular system, show that both algorithms result in substantial improvement over direct transmission and random choice of relay in the cell and provide error rates close to best relay performance.

Original languageEnglish (US)
Title of host publicationGLOBECOM'05: IEEE Global Telecommunications Conference, 2005
Pages1314-1319
Number of pages6
Volume3
DOIs
StatePublished - 2005
EventGLOBECOM'05: IEEE Global Telecommunications Conference, 2005 - St. Louis, MO, United States
Duration: Nov 28 2005Dec 2 2005

Other

OtherGLOBECOM'05: IEEE Global Telecommunications Conference, 2005
CountryUnited States
CitySt. Louis, MO
Period11/28/0512/2/05

Fingerprint

Signal to noise ratio
Antennas
Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lin, Z., & Erkip, E. (2005). Relay search algorithms for coded cooperative systems. In GLOBECOM'05: IEEE Global Telecommunications Conference, 2005 (Vol. 3, pp. 1314-1319). [1577865] https://doi.org/10.1109/GLOCOM.2005.1577865

Relay search algorithms for coded cooperative systems. / Lin, Zinan; Erkip, Elza.

GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 3 2005. p. 1314-1319 1577865.

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

Lin, Z & Erkip, E 2005, Relay search algorithms for coded cooperative systems. in GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. vol. 3, 1577865, pp. 1314-1319, GLOBECOM'05: IEEE Global Telecommunications Conference, 2005, St. Louis, MO, United States, 11/28/05. https://doi.org/10.1109/GLOCOM.2005.1577865
Lin Z, Erkip E. Relay search algorithms for coded cooperative systems. In GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 3. 2005. p. 1314-1319. 1577865 https://doi.org/10.1109/GLOCOM.2005.1577865
Lin, Zinan ; Erkip, Elza. / Relay search algorithms for coded cooperative systems. GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 3 2005. pp. 1314-1319
@inproceedings{3d225f1d4a4b4b489a1a028099388e93,
title = "Relay search algorithms for coded cooperative systems",
abstract = "Cooperation provides an efficient form of diversity in wireless communications. In this paper we consider a coded cooperative system where the source and the relays may have multiple antennas. We describe two simple algorithms for choosing a good relay: Blind-Selection-Algorithm and Informed-Selection-Algorithm. These algorithms only require the knowledge of average received signal to noise ratios at the destination. Simulation results, carried out for a cellular system, show that both algorithms result in substantial improvement over direct transmission and random choice of relay in the cell and provide error rates close to best relay performance.",
author = "Zinan Lin and Elza Erkip",
year = "2005",
doi = "10.1109/GLOCOM.2005.1577865",
language = "English (US)",
isbn = "0780394143",
volume = "3",
pages = "1314--1319",
booktitle = "GLOBECOM'05: IEEE Global Telecommunications Conference, 2005",

}

TY - GEN

T1 - Relay search algorithms for coded cooperative systems

AU - Lin, Zinan

AU - Erkip, Elza

PY - 2005

Y1 - 2005

N2 - Cooperation provides an efficient form of diversity in wireless communications. In this paper we consider a coded cooperative system where the source and the relays may have multiple antennas. We describe two simple algorithms for choosing a good relay: Blind-Selection-Algorithm and Informed-Selection-Algorithm. These algorithms only require the knowledge of average received signal to noise ratios at the destination. Simulation results, carried out for a cellular system, show that both algorithms result in substantial improvement over direct transmission and random choice of relay in the cell and provide error rates close to best relay performance.

AB - Cooperation provides an efficient form of diversity in wireless communications. In this paper we consider a coded cooperative system where the source and the relays may have multiple antennas. We describe two simple algorithms for choosing a good relay: Blind-Selection-Algorithm and Informed-Selection-Algorithm. These algorithms only require the knowledge of average received signal to noise ratios at the destination. Simulation results, carried out for a cellular system, show that both algorithms result in substantial improvement over direct transmission and random choice of relay in the cell and provide error rates close to best relay performance.

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

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

U2 - 10.1109/GLOCOM.2005.1577865

DO - 10.1109/GLOCOM.2005.1577865

M3 - Conference contribution

SN - 0780394143

SN - 9780780394148

VL - 3

SP - 1314

EP - 1319

BT - GLOBECOM'05: IEEE Global Telecommunications Conference, 2005

ER -