{"id":"W2155165039","doi":"10.1109/tcomm.2012.081012.100156","title":"Performance Analysis for Multihop Relaying Channels with Nakagami-m Fading: Ergodic Capacity Upper-Bounds and Outage Probability","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Ergodic theory; Upper and lower bounds; Topology (electrical circuits); Independent and identically distributed random variables; Moment-generating function; Computer science; Signal-to-noise ratio (imaging); Channel state information; Context (archaeology); Mathematics; Channel capacity; Channel (broadcasting); Telecommunications; Probability density function; Wireless; Random variable; Statistics; Combinatorics; Mathematical analysis","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007580525,0.0002221875,0.0002803954,0.0003283852,0.001941929,0.0001799924,0.001343579,0.00008481805,0.00001198621],"category_scores_gemma":[0.00001927073,0.0002039132,0.0001417293,0.001366552,0.0002829248,0.001003784,0.0000386445,0.0004300166,0.000008779985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001398879,"about_ca_system_score_gemma":0.00005325329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001880973,"about_ca_topic_score_gemma":0.000218385,"domain_scores_codex":[0.998483,0.0002818121,0.000341898,0.0003326357,0.0001836011,0.0003770652],"domain_scores_gemma":[0.9960442,0.0006412418,0.0001306784,0.002757294,0.0002418507,0.0001847815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003810818,0.009477263,0.1001665,0.0004644305,0.005350169,8.21831e-7,0.1008385,0.1822086,0.005779043,0.1062472,0.0002652087,0.4888211],"study_design_scores_gemma":[0.0009056737,0.0002324055,0.01469401,0.00008604258,0.0003682356,0.00001469179,0.0001979615,0.9750926,0.002100702,0.0001613775,0.005540494,0.0006057977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1410024,0.0003231803,0.8558205,0.00146684,0.0001300139,0.0005357948,0.00001590427,0.0001947695,0.0005105558],"genre_scores_gemma":[0.917347,0.001028885,0.08077539,0.0001435367,0.00001674062,0.000468983,0.000009147291,0.0000153152,0.0001950527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7928841,"threshold_uncertainty_score":0.9993574,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09869369265298683,"score_gpt":0.292406410548786,"score_spread":0.1937127178957992,"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."}}