IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
On the design of delay-tolerant distributed space-time codes with minimum length
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Combating timing asynchronism in relay transmission for 3GPP LTE uplink
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
A simple scheme for delay-tolerant decode-and-forward based cooperative communication
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Cooperative multiple trellis coded modulation
IEEE Transactions on Communications
DMT analysis of asynchronous OFDM decode-and-forward cooperative networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Delay-tolerant distributed linear convolutional space-time code under frequency-selective channels
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Delay-tolerant decode-and-forward based cooperative communication over Ricean channels
IEEE Transactions on Wireless Communications
Performance analysis of distributed transmission schemes in cooperative random networks
IEEE Transactions on Wireless Communications
Is network coding always good for cooperative communications?
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Transactions on Wireless Communications
A linear analog network coding for asynchronous two-way relay networks
IEEE Transactions on Wireless Communications
An optimal algorithm for relay node assignment in cooperative ad hoc networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.84 |
In cooperative networks using a decode-and-forward strategy, the multiple relays effectively transmit a distributed space-time code, the performance of which can be severely degraded when timing synchronization among the relays is not assured (e.g., in cases of broadcast to dispersed recipients or in networks without a shared, high-quality timing reference). Recent work by Xia and Hammons have investigated the design of distributed space-time codes that are delay tolerant, in the sense that full spatial diversity is achieved regardless of timing offsets. In general, the previously known space-time block codes belonging to the class of C-linear codes, however, which are important because they achieve full spatial diversity and admit near-optimal lattice decoding algorithms, are not delay tolerant. In this paper, we present a new family of such codes that are fully delay tolerant. The new codes generalize the threaded algebraic space-time (TAST) codes introduced by El Gamal and Damen. Like their brethren, the new distributed-TAST codes are effective and flexible, enabling use of different signaling constellations, transmission rates, numbers of transmit and receive antennas, and decoders of varying levels of complexity.