{"id":"W2321848620","doi":"10.1109/twc.2015.2505315","title":"Novel Compressed Sensing-Based Channel Estimation Algorithm and Near-Optimal Pilot Placement Scheme","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Compressed sensing; Mutual coherence; Algorithm; Computer science; Orthogonal frequency-division multiplexing; Computational complexity theory; Channel (broadcasting); Matching pursuit; Mean squared error; Coherence (philosophical gambling strategy); Bit error rate; Matrix (chemical analysis); Mathematics; Decoding methods; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001291498,0.000233701,0.0002155236,0.0001502996,0.0003658655,0.0001088741,0.0003040943,0.00008930449,0.00000420888],"category_scores_gemma":[0.00000370603,0.00026813,0.00004899674,0.000237845,0.0002040345,0.0001557793,0.000007874041,0.0003708781,0.00001624957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001123642,"about_ca_system_score_gemma":0.00005670144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001297147,"about_ca_topic_score_gemma":0.00004654422,"domain_scores_codex":[0.9990436,0.00005889132,0.0002723708,0.0001956583,0.0002067636,0.0002227454],"domain_scores_gemma":[0.9984319,0.0001493687,0.00005366435,0.001060393,0.0001538263,0.0001508667],"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.00002770569,0.0002990097,5.707487e-7,0.00001168469,0.0000635812,0.000001048726,0.0003070578,0.9634444,0.008348797,0.00004840531,0.0003515867,0.02709622],"study_design_scores_gemma":[0.000818337,0.0001308421,0.00001114635,0.0001072664,0.00003853819,0.0000138319,0.00008126234,0.9603876,0.03767608,0.00004309165,0.0004336773,0.0002583464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01032817,0.0001343506,0.9872894,0.0003787331,0.0001816671,0.0003217529,0.00005469722,0.001046735,0.0002645322],"genre_scores_gemma":[0.6922379,0.00005919171,0.3074969,0.00007459344,0.00001041617,0.0000407582,0.00002657848,0.00003912739,0.00001456569],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6819097,"threshold_uncertainty_score":0.9999771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05527355116193532,"score_gpt":0.270562417369236,"score_spread":0.2152888662073007,"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."}}