{"id":"W2149020265","doi":"10.1109/itw.2007.4313139","title":"Low-Complexity Capacity Achieving Two-Stage Demodulation/Decoding for Random Matrix Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Demodulation; Computer science; Decoding methods; Turbo code; Algorithm; Concatenated error correction code; Concatenation (mathematics); Redundancy (engineering); EXIT chart; Electronic engineering; Channel (broadcasting); Telecommunications; Mathematics; Block code; Engineering; Arithmetic","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.0007091775,0.0001796472,0.0002354278,0.0001457546,0.000191746,0.00003884659,0.0002904563,0.00007900025,0.00005980904],"category_scores_gemma":[0.00008889577,0.0001899547,0.00009465747,0.0001731716,0.00005035143,0.0003275784,0.00005665406,0.0001791282,0.00000981744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001468781,"about_ca_system_score_gemma":0.000005167951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002135292,"about_ca_topic_score_gemma":0.00008168823,"domain_scores_codex":[0.998947,0.00002197655,0.0003967682,0.0001681644,0.0001188125,0.0003472989],"domain_scores_gemma":[0.9989341,0.0003756398,0.00006626242,0.0004674631,0.00007885434,0.00007762847],"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.0002089259,0.0001262749,0.001377839,0.0007752006,0.0001072913,0.000002774455,0.001164714,0.419426,0.2290438,0.2582915,0.0005941014,0.08888164],"study_design_scores_gemma":[0.001724674,0.00001761179,0.0005258926,0.0000622629,0.00001052394,0.000003294756,0.00009431655,0.6112846,0.3736741,0.009536188,0.002588023,0.000478555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1582013,0.00006221464,0.8362459,0.00003917288,0.000139051,0.0005160225,0.00001112558,0.001541561,0.003243654],"genre_scores_gemma":[0.7012298,0.00002235424,0.2983667,0.00002865852,0.00007776881,0.00004172698,0.00001717314,0.00003775558,0.0001780236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5430285,"threshold_uncertainty_score":0.7746128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0500209533289319,"score_gpt":0.3204945436206579,"score_spread":0.270473590291726,"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."}}