{"id":"W1960995591","doi":"10.1109/iscas.2003.1205782","title":"Efficient pruning algorithms for the DFT computation for a subset of output samples","year":2003,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimation; Fast Fourier transform; Pruning; Twiddle factor; Computer science; Algorithm; Lookup table; Reduction (mathematics); Computation; Computational complexity theory; Arithmetic; Parallel computing; Mathematics; Filter (signal processing); Fourier analysis; Fourier transform","routes":{"ca_aff":true,"ca_fund":true,"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.0006747572,0.0009399793,0.0007710544,0.001294068,0.00058776,0.0009066038,0.0008717012,0.0005500506,0.003643828],"category_scores_gemma":[0.004077956,0.0003268805,0.0005267622,0.0009517006,0.0003456908,0.001211024,0.0006516858,0.0007238801,0.001595909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004074488,"about_ca_system_score_gemma":0.0009942004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001178615,"about_ca_topic_score_gemma":0.003848074,"domain_scores_codex":[0.9993867,0.00008169474,0.00006445789,0.00006186034,0.0003540778,0.00005119284],"domain_scores_gemma":[0.9988952,0.0005972855,0.00009655316,0.0001528883,0.0002330084,0.00002505312],"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.0003232095,0.00008229484,0.0006294303,0.000195704,0.00005262391,0.0001685739,0.000157578,0.02900193,0.04282354,0.01751656,0.002699579,0.9063491],"study_design_scores_gemma":[0.0001850093,0.0003765352,0.001781988,0.0001196049,0.0001100219,0.00137112,0.0001541991,0.8523452,0.09987998,0.02223759,0.02136866,0.00007013634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007331585,0.000240365,0.991052,0.00003077394,0.00002907954,0.00005830562,0.0000421097,0.0004652474,0.000750558],"genre_scores_gemma":[0.03791304,0.0002789978,0.9598292,0.00002652452,0.00004115194,0.0001410803,0.0002755008,0.00008198524,0.001412457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003643828,"threshold_uncertainty_score":0.01218987,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1121712084754194,"score_gpt":0.325437292296424,"score_spread":0.2132660838210046,"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."}}