{"id":"W1589135268","doi":"10.1109/mwscas.1996.593165","title":"An algorithm for multiplication modulo (2⋀N-1)","year":2002,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Multiplier (economics); Binary tree; Arithmetic; Multiplication algorithm; Computer science; Binary number; Algorithm; Multiplication (music); Tree (set theory); Mathematics; Parallel computing; Discrete mathematics; 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.0003877986,0.0007665561,0.0004868108,0.001142122,0.001176951,0.0008233308,0.001072373,0.0005749171,0.00931931],"category_scores_gemma":[0.0009593607,0.0003140718,0.0004678255,0.001015101,0.0004852027,0.001476615,0.0008410159,0.0008381435,0.006751689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003747547,"about_ca_system_score_gemma":0.000822201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004206875,"about_ca_topic_score_gemma":0.001065478,"domain_scores_codex":[0.9996008,0.00005244377,0.00004781942,0.00007906172,0.0001788723,0.00004107583],"domain_scores_gemma":[0.9996949,0.00005983813,0.00003729457,0.00005660165,0.000133072,0.00001823099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001274401,0.00007265661,0.0003912444,0.0003238001,0.000042043,0.0002337105,0.0001917113,0.005004985,0.02621667,0.08488204,0.02364455,0.8588692],"study_design_scores_gemma":[0.0002805233,0.0008251371,0.001287325,0.0003186116,0.0001539137,0.004703312,0.0001719929,0.1071388,0.09453133,0.164678,0.6257299,0.0001811894],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005665694,0.001119823,0.9691156,0.000522703,0.0008949203,0.000248204,0.0001682372,0.002092786,0.02017218],"genre_scores_gemma":[0.03655327,0.0005696557,0.9499594,0.0001892247,0.0001823418,0.0001608902,0.0003285723,0.0001112095,0.01194554],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00931931,"threshold_uncertainty_score":0.03117621,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01405893602722939,"score_gpt":0.2127371701820024,"score_spread":0.198678234154773,"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."}}