{"id":"W2158685876","doi":"10.1109/glocom.2005.1578267","title":"Delay limited optimal and suboptimal power and bit loading algorithms for OFDM systems over correlated fading channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Fading; Markov decision process; Computer science; Algorithm; Dynamic programming; Transmitter power output; Mathematical optimization; Transmission (telecommunications); Power (physics); Markov process; Mathematics; Telecommunications; Channel (broadcasting); Transmitter; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002898283,0.000549108,0.0005872346,0.000223911,0.0005052869,0.0003623707,0.0005667922,0.0003918617,0.00005327421],"category_scores_gemma":[0.00004897533,0.0006319329,0.00009489865,0.0005759373,0.0001940803,0.0008053239,0.0001706523,0.0004231839,0.00002338677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004524217,"about_ca_system_score_gemma":0.00007233211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005726884,"about_ca_topic_score_gemma":0.0000874348,"domain_scores_codex":[0.9974636,0.00009707476,0.0007990858,0.0005281292,0.0002187419,0.0008933494],"domain_scores_gemma":[0.9981179,0.0002435142,0.0002209407,0.0008069355,0.0002821481,0.0003285767],"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.00003733849,0.00007600022,0.0003745678,0.00004610093,0.0001849036,0.000002824891,0.0002250149,0.9796525,0.0002442359,0.003114427,0.005316762,0.01072528],"study_design_scores_gemma":[0.001341863,0.00008102413,0.0004082744,0.0001638772,0.00008526975,0.0001376368,0.0001521046,0.975554,0.0001066362,0.00007560391,0.02122747,0.0006662186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2246519,0.007620389,0.7576935,0.0004614051,0.001382439,0.001914838,0.0005415133,0.001248086,0.004485912],"genre_scores_gemma":[0.9163439,0.002906614,0.07975875,0.00007783641,0.0001527235,0.000207906,0.0002679001,0.00007802378,0.0002063459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6916921,"threshold_uncertainty_score":0.9996132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01959153959635459,"score_gpt":0.2583814134103958,"score_spread":0.2387898738140412,"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."}}