{"id":"W3020140618","doi":"10.1109/tbc.2020.2985008","title":"Backward Compatible Low-Complexity Demapping Algorithms for Two-Dimensional Non-Uniform Constellations in ATSC 3.0","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Telecommunications and Broadcasting Technologies","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Communications Research Centre Canada","funders":"National Natural Science Foundation of China; Shanghai Key Laboratory of Digital Media Processing and Transmission; Natural Science Foundation of Shanghai","keywords":"Computer science; Reduction (mathematics); Algorithm; Constellation; Computational complexity theory; Code (set theory); Broadcasting (networking); Digital Video Broadcasting; Noisy-channel coding theorem; Low-density parity-check code; Telecommunications; Decoding methods; Computer network; Mathematics; Error floor","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.0001739288,0.0002820728,0.0003469603,0.0002723341,0.0004052664,0.00006142598,0.0003326311,0.0001290032,0.00005894472],"category_scores_gemma":[0.00003501057,0.0003193529,0.0001352854,0.0007577947,0.0001276791,0.0002084188,0.00000781868,0.000571718,0.00004427275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001337661,"about_ca_system_score_gemma":0.00004590963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005218701,"about_ca_topic_score_gemma":0.00008804481,"domain_scores_codex":[0.9984657,0.00002524445,0.0005620623,0.0003302726,0.0001656187,0.0004511443],"domain_scores_gemma":[0.9988963,0.0004711204,0.00007735996,0.0003531957,0.00008962442,0.0001124101],"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.00001711488,0.00006695973,0.00003978738,0.0001093089,0.00003210766,0.000002312415,0.0003957584,0.9431074,0.006590902,0.00005329872,0.000155207,0.04942982],"study_design_scores_gemma":[0.001009926,0.00007676324,0.0001062496,0.0001955122,0.00002166453,0.00001352852,0.0003649219,0.9810082,0.01644467,0.0001777157,0.0002366613,0.0003441942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.173374,0.00006012539,0.8231518,0.000469662,0.0002642387,0.0005708386,0.0001081143,0.001065609,0.0009356967],"genre_scores_gemma":[0.8572139,0.00001045961,0.1424757,0.00009415921,0.00005146957,0.00007561327,0.00001817235,0.00004809518,0.00001251104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6838399,"threshold_uncertainty_score":0.9999259,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07350828272967924,"score_gpt":0.2765540901110486,"score_spread":0.2030458073813694,"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."}}