{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003792936,0.00006716004,0.00008159268,0.00004484718,0.00009613023,0.0001164399,0.0002121097,0.00001358433,0.000002009004],"category_scores_gemma":[0.00007178669,0.00004611213,0.00006087215,0.0001385782,0.00001848899,0.0001193154,0.00002328884,0.00001433106,0.000001393104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001391021,"about_ca_system_score_gemma":0.00003755082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009373905,"about_ca_topic_score_gemma":0.00000309801,"domain_scores_codex":[0.9993358,0.00002060716,0.000199264,0.0001575028,0.0001307752,0.0001560128],"domain_scores_gemma":[0.9991031,0.0005246095,0.00008285063,0.0001369539,0.0001277405,0.00002468793],"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.00001603341,0.0001265077,0.0001126666,0.00005896741,0.00004816002,1.369509e-7,0.001951908,0.01636792,0.001396531,0.662841,0.00526953,0.3118107],"study_design_scores_gemma":[0.0007053992,0.0002200496,0.0004501218,0.000007785763,0.000009302807,0.000002246163,0.0002554079,0.9695511,0.01321361,0.008370599,0.00711785,0.00009647006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002738064,0.00002317571,0.9955134,0.0002169053,0.0001908962,0.0007356532,0.00002056024,0.0000358084,0.0005255159],"genre_scores_gemma":[0.6097406,5.191987e-7,0.3898562,0.0001455104,0.00001189657,0.00006482396,0.00001371862,0.000004593769,0.000162236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9531832,"threshold_uncertainty_score":0.1880398,"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."}}