{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001126754,0.00007369268,0.0001070672,0.00005680679,0.00003497812,0.0000390742,0.0003282899,0.00001267345,0.00001172822],"category_scores_gemma":[0.000008488611,0.00004850177,0.0001053727,0.0001492189,0.00003747343,0.0002565488,0.0000314366,0.00002830443,0.00000283766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002048795,"about_ca_system_score_gemma":0.00001023772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001580629,"about_ca_topic_score_gemma":0.000007620918,"domain_scores_codex":[0.9992815,0.0000171157,0.0002153451,0.0001332852,0.0002281549,0.0001245457],"domain_scores_gemma":[0.9995795,0.00006724757,0.0001173021,0.0001515366,0.00006051829,0.00002382003],"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.00004782014,0.0007105652,0.0006975178,0.0002031773,0.00007914437,8.220498e-7,0.009256768,0.00818673,0.01137054,0.4374206,0.004623691,0.5274026],"study_design_scores_gemma":[0.001428868,0.0002719948,0.001960909,0.0000534083,0.00001123042,0.000003154908,0.0004368178,0.7590951,0.2307768,0.005561966,0.0002575943,0.0001421115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1132264,0.0000158547,0.8819097,0.001260623,0.0002673853,0.0004523713,0.00001974737,0.00003091454,0.002816952],"genre_scores_gemma":[0.993692,0.000001136496,0.005831544,0.000263995,0.000007510293,0.000007125209,0.000001884836,0.000003862357,0.0001909566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8804656,"threshold_uncertainty_score":0.1977845,"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."}}