Recursive Least Squares Self-Interference Cancellation Algorithm Based on Dichotomous Coordinate Descent

Recursive Least Squares Self-Interference Cancellation Algorithm Based on Dichotomous Coordinate Descent | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL Electronics Letters This is a preprint and has not been peer reviewed. Data may be preliminary. 21 August 2025 V1 Latest version Share on Recursive Least Squares Self-Interference Cancellation Algorithm Based on Dichotomous Coordinate Descent Authors : Yuan Zhao , Jinghan Feng 0009-0005-2449-5225 , Zhao Tong , Yulu Zhang , Yufeng Qin , Yanzhou Yu , and Yangyang Liu [email protected] Authors Info & Affiliations https://doi.org/10.22541/au.175575105.51711331/v1 Published Electronics Letters Version of record Peer review timeline 217 views 145 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract Digital-domain self-interference cancellation (SIC) technology effectively addresses the SI issue by reconstructing the SI signal, and is one of the key techniques for in-band full-duplex (IBFD) communication systems. Due to the high computational complexity of the traditional Recursive Least Squares (RLS) algorithm in SIC, its real-time engineering application capability is limited. To overcome this limitation, this paper presents an RLS-SIC algorithm based on dichotomous coordinate descent(DCD). The method transforms the original normal equations of the RLS algorithm into auxiliary normal equations, and by combining a bisection search strategy, it significantly reduces the computational complexity while maintaining optimal convergence performance. Simulation results demonstrate that the proposed algorithm not only achieves a significant reduction in computational complexity but also retains SIC performance, thus enhancing the practical application value of full-duplex(FD) communication systems. Supplementary Material File (recursive least squares self-interference cancellation algorithm based on dichotomous coordinate descent.docx) Download 529.15 KB Information & Authors Information Version history V1 Version 1 21 August 2025 Peer review timeline Published Electronics Letters Version of Record 29 Nov 2025 Published Copyright This work is licensed under a Non Exclusive No Reuse License. Collection Electronics Letters Keywords adaptive filters signal processing Authors Affiliations Yuan Zhao Northwestern Polytechnical University View all articles by this author Jinghan Feng 0009-0005-2449-5225 Northwestern Polytechnical University View all articles by this author Zhao Tong China Star Network System Research Institute Co Ltd View all articles by this author Yulu Zhang China Star Network System Research Institute Co Ltd View all articles by this author Yufeng Qin China Academy of Space Technology(Xi’an) View all articles by this author Yanzhou Yu Northwestern Polytechnical University View all articles by this author Yangyang Liu [email protected] Northwestern Polytechnical University View all articles by this author Metrics & Citations Metrics Article Usage 217 views 145 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Yuan Zhao, Jinghan Feng, Zhao Tong, et al. Recursive Least Squares Self-Interference Cancellation Algorithm Based on Dichotomous Coordinate Descent. Authorea . 21 August 2025. DOI: https://doi.org/10.22541/au.175575105.51711331/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.175575105.51711331/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'a00414f9df6b593a',t:'MTc3OTUzOTUzMQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();