TY - GEN
T1 - Randomized space-time coding for distributed cooperative communication
AU - Mergen, Birsen Sirkeci
AU - Scaglione, Anna
PY - 2006/12/1
Y1 - 2006/12/1
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
T3 - IEEE International Conference on Communications
SP - 4501
EP - 4506
BT - 2006 IEEE International Conference on Communications, ICC 2006
T2 - 2006 IEEE International Conference on Communications, ICC 2006
Y2 - 11 July 2006 through 15 July 2006
ER -