{"id":"W2153702050","doi":"10.1109/mwscas.1996.588024","title":"Efficient computation of the DFT for some transform lengths that are not integral powers of two","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Discrete Fourier transform (general); Computation; Computer science; Overhead (engineering); Radix (gastropod); Algorithm; Discrete Hartley transform; Computational complexity theory; Fast Fourier transform; Cyclotomic fast Fourier transform; Hartley transform; Prime-factor FFT algorithm; Parallel computing; Arithmetic; Fourier transform; Fractional Fourier transform; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003656716,0.0006499522,0.0004173675,0.0004882828,0.0003343136,0.0006266605,0.0003563916,0.0003871933,0.002467648],"category_scores_gemma":[0.0020673,0.0002030965,0.0003116986,0.0003462421,0.0002988253,0.001333602,0.0003723069,0.0005661211,0.0009683182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002542189,"about_ca_system_score_gemma":0.0005593584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002888972,"about_ca_topic_score_gemma":0.0007677517,"domain_scores_codex":[0.9997969,0.00002797203,0.00001788225,0.00003634721,0.00009651819,0.00002434423],"domain_scores_gemma":[0.9994752,0.0002866037,0.00005068983,0.00008653844,0.00008703089,0.00001403519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005229893,0.00009407727,0.001016819,0.0002880852,0.00007175562,0.0003387181,0.0001762269,0.06653643,0.1245426,0.08802636,0.003404231,0.7149819],"study_design_scores_gemma":[0.00009985697,0.0002779959,0.0008029799,0.00004299646,0.00004456686,0.001433451,0.00007142399,0.8063208,0.1379181,0.04082667,0.01211579,0.00004529446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01455314,0.0001270034,0.9839538,0.00004025395,0.00003709698,0.00002194681,0.00002367279,0.0002962237,0.0009468814],"genre_scores_gemma":[0.1348746,0.0002365391,0.8626589,0.00004957575,0.00004716227,0.00005565973,0.0001369676,0.00007567168,0.001864979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002467648,"threshold_uncertainty_score":0.008255124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05803396206453022,"score_gpt":0.2868248706760586,"score_spread":0.2287909086115284,"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."}}