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
Subtitle of host publicationIEEE Global Telecommunications Conference, 2005
Pages1314-1319
Number of pages6
DOIs
StatePublished - Dec 1 2005
EventGLOBECOM'05: IEEE Global Telecommunications Conference, 2005 - St. Louis, MO, United States
Duration: Nov 28 2005Dec 2 2005

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference
Volume3

Other

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

    Fingerprint

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 (pp. 1314-1319). [1577865] (GLOBECOM - IEEE Global Telecommunications Conference; Vol. 3). https://doi.org/10.1109/GLOCOM.2005.1577865