On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas
Wireless Personal Communications: An International Journal
Channel and Delay Estimation Algorithm for Asynchronous Cooperative Diversity
Wireless Personal Communications: An International Journal
Distributed space-time coding for regenerative relay networks
IEEE Transactions on Wireless Communications
On the performance of distributed space-time coding systems with one and two non-regenerative relays
IEEE Transactions on Wireless Communications
Asynchronous cooperative diversity
IEEE Transactions on Wireless Communications
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
Distributed Space-Time Cooperative Systems with Regenerative Relays
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
On the theory of space-time codes for PSK modulation
IEEE Transactions on Information Theory
Maximum-diversity transmissions over doubly selective wireless channels
IEEE Transactions on Information Theory
On the design of space-time and space-frequency codes for MIMO frequency-selective fading 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
A unified construction of space-time codes with optimal rate-diversity tradeoff
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity
IEEE Transactions on Information Theory
Limited-Shift-Full-Rank Matrices With Applications in Asynchronous Cooperative Communications
IEEE Transactions on Information Theory
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Wireless Communications
Delay-tolerant distributed linear convolutional space-time code under frequency-selective channels
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Enhanced music+ algorithm based transceiver for multicode multicarrier CDMA
ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
Hi-index | 0.01 |
In most cooperative communication works, perfect synchronization among relay nodes is assumed in order to achieve the cooperative diversity. However, this assumption is not realistic due to the distributed nature of each relay node. In this paper, we propose a family of distributed space-time trellis code (DSTTC) that does not require the synchronization assumption. It is shown that the proposed DSTTC has minimum memory order, and the construction of such DSTTCs is equivalent to using the generator matrices that have full row rank, regardless of sub-matrices shifting problem. Here, a sub-matrix corresponds to the generator matrix of a relay node under frequency-selective channels. We derive sufficient conditions on the code design such that the full cooperative and multipath diversities can be achieved. By further studying the diversity product, we design the DSTTCs which can achieve full diversity and the maximum coding gain through the exhaustive computer search. The newly proposed codes exhibit good properties, e.g., high energy efficiency and low synchronization cost, and can be applied to distributed wireless networks. Finally, various numerical examples are provided to corroborate the analytical studies.