{"id":"W1975388559","doi":"10.1109/icecs.2011.6122381","title":"A higher radix FFT FPGA implementation suitable for OFDM systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Fast Fourier transform; Split-radix FFT algorithm; Computer science; Field-programmable gate array; Pipeline (software); Computation; Factorization; Prime-factor FFT algorithm; Parallel computing; Very-large-scale integration; Multiplier (economics); Arithmetic; Radix (gastropod); Algorithm; Theoretical computer science; Fourier transform; Computer hardware; Mathematics; Embedded system; Fractional Fourier transform; Fourier analysis","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.0002217495,0.0001000912,0.0001008465,0.00007740286,0.00007089974,0.0002783322,0.0003587435,0.00002509183,0.0002489477],"category_scores_gemma":[0.000003243119,0.00008754968,0.00004624166,0.0001568779,0.000008672688,0.001481943,0.00006417567,0.0000212488,0.00008516445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003958387,"about_ca_system_score_gemma":0.0000338445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003257542,"about_ca_topic_score_gemma":0.00001884418,"domain_scores_codex":[0.999034,0.00002536614,0.0002533071,0.0002502743,0.0001555275,0.0002814603],"domain_scores_gemma":[0.9994833,0.00003595856,0.00007597731,0.0002572174,0.00007840288,0.00006915999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001387613,0.00007895878,0.0006398764,0.00004514701,0.00004468542,0.000001970695,0.001344994,0.000001362569,0.002375335,0.8682178,0.08071201,0.04652404],"study_design_scores_gemma":[0.01018971,0.003576402,0.02754147,0.00007011333,0.0001025235,0.00005511273,0.003109157,0.03565377,0.1923156,0.08004762,0.6450946,0.00224397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00138347,0.00002830438,0.9580171,0.0001030208,0.0007852163,0.0006784007,0.00001450324,0.000180592,0.03880947],"genre_scores_gemma":[0.9101572,0.000002779871,0.07445665,0.0004852614,0.00009455617,0.000276073,0.00005272497,0.00001621617,0.01445854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9087737,"threshold_uncertainty_score":0.3570172,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1095255645132746,"score_gpt":0.3094961517208039,"score_spread":0.1999705872075293,"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."}}