{"id":"W1974517611","doi":"10.1364/ofc.2011.omj5","title":"Low Computation Complexity Two-Stage Feedforward Carrier Recovery Algorithm for M-QAM","year":2011,"lang":"en","type":"article","venue":"","topic":"Optical Network Technologies","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computation; Feed forward; QAM; Reduction (mathematics); Computational complexity theory; Computer science; Algorithm; Quadrature amplitude modulation; Loop (graph theory); Mathematics; Decoding methods; Bit error rate; Engineering","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.0004279075,0.0005592795,0.0003439453,0.000473764,0.0003647067,0.0005218342,0.001006939,0.0007987882,0.003009576],"category_scores_gemma":[0.0009158485,0.0002316992,0.0003056463,0.0003290743,0.0002729852,0.0009514146,0.0004429047,0.0006942783,0.0008313499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003647515,"about_ca_system_score_gemma":0.0007633898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008026999,"about_ca_topic_score_gemma":0.001751783,"domain_scores_codex":[0.9996465,0.00005880542,0.00002450734,0.00004901919,0.0001836749,0.0000373877],"domain_scores_gemma":[0.9996223,0.0001087742,0.00004527117,0.00008708239,0.0001207172,0.00001583117],"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.0006490575,0.000227751,0.0006587523,0.0002507092,0.00005785425,0.0001602809,0.0001054463,0.03341791,0.3311524,0.02159384,0.00376665,0.6079594],"study_design_scores_gemma":[0.0002271668,0.0006618941,0.001318026,0.00003452274,0.00005317918,0.0006680983,0.00001802834,0.751168,0.2290342,0.005658112,0.01107602,0.00008280122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01803176,0.0002153357,0.9794139,0.0001516998,0.00007925968,0.00006794404,0.00002854141,0.0007118662,0.001299687],"genre_scores_gemma":[0.2098863,0.000179111,0.7848495,0.0001562784,0.00007473974,0.0001276001,0.0001192246,0.00004231676,0.004564929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003009576,"threshold_uncertainty_score":0.01006806,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0425963946118607,"score_gpt":0.2482718862894985,"score_spread":0.2056754916776378,"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."}}