{"id":"W2113875394","doi":"10.1109/ccece.2004.1345319","title":"An efficient FFT algorithm based on the radix-2/4 DIF approach for computing 3D DFT","year":2004,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Fast Fourier transform; Split-radix FFT algorithm; Radix (gastropod); Computer science; Prime-factor FFT algorithm; Algorithm; Kronecker product; Computational complexity theory; Twiddle factor; Parallel computing; Decimation; Matrix multiplication; Kronecker delta; Mathematics; Fourier transform; Filter (signal processing); 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.0002626314,0.0007232157,0.0006141522,0.001034605,0.0004312904,0.0007389336,0.0007138569,0.0006387225,0.004888624],"category_scores_gemma":[0.0009961464,0.0003277605,0.0005350584,0.001009581,0.0003295515,0.00104539,0.0004685326,0.000568126,0.00216325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003222862,"about_ca_system_score_gemma":0.0005138722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001055002,"about_ca_topic_score_gemma":0.00176862,"domain_scores_codex":[0.9997764,0.00002778933,0.00002415468,0.0000313327,0.00012168,0.00001863031],"domain_scores_gemma":[0.9996783,0.00007331105,0.00002754965,0.00005757406,0.0001470552,0.0000162513],"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.0002533513,0.00007925319,0.0009843486,0.0001830442,0.000060793,0.0001977197,0.0001225051,0.04470249,0.1015936,0.0303828,0.005996316,0.8154439],"study_design_scores_gemma":[0.00009164261,0.0002912571,0.000932648,0.00003226083,0.00004201427,0.0009021185,0.00006256192,0.8700116,0.08197944,0.01377563,0.03180292,0.00007604631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003345181,0.00009303026,0.994862,0.00004488742,0.00005336723,0.00003329409,0.00004637784,0.0005120492,0.00100979],"genre_scores_gemma":[0.02495773,0.0001206088,0.9734486,0.00004120732,0.00003065324,0.0000700686,0.0001900387,0.00005018588,0.001090815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004888624,"threshold_uncertainty_score":0.01635408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03318657468837668,"score_gpt":0.2741796488629311,"score_spread":0.2409930741745544,"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."}}