{"id":"W2912814457","doi":"10.1109/access.2019.2895415","title":"An Optimal Low Complexity PAPR Reduction Technique for Next Generation OFDM Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Reduction (mathematics); Computer science; Bit error rate; Transmitter; Waveform; Amplifier; Transmission (telecommunications); Computational complexity theory; Electronic engineering; Distortion (music); Modulation (music); Algorithm; Mathematics; Telecommunications; Channel (broadcasting); Bandwidth (computing); Decoding methods; Engineering","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.0001852144,0.0001571273,0.0001809653,0.000114908,0.00008093224,0.0002583421,0.0002962296,0.0001371535,0.00005635197],"category_scores_gemma":[0.000006053959,0.0001724216,0.00004950023,0.0001601535,0.00003014755,0.001306076,0.00001240874,0.0001261294,0.00004474019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001477356,"about_ca_system_score_gemma":0.00001971645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004699937,"about_ca_topic_score_gemma":0.000002775365,"domain_scores_codex":[0.9990787,0.00003380553,0.000263498,0.000256188,0.0001448264,0.0002229638],"domain_scores_gemma":[0.9993576,0.00001240939,0.00006229972,0.0003929301,0.0001052091,0.0000694866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000111915,0.00002032766,0.00003904357,0.0001618234,0.00001301364,2.575787e-7,0.00003961551,0.3784167,0.6169508,0.0002261005,0.003654706,0.0004664581],"study_design_scores_gemma":[0.0003029415,0.00006993976,0.0001574216,0.00004199973,0.0000145527,0.00004376241,0.00006905159,0.391652,0.6050375,0.0001011574,0.002200618,0.0003090972],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7486546,0.00008161402,0.2431533,0.00002308309,0.005650147,0.001268819,0.00002463021,0.0004997242,0.0006440991],"genre_scores_gemma":[0.993846,0.00001526806,0.003897411,0.000009403408,0.001457957,0.0005098504,0.00007273006,0.00005327953,0.0001381222],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2451914,"threshold_uncertainty_score":0.7031149,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09643267807069196,"score_gpt":0.323880319636085,"score_spread":0.2274476415653931,"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."}}