{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000386887,0.0007152751,0.0003976077,0.0004136746,0.0003468526,0.0007002161,0.0004293796,0.000537929,0.001034268],"category_scores_gemma":[0.001089493,0.0002084333,0.0003688839,0.0005305525,0.0003449339,0.0006337385,0.0003236472,0.0006510125,0.0005407293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000362989,"about_ca_system_score_gemma":0.0005055464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005111373,"about_ca_topic_score_gemma":0.0007930075,"domain_scores_codex":[0.9995684,0.00009270106,0.00001979873,0.00005719333,0.0002241186,0.00003777275],"domain_scores_gemma":[0.999721,0.00009872363,0.00006881722,0.00003094617,0.00007358744,0.000007003615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001701247,0.0001537712,0.0009375537,0.0006217079,0.00008144881,0.0004230511,0.0003105249,0.2127805,0.2765378,0.04657778,0.003375242,0.4580304],"study_design_scores_gemma":[0.00002838837,0.0007379251,0.001334552,0.0001101498,0.00007545637,0.001158719,0.0001049992,0.8908708,0.07133019,0.01504299,0.01914642,0.00005935497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01909821,0.002323663,0.9714255,0.0002474643,0.00005304617,0.00004747714,0.00002473217,0.0003156252,0.006464288],"genre_scores_gemma":[0.6395089,0.002779002,0.3541045,0.0001756709,0.0001153975,0.00008643563,0.00006356247,0.00005949047,0.003107094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001034268,"threshold_uncertainty_score":0.00345993,"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."}}