{"id":"W1850182876","doi":"10.1109/icassp.1985.1168491","title":"A VLSI implementation of an FFT/NTT computational unit","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Very-large-scale integration; Modularity (biology); Computer science; Interconnection; Fast Fourier transform; Residue number system; Table (database); Block (permutation group theory); Parallel computing; Computer architecture; Embedded system; Algorithm; Mathematics; Telecommunications","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.0001257463,0.0002956551,0.0002790837,0.0003359812,0.0003252134,0.0005819752,0.0008065373,0.0003886055,0.009245893],"category_scores_gemma":[0.0004592319,0.0001889485,0.0002401068,0.0003381707,0.0001647133,0.0005009717,0.0002552312,0.000276748,0.002692975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003059305,"about_ca_system_score_gemma":0.0004493373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007526363,"about_ca_topic_score_gemma":0.0008269429,"domain_scores_codex":[0.9998778,0.00001564867,0.00001170041,0.00002432123,0.00004975665,0.00002076967],"domain_scores_gemma":[0.999851,0.000024486,0.0000161678,0.00003507337,0.00005715317,0.00001596236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007243178,0.0002040695,0.001847672,0.0004197799,0.0001006488,0.001446665,0.0001797716,0.02822376,0.4692598,0.04434747,0.01412099,0.4391251],"study_design_scores_gemma":[0.0003030123,0.002292266,0.003611268,0.00008906005,0.0001725587,0.005530577,0.00008594744,0.3849212,0.4858306,0.009525762,0.1075347,0.0001030216],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09662198,0.0004838056,0.859505,0.0004368344,0.0003851056,0.0002463569,0.0003595623,0.006789802,0.03517159],"genre_scores_gemma":[0.5247477,0.0002734295,0.4588057,0.0002763193,0.0001324394,0.000170506,0.0003740039,0.0001304819,0.01508934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009245893,"threshold_uncertainty_score":0.03093064,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0138764437214989,"score_gpt":0.3017866378917182,"score_spread":0.2879101941702193,"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."}}