{"id":"W2105168374","doi":"10.1109/iscas.2005.1464718","title":"An Approach for Computing the Radix-2/4 DIT FHT and FFT Algorithms Using a Unified Structure","year":2005,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Fast Fourier transform; Discrete Hartley transform; Split-radix FFT algorithm; Algorithm; Hartley transform; Computer science; Prime-factor FFT algorithm; Decimation; Discrete Fourier transform (general); Computation; Twiddle factor; Rader's FFT algorithm; Software; Arithmetic; Parallel computing; Mathematics; Fourier transform; Fractional Fourier transform; Fourier analysis; Telecommunications; Short-time 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.0005860656,0.0007691009,0.000704055,0.001917282,0.0007074164,0.001725802,0.001210597,0.0009475459,0.004868818],"category_scores_gemma":[0.00190049,0.0004099954,0.0008093922,0.001558029,0.0008368935,0.002570682,0.001196463,0.001379102,0.002190985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000741283,"about_ca_system_score_gemma":0.001234513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00121921,"about_ca_topic_score_gemma":0.002228768,"domain_scores_codex":[0.9994528,0.00007181917,0.00005679338,0.00008016151,0.0003006551,0.00003785478],"domain_scores_gemma":[0.9996014,0.00008233348,0.00003107436,0.0001019896,0.0001633508,0.00001974543],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001214647,0.00009511985,0.0004648617,0.0002561104,0.00007041606,0.0002773686,0.0002926219,0.03195678,0.03607587,0.5038412,0.005369085,0.4211791],"study_design_scores_gemma":[0.0001097496,0.000504252,0.0006442756,0.0001448217,0.0001183962,0.001440663,0.0001597962,0.5585697,0.05608095,0.2671294,0.1149629,0.0001351818],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001005878,0.0001315143,0.9965943,0.00004354756,0.00008863392,0.00002706946,0.00001488656,0.0002971061,0.001797172],"genre_scores_gemma":[0.01766323,0.0002517656,0.9792116,0.00009007696,0.00008832275,0.0001001343,0.00008959427,0.00008963008,0.002415564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004868818,"threshold_uncertainty_score":0.0162878,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05052119468628341,"score_gpt":0.3057272584732045,"score_spread":0.2552060637869211,"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."}}