{"id":"W2198664117","doi":"","title":"Convergence Speed and Throughput of Analog Iterative Decoders for Low-Density Parity-Check (LDPC) Codes","year":2006,"lang":"en","type":"article","venue":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Throughput; Algorithm; Computer science; Very-large-scale integration; Constant (computer programming); Convergence (economics); Sequential decoding; Mathematics; Telecommunications; Block code; Wireless; Embedded system","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.0006767044,0.0006005409,0.0006312702,0.0004650398,0.0003452399,0.0004747628,0.001232201,0.0003621972,0.00005643553],"category_scores_gemma":[0.0002103618,0.0005957075,0.0002123891,0.000280817,0.0002918116,0.0006605299,0.0003938243,0.0006149857,0.00001247385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002688259,"about_ca_system_score_gemma":0.00008340881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005124231,"about_ca_topic_score_gemma":0.0001117001,"domain_scores_codex":[0.9962412,0.0001355615,0.001014094,0.00120022,0.0008648714,0.0005440757],"domain_scores_gemma":[0.9971418,0.0004904736,0.0007706181,0.0004604094,0.0009708435,0.0001658378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009108337,0.001210555,0.01897496,0.0002625774,0.000955147,0.00008286112,0.007225417,0.01001969,0.02642253,0.9210842,0.004404693,0.008446514],"study_design_scores_gemma":[0.003173369,0.001079327,0.005102974,0.001613498,0.0001089052,0.0001515137,0.0004296414,0.7690566,0.1502992,0.06415744,0.003148811,0.001678737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6710219,0.0002280668,0.2712107,0.01570403,0.004719686,0.001693232,0.0003301401,0.0008725976,0.03421961],"genre_scores_gemma":[0.9923979,0.0003147187,0.002958759,0.0006579612,0.000373213,0.00005338698,0.0001408724,0.00004153516,0.003061631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8569268,"threshold_uncertainty_score":0.9996494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02441762300441337,"score_gpt":0.275463680157515,"score_spread":0.2510460571531016,"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."}}