TY - GEN
T1 - Multi-source cooperative networks with distributed convolutional coding
AU - Wang, Renqiu
AU - Zhao, Wanlun
AU - Giannakis, Georgios B.
PY - 2005
Y1 - 2005
N2 - Cooperative diversity, enabled by communicators willing to collaborate, offers an effective way of mitigating slow fading propagation effects. Recently, multi-source cooperation (MSC) has been introduced to provide higher diversity and code rates relative to cooperative schemes that rely on either amplify-and-forward or regeneration of information at relay nodes. In this paper, we develop a distributed convolutionally coded (DCC) MSC system. We show that in a cooperative network with binary transmission among K active users and M idle users, the maximum diversity order is min(dmin,α) for any MSC scheme with code rate R and minimum (free) Hamming distance d min, where α = 1 + ⌊L(1 -R)⌋ is the maximum possible diversity order provided by L independent Rayleigh channel gains. Notice that L = K, if cooperation takes place only between active users; and L = K + M, if M idle users also serve as relays. Compared to MSC with block coding, our DCC-MSC scheme is more effective with long codewords, when maximum likelihood decoding can be implemented using Viterbi's algorithm. We also design interleavers to maximize the diversity of the error event with minimum distance. Simulations verify that DCC-MSC can improve system performance markedly.
AB - Cooperative diversity, enabled by communicators willing to collaborate, offers an effective way of mitigating slow fading propagation effects. Recently, multi-source cooperation (MSC) has been introduced to provide higher diversity and code rates relative to cooperative schemes that rely on either amplify-and-forward or regeneration of information at relay nodes. In this paper, we develop a distributed convolutionally coded (DCC) MSC system. We show that in a cooperative network with binary transmission among K active users and M idle users, the maximum diversity order is min(dmin,α) for any MSC scheme with code rate R and minimum (free) Hamming distance d min, where α = 1 + ⌊L(1 -R)⌋ is the maximum possible diversity order provided by L independent Rayleigh channel gains. Notice that L = K, if cooperation takes place only between active users; and L = K + M, if M idle users also serve as relays. Compared to MSC with block coding, our DCC-MSC scheme is more effective with long codewords, when maximum likelihood decoding can be implemented using Viterbi's algorithm. We also design interleavers to maximize the diversity of the error event with minimum distance. Simulations verify that DCC-MSC can improve system performance markedly.
UR - http://www.scopus.com/inward/record.url?scp=33847648489&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33847648489&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33847648489
SN - 1424401313
SN - 9781424401314
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 1056
EP - 1060
BT - Conference Record of The Thirty-Ninth Asilomar Conference on Signals, Systems and Computers
T2 - 39th Asilomar Conference on Signals, Systems and Computers
Y2 - 28 October 2005 through 1 November 2005
ER -