A family of distributed space-time trellis codes with asynchronous cooperative diversity
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols
IEEE Transactions on Information Theory
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Space-time diversity enhancements using collaborative communications
IEEE Transactions on Information Theory
Transmitting to colocated users in wireless ad hoc and sensor networks
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Approximately universal codes over slow-fading channels
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel
IEEE Transactions on Information Theory
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
IEEE Journal on Selected Areas in Communications
EURASIP Journal on Advances in Signal Processing
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
We construct cooperative diversity coding schemes that mitigate the effects of symbol asynchronicity among network users. We do so by modifying, at the expense of implementation practicality, the signaling complexity of well behaved existing schemes. The modification allows the same good performance (DMT optimality) in the presence of synchronicity, and almost-surely permits full-diversity gains for any event of symbol asynchronicity.