{"id":"W4243562278","doi":"10.36227/techrxiv.14345900","title":"Efficient Bit Loading Algorithm for OFDM-NOMA Systems with BER Constraints","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Noma; Computer science; Throughput; Interference (communication); Computational complexity theory; Bit error rate; Quality of service; Single antenna interference cancellation; Algorithm; Orthogonal frequency-division multiplexing; Power (physics); Reduction (mathematics); Bit (key); Computer engineering; Electronic engineering; Computer network; Telecommunications; Engineering; Mathematics; Wireless; Telecommunications link; Channel (broadcasting); Decoding methods","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.0004367738,0.0008586874,0.0007090444,0.0004430309,0.0005635558,0.001193037,0.0005454679,0.0008104866,0.002990967],"category_scores_gemma":[0.002176527,0.0002800352,0.0002692855,0.0006391554,0.0004606801,0.001031245,0.001085536,0.0007519302,0.001242302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004255723,"about_ca_system_score_gemma":0.0009744081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009567728,"about_ca_topic_score_gemma":0.001259431,"domain_scores_codex":[0.9995555,0.0001540692,0.00003121043,0.00005190043,0.0001309567,0.00007627661],"domain_scores_gemma":[0.9992532,0.0004095714,0.00009378255,0.0000928895,0.0001175931,0.00003303821],"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.0005089512,0.0001874273,0.0009202825,0.0001575703,0.00004961988,0.0001928116,0.0001990712,0.518005,0.03182891,0.02293316,0.002976535,0.4220407],"study_design_scores_gemma":[0.00002288247,0.00004590186,0.0001381091,0.000007848344,0.000005603703,0.00005096562,0.00002305002,0.9899856,0.004030613,0.004785328,0.0008951845,0.000008924273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0279694,0.0001906298,0.9685925,0.0001369021,0.00004195619,0.00006235378,0.00004900967,0.0003868838,0.002570426],"genre_scores_gemma":[0.4174078,0.0003042778,0.5766621,0.0001421588,0.00007600638,0.0002986411,0.0002270605,0.0001012401,0.004780746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002990967,"threshold_uncertainty_score":0.01000577,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01667897370884988,"score_gpt":0.2373620533003544,"score_spread":0.2206830795915045,"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."}}