{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001660099,0.00009458431,0.00008007016,0.00003748814,0.0001905878,0.0005530289,0.0003565602,0.00002348303,0.000003898732],"category_scores_gemma":[0.000004693553,0.00006295178,0.00002187177,0.0001326424,0.00002658133,0.0008518641,0.00007888158,0.0000441671,3.800052e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001889612,"about_ca_system_score_gemma":0.00001961213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001402784,"about_ca_topic_score_gemma":0.000003557897,"domain_scores_codex":[0.9992654,0.00003099317,0.0001412087,0.0002557167,0.0001164661,0.0001902649],"domain_scores_gemma":[0.9995795,0.00004762633,0.00004832893,0.0002350782,0.00003461565,0.00005486736],"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.000009082035,0.00006962868,0.0003087724,0.00002331385,0.00003396166,6.390932e-7,0.003319421,0.003216355,0.01055509,0.09597533,0.0008523862,0.885636],"study_design_scores_gemma":[0.0003043619,0.00005048289,0.0004036246,0.000001964484,0.000004672265,0.00002417505,0.0001482062,0.9950495,0.001551631,0.001468174,0.0008922168,0.0001009597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02792306,0.00001781946,0.9707519,0.0002251987,0.00006091424,0.0002887152,0.000006296343,0.00006810429,0.0006579736],"genre_scores_gemma":[0.5134885,3.103211e-7,0.4859801,0.0003720016,0.00009975419,0.000001400519,0.00001046917,0.000004158991,0.00004338238],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9918332,"threshold_uncertainty_score":0.5332871,"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."}}