.png){kind=icon}
.png){kind=icon}
Return
Distributed space-time coding for regenerative relay networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2005.853883.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Cooperation among mobile users (MUs) in a wireless network can be very useful to reduce the total radiated power necessary to insure the delivery of the information with the desired quality of service. A systematic framework for achieving such a gain consists in making the cooperating nodes act as the antennas of a virtual transmit array, operating according to a distributed space-time coding (DSTC) strategy. However, cooperation implies the allocation of dedicated resources, typically power and time slots, for the exchange of data between source and intermediate nodes (relays). It is then necessary to design the system properly to make possible a final net gain, taking into account all resources involved in the communication. In this paper, we consider regenerative relays and we analyze the effect of intermediate decision errors at the relay nodes. We derive the optimal maximum-likelihood (NIL) detector, at the final destination, in case of binary phase-shift keying (BPSK) transmission, and a suboptimal scalar detector, whose bit-error rate (BER) is expressed in (approximate) closed form. Since with DSTC the transmit antennas are not colocated, we show how to allocate the power among source and relay terminals in order to minimize the average BER at the final destination. Finally, we compare alternative cooperation and decoding strategies.
Keywords:
cooperative communications
distributed spacetime coding (DSTC)
relay networks
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
Organization
No organization information available