{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004607339,0.0007673794,0.0004330501,0.0006310407,0.0005221124,0.000562608,0.0006593149,0.0005041487,0.001434369],"category_scores_gemma":[0.001664706,0.0002283486,0.0004711371,0.0006760467,0.0004145743,0.0009311586,0.0008321302,0.0008420455,0.000416179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004768537,"about_ca_system_score_gemma":0.0008815381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001716836,"about_ca_topic_score_gemma":0.002341071,"domain_scores_codex":[0.9996601,0.00008609967,0.00002439467,0.00005274524,0.0001378404,0.00003875246],"domain_scores_gemma":[0.9994965,0.0001859211,0.00006754331,0.00008580763,0.0001403372,0.00002387494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004753769,0.00009746963,0.001185823,0.0002436008,0.00006569213,0.0001816186,0.0004614151,0.3284813,0.03733426,0.06159327,0.002719613,0.5671605],"study_design_scores_gemma":[0.00003322412,0.0001388193,0.000328448,0.00002376908,0.00001876031,0.0003342231,0.00008614673,0.9646506,0.01978284,0.01084894,0.003723115,0.00003117464],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01182011,0.0001961182,0.9862592,0.00005237997,0.00003641757,0.00003103564,0.00001803653,0.0001416197,0.001445123],"genre_scores_gemma":[0.1948282,0.0003975815,0.8010056,0.00006747278,0.00002826381,0.00008451691,0.0001339839,0.00004732869,0.00340703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001716836,"threshold_uncertainty_score":0.004798412,"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."}}