{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001731324,0.0003085757,0.0002435113,0.0003999845,0.0002985101,0.0003322066,0.0005834075,0.0002623006,0.004054211],"category_scores_gemma":[0.0003197912,0.0001578168,0.00024357,0.0003202668,0.0001628451,0.0005136441,0.0001662194,0.0002729622,0.000722418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002558542,"about_ca_system_score_gemma":0.000294748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002556881,"about_ca_topic_score_gemma":0.0005593029,"domain_scores_codex":[0.9999152,0.0000158343,0.000008075344,0.00001574398,0.00002949233,0.00001565352],"domain_scores_gemma":[0.9998651,0.00003390914,0.00002519536,0.00002450223,0.00004095973,0.00001038816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005069391,0.0001370285,0.0009418856,0.0003408281,0.0001048372,0.0009099268,0.0001711049,0.01021283,0.6839908,0.02040581,0.003704136,0.278574],"study_design_scores_gemma":[0.0004688956,0.00466985,0.003756929,0.0001411593,0.0003802679,0.006355685,0.000128822,0.2119834,0.6904415,0.01077146,0.07074347,0.0001585121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2777198,0.001061237,0.7039311,0.0003633771,0.0002946264,0.0001764591,0.0002319361,0.003404585,0.01281691],"genre_scores_gemma":[0.6516833,0.0004004883,0.3407486,0.0001299046,0.00009887334,0.00009430981,0.0003019345,0.00004823599,0.00649433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004054211,"threshold_uncertainty_score":0.01356274,"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."}}