{"id":"W1512470403","doi":"10.1109/ccece.1993.332358","title":"A variable rate constraint length K=5 Viterbi decoder for 12 Mb/s","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Viterbi decoder; Decoding methods; Viterbi algorithm; Convolutional code; Soft-decision decoder; Node (physics); Sequential decoding; Overhead (engineering); Parallel computing; Algorithm; Computer hardware; Block code; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003195397,0.000112069,0.0001321693,0.00005107693,0.0001522868,0.0001927646,0.0004243645,0.0000434803,0.0002250365],"category_scores_gemma":[0.00010994,0.00009653233,0.0000569829,0.0001269742,0.00002423338,0.0003351648,0.00006878425,0.00007048984,0.0001034429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001846684,"about_ca_system_score_gemma":0.00002489671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002496269,"about_ca_topic_score_gemma":0.00001196025,"domain_scores_codex":[0.9990195,0.00002779941,0.0001871288,0.0003196559,0.00008960471,0.0003563087],"domain_scores_gemma":[0.9992179,0.0002743376,0.00004913584,0.0002997113,0.00006307866,0.00009585278],"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":[2.917062e-7,0.0001570387,0.0007686835,0.00004532155,0.00004413412,0.0000205069,0.0008374712,0.0003727876,0.005898173,0.5241386,0.01557857,0.4521385],"study_design_scores_gemma":[0.0006409761,0.00009361571,0.0001202401,0.0000301116,0.000008772366,0.00005926243,0.00003001755,0.9532133,0.0008065546,0.02542941,0.01925367,0.0003140313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006896977,0.00004453841,0.937899,0.0005679003,0.0002372058,0.0001386192,0.00000245537,0.0002571985,0.06016339],"genre_scores_gemma":[0.8571764,0.000004140716,0.134713,0.002341217,0.000118798,0.00002828211,0.000001549896,0.00001110027,0.005605501],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9528406,"threshold_uncertainty_score":0.3936474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04391040894284493,"score_gpt":0.2296437023216273,"score_spread":0.1857332933787824,"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."}}