{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:32:08Z","timestamp":1773793928577,"version":"3.50.1"},"reference-count":28,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:00:00Z","timestamp":1736985600000},"content-version":"vor","delay-in-days":15,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>\n                    The efficiency of recovery and signal decoding efficacy at the receiver in end\u2010to\u2010end communications using linearly predicted coefficients are susceptible to errors, especially for highly compressed signals. In this paper, we propose a method to efficiently recover linearly predicted coefficients for high signal compression for end\u2010to\u2010end communications. Herein, the steepest descent algorithm is applied at the receiver to decode the affected linear predicted coefficients. This algorithm is used to estimate the unknown frequency, time, and phase. Subsequently, the algorithm facilitates down\u2010conversion, time and carrier recovery, equalization, and correlation processes. To evaluate the feasibility of the proposed method, parameters such as multipath interference, additive white Gaussian noise, timing, and phase noise are modeled as channel errors in signal compression using the software\u2010defined receiver. Our results show substantial recovery efficiency with noise variance between 0 and\n                    <jats:italic>y<\/jats:italic>\n                    \u2009\u00d7\u200910E\u2009\u2212\u20093, where\n                    <jats:italic>y<\/jats:italic>\n                    lies between 0 and 10 using the modeled performance metrics of bit error rate, symbol error rate, and mean square error. This is promising for modeling software\u2010defined networks using highly compressed signals in end\u2010to\u2010end communications.\n                  <\/jats:p>","DOI":"10.1155\/jece\/6570183","type":"journal-article","created":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:35:27Z","timestamp":1737077727000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Recovery of Linear Predicted Coefficients Based on Adaptive Steepest Descent Algorithm in Signal Compression for End\u2010to\u2010End Communications"],"prefix":"10.1155","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2089-5564","authenticated-orcid":false,"given":"Abel","family":"Kamagara","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8580-984X","authenticated-orcid":false,"given":"Abbas","family":"Kagudde","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2310-8175","authenticated-orcid":false,"given":"Baris","family":"Atakan","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2025,1,16]]},"reference":[{"key":"e_1_2_10_1_2","unstructured":"ChuW. Speech Coding Algorithms Foundation and Evolution of Standardized Codes 2020 https:\/\/dsp-book.narod.ru\/ChuSCA.pdf."},{"key":"e_1_2_10_2_2","doi-asserted-by":"crossref","unstructured":"ChungY.-A.andGlassJ. Generative Pre-Training for Speech With Autoregressive Predictive Coding ICASSP 2020-2020 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP) May 2020 Barcelona Spain 3497\u20133501.","DOI":"10.1109\/ICASSP40776.2020.9054438"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4698"},{"key":"e_1_2_10_4_2","unstructured":"MawalimC. O. WangS. andUnokiM. Speech Information Hiding by Modification of Lsf Quantization Index in Celp Codes 2020 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC) December 2020 Lanzhou China 1321\u20131330."},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.213"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2022.104192"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4566"},{"key":"e_1_2_10_8_2","article-title":"Linear Predictive Coding Is All-Pole Resonance Modeling","author":"Kim H.-S.","year":"2023","journal-title":"Center for Computer Research in Music and Acoustics"},{"key":"e_1_2_10_9_2","article-title":"Linear Predictive Coding (LPC) Dan K-Nearest Neighbor (KNN)","volume":"11","author":"Tsabit Imanadi M.","year":"2023","journal-title":"Journal of Electrical and System Control Engineering"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116164"},{"key":"e_1_2_10_11_2","article-title":"On Spectral Properties of Steepest Descent Methods","volume":"11","author":"Asmundis R.","year":"2013","journal-title":"IMA Journal of Numerical Analysis"},{"key":"e_1_2_10_12_2","article-title":"The Steepest Descent Method","volume":"2","author":"Bartholomew-Biggs M.","year":"2015","journal-title":"Nonlinear optimization with financial applications"},{"key":"e_1_2_10_13_2","volume-title":"Linear Predictive Coding","author":"Bradbury J.","year":"2000"},{"key":"e_1_2_10_14_2","article-title":"A Review of Predictive Coding Algorithms","volume":"8","author":"Spratling M. W.","year":"2017","journal-title":"Brain and Cognition"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2017.2692764"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.3969\/j.issn.1004-4132.2010.01.004"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1023\/b:jota.0000005048.79379.b6"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014878317736"},{"key":"e_1_2_10_19_2","doi-asserted-by":"crossref","unstructured":"SrinuC.andParayitamL. A Post-processing Based IRNSS\/NavIC Software Receiver for Analysis and Development of New Algorithms and Signals Proceedings of the 33rd International Technical Meeting of the Satellite Division of The Institute of Navigation (ION GNSS+ 2020) September 2020 Tampa FL 2822\u20132835 https:\/\/doi.org\/10.33012\/2020.17597.","DOI":"10.33012\/2020.17597"},{"key":"e_1_2_10_20_2","first-page":"149","article-title":"Wiley Interdisciplinary Reviews","volume":"7","author":"Meza J. C.","year":"2010","journal-title":"Computational Statistics"},{"key":"e_1_2_10_21_2","unstructured":"Richard JohnsonC. SetharesW. A. andKleinA. Build Your Own Digital Communication System in Five Easy Steps 2005 https:\/\/sethares.engr.wisc.edu\/TBstuff\/SRD.pdf."},{"key":"e_1_2_10_22_2","volume-title":"An Introduction to Optimization","author":"Chong E. K. P.","year":"2013"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3162853"},{"key":"e_1_2_10_24_2","doi-asserted-by":"crossref","unstructured":"der HeideAn Sjoerd Luiset al. Real-time Software-Defined GPU-Based Receiver Field Trial 2020 European Conference on Optical Communications (ECOC) December 2020 Brussels Belgium 1\u20134.","DOI":"10.1109\/ECOC48923.2020.9333244"},{"key":"e_1_2_10_25_2","volume-title":"B Digital Communication","author":"Lee E. A.","year":"2012"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/tie.2010.2070771"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1080\/01630560802418391"},{"key":"e_1_2_10_28_2","volume-title":"Effects of Channel Errors on Coded Speech Communication in Software Defined Radio","author":"Abbas K.","year":"2022"}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/jece\/6570183","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/jece\/6570183","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/jece\/6570183","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:39:21Z","timestamp":1773779961000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/jece\/6570183"}},"subtitle":[],"editor":[{"given":"Andrea","family":"Tani","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1155\/jece\/6570183"],"URL":"https:\/\/doi.org\/10.1155\/jece\/6570183","archive":["Portico"],"relation":{},"ISSN":["2090-0147","2090-0155"],"issn-type":[{"value":"2090-0147","type":"print"},{"value":"2090-0155","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-01-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6570183"}}