.png){kind=icon}
.png){kind=icon}
Return
Partially-coherent distributed space-time codes with differential encoder and decoder
.png){kind=icon}
PRE
AI
DOI：10.1109/JSAC.2007.070217.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Distributed space-time coding is a mean of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission protocol that follows a two-stage model: transmission from source to relays in the first stage, followed by a simple relaying technique from relays to destination. The relays transmit a vector which is a transformation of the received vector by a relay-specific unitary transformation. We assume that the relays do not have any, channel information, while the destination has only a partial-channel knowledge, by which we mean that destination knows only the relay-to-destination channel. For such a setup, we derive a Chernoff bound on the pairwise error probability and propose code design criteria. A second contribution is the differential encoding and decoding scheme for this setup, which is different from the existing ones. Furthermore, differential codes from cyclic division algebra are proposed that achieve full diversity. For our setup with two relays, a Generalized PSK code is shown to achieve full diversity, for which the decoding complexity is independent of code size.
Keywords:
cyclic division algebra
differential decoder
differential encoder
distributed space-time code
diversity
pairwise error probability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W
Organization
No organization information available