Optimal distributed codes with delay four and constant decoding complexity

Francis Lu*

*此作品的通信作者

研究成果: Conference contribution同行評審

摘要

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.

原文English
主出版物標題Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
發行者Institute of Electrical and Electronics Engineers Inc.
頁面2026-2030
頁數5
ISBN(電子)9781467377041
DOIs
出版狀態Published - 28 9月 2015
事件IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
持續時間: 14 6月 201519 6月 2015

出版系列

名字IEEE International Symposium on Information Theory - Proceedings
2015-June
ISSN(列印)2157-8095

Conference

ConferenceIEEE International Symposium on Information Theory, ISIT 2015
國家/地區Hong Kong
城市Hong Kong
期間14/06/1519/06/15

指紋

深入研究「Optimal distributed codes with delay four and constant decoding complexity」主題。共同形成了獨特的指紋。

引用此