{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009153689,0.0001492965,0.000184554,0.00006420301,0.00004878637,0.00002549512,0.0001459784,0.0001077726,0.000136797],"category_scores_gemma":[0.00002050505,0.0001426639,0.00007527144,0.0001332015,0.00008408961,0.0001483607,0.00004678436,0.0001234798,0.00004593147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006288775,"about_ca_system_score_gemma":0.000006471703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002740982,"about_ca_topic_score_gemma":0.00003333392,"domain_scores_codex":[0.9992393,0.000006786849,0.0001958645,0.0001674322,0.00008680939,0.0003038016],"domain_scores_gemma":[0.9996248,0.00006866577,0.00002031602,0.0001815196,0.00004900444,0.00005572211],"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.00002718435,0.00008598519,0.0001896004,0.0001569735,0.000178622,0.000009089439,0.0001801032,0.03892934,0.0002746084,0.04769007,0.01019188,0.9020866],"study_design_scores_gemma":[0.00042315,0.0001071509,0.0004971002,0.00001269086,0.00001408632,0.000001885645,0.0001153039,0.9753455,0.007786606,0.01397595,0.00145726,0.0002633467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0351326,0.00003405129,0.9447806,0.00002779114,0.000443986,0.0003420553,0.00006787246,0.001889129,0.0172819],"genre_scores_gemma":[0.3536778,0.00001177352,0.6457941,0.00004370607,0.00006701022,0.00003847773,0.00003027742,0.00003757618,0.0002992912],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9364161,"threshold_uncertainty_score":0.5817665,"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."}}