{"id":"W2163537708","doi":"10.1109/lcomm.2008.071397","title":"Partial Selective Mapping OFDM with Low Complexity IFFTs","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computational complexity theory; Fast Fourier transform; Reduction (mathematics); Computer science; Algorithm; Multiplexing; Computation; Inverse; SIGNAL (programming language); Mathematics; Telecommunications; Channel (broadcasting)","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.00006680035,0.0001514702,0.0001544409,0.0001219661,0.0003895768,0.00002023917,0.0006104209,0.00004523178,0.00001981766],"category_scores_gemma":[0.0000104299,0.0001618535,0.00004494727,0.0004083492,0.0004799543,0.0001837735,0.0000489074,0.0003770236,0.0001019502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001632076,"about_ca_system_score_gemma":0.00002347611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004236453,"about_ca_topic_score_gemma":0.00002780193,"domain_scores_codex":[0.9991807,0.0000788181,0.0002066246,0.0001409029,0.0001480379,0.0002449293],"domain_scores_gemma":[0.9985102,0.00008067451,0.00004575496,0.001236851,0.00005633313,0.00007017461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006911026,0.0005660931,0.0184557,0.0002000385,0.0009761288,0.00005418488,0.0186632,0.2108064,0.4809953,0.001828707,0.2632552,0.004129904],"study_design_scores_gemma":[0.006745226,0.0002382432,0.1944872,0.0007228754,0.0002471869,0.002257189,0.001706519,0.2756686,0.2097416,0.0006684024,0.302161,0.005356083],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9494672,0.0001929568,0.03714952,0.00435054,0.0003699665,0.0003198487,0.00001581698,0.000901161,0.007232998],"genre_scores_gemma":[0.9837506,0.00009211367,0.01542241,0.0004428427,0.000100773,0.00009609766,0.00002100133,0.0000364088,0.00003774749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2712538,"threshold_uncertainty_score":0.6600196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05691865674489551,"score_gpt":0.2492085492291608,"score_spread":0.1922898924842653,"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."}}