{"id":"W2342309445","doi":"10.22215/etd/2005-06505","title":"Iterative decoding in analog VLSI","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Decoding methods; Computer science; Sequential decoding; Very-large-scale integration; CMOS; Algorithm; Modular design; Electronic engineering; Iterative method; Block code; Engineering; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002518635,0.0002167892,0.0002441246,0.0005144562,0.00005029175,0.0001629141,0.0008836943,0.0002068715,0.00004671625],"category_scores_gemma":[0.00007981163,0.0002144667,0.00006965464,0.0005279179,0.000005986985,0.0004275204,0.00004980218,0.0004033311,0.00004769938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001541634,"about_ca_system_score_gemma":0.0001016966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001213701,"about_ca_topic_score_gemma":0.01036933,"domain_scores_codex":[0.998679,0.00005660633,0.0003131093,0.0004963549,0.0002106802,0.0002442407],"domain_scores_gemma":[0.9991972,0.0001011493,0.0001459023,0.0004231994,0.00009229466,0.00004018413],"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.0000264862,0.0002325148,0.004912444,0.0001420974,0.00004928907,0.0001731719,0.03109429,0.00007788125,0.003536837,0.1645404,0.01102058,0.784194],"study_design_scores_gemma":[0.001976844,0.001001853,0.09710142,0.005518523,0.00007999522,0.0001373967,0.006563992,0.3423371,0.448456,0.06871388,0.01917631,0.008936639],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06426827,0.0003611067,0.1339051,0.0002633931,0.001605582,0.0005195741,0.000001211063,0.00184765,0.7972282],"genre_scores_gemma":[0.7626466,0.00005079616,0.2148068,0.0003235851,0.0001241971,0.00007228599,0.00006863261,0.00003194937,0.02187524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7753529,"threshold_uncertainty_score":0.8745696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0149438813896406,"score_gpt":0.3083961886925919,"score_spread":0.2934523073029514,"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."}}