{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000508955,0.0004692368,0.0005157354,0.0003043535,0.0008088443,0.0003462707,0.001790076,0.0002057541,0.00004308295],"category_scores_gemma":[0.0000812951,0.0005197172,0.0003018489,0.001374412,0.00006594566,0.0006097535,0.0001844126,0.0008741483,0.0001466495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001910476,"about_ca_system_score_gemma":0.000154077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003057397,"about_ca_topic_score_gemma":0.00005196515,"domain_scores_codex":[0.9963939,0.0002883756,0.000691538,0.001232448,0.0005783882,0.0008153196],"domain_scores_gemma":[0.996429,0.0006767202,0.0002320978,0.002187132,0.0002766784,0.0001983986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001283392,0.0004154958,0.00006820374,0.00003689849,0.0001327532,0.0002670734,0.00166622,0.09230957,0.002117061,0.001669753,0.0003273966,0.9009767],"study_design_scores_gemma":[0.001435761,0.0003779333,0.0005705981,0.0003612337,0.00006268549,0.001107784,0.0001531016,0.953703,0.02018553,0.01916921,0.00150749,0.001365627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0058229,0.0001505764,0.9876208,0.002160358,0.001353846,0.0002668321,0.000003856598,0.002302643,0.000318233],"genre_scores_gemma":[0.4021503,0.00002195349,0.596533,0.000935166,0.0001018616,0.0000194197,0.000005295167,0.00003707446,0.0001959082],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8996111,"threshold_uncertainty_score":0.9997255,"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."}}