{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:53:35Z","timestamp":1747191215225,"version":"3.40.5"},"reference-count":23,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer Networks and Communications"],"published-print":{"date-parts":[[2023,7,14]]},"abstract":"<jats:p>In order to solve the problem of small capacity and high energy consumption in China\u2019s 5G communication technology system, the research proposes that based on the segmented weakly orthogonal matching pursuit (SWOMP) algorithm, it is combined with the compressed sensing matching pursuit algorithm to form a segmented backtracking weak selection positive algorithm and Cross Match Tracking (SCWOMP) algorithm. First, the sparseness of MIMO system technology and its transmission structure is analyzed. Then, the new model is built after comparing with other algorithms, and the problem of overestimating the low recovery probability in the calculation process is improved by the backtracking of the algorithm and the improvement of the angle of the atomic column selection, so as to reduce the number of iterations and improve the performance of the algorithm. The results show that, in the performance comparison of different sampling points under different compressed sensing recovery algorithms, the recovery probability of the SCWOMP algorithm is the best, and when the number of sampling points is 80, although the fixed step size of the SCWOMP algorithm is different, there is recovery. The probability has a maximum value, close to 1. Then, the improved compressed sensing recovery algorithm is simulated and analyzed. When the pruning coefficient is 0.5 and the number of sampling points is 80, the reconstruction rate has a maximum value, and when other algorithms reach the maximum reconstruction rate, the number of sampling points (M) is significantly greater than that of the SCWOMP algorithm. An increase in the rate of reduction of the reconstruction probability of the SCWOMP algorithm is significantly lower than that of other algorithms; when sparsity is equal to 70, the reconstruction probability becomes 0, indicating that SCWOMP has a wider reconfigurable range and has a significant performance effect. This shows that the proposed SCWOMP algorithm has the best detection performance for 5G communication symbol detection, which can effectively increase the capacity of the system and better promote technology.<\/jats:p>","DOI":"10.1155\/2023\/1374601","type":"journal-article","created":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:05:05Z","timestamp":1689379505000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["SCWOMP Recovery Algorithm for 5G MIMO Communication Symbol Detection"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3155-9947","authenticated-orcid":true,"given":"Tao","family":"Fu","sequence":"first","affiliation":[{"name":"College of Electronic Engineering, Zhengzhou Railway Vocational & Technical College, Zhengzhou 450000, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2657-3520","authenticated-orcid":true,"given":"Yanfeng","family":"Yu","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, Zhengzhou Railway Vocational & Technical College, Zhengzhou 450000, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1764-6526","authenticated-orcid":true,"given":"Cheng","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, Zhengzhou Railway Vocational & Technical College, Zhengzhou 450000, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/jetcas.2020.2992238"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/mcom.2018.1701310"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/jetcas.2020.2999944"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/mnet.011.2000229"},{"issue":"1","key":"5","first-page":"69","article-title":"A survey of testing for 5G: solutions, opportunities, and challenges","volume":"16","author":"P. Zhang","year":"2019","journal-title":"China Communications"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/tcns.2019.2926281"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/tcns.2017.2698261"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/tcc.2017.2737628"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/jas.2021.1004165"},{"issue":"1","key":"10","first-page":"3","article-title":"Deep neural network for supervised single-channel speech enhancement","volume":"44","author":"N. Saleem","year":"2019","journal-title":"Archives of Acoustics"},{"issue":"4","key":"11","first-page":"323","article-title":"Waveform design for MIMO radar with One-Bit DACs via block-sparse semidefinite relaxation","volume":"30","author":"T. Wei","year":"2021","journal-title":"Journal of Beijing Institute of Technology (Social Sciences Edition)"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/tbc.2019.2891051"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2019.2894789"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.2019.2934004"},{"issue":"06","key":"15","first-page":"97","article-title":"Piecewise sparse recovery via piecewise greedy method","volume":"38","author":"Y. Zhong","year":"2018","journal-title":"Journal of Mathematical Research with Applications"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2021.3100389"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/mwc.2018.1700084"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/mwc.2019.1900027"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5481"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2017.2673803"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.2174\/2210327910666200213121936"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/jstsp.2021.3117404"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2021.3073112"}],"container-title":["Journal of Computer Networks and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2023\/1374601.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2023\/1374601.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2023\/1374601.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:05:12Z","timestamp":1689379512000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/jcnc\/2023\/1374601\/"}},"subtitle":[],"editor":[{"given":"Jaafar","family":"Gaber","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,7,14]]},"references-count":23,"alternative-id":["1374601","1374601"],"URL":"https:\/\/doi.org\/10.1155\/2023\/1374601","relation":{},"ISSN":["2090-715X","2090-7141"],"issn-type":[{"type":"electronic","value":"2090-715X"},{"type":"print","value":"2090-7141"}],"subject":[],"published":{"date-parts":[[2023,7,14]]}}}