Capacity Bounds and Mapping Design for Binary Symmetric Relay ChannelsReport as inadecuate


Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels


Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels - Download this document for free, or read online. Document in PDF available to download.

School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology KTH, Stockholm, 100 44, Sweden





*

Authors to whom correspondence should be addressed.



Abstract Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward DF, partial DF and compress-and-forward CF relaying are first evaluated. Then relaying strategies with finite memory-length are considered. An efficient algorithm for optimizing the relay functions is presented. The Boolean Fourier transform is then employed to unveil the structure of the optimized mappings. Interestingly, the optimized relay functions exhibit a simple structure. Numerical results illustrate that the rates achieved using the optimized low-dimensional functions are either comparable to those achieved by CF or superior to those achieved by DF relaying. In particular, the optimized low-dimensional relaying scheme can improve on DF relaying when the quality of the source-relay link is worse than or comparable to that of other links. View Full-Text

Keywords: binary symmetric relay channel; decode-and-forward; compress-and-forward; linear relaying; capacity bounds; binary Fourier transform binary symmetric relay channel; decode-and-forward; compress-and-forward; linear relaying; capacity bounds; binary Fourier transform





Author: Majid Nasiri Khormuji * and Mikael Skoglund *

Source: http://mdpi.com/



DOWNLOAD PDF




Related documents