{"id":"W2161899247","doi":"10.1109/mwscas.1996.588018","title":"Fast computation of the two-dimensional discrete Fourier transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Discrete Fourier transform (general); Prime-factor FFT algorithm; Algorithm; Decimation; Fast Fourier transform; Computation; Computer science; Computational complexity theory; Cyclotomic fast Fourier transform; Cooley–Tukey FFT algorithm; Fourier transform; Overhead (engineering); Split-radix FFT algorithm; Mathematics; Fractional Fourier transform; Fourier analysis; Filter (signal processing); Computer vision","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.00005997893,0.00005497373,0.0000540025,0.00002736212,0.00004919932,0.00005646886,0.0002410035,0.000009515246,0.00007347399],"category_scores_gemma":[0.000002764524,0.00003440221,0.00005081578,0.0001790273,0.00002591986,0.0005396706,0.00004535545,0.00002764295,0.00002561599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009859428,"about_ca_system_score_gemma":0.000007340254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001127293,"about_ca_topic_score_gemma":0.000006108306,"domain_scores_codex":[0.9993779,0.00001951135,0.0001532634,0.0001111821,0.0002408265,0.00009730858],"domain_scores_gemma":[0.9997352,0.00002164674,0.0000406022,0.0001406943,0.0000353007,0.00002655374],"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.000005276163,0.0001140953,0.0003746228,0.00001502643,0.00002987699,0.000001465883,0.001925311,0.003199023,0.003887773,0.1167958,0.01154699,0.8621047],"study_design_scores_gemma":[0.0006731414,0.00009259285,0.002198724,0.00001535893,0.000005041948,0.00001098586,0.0000242439,0.9653265,0.01687365,0.01393865,0.00071955,0.0001215789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01191426,0.00001078656,0.9404517,0.002365494,0.0001861385,0.0001668598,0.000003969718,0.00004182976,0.04485894],"genre_scores_gemma":[0.9784114,3.136292e-7,0.01994863,0.0003825765,0.00001136086,0.000002593215,0.000001777066,0.000002658855,0.001238637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9664972,"threshold_uncertainty_score":0.1402881,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02927600486000399,"score_gpt":0.2598159095282031,"score_spread":0.2305399046681991,"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."}}