{"id":"W1976979609","doi":"10.1007/s11265-011-0577-y","title":"Switching Activity Minimization in Iterative LDPC Decoders","year":2011,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"University of Alberta","keywords":"Low-density parity-check code; Computer science; Decoding methods; Interconnection; Soft-decision decoder; Implementation; Process (computing); Code (set theory); Power (physics); Computer engineering; Parallel computing; Algorithm; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.0006014021,0.0004650379,0.0005285381,0.0004754089,0.0003027568,0.0008285843,0.0007787688,0.000626193,0.001254457],"category_scores_gemma":[0.003040577,0.0003419612,0.0002835628,0.0006849598,0.0004669144,0.0006142044,0.0006451929,0.0005912962,0.0003574752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006998025,"about_ca_system_score_gemma":0.001011377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001518137,"about_ca_topic_score_gemma":0.002328375,"domain_scores_codex":[0.9994479,0.000227609,0.00003294861,0.00005160086,0.0001810555,0.00005883249],"domain_scores_gemma":[0.9984574,0.001070529,0.00009125663,0.0001328357,0.0002058635,0.00004202177],"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.0003191743,0.0001117089,0.001018152,0.0001610501,0.00004889462,0.0001046282,0.0002308527,0.7240493,0.02983356,0.07308441,0.001368404,0.1696699],"study_design_scores_gemma":[0.00000938279,0.0000375554,0.0001516484,0.00001032332,0.000008189609,0.00003508711,0.00001024014,0.9806005,0.007730144,0.01098303,0.0004179719,0.000005871108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0938341,0.0003890568,0.8981695,0.0002287926,0.00002551715,0.00004453717,0.00008049479,0.0003115032,0.00691652],"genre_scores_gemma":[0.821609,0.0004872076,0.1696784,0.00008472013,0.00004749116,0.0001402544,0.0002143913,0.0001669547,0.007571651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001518137,"threshold_uncertainty_score":0.005077481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04243321150863617,"score_gpt":0.2749676573521522,"score_spread":0.2325344458435161,"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."}}