Diversity-multiplexing tradeoff optimal codes for OFDM-based asynchronous cooperative networks

Hsiao-Feng Lu*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An asynchronous cooperative network where different time delays among nodes exist is considered in this paper. With OFDM modulation, it is first shown that the diversity-multiplexing tradeoff (DMT) achieved by the non-orthogonal selection decode-and-forward (NSDF) protocol for this network is the same as that for the synchronous one. In sharp contrast to the currently available complicated approximately universal "matrix" codes, a systematic construction of an extremely simple "vector" code is proposed. Given the transmitted codeword vector, the same codeword will be sent by all nodes during transmission, hence it will greatly reduce the complexities of relay deployment and decoding. Furthermore, it is proved that the proposed scheme achieves the optimal DMT of the NSDF protocol for this asynchronous cooperative network.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages1701-1705
Number of pages5
DOIs
StatePublished - 29 Sep 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: 6 Jul 200811 Jul 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/TerritoryCanada
CityToronto, ON
Period6/07/0811/07/08

Fingerprint

Dive into the research topics of 'Diversity-multiplexing tradeoff optimal codes for OFDM-based asynchronous cooperative networks'. Together they form a unique fingerprint.

Cite this