Design of delay-tolerant linear dispersion codes

TY - JOUR

T1 - Design of delay-tolerant linear dispersion codes

AU - Wang, Wenjin

AU - Zheng, Fuchun

AU - Burr, Alister

AU - Fitch, Michael

PY - 2012/9

Y1 - 2012/9

N2 - In cooperative communication networks, owing to the nodes' arbitrary geographical locations and individual oscillators, the system is fundamentally asynchronous. This will damage some of the key properties of the space-time codes and can lead to substantial performance degradation. In this paper, we study the design of linear dispersion codes (LDCs) for such asynchronous cooperative communication networks. Firstly, the concept of conventional LDCs is extended to the delay-tolerant version and new design criteria are discussed. Then we propose a new design method to yield delay-tolerant LDCs that reach the optimal Jensen's upper bound on ergodic capacity as well as minimum average pairwise error probability. The proposed design employs stochastic gradient algorithm to approach a local optimum. Moreover, it is improved by using simulated annealing type optimization to increase the likelihood of the global optimum. The proposed method allows for flexible number of nodes, receive antennas, modulated symbols and flexible length of codewords. Simulation results confirm the performance of the newly-proposed delay-tolerant LDCs.

AB - In cooperative communication networks, owing to the nodes' arbitrary geographical locations and individual oscillators, the system is fundamentally asynchronous. This will damage some of the key properties of the space-time codes and can lead to substantial performance degradation. In this paper, we study the design of linear dispersion codes (LDCs) for such asynchronous cooperative communication networks. Firstly, the concept of conventional LDCs is extended to the delay-tolerant version and new design criteria are discussed. Then we propose a new design method to yield delay-tolerant LDCs that reach the optimal Jensen's upper bound on ergodic capacity as well as minimum average pairwise error probability. The proposed design employs stochastic gradient algorithm to approach a local optimum. Moreover, it is improved by using simulated annealing type optimization to increase the likelihood of the global optimum. The proposed method allows for flexible number of nodes, receive antennas, modulated symbols and flexible length of codewords. Simulation results confirm the performance of the newly-proposed delay-tolerant LDCs.

KW - Asynchronous relay network

KW - Cooperative communication

KW - Delay-tolerant space-time code

KW - Linear dispersion code

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

U2 - 10.1109/TCOMM.2012.070912.110362

DO - 10.1109/TCOMM.2012.070912.110362

M3 - Article

AN - SCOPUS:84866736101

SN - 0090-6778

VL - 60

SP - 2560

EP - 2570

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 9

M1 - 6241380

ER -