{"id":"W2110537587","doi":"10.1109/icc.2009.5199311","title":"Performance Analysis of Multi-Branch Decode-and-Forward Cooperative Diversity Networks over Nakagami-m Fading Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Nakagami distribution; Maximal-ratio combining; Fading; Moment-generating function; Probability density function; Computer science; Cooperative diversity; Signal-to-noise ratio (imaging); Diversity combining; Closed-form expression; Expression (computer science); Topology (electrical circuits); Channel (broadcasting); Outage probability; Algorithm; Cumulative distribution function; Node (physics); Statistics; Mathematics; Telecommunications; Physics; Combinatorics","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.0003700039,0.0001622297,0.0003528459,0.000267006,0.0005226269,0.0000871044,0.000764509,0.00006210628,0.00005115342],"category_scores_gemma":[0.00001960467,0.0001433716,0.0001093243,0.001729554,0.00006085744,0.0006132381,0.0006490988,0.0001597067,0.000002575282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003903258,"about_ca_system_score_gemma":0.00001802228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001151134,"about_ca_topic_score_gemma":0.00005814826,"domain_scores_codex":[0.9988632,0.0001113149,0.0002676657,0.0003335695,0.0001805868,0.0002436369],"domain_scores_gemma":[0.9989319,0.000114799,0.0001118427,0.0005299626,0.0002102411,0.000101295],"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.00004152281,0.0003122776,0.09935898,0.00001198117,0.00101541,0.000003403692,0.01043124,0.5807283,0.0009440684,0.02154573,0.0006807394,0.2849263],"study_design_scores_gemma":[0.0003063812,0.00006403795,0.1108986,0.0000157199,0.00006340378,6.701295e-7,0.00001434823,0.8879417,0.0004389957,0.00001074682,0.0000842853,0.000161197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3659711,0.0002896484,0.6324817,0.0001720767,0.00008597293,0.0001046086,9.000603e-7,0.00006561235,0.0008284083],"genre_scores_gemma":[0.993631,0.001506402,0.003831817,0.0006717911,0.00002005721,0.000002630964,0.00000414092,0.000003207658,0.0003289237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6286499,"threshold_uncertainty_score":0.5846522,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03634602653202276,"score_gpt":0.2768832574982356,"score_spread":0.2405372309662128,"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."}}