{"id":"W2111124811","doi":"10.1109/ecctd.2009.5274961","title":"High speed VLSI implementation of a finite field multiplier using redundant representation","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Computer science; Electronic engineering; Finite field; Clock rate; CMOS; Domino logic; Logic synthesis; Integrated circuit design; Arithmetic; Logic gate; Embedded system; Mathematics; Algorithm; Logic family; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001697164,0.00006671778,0.00009237356,0.0001234604,0.00006377464,0.00004825399,0.0002249446,0.00002600639,0.00009585246],"category_scores_gemma":[0.00002096718,0.00006192949,0.00006284604,0.0003907768,0.00001223808,0.0003196887,0.0000456356,0.00004226145,0.000003007851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009788781,"about_ca_system_score_gemma":0.00001712171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001918403,"about_ca_topic_score_gemma":0.00001009369,"domain_scores_codex":[0.9992887,0.00004546411,0.000212855,0.0001899225,0.0001421134,0.0001209933],"domain_scores_gemma":[0.9994192,0.0001073424,0.00009736817,0.0002941454,0.00005190714,0.00003004054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006029769,0.0001260838,0.00320224,0.00001220309,0.00003453233,0.000007773441,0.002985476,0.001746669,0.1717434,0.4923202,0.0004722171,0.3272889],"study_design_scores_gemma":[0.001335851,0.0005954914,0.02686828,0.0000339857,0.00003150033,0.000009659489,0.0006213509,0.06534715,0.7615427,0.1431294,0.0001669072,0.0003177052],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4787914,0.000006361662,0.519862,0.0004451887,0.0001055932,0.00008872842,6.690391e-7,0.00005471521,0.000645312],"genre_scores_gemma":[0.9281322,0.000002951957,0.0714537,0.0003439527,0.00002720161,6.128187e-7,0.000002087303,0.000001894264,0.00003534006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5897993,"threshold_uncertainty_score":0.2525411,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02972081559660105,"score_gpt":0.3227016931147902,"score_spread":0.2929808775181892,"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."}}