{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029646,0.0006456714,0.0005991734,0.0007473864,0.0004828845,0.001159479,0.0006461621,0.0005630471,0.005130325],"category_scores_gemma":[0.002725253,0.0002858058,0.0003484321,0.0005235561,0.0003027442,0.001345274,0.000698234,0.0008095568,0.002483846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003614286,"about_ca_system_score_gemma":0.0008210658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008880342,"about_ca_topic_score_gemma":0.001641864,"domain_scores_codex":[0.9996026,0.00003935903,0.00002193499,0.00005337536,0.0002514534,0.00003125415],"domain_scores_gemma":[0.999265,0.000314791,0.00003455162,0.0001151313,0.0002361389,0.00003444161],"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.0002826765,0.00005809464,0.0006421327,0.0002425648,0.00005451796,0.0002911277,0.00018007,0.05058787,0.07441546,0.04922111,0.007705574,0.8163188],"study_design_scores_gemma":[0.00006702363,0.0001236959,0.0007350243,0.00003441698,0.00002241211,0.0007338588,0.00007156517,0.8831442,0.06190043,0.02043278,0.03267437,0.00006021135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003975839,0.0001376689,0.9935995,0.00005755192,0.0001004988,0.00001878267,0.00004593145,0.0006781435,0.001385999],"genre_scores_gemma":[0.06586152,0.0003014435,0.9295353,0.00005537237,0.00008572593,0.00006933524,0.0002614667,0.0001273756,0.003702495],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005130325,"threshold_uncertainty_score":0.01716262,"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."}}