{"id":"W2120927355","doi":"10.1109/icassp.2005.1416259","title":"Arithmetic Complexity of the Split-Radix FFT Algorithms","year":2006,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Fast Fourier transform; Split-radix FFT algorithm; Twiddle factor; Radix (gastropod); Prime-factor FFT algorithm; Rader's FFT algorithm; Arithmetic; Algorithm; Cooley–Tukey FFT algorithm; Computer science; Mathematics; Fourier transform; Fourier analysis","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.000103433,0.00006590792,0.00007805255,0.00003252211,0.00004888649,0.0001036057,0.0005727391,0.00001360829,0.00003623002],"category_scores_gemma":[0.00000484612,0.00004309017,0.00005593355,0.000267211,0.00008594002,0.0003353405,0.000146366,0.00003201019,0.00002450026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001584576,"about_ca_system_score_gemma":0.00002349805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003092337,"about_ca_topic_score_gemma":0.00003156556,"domain_scores_codex":[0.9992682,0.00003034761,0.0001942407,0.0001485341,0.000222771,0.0001359562],"domain_scores_gemma":[0.9994948,0.00002623689,0.00006127177,0.0003538888,0.00004194389,0.00002185182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.135989e-7,0.00006618104,0.0008256623,0.000006165304,0.000004732357,6.576056e-7,0.0000550044,0.000007484865,0.002197316,0.9716823,0.005448018,0.01970582],"study_design_scores_gemma":[0.0007892249,0.0001501863,0.2180962,0.00002029384,0.00001064094,0.00002878591,0.00003847443,0.1542914,0.07594687,0.5368031,0.01349777,0.000327024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01142196,0.00001500581,0.9189848,0.001202997,0.0002505624,0.0001785423,0.000007295393,0.0000727815,0.06786603],"genre_scores_gemma":[0.8550915,4.568213e-7,0.1422312,0.0002944124,0.00003292346,0.000003889229,0.000004019014,0.000003615193,0.002338025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8436695,"threshold_uncertainty_score":0.1757166,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04589300623611296,"score_gpt":0.2572084984168259,"score_spread":0.211315492180713,"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."}}