{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:37:12Z","timestamp":1760150232030,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T00:00:00Z","timestamp":1698969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["51574232","2022B03003-3"],"award-info":[{"award-number":["51574232","2022B03003-3"]}]},{"name":"Xinjiang Key Research and Development Special Task","award":["51574232","2022B03003-3"],"award-info":[{"award-number":["51574232","2022B03003-3"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Compute-and-Forward (CoF) is an innovative physical layer network coding strategy, designed to enable receivers in wireless communications to effectively utilize interference. The key idea of CoF is to implement integer combinations based on the codewords from multiple transmitters, rather than decoding individual source codewords. Although CoF is widely used in wireless relay networks, there are still some problems to be solved, such as rank failure, single antenna reception, and the shortest vector problem. In this paper, we introduce a successive extended CoF (SECoF) as a pioneering solution tailored for multi-source, multi-relay, and multi-antenna wireless relay networks. First, we analyze the traditional CoF, and design a SECoF method combining the concepts of matrix projection and successive interference cancellation, which overcomes the problem of CoF rate tending to zero and rank failure and improves the network performance. Secondly, we obtain an approximate solution to the integer-value coefficient vectors by using the LLL lattice-based resolution algorithm. In addition, we deduce the corresponding concise formulas of SECoF. Simulation results show that the SECoF has strong robustness and the approaches outperform the state-of-the-art methods in terms of computation rate, rank failure probability, and outage probability.<\/jats:p>","DOI":"10.3390\/e25111512","type":"journal-article","created":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T10:51:28Z","timestamp":1699008688000},"page":"1512","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Compute-and-Forward Relaying Method for Multi-Antenna Wireless Relay Networks"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5191-6850","authenticated-orcid":false,"given":"Xuan","family":"Yang","sequence":"first","affiliation":[{"name":"School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaqi","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonggang","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Desheng","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Hua","sequence":"additional","affiliation":[{"name":"School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,11,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/JIOT.2017.2683200","article-title":"A Survey on Internet of Things: Architecture, Enabling Technologies, Security and Privacy, and Applications","volume":"4","author":"Lin","year":"2017","journal-title":"IEEE Internet Things J."},{"key":"ref_2","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. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"6463","DOI":"10.1109\/TIT.2011.2165816","article-title":"Compute-and-Forward: Harnessing Interference through Structured Codes","volume":"57","author":"Nazer","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.2022.3197592","article-title":"A Unified Discretization Approach to Compute\u2013Forward: From Discrete to Continuous Inputs","volume":"69","author":"Pastore","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.phycom.2012.05.002","article-title":"Physical-layer network coding: Tutorial, survey, and beyond","volume":"6","author":"Liew","year":"2013","journal-title":"Phys. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2293","DOI":"10.1109\/TIT.2004.834787","article-title":"Achieving 1\/2 Log (1+SNR) on the AWGN Channel with Lattice Encoding and Decoding","volume":"50","author":"Erez","year":"2004","journal-title":"IEEE Trans. Inf. Theor."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.aeue.2018.10.020","article-title":"Outage analysis for multiuser underlay cognitive TWRN with antenna selection and user scheduling","volume":"98","author":"Khan","year":"2019","journal-title":"AEU Int. J. Electron. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3413","DOI":"10.1109\/TIT.2007.904838","article-title":"Relay Networks with Delays","volume":"53","author":"Gamal","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/JSYST.2018.2810019","article-title":"Outage Analysis of Decode-and-Forward Two-Way Relay Selection with Different Coding and Decoding Schemes","volume":"13","author":"Li","year":"2019","journal-title":"IEEE Syst. J."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2054","DOI":"10.1049\/iet-com.2013.0324","article-title":"Simplified Compute-and-Forward and Its Performance Analysis","volume":"7","author":"Hejazi","year":"2013","journal-title":"IET Commun."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/LCOMM.2016.2537810","article-title":"Low-Complexity Compute-and-Forward Techniques for Multisource Multirelay Networks","volume":"20","author":"Molu","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4905","DOI":"10.1109\/TWC.2013.090513.121465","article-title":"Integer-Forcing MIMO Linear Receivers Based on Lattice Reduction","volume":"12","author":"Sakzad","year":"2013","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"2591","DOI":"10.1109\/TMC.2018.2812722","article-title":"Optimal Power Allocation and Scheduling for Non-Orthogonal Multiple Access Relay-Assisted Networks","volume":"17","author":"Wu","year":"2018","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/TVT.2010.2100416","article-title":"A New Efficient Low-Complexity Scheme for Multi-Source Multi-Relay Cooperative Networks","volume":"60","author":"Ding","year":"2011","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"6243","DOI":"10.1109\/TIT.2021.3093454","article-title":"Compute-and-Forward in Large Relaying Systems: Limitations and Asymptotically Optimal Scheduling","volume":"67","author":"Shmuel","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.aeue.2018.09.001","article-title":"Source compression in two-way two-relay network using compute-and-forward relaying","volume":"95","author":"Jeyalakshmi","year":"2018","journal-title":"AEU Int. J. Electron. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/LWC.2016.2612185","article-title":"Decentralized Compute-and-Forward for Ad Hoc Networks","volume":"5","author":"Hejazi","year":"2016","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"8112","DOI":"10.1109\/TVT.2015.2506981","article-title":"Robust Successive Compute-and-Forward Over Multiuser Multirelay Networks","volume":"65","author":"Hejazi","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s11276-017-1583-1","article-title":"A novel scheme inspired by the compute-and-forward relaying strategy for the multiple access relay channel","volume":"25","author":"Insausti","year":"2019","journal-title":"Wirel. Networks"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ngeth, R., Lim, Y., Kurkoski, B.M., and Tan, Y. (2018, January 9\u201313). A Design of Overlapped Chunked Code over Compute-and-Forward in Multi-Source Multi-Relay Networks. Proceedings of the 2018 IEEE Global Communications Conference (GLOBECOM), Abu Dhabi, United Arab Emirates.","DOI":"10.1109\/GLOCOM.2018.8647922"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Zhou, B., and Mow, W.H. (July, January 29). A quadratic programming relaxation approach to compute-and-forward network coding design. Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6875243"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"7780","DOI":"10.1109\/TIT.2017.2759281","article-title":"Polynomially Solvable Instances of the Shortest and Closest Vector Problems with Applications to Compute-and-Forward","volume":"63","author":"Sahraei","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"19182","DOI":"10.1109\/ACCESS.2017.2736543","article-title":"Low Complexity Coefficient Selection Algorithms for Compute-and-Forward","volume":"5","author":"Huang","year":"2017","journal-title":"IEEE Access"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Sahraei, S., and Gastpar, M. (October, January 30). Compute-and-Forward: Finding the best equation. Proceedings of the 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2014.7028460"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Wen, J., and Chang, X.W. (2016, January 10\u201315). A linearithmic time algorithm for a shortest vector problem in compute-and-forward design. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541718"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"102106","DOI":"10.1016\/j.phycom.2023.102106","article-title":"Optimal coefficient selection in Compute and Forward relaying using improved Schnorr\u2013Euchner search algorithm","volume":"59","author":"Jeyalakshmi","year":"2023","journal-title":"Phys. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TSP.2015.2481876","article-title":"Compute-Compress-and-Forward: Exploiting Asymmetry of Wireless Relay Networks","volume":"64","author":"Tan","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.2018.2864638","article-title":"Generalized Compute-Compress-and-Forward","volume":"65","author":"Cheng","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","unstructured":"Strang, G. (2022). Introduction to Linear Algebra, SIAM."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Ghabeli, L., and Derpich, M.S. (2016, January 3\u20134). Asymmetric successive compute-and-forward. Proceedings of the 2016 Iran Workshop on Communication and Information Theory (IWCIT), Tehran, Iran.","DOI":"10.1109\/IWCIT.2016.7491625"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/11\/1512\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:17:27Z","timestamp":1760131047000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/11\/1512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,3]]},"references-count":30,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2023,11]]}},"alternative-id":["e25111512"],"URL":"https:\/\/doi.org\/10.3390\/e25111512","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,11,3]]}}}