{"id":"W2127840114","doi":"10.1109/iscas.2003.1205774","title":"An efficient split-radix FFT algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Twiddle factor; Radix (gastropod); Fast Fourier transform; Prime-factor FFT algorithm; Split-radix FFT algorithm; Algorithm; Computer science; Kronecker product; Cooley–Tukey FFT algorithm; Arithmetic; Lookup table; Mathematics; Parallel computing; Kronecker delta; Fourier transform; Fourier analysis","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.0003069698,0.0005090975,0.00058643,0.0007821129,0.0005268162,0.0007413109,0.0008641803,0.0006126276,0.008693466],"category_scores_gemma":[0.001223817,0.0002838598,0.0003536078,0.000819963,0.0003659608,0.001425785,0.0006931198,0.0005878183,0.003944502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000348391,"about_ca_system_score_gemma":0.0008325891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001065735,"about_ca_topic_score_gemma":0.00179207,"domain_scores_codex":[0.9996163,0.00004060774,0.00002608,0.00006457516,0.0002178059,0.00003460714],"domain_scores_gemma":[0.9996494,0.00007054907,0.00001909207,0.00006923635,0.0001755011,0.00001615723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003047004,0.00006311715,0.0004132104,0.0001448824,0.00003490913,0.0001770978,0.0001179512,0.05217781,0.04252675,0.04204577,0.01111013,0.8508836],"study_design_scores_gemma":[0.0001091328,0.0001791957,0.000440189,0.00003592898,0.00002754976,0.0006019765,0.00006224321,0.9006174,0.03662607,0.02370933,0.03755645,0.00003453721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004283512,0.0001592872,0.9917837,0.00007987032,0.00007076334,0.0000427816,0.00005915684,0.0008859888,0.002635002],"genre_scores_gemma":[0.04562752,0.0002048861,0.9484637,0.00006942689,0.00005025022,0.00008743307,0.0003027027,0.0001109774,0.005083014],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008693466,"threshold_uncertainty_score":0.02908254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01850469479199976,"score_gpt":0.2714997838956649,"score_spread":0.2529950891036652,"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."}}