{"id":"W2041176458","doi":"10.1109/lcomm.2012.050912.120103","title":"Two-Way Amplify-and-Forward Relaying with Gaussian Imperfect Channel Estimations","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Computer science; Channel (broadcasting); Gaussian; Reliability (semiconductor); Upper and lower bounds; Signal-to-noise ratio (imaging); Bounded function; Imperfect; Probability density function; Selection (genetic algorithm); Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Statistics; Power (physics)","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.0005971568,0.0002126796,0.0001978436,0.0001971436,0.001188005,0.0002419235,0.002163834,0.00004692527,0.000008930217],"category_scores_gemma":[0.0000438598,0.0001900672,0.00005019014,0.0006741997,0.0002598898,0.001155215,0.0007557264,0.000469637,0.00008207504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008908175,"about_ca_system_score_gemma":0.00003517564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002642275,"about_ca_topic_score_gemma":0.00005972704,"domain_scores_codex":[0.9984543,0.0003956279,0.0002942739,0.0002469979,0.0001875218,0.0004212691],"domain_scores_gemma":[0.9957947,0.0004709441,0.0001483591,0.00329397,0.00008744104,0.0002045509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003113061,0.0009205171,0.01378934,0.00006519428,0.0004868079,0.000005808205,0.03392069,0.004696487,0.04711949,0.7403162,0.01746278,0.1411856],"study_design_scores_gemma":[0.007076091,0.0004394829,0.07417611,0.001132087,0.0004013144,0.0009678986,0.001677561,0.7475255,0.006896258,0.001700256,0.1525512,0.005456188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04001729,0.00277982,0.8985759,0.05031246,0.0002926858,0.0005130679,0.00000535514,0.0005061912,0.006997243],"genre_scores_gemma":[0.8910787,0.0007789617,0.1047571,0.003095122,0.00006083383,0.0001446111,0.0000183625,0.00002072936,0.00004551969],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8510615,"threshold_uncertainty_score":0.9137297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04853330916029852,"score_gpt":0.2987022164269006,"score_spread":0.2501689072666021,"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."}}