{"id":"W2137554319","doi":"10.1109/tsp.2011.2150221","title":"Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Hop (telecommunications); Mathematical optimization; Channel state information; Closed-form expression; Node (physics); Minification; Optimization problem; Power (physics); Expression (computer science); Relay channel; Convex optimization; Transmission (telecommunications); Decoding methods; Fading; Mathematics; Algorithm; Wireless; Telecommunications; Regular polygon","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.0002464263,0.0001251267,0.000109396,0.0002216032,0.0002379713,0.00008523412,0.0002611566,0.0000527212,0.00005511676],"category_scores_gemma":[0.000003726014,0.0001209257,0.00003307199,0.0005482074,0.00003271451,0.0003978006,0.000003206209,0.0002596055,0.000007612369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005442024,"about_ca_system_score_gemma":0.00006018503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003821551,"about_ca_topic_score_gemma":0.00004562065,"domain_scores_codex":[0.9990882,0.0001079712,0.0002188199,0.0002746287,0.0001498536,0.0001605052],"domain_scores_gemma":[0.9994443,0.00008830514,0.00007116519,0.0002492545,0.00009035697,0.000056615],"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.00006665504,0.0002208819,0.00007659457,0.000009748965,0.000007048747,0.000003023087,0.001580541,0.5251096,0.0002416706,0.0006399996,0.00007037857,0.4719738],"study_design_scores_gemma":[0.0003685631,0.00006556129,0.0001924796,0.0001068858,0.000004251963,0.000002242933,0.00001950945,0.9969051,0.001932011,0.0001000711,0.0001558402,0.0001475014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001469487,0.0001013113,0.9953162,0.0002183617,0.0001000985,0.0001232498,3.646901e-7,0.0001360062,0.002534896],"genre_scores_gemma":[0.9838274,0.00004468638,0.01529858,0.000705026,0.0000123765,0.00003677732,0.000001643336,0.00001259417,0.00006094684],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9823579,"threshold_uncertainty_score":0.4931209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03478725742425993,"score_gpt":0.2761872993055248,"score_spread":0.2414000418812648,"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."}}