{"id":"W2262590824","doi":"10.1109/wcnc.2015.7127542","title":"An adaptive matching pursuit algorithm for sparse channel estimation","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Matching pursuit; Compressed sensing; A priori and a posteriori; Algorithm; Computer science; Orthogonal frequency-division multiplexing; Channel (broadcasting); Mean squared error; Computational complexity theory; Matching (statistics); Estimation; Mathematics; Statistics; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001114641,0.0001036729,0.0001035848,0.00005603883,0.00003030344,0.00004906255,0.0001037761,0.00005365647,0.000004201735],"category_scores_gemma":[0.000006167854,0.0001005854,0.00002634994,0.00005129644,0.000009664273,0.0002298573,0.00001321117,0.00005342085,0.00001366021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003869679,"about_ca_system_score_gemma":0.000009012397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004650725,"about_ca_topic_score_gemma":0.000008808889,"domain_scores_codex":[0.9995232,0.000008546117,0.0001017674,0.0001124513,0.00009923186,0.0001547745],"domain_scores_gemma":[0.9996536,0.00001810465,0.00001585805,0.0001578109,0.00007035024,0.00008429831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002395942,0.00005918408,0.000002152936,0.000009890206,0.00005889908,0.000009198747,0.001214321,0.4169252,0.003873081,0.004225892,0.02162328,0.551975],"study_design_scores_gemma":[0.0001537675,0.000111562,0.00001079544,0.000016706,0.000008780733,0.000005798986,0.000197928,0.9521729,0.02445937,0.02231666,0.0004089173,0.0001367906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005659987,0.00004722529,0.9897911,0.00002405802,0.0002064582,0.0002046884,0.000006119461,0.001330083,0.002730308],"genre_scores_gemma":[0.5818189,0.0000022618,0.4179136,0.00004473126,0.0001002285,0.00002643776,0.00001533846,0.00002539262,0.00005312503],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5761589,"threshold_uncertainty_score":0.4101753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04837268630733652,"score_gpt":0.2746841445333013,"score_spread":0.2263114582259648,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}