{"id":"W2144085454","doi":"10.1109/dcc.1993.253138","title":"Minimizing error and VLSI complexity in the multiplication free approximation of arithmetic coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arithmetic; Alphabet; Binary number; Arithmetic coding; Multiplication (music); Multiplication algorithm; Coding (social sciences); Computer science; Algorithm; Very-large-scale integration; Arbitrary-precision arithmetic; Saturation arithmetic; Reduction (mathematics); Mathematics; Context-adaptive binary arithmetic coding; Data compression; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.0007430139,0.0004927736,0.0003256767,0.0006783692,0.0003169139,0.001071445,0.0008518627,0.0004381164,0.002015383],"category_scores_gemma":[0.00518366,0.0001929768,0.0002440615,0.0009885668,0.0006709612,0.001715862,0.0007805151,0.0005364975,0.0007123431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006767868,"about_ca_system_score_gemma":0.0008299367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000778215,"about_ca_topic_score_gemma":0.002155676,"domain_scores_codex":[0.999086,0.0001987831,0.00004582037,0.00008076366,0.0005044966,0.00008410883],"domain_scores_gemma":[0.9982556,0.001016823,0.0001146751,0.000356563,0.0002321137,0.00002412904],"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.0006326505,0.0000665992,0.001222452,0.0002021936,0.00003959024,0.0002043094,0.0001715219,0.1657841,0.05885689,0.1361575,0.00352479,0.6331373],"study_design_scores_gemma":[0.00007760958,0.0002941976,0.000832943,0.00004420029,0.0000455488,0.0005586683,0.00005278999,0.8672414,0.07645831,0.04487461,0.009493318,0.00002656301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04731196,0.000642966,0.9455006,0.0002116453,0.00005094253,0.00003151567,0.00003138152,0.0006523897,0.005566591],"genre_scores_gemma":[0.2820528,0.0006157737,0.7095385,0.0000959513,0.00009125087,0.00008027955,0.0001597649,0.0001733255,0.007192228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002015383,"threshold_uncertainty_score":0.00674212,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1081076579670121,"score_gpt":0.2796426647168135,"score_spread":0.1715350067498013,"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."}}