{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:36:42Z","timestamp":1760243802796,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T00:00:00Z","timestamp":1355702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e14122589","type":"journal-article","created":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T12:00:58Z","timestamp":1355745658000},"page":"2589-2610","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels"],"prefix":"10.3390","volume":"14","author":[{"given":"Majid","family":"Khormuji","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, 100 44, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Skoglund","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, 100 44, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2012,12,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.2307\/1426331","article-title":"Three-terminal communication channels","volume":"3","year":"1971","journal-title":"Adv. Appl. Probab."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","article-title":"Capacity theorems for the relay channel","volume":"25","author":"Cover","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_3","first-page":"2020","article-title":"Capacity bounds and power allocation for wireless relay channels","volume":"51","author":"Zhang","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1545","DOI":"10.1109\/TIT.2006.871579","article-title":"Bounds on capacity and minimum energy-per-bit for AWGN relay channels","volume":"52","author":"Mohseni","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3037","DOI":"10.1109\/TIT.2005.853304","article-title":"Cooperative strategies and capacity theorems for relay networks","volume":"51","author":"Kramer","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4409","DOI":"10.1109\/TIT.2008.928981","article-title":"On the role of estimate-and-forward with time sharing in cooperative communication","volume":"541","author":"Dabora","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"3062","DOI":"10.1109\/TIT.2004.838089","article-title":"Cooperative diversity in wireless networks: Efficient protocols and outage behavior","volume":"50","author":"Laneman","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1927","DOI":"10.1109\/TCOMM.2003.818096","article-title":"User cooperation diversity-Part I: System description","volume":"51","author":"Sendonaris","year":"2003","journal-title":"IEEE Trans. Commun."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1109\/TCOMM.2003.819238","article-title":"User cooperation diversity-Part II: Implementation aspects and performance analysis","volume":"51","author":"Sendonaris","year":"2003","journal-title":"IEEE Trans. Commun."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1109\/TIT.2008.2011518","article-title":"Capacity of a class of modulo-sum relay channels","volume":"55","author":"Aleksic","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_11","unstructured":"Kim, Y.H. (2007, January 26\u201328). Coding Techniques for Primitive Relay Channels. Proceedings of the Forty-Fifth Annual Allerton Conference, Allerton House, UIUC, IL, USA."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2820","DOI":"10.1109\/TWC.2007.06110","article-title":"Joint power minimization in wireless relay channels","volume":"6","author":"Lau","year":"2007","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Karystinos, G.N., and Liavas, A.P. (4, January 31). Outage Capacity of a Cooperative Scheme with Binary Input and a Simple Relay. Proceedings of the IEEE ICASSP 2008-International Conference Acoustics, Speech and Signal Processing, Las Vegas, NV, USA.","DOI":"10.1109\/ICASSP.2008.4518336"},{"key":"ref_14","unstructured":"Sagar, Y., Kwon, H.M., and Ding, Y. (2010, January 3\u20135). Capacity of Modulo-Sum Simple Relay Network. Proceedings International Zurich Seminar on Communications, Zurich, Switzerland."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1109\/TIT.1982.1056502","article-title":"The capacity of the semi-deterministic relay channel","volume":"28","author":"Aref","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1109\/LCOMM.2008.080898","article-title":"Rate-optimized constellation rearrangement for the relay channel","volume":"12","author":"Khormuji","year":"2008","journal-title":"IEEE Commun. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Khormuji, M.N., and Skoglund, M. (2009, January 21\u201324). Piecewise linear relaying: Low complexity parametric relaying. Proceedings of the IEEE SPAWC, Perugia, Italy.","DOI":"10.1109\/SPAWC.2009.5161786"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3378","DOI":"10.1109\/TIT.2010.2048444","article-title":"On instantaneous relaying","volume":"56","author":"Khormuji","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_19","unstructured":"Zaidi, A., Khormuji, M.N., Yao, S., and Skoglund, M. (July,, January 28). Rate-maximizing Mappings for Memoryless Relaying. Proceedings of the IEEE ISIT, Seoul, Korea."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2615","DOI":"10.1109\/18.796416","article-title":"On channel-constrained vector quantization and index assignment for discrete memoryless channels","volume":"45","author":"Skoglund","year":"1999","journal-title":"IEEE Trans Inform. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2468","DOI":"10.1109\/18.887858","article-title":"Performance of quantizers on noisy channels using structured families of codes","volume":"46","author":"Mehes","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Rudin, W. (1990). Fourier Analysis on Groups, John Wiley And Sons Ltd.","DOI":"10.1002\/9781118165621"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Khormuji, M.N., and Skoglund, M. (2010, January 6\u20138). On the Capacity of the Binary Symmetric Relay Channel with a Finite Memory Relay. Proceedings of the IEEE ITW, Cairo, Egypt.","DOI":"10.1109\/ITWKSPS.2010.5503205"},{"key":"ref_24","unstructured":"Liavas, A. (Year-1 Work-Package-1 report of European Commission FET Project FP6-033533-COOPCOM, 2007). Outage Capacity of a Cooperative Scheme with Binary Input and a Simple Relay, Year-1 Work-Package-1 report of European Commission FET Project FP6-033533-COOPCOM."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/14\/12\/2589\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:54:17Z","timestamp":1760219657000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/14\/12\/2589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,17]]},"references-count":24,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2012,12]]}},"alternative-id":["e14122589"],"URL":"https:\/\/doi.org\/10.3390\/e14122589","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2012,12,17]]}}}