{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008432628,0.0000456675,0.00004583048,0.00002826758,0.00004056051,0.00006071038,0.0004240811,0.000009560006,0.000005966279],"category_scores_gemma":[0.000006971852,0.00002874794,0.00003826141,0.0002162475,0.00001950522,0.0001089085,0.0001534648,0.00002487916,0.0000206119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002075876,"about_ca_system_score_gemma":0.00003659799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002900876,"about_ca_topic_score_gemma":0.000001530447,"domain_scores_codex":[0.9994699,0.00001095267,0.0001203426,0.0001074819,0.0001866827,0.0001046904],"domain_scores_gemma":[0.9996492,0.00001219243,0.00004072642,0.0002439058,0.00003082303,0.00002318536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001127654,0.0001633118,0.000300289,0.000009047169,0.00001713448,0.000002471957,0.002296186,0.005690516,0.004469113,0.5413118,0.0007587722,0.4449802],"study_design_scores_gemma":[0.003150632,0.0004757808,0.03964787,0.0001261429,0.00001735019,0.00004960401,0.0003944185,0.6397662,0.2608687,0.04739719,0.007450901,0.0006552515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01286616,0.000006707913,0.9762006,0.0005081947,0.0002101572,0.00008566465,0.000001074986,0.00004038886,0.01008099],"genre_scores_gemma":[0.8704364,2.525434e-7,0.1286604,0.000342309,0.00001032848,0.000001915024,4.151091e-7,0.000002303088,0.0005456005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8575703,"threshold_uncertainty_score":0.1172307,"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."}}