{"id":"W1585568489","doi":"10.1109/vetecf.2004.1404804","title":"Sparse channel estimation using orthogonal matching pursuit algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Matching pursuit; Channel (broadcasting); Algorithm; Basis pursuit; Computer science; Computational complexity theory; Selection (genetic algorithm); Convergence (economics); Least-squares function approximation; Compressed sensing; Mathematics; Artificial intelligence; Telecommunications; Statistics","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.00007426,0.0001316463,0.0001151421,0.00008801526,0.00006051394,0.00005833395,0.00009747524,0.00006247187,0.00007499671],"category_scores_gemma":[0.000003434366,0.0001332273,0.00004127984,0.00009192801,0.00001307873,0.0002347981,0.00003144613,0.0001096797,0.00004984138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005539157,"about_ca_system_score_gemma":0.000007557999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002483365,"about_ca_topic_score_gemma":0.00000977969,"domain_scores_codex":[0.9993634,0.000008588972,0.0001549278,0.0001213456,0.0001459582,0.0002057623],"domain_scores_gemma":[0.999737,0.00001441387,0.0000203789,0.0001524656,0.00002657669,0.00004922557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000150524,0.00001656137,0.000006507625,0.000006089625,0.00002433314,0.000008792431,0.0001384221,0.7527244,0.01190092,0.0006349266,0.001324095,0.2332134],"study_design_scores_gemma":[0.00007589679,0.000005941645,0.00007424144,0.00003584848,0.00001013153,0.00003910642,0.00001821982,0.9630849,0.03367,0.001952511,0.0008665317,0.0001666491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1106651,0.0001056849,0.8836728,0.00005527027,0.0001472873,0.0000823874,0.000002260775,0.001289682,0.003979426],"genre_scores_gemma":[0.6629365,0.00001080264,0.3366864,0.0000865163,0.0001830979,0.000002791779,0.000005765576,0.00002628974,0.00006183243],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5522714,"threshold_uncertainty_score":0.5432854,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02256096279638439,"score_gpt":0.2492724020880628,"score_spread":0.2267114392916784,"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."}}