Next Article in Journal
A Finite-Time Thermal Cycle Variational Optimization with a Stefan–Boltzmann Law for Three Different Criteria
Previous Article in Journal
Reliability Analysis of Free Jet Scour Below Dams
Article

Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels

School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, 100 44, Sweden
*
Authors to whom correspondence should be addressed.
Entropy 2012, 14(12), 2589-2610; https://doi.org/10.3390/e14122589
Received: 1 September 2012 / Revised: 4 December 2012 / Accepted: 6 December 2012 / Published: 17 December 2012
(This article belongs to the Special Issue Information Theory Applied to Animal Communication)
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
Show Figures

Figure 1

MDPI and ACS Style

Khormuji, M.N.; Skoglund, M. Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels. Entropy 2012, 14, 2589-2610. https://doi.org/10.3390/e14122589

AMA Style

Khormuji MN, Skoglund M. Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels. Entropy. 2012; 14(12):2589-2610. https://doi.org/10.3390/e14122589

Chicago/Turabian Style

Khormuji, Majid N., and Mikael Skoglund. 2012. "Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels" Entropy 14, no. 12: 2589-2610. https://doi.org/10.3390/e14122589

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop