{"id":"W2125679618","doi":"10.1109/cmpcon.1979.729130","title":"Microprocessor Implementations Of Discrete Fourier Transform Machines","year":2005,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Fast Fourier transform; Discrete Fourier transform (general); Computer science; Microprocessor; Fourier transform; Algorithm; Cooley–Tukey FFT algorithm; Implementation; Parallel computing; Discrete Hartley transform; Prime-factor FFT algorithm; Computer engineering; Fractional Fourier transform; Computer hardware; Mathematics; Fourier analysis; Programming language","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.00059528,0.0005907839,0.000502722,0.0008837294,0.0005104131,0.001832883,0.001392304,0.0007155893,0.01996673],"category_scores_gemma":[0.003621008,0.0003877219,0.0003264093,0.001262042,0.0003587628,0.001999067,0.000520609,0.0009279454,0.007336024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005794374,"about_ca_system_score_gemma":0.0004974661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003094276,"about_ca_topic_score_gemma":0.000438761,"domain_scores_codex":[0.9992731,0.0001312806,0.00008332565,0.00009447095,0.0003178373,0.000100039],"domain_scores_gemma":[0.9989262,0.0002909011,0.00008108581,0.0002525747,0.0004116866,0.00003749375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007905763,0.0001502684,0.000878086,0.001307704,0.00007300999,0.0005376731,0.0005956933,0.01574991,0.04883005,0.2819413,0.03479698,0.6143487],"study_design_scores_gemma":[0.0003431285,0.0007282429,0.001098076,0.0004715716,0.0001107765,0.001434897,0.0002260598,0.1383091,0.1602939,0.08169561,0.6151807,0.0001079982],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01866582,0.003948551,0.9212907,0.0005426733,0.001025699,0.0002482825,0.0003634391,0.004863938,0.04905089],"genre_scores_gemma":[0.2190394,0.00412294,0.7240846,0.0004924412,0.0003899295,0.0005887697,0.0008216992,0.0005409243,0.04991942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01996673,"threshold_uncertainty_score":0.06679535,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01738060973665043,"score_gpt":0.2975958635453794,"score_spread":0.280215253808729,"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."}}