{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186888,0.00158387,0.001355142,0.001787457,0.0007257471,0.001833885,0.001094616,0.001155277,0.001889895],"category_scores_gemma":[0.01527109,0.0004752487,0.0007033779,0.001569823,0.001671748,0.002159575,0.001565257,0.001120513,0.0004574094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002473855,"about_ca_system_score_gemma":0.0009799196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004279503,"about_ca_topic_score_gemma":0.002411322,"domain_scores_codex":[0.9984167,0.0004649925,0.00005976031,0.0001511976,0.000563202,0.0003441971],"domain_scores_gemma":[0.988641,0.008549115,0.001036147,0.0006103466,0.001004022,0.0001593852],"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.00006092574,0.00002818837,0.0008337559,0.0001522018,0.0000487406,0.0002667256,0.0001760401,0.9341331,0.003125756,0.05027517,0.0007689135,0.01013062],"study_design_scores_gemma":[0.000003473191,0.00003514811,0.0005361367,0.00003507113,0.00002362238,0.0001672478,0.00004376485,0.9821472,0.001606233,0.01492806,0.0004469838,0.00002707318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09856321,0.008101884,0.8743542,0.0006332012,0.0000774781,0.00005896702,0.0003026491,0.0005540293,0.01735441],"genre_scores_gemma":[0.9782509,0.003444443,0.01624735,0.0001053553,0.0001280778,0.00007747734,0.0001261467,0.00008390899,0.001536415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004279503,"threshold_uncertainty_score":0.01794922,"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."}}