{"id":"W2133417026","doi":"10.1109/iscas.2004.1328739","title":"Efficient output-pruning of the 2-D FFT algorithm","year":2004,"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":"Fast Fourier transform; Twiddle factor; Computer science; Algorithm; Prime-factor FFT algorithm; Pruning; Decimation; Lookup table; Split-radix FFT algorithm; Computation; Parallel computing; Search engine indexing; Process (computing); Radix (gastropod); Algorithm design; Arithmetic; Mathematics; Filter (signal processing); Artificial intelligence; Fourier transform","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.0002094994,0.0004497641,0.0004201564,0.0005448018,0.0004353101,0.000675007,0.0005042288,0.0003696504,0.003709226],"category_scores_gemma":[0.001552098,0.0001977242,0.0002674109,0.0006096273,0.0002554103,0.000791565,0.0005424015,0.0003986195,0.001249127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003480902,"about_ca_system_score_gemma":0.0006729561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562285,"about_ca_topic_score_gemma":0.003489488,"domain_scores_codex":[0.9996667,0.00004144208,0.00002809767,0.00003611351,0.0001944724,0.00003315707],"domain_scores_gemma":[0.999625,0.0001531905,0.00002999509,0.00006197436,0.0001183083,0.00001150668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005171199,0.00007793952,0.001699678,0.0001663795,0.00002880808,0.0003987131,0.0002500335,0.05280308,0.09035326,0.02106976,0.004610957,0.8280243],"study_design_scores_gemma":[0.00006389449,0.0001411943,0.00160798,0.00004367756,0.00002160271,0.0005656014,0.00008068175,0.8681733,0.09866925,0.01047554,0.02013166,0.00002565566],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02910028,0.0001491313,0.9649433,0.00006469795,0.00004025098,0.0000465274,0.0000893866,0.001039469,0.00452693],"genre_scores_gemma":[0.184541,0.0001966191,0.808575,0.00007404031,0.00003369909,0.0001003489,0.0005406946,0.0001679953,0.005770565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003709226,"threshold_uncertainty_score":0.01240861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02177228299038264,"score_gpt":0.2447591917978199,"score_spread":0.2229869088074372,"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."}}