{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228616,0.0004826026,0.000591668,0.0006508206,0.000305131,0.0003695541,0.0008352773,0.0007544822,0.001281761],"category_scores_gemma":[0.002969767,0.0002510542,0.0004422741,0.001149489,0.0004350767,0.001080154,0.0009040663,0.001093067,0.0005397887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002452617,"about_ca_system_score_gemma":0.0006391603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001011445,"about_ca_topic_score_gemma":0.0009047239,"domain_scores_codex":[0.9994234,0.0001452276,0.00002715306,0.00009031792,0.0002803871,0.00003358335],"domain_scores_gemma":[0.9994527,0.0002833188,0.00005051159,0.0000591692,0.0001365686,0.00001783693],"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.000210792,0.00008980901,0.0005563028,0.0001540316,0.00006965563,0.0001071167,0.00008056471,0.2503995,0.0301781,0.03715884,0.002586959,0.6784082],"study_design_scores_gemma":[0.0000151341,0.00004923403,0.00009251077,0.000005371381,0.000006567648,0.00007682794,0.000005561619,0.9906963,0.003174905,0.003934341,0.001935206,0.000008115719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001924239,0.0001039541,0.9973802,0.00004611871,0.00002227061,0.00001422888,0.00000978834,0.00007703797,0.0004221475],"genre_scores_gemma":[0.1082742,0.0004846602,0.8891453,0.00008950801,0.00009931321,0.0001127368,0.0001139751,0.00004272109,0.001637703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001281761,"threshold_uncertainty_score":0.004287958,"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."}}