{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002518792,0.0004569762,0.0003442962,0.0004145449,0.0003406464,0.0008584289,0.001101929,0.001074824,0.009508032],"category_scores_gemma":[0.0006363249,0.0003394314,0.0002576925,0.0004038621,0.0002839713,0.0009364447,0.000269408,0.0005305012,0.006196662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006513353,"about_ca_system_score_gemma":0.000797491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001985163,"about_ca_topic_score_gemma":0.005239349,"domain_scores_codex":[0.9997813,0.00003587964,0.00001545242,0.00003032324,0.0001031162,0.00003388981],"domain_scores_gemma":[0.9997925,0.00006550517,0.00002192358,0.00004235091,0.0000666187,0.00001106027],"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.0005031966,0.0002104518,0.001968089,0.0006001716,0.0001294952,0.0008673934,0.0002434024,0.0502238,0.2285519,0.06697799,0.0389506,0.6107735],"study_design_scores_gemma":[0.0001212951,0.0007630209,0.001733165,0.00009220889,0.00008599176,0.002077743,0.00003575158,0.4411677,0.3509777,0.01028807,0.1925273,0.0001300647],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02328586,0.001516172,0.9356637,0.000615273,0.0002517619,0.0003180517,0.001015111,0.01218614,0.02514792],"genre_scores_gemma":[0.2876611,0.0009918537,0.6645551,0.0006234525,0.0001302305,0.0002426467,0.002163341,0.00082116,0.04281109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009508032,"threshold_uncertainty_score":0.0318076,"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."}}