.png){kind=icon}
.png){kind=icon}
Return
Delay-Tolerant Distributed Linear Convolutional Space-Time Code with Minimum Memory Length under Frequency-Selective Channels
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2009.081181.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In cooperative communication networks, the performance of distributed space-time code will be severely degraded if the timing synchronization among relay nodes is not perfect. In this letter, we propose a systematic construction of the so called distributed linear convolutional space-time code (DLCSTC) for multipath fading channels that does not require the synchronization assumption. We derive sufficient conditions on the code design such that the full cooperative and multipath diversities can be achieved under the minimum memory length constraint. Then we design DLCSTCs that both have the trace-orthonormality property and achieve the full diversity. We show that the proposed codes can also achieve the full diversity for asynchronous cooperative communications with ZF, MMSE and MMSE-DFE receivers under frequency-selective channels. Finally, various numerical examples are provided to corroborate the analytical studies.
Keywords:
Asynchronous cooperative communications
linear dispersion space-time codes
distributed linear convolutional space-time code
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W