{"id":"W1931709921","doi":"","title":"High-throughput LDPC decoding using the RHS algorithm","year":2012,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Low-density parity-check code; Computer science; Decoding methods; Throughput; Algorithm; Application-specific integrated circuit; Code word; CMOS; Clock rate; Bit error rate; Latency (audio); Soft-decision decoder; Parallel computing; Computer engineering; Computer hardware; Wireless; Electronic engineering; Chip; Telecommunications; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002309736,0.000533562,0.0004614307,0.0004395667,0.0008452727,0.0005296025,0.00262496,0.0003376176,0.00001998891],"category_scores_gemma":[0.0002968739,0.0004456447,0.0002570635,0.001362273,0.000145253,0.001897437,0.001334088,0.0008601654,0.00003443619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008679386,"about_ca_system_score_gemma":0.0002321627,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009955368,"about_ca_topic_score_gemma":0.0004225478,"domain_scores_codex":[0.9959725,0.0003666269,0.000656628,0.0006797556,0.0006878851,0.00163659],"domain_scores_gemma":[0.9963163,0.0003815272,0.0004190094,0.002297818,0.0001782665,0.0004070591],"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.00003044685,0.0007628291,0.04261989,0.00006025094,0.0001968459,0.0001141314,0.004872323,0.002381518,0.0315769,0.3474174,0.0119428,0.5580246],"study_design_scores_gemma":[0.0003887544,0.0001400965,0.007373053,0.0001251244,0.00006580172,0.0009913712,0.0002090787,0.8736979,0.09936983,0.01097801,0.005460271,0.001200653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03402613,0.001465346,0.956679,0.002454488,0.001012702,0.0007188795,0.00000863325,0.003295782,0.000338994],"genre_scores_gemma":[0.4255563,0.000058521,0.5718623,0.001784353,0.0003698625,0.0001636266,0.000002854847,0.00005959013,0.0001425537],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8713164,"threshold_uncertainty_score":0.9997995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02138624387528731,"score_gpt":0.2637628547762321,"score_spread":0.2423766109009448,"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."}}