TY - GEN
T1 - Optimal distributed codes with delay four and constant decoding complexity
AU - Lu, Francis
PY - 2015/9/28
Y1 - 2015/9/28
N2 - A novel transmission scheme based on the non-orthogonal selection decode-and-forward protocol is presented in this paper for cooperative relay networks. The proposed scheme assumes a low rate feedback channel from the destination to the relays. Benefited from the feedback information, an optimal distributed code that has an extremely short delay equal to four is constructed, and the same code can be applied to networks with arbitrary number of relays to yield optimal cooperative diversity gains. The proposed code is sphere-decodable with decoding complexity again independent of the number of relays. In particular, when operating at multiplexing gain ≥ 1 over 2, the lattice decoder at the destination has a zero complexity exponent, meaning a constant decoding complexity and independent of transmission rate. Analyses for the decoding complexity of other existing diversity-optimal distributed codes are also provided. It is shown that these codes have a linear growth in delay and an exponential growth in decoding complexity as the number of relays increases.
AB - A novel transmission scheme based on the non-orthogonal selection decode-and-forward protocol is presented in this paper for cooperative relay networks. The proposed scheme assumes a low rate feedback channel from the destination to the relays. Benefited from the feedback information, an optimal distributed code that has an extremely short delay equal to four is constructed, and the same code can be applied to networks with arbitrary number of relays to yield optimal cooperative diversity gains. The proposed code is sphere-decodable with decoding complexity again independent of the number of relays. In particular, when operating at multiplexing gain ≥ 1 over 2, the lattice decoder at the destination has a zero complexity exponent, meaning a constant decoding complexity and independent of transmission rate. Analyses for the decoding complexity of other existing diversity-optimal distributed codes are also provided. It is shown that these codes have a linear growth in delay and an exponential growth in decoding complexity as the number of relays increases.
UR - http://www.scopus.com/inward/record.url?scp=84969790507&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2015.7282811
DO - 10.1109/ISIT.2015.7282811
M3 - Conference contribution
AN - SCOPUS:84969790507
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2026
EP - 2030
BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Symposium on Information Theory, ISIT 2015
Y2 - 14 June 2015 through 19 June 2015
ER -