{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001155853,0.0009079172,0.001157815,0.0004437932,0.0002966913,0.0009812715,0.0007031079,0.0008827274,0.0007302712],"category_scores_gemma":[0.002068709,0.0004782212,0.000357832,0.0005987609,0.0008956754,0.0009018024,0.0007677817,0.0005694035,0.0002269611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007795714,"about_ca_system_score_gemma":0.0005329235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008452664,"about_ca_topic_score_gemma":0.0006966369,"domain_scores_codex":[0.9993667,0.0003527425,0.00002358477,0.00007630673,0.0001229699,0.00005779076],"domain_scores_gemma":[0.9991822,0.0005892465,0.00008693611,0.00003788744,0.00008177093,0.00002191981],"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.00006274047,0.00002684341,0.0001488327,0.00006423476,0.00002180462,0.00008756763,0.0000653907,0.9656557,0.0025531,0.01467551,0.000406007,0.01623229],"study_design_scores_gemma":[0.000008023727,0.00002378885,0.00003522295,0.000003653472,0.000004126595,0.00002000023,0.000008606782,0.9931117,0.0007069781,0.005919664,0.0001542364,0.000004001781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02446595,0.00036503,0.9724705,0.0001616836,0.00001715713,0.00002862509,0.00002570783,0.00008619233,0.002379194],"genre_scores_gemma":[0.8886455,0.00073543,0.10701,0.00007155681,0.00004019777,0.0001486431,0.0000433492,0.00005142604,0.003254037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001157815,"threshold_uncertainty_score":0.006112814,"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."}}