Elements of information theory
Elements of information theory
Randomized cooperation in asynchronous dispersive links
IEEE Transactions on Communications
Capacity bounds and power allocation for underwater acoustic relay channels with ISI
Proceedings of the Fourth ACM International Workshop on UnderWater Networks
Capacity of relay channels with ISI and colored Gaussian noise
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Coded modulation using superimposed binary codes
IEEE Transactions on Information Theory
On the capacity of MIMO relay channels
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Bounds and Protocols for a Rate-Constrained Relay Channel
IEEE Transactions on Information Theory
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
IEEE Transactions on Information Theory
A Computationally Efficient Multilevel Coding Scheme for ISI Channels
IEEE Transactions on Information Theory
Low density parity check codes for the relay channel
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The capacity of the symbol-asynchronous single-relay channel is investigated. Symbol asynchronism implies that the codewords transmitted from the relay and the source do not coincide in time at the destination. Due to propagation or implementation effects (e.g. mis-synchronized clocks), symbol asynchronism occurs in many practical situations. In ad hoc scenarios, such as sensor networks, achieving perfect synchronism is challenging (due to the distributed nature of the network). Herein it is shown that the symbol-asynchronous single-relay channel can be modeled as a MIMO relay channel with memory. First, lower and upper bounds on the capacity are derived under the assumption that the receivers know the symbol epochs and the transmitters know their mutual offset. Next, the case where the transmitters only know that the mutual offsets that parameterize the channel belong to an uncertainty set and receivers have no knowledge of the symbol epochs is examined. Conditions for characterizing capacity (when the upper and lower bounds match) are also derived. Simple asynchronous coding schemes for the relay channel are also explored. The proposed coding scheme can be extended to the relay with memory. Bilayer LDPC codes are used to replicate the binning strategy of the relay and MLC coding with MSD decoding is used to counter the effect of memory.