{"id":"W3206276601","doi":"10.1145/3470642","title":"A High-throughput Parallel Viterbi Algorithm via Bitslicing","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Soft output Viterbi algorithm; Viterbi decoder; Computer science; Viterbi algorithm; Throughput; Iterative Viterbi decoding; Parallel computing; Decoding methods; Algorithm; Sequential decoding; Wireless; Telecommunications; Block code","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.000382488,0.0005187975,0.0005216507,0.0006319995,0.0005465139,0.0008371933,0.001235023,0.0007423253,0.004436123],"category_scores_gemma":[0.001189943,0.0003669917,0.0003230088,0.0007020928,0.0004458597,0.001303054,0.0008592505,0.000999614,0.002205294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005929089,"about_ca_system_score_gemma":0.001338139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001619452,"about_ca_topic_score_gemma":0.002030659,"domain_scores_codex":[0.9995109,0.00007311468,0.00003173155,0.0001020269,0.0002295845,0.00005270689],"domain_scores_gemma":[0.9996044,0.00009346686,0.00004026306,0.0001190792,0.000119122,0.00002366424],"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.0008564641,0.0002146699,0.001151185,0.0004286171,0.000133193,0.0003428155,0.000273709,0.1119567,0.2432102,0.04195612,0.008233617,0.5912427],"study_design_scores_gemma":[0.0001036284,0.000312919,0.0004135718,0.00003670714,0.00005281399,0.0004988475,0.00003271317,0.7766895,0.1869143,0.01055893,0.02432908,0.00005697336],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01811273,0.0004303302,0.9750684,0.0001569827,0.0000979968,0.000108976,0.0001225917,0.002609624,0.003292279],"genre_scores_gemma":[0.2495095,0.0003964419,0.7407058,0.0002250549,0.00009029509,0.0001689328,0.0005876328,0.000269776,0.008046608],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004436123,"threshold_uncertainty_score":0.01484036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02045993853133701,"score_gpt":0.2725710921249695,"score_spread":0.2521111535936325,"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."}}