{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:53:05Z","timestamp":1760237585088,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T00:00:00Z","timestamp":1591228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1604160"],"award-info":[{"award-number":["U1604160"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>To solve a system of equations that needs few updates, such as sparse systems, the leading dichotomous coordinate descent (DCD) algorithm is better than the cyclic DCD algorithm because of its fast speed of convergence. In the case of sparse systems requiring a large number of updates, the cyclic DCD algorithm converges faster and has a lower error level than the leading DCD algorithm. However, the leading DCD algorithm has a faster convergence speed in the initial updates. In this paper, we propose a combination of leading and cyclic DCD iterations, the leading-cyclic DCD algorithm, to improve the convergence speed of the cyclic DCD algorithm. The proposed algorithm involves two steps. First, by properly selecting the number of updates of the solution vector used in the leading DCD algorithm, a solution is obtained from the leading DCD algorithm. Second, taking the output of the leading DCD algorithm as the initial values, an improved soft output is generated by the cyclic DCD algorithm with a large number of iterations. Numerical results demonstrate that when the solution sparsity    \u03b3    is in the interval     [ 1 \/ 8 , 6 \/ 8 ]    , the proposed leading-cyclic DCD algorithm outperforms both the existing cyclic and leading DCD algorithms for all iterations.<\/jats:p>","DOI":"10.3390\/a13060136","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T03:32:21Z","timestamp":1591327941000},"page":"136","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Convergence Speed of a DCD-Based Algorithm for Sparse Solutions"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3474-9143","authenticated-orcid":false,"given":"Zhi","family":"Quan","sequence":"first","affiliation":[{"name":"School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhua","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,6,4]]},"reference":[{"key":"ref_1","unstructured":"Haykin, S. (2001). Adaptive Filter Theory, Prentice Hall, Inc.. [4th ed.]."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1007\/s11277-019-06764-6","article-title":"Advances in Smart Antenna Systems for Wireless Communication","volume":"110","author":"Dakulagi","year":"2000","journal-title":"Wirel. Pers. Commun."},{"key":"ref_3","unstructured":"Verdu, S. (1998). Multiuser Detection, Cambridge University Press."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3109","DOI":"10.1109\/COMST.2019.2935810","article-title":"Massive MIMO detection techniques: A survey","volume":"21","author":"Albreem","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.apacoust.2018.11.033","article-title":"A new adaptive filtering algorithm for stereophonic acoustic echo cancellation","volume":"146","author":"Messini","year":"2019","journal-title":"Appl. Acoust."},{"key":"ref_6","unstructured":"Proakis, J., and Manolakis, D. (1992). Digital Signal Processing: Principles, Algorithms, and Applications, Macmillan. [2nd ed.]."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TASLP.2019.2949928","article-title":"Partial Update Adaptive Algorithm for Sparse System Identification","volume":"28","author":"Wen","year":"2020","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_8","unstructured":"Yazdanpanah, H., Diniz, P.S.R., and Lima, M.V.S. Feature Adaptive Filtering: Exploiting Hidden Sparsity. IEEE Trans. Circuits Syst. Regul. Pap., Available online: http:\/\/www02.smt.ufrj.br\/~diniz\/papers\/ri99.pdf."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1109\/TASLP.2015.2499602","article-title":"Proportionate Adaptive Filtering for Block-Sparse System Identification","volume":"24","author":"Liu","year":"2016","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_10","unstructured":"Golub, G.H., and Van Loan, C.F. (1996). Matrix Computations, The Johns Hopkins University Press. [3rd ed.]."},{"key":"ref_11","unstructured":"Liu, J. (2008). DCD Algorithm: Architectures, FPGA Implementations and Applications. [Ph.D. Thesis, University of York]."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0309028","article-title":"The solution of a quadratic programming problem using systematic overrelaxation","volume":"9","author":"Cryer","year":"1971","journal-title":"SIAM J. Control"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Watkins, D.J. (2002). Fundamentals of Matrix Computations, Wiley.","DOI":"10.1002\/0471249718"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1587\/transcom.2017EBP3336","article-title":"DCD-based branch and bound detector with reduced complexity for MIMO systems","volume":"E101-B","author":"Quan","year":"2018","journal-title":"IEICE Trans. Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1049\/el:20063966","article-title":"Efficient multichannel filtered-x affine projection algorithm for active noise control","volume":"42","author":"Albu","year":"2006","journal-title":"Electron. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1109\/TASL.2006.881677","article-title":"Pseudo Affine Projection Algorithms for Multichannel Active Noise Control","volume":"15","author":"Albu","year":"2007","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1109\/LSP.2008.2001111","article-title":"Low complexity implementation of the affine projection algorithm","volume":"15","author":"Zakharov","year":"2008","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3150","DOI":"10.1109\/TSP.2008.917874","article-title":"Low complexity RLS algorithms using dichotomous coordinate descent iterations","volume":"56","author":"Zakharov","year":"2008","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1049\/el:20040353","article-title":"Multiplication-free iterative algorithm for LS problem","volume":"40","author":"Zakharov","year":"2004","journal-title":"Electron. Lett."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2425","DOI":"10.1109\/TCSI.2009.2015725","article-title":"Architecture and FPGA design of dichotomous coordinate descent algorithms","volume":"56","author":"Liu","year":"2009","journal-title":"IEEE Trans. Circuits Syst. Regul. Pap."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/26.990897","article-title":"Sparse channel estimation via matching pursuit with application to equalization","volume":"50","author":"Cotter","year":"2002","journal-title":"IEEE Trans. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1723","DOI":"10.1109\/49.737641","article-title":"Identification of active users in synchronous CDMA multiuser detection","volume":"16","author":"Wu","year":"1998","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/6\/136\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:35:32Z","timestamp":1760175332000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/6\/136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,4]]},"references-count":22,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2020,6]]}},"alternative-id":["a13060136"],"URL":"https:\/\/doi.org\/10.3390\/a13060136","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,6,4]]}}}