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
AN - SCOPUS:33846620626
SN - 0780394143
SN - 9780780394148
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 1314
EP - 1319
BT - GLOBECOM'05
T2 - GLOBECOM'05: IEEE Global Telecommunications Conference, 2005
Y2 - 28 November 2005 through 2 December 2005
ER -