A Linear Analog Network Coding for Asynchronous Two-Way Relay Networks
Authors:
- 28 October 2010
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 9 (12) , 3630-3637
Abstract
Time asynchronism is a practical issue need to be addressed for a general distributed two-way relay network, where two terminal nodes exchange information through multiple spatial-separated relay nodes. In this letter, we propose an analog network coding (ANC) scheme for a time asynchronous two-way relay network. In the proposed scheme, each relay node linearly transforms the received mixed asynchronous signals in the first time-slot by a Toeplitz matrix, and then broadcasts them back to the terminals in the second time-slot. A sufficient condition is derived for the proposed ANC to achieve full cooperative diversity using only linear receivers at the terminal nodes, such as zero-forcing (ZF), or minimum mean square error (MMSE) receivers, with any delay profiles of the timing errors. The decoding of the proposed ANC scheme is computationally efficient and the symbol rate can approach 1, when the coding block length is sufficiently large compared to the number of relay nodes R and the timing errors.Keywords
This publication has 21 references indexed in Scilit:
- Fast Kalman Equalization for Time-Frequency Asynchronous Cooperative Relay Networks With Distributed Space-Time CodesIEEE Transactions on Vehicular Technology, 2010
- Achieving full diversity and fast ML decoding via simple analog network coding for asynchronous two-way relay networksIEEE Transactions on Communications, 2009
- Channel Coding Design to Support Asynchronous Physical Layer Network Coding2009
- Computationally efficient equalization for asynchronous cooperative communications with multiple frequency offsetsIEEE Transactions on Wireless Communications, 2009
- Space-time trellis codes with asynchronous full diversity up to fractional symbol delaysIEEE Transactions on Wireless Communications, 2008
- Distributed linear convolutive space-time codes for asynchronous cooperative communication networksIEEE Transactions on Wireless Communications, 2008
- Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay NetworksIEEE Transactions on Information Theory, 2007
- Delay-Tolerant Distributed-TAST Codes for Cooperative DiversityIEEE Transactions on Information Theory, 2007
- Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative ChannelIEEE Transactions on Information Theory, 2007
- Distributed Space-Time Coding in Wireless Relay NetworksIEEE Transactions on Wireless Communications, 2006