FULL-DIVERSITY DISTRIBUTED SPACE-TIME CODES WITH AN EFFICIENT ML DECODER FOR ASYNCHRONOUS COOPERATIVE COMMUNICATIONS
Refereed conference paper presented and published in conference proceedings


Full Text

Times Cited
Web of Science2WOS source URL (as at 20/11/2020) Click here for the latest count

Other information
AbstractWe consider an asynchronous cooperative communication system where two distributed transmitters are communicating with one destination. In this paper, a bounded delay-tolerant time interleave reversal Alamouti code (BDT-TIR AC) is proposed. BDT-TIR AC achieves full diversity, given that the path delay difference is within a tolerance limit. Furthermore, we design an efficient maximum-likelihood (ML) decoder. By employing a divide-and-conquer strategy, the original decoding problem is decoupled into several sub-problems in small size. In fact, these sub-problems contain either Alamouti code structure or only four symbols. By parallel decoding on the sub-problems, the proposed ML decoder exhibits low complexity advantage in large scale problems. Simulations of BDT-TIR AC confirm the full diversity gain. The bit error rate performance of BDT-TIR AC in the considered asynchronous scenarios is comparable with that of synchronized Alamouti code, and outperforms the latest delay-tolerant space-time code.
All Author(s) ListLiu Y, Zhang W, Ching PC
Name of ConferenceIEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
Start Date of Conference26/05/2013
End Date of Conference31/05/2013
Place of ConferenceVancouver
Country/Region of ConferenceCanada
Detailed descriptionorganized by IEEE Signal Processing Society,
Year2013
Month1
Day1
PublisherIEEE
Pages5011 - 5015
eISBN978-1-4799-0356-6
ISSN1520-6149
LanguagesEnglish-United Kingdom
KeywordsAsynchronous cooperative communication; full diversity; space-time code
Web of Science Subject CategoriesAcoustics; Engineering; Engineering, Electrical & Electronic

Last updated on 2020-20-11 at 23:52