{"id":"W2114732083","doi":"10.1109/lcomm.2005.10012","title":"A simple and fast carrier recovery algorithm for high-order QAM","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Algorithm; Simple (philosophy); QAM; Quadrature amplitude modulation; Telecommunications; Decoding methods; Bit error rate","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.0002891596,0.0001129838,0.0001229271,0.0001256045,0.0002868131,0.0001911573,0.001272244,0.00005487025,0.000003517999],"category_scores_gemma":[0.00002356788,0.0001211449,0.00004139557,0.0002493226,0.0001070474,0.0006303265,0.0002628486,0.0001538086,0.00001002202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004960264,"about_ca_system_score_gemma":0.00003847267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005638123,"about_ca_topic_score_gemma":0.00007456025,"domain_scores_codex":[0.9991543,0.0001140765,0.000218794,0.0002277444,0.0001073263,0.0001777309],"domain_scores_gemma":[0.9977504,0.0002558588,0.00009020008,0.00174085,0.0001048913,0.0000577897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002763493,0.0001229369,0.00004575506,0.000007300338,0.00005339107,4.709724e-7,0.002163529,0.0003953167,0.009825971,0.02860884,0.0648165,0.8939573],"study_design_scores_gemma":[0.0009341402,0.000123169,0.0007511829,0.00002557736,0.00002671804,0.0000195259,0.0000827695,0.2923021,0.01590836,0.005978629,0.6831913,0.0006565796],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004940408,0.0001323606,0.9425563,0.05145453,0.0000631277,0.0003164977,0.00002810809,0.0002762005,0.0002325408],"genre_scores_gemma":[0.1617346,0.0001075859,0.8239539,0.01377248,0.00006019068,0.000211507,0.00003007459,0.00001470448,0.0001149286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8933007,"threshold_uncertainty_score":0.4940147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02133969116201498,"score_gpt":0.2845591375098508,"score_spread":0.2632194463478358,"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."}}