{"id":"W1976526421","doi":"10.1049/el.2009.3330","title":"Efficient computation of DFT of Zadoff-Chu sequences","year":2009,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Sequence (biology); Discrete Fourier transform (general); Computation; Algorithm; Prime (order theory); Fast Fourier transform; Computer science; Arithmetic; Mathematics; Fourier analysis; Fourier transform; Combinatorics; Fractional Fourier transform; Mathematical 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.0004434784,0.00008930869,0.0001656508,0.0001537108,0.0000573027,0.00002935569,0.001158034,0.00003590144,0.000002302608],"category_scores_gemma":[0.0000238098,0.0000882846,0.00006098012,0.0006698107,0.00008869026,0.00008364427,0.00009967598,0.0002102895,0.000004538101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008914688,"about_ca_system_score_gemma":0.0001245882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001114892,"about_ca_topic_score_gemma":0.000003175988,"domain_scores_codex":[0.9985799,0.000151762,0.0003002618,0.000198342,0.0004548947,0.0003148092],"domain_scores_gemma":[0.9989622,0.000132535,0.0001902191,0.0005519062,0.0001212715,0.00004189226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001836791,0.0002010711,0.0001790975,0.00002549419,0.00003252979,0.000003135088,0.0008220256,0.58265,0.2341323,0.1015074,0.001244824,0.07918378],"study_design_scores_gemma":[0.0003154198,0.0002825156,0.003007452,0.00004743943,0.000004063606,0.000006394133,0.000009497285,0.9562211,0.03727962,0.002438426,0.0002327861,0.0001552771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4917583,0.001008172,0.4964447,0.01016181,0.00004688908,0.0001506519,5.009173e-7,0.00005395814,0.0003749969],"genre_scores_gemma":[0.9866313,0.00004953941,0.01283651,0.0004520254,0.00001488893,0.000002811993,0.0000024878,0.000004223527,0.000006164785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.494873,"threshold_uncertainty_score":0.3600141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01279726512769633,"score_gpt":0.273856390635857,"score_spread":0.2610591255081607,"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."}}