{"id":"W2153875024","doi":"10.1109/cwit.2011.5872139","title":"Complexity-efficient detection for MIMO relay networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Relay; Computer science; Computational complexity theory; Decoding methods; Focus (optics); Detector; Algorithm; 3G MIMO; Computer engineering; Computer network; Telecommunications; Channel (broadcasting)","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.0008522965,0.0006715332,0.0005941199,0.0005081369,0.0002098679,0.000874559,0.0006022402,0.0005696249,0.001356099],"category_scores_gemma":[0.005303703,0.0002942008,0.0003043633,0.0004522042,0.0005572158,0.00106903,0.0009813968,0.0006885444,0.0005279802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005940288,"about_ca_system_score_gemma":0.0006935896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005997819,"about_ca_topic_score_gemma":0.000908253,"domain_scores_codex":[0.9988245,0.0003555643,0.00006111499,0.000117697,0.000570666,0.00007042165],"domain_scores_gemma":[0.9979274,0.001300237,0.0001531896,0.0002461257,0.0003288733,0.00004403042],"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.0003365928,0.00008135602,0.001178682,0.0003053312,0.00009514294,0.0003046624,0.0002330801,0.4936004,0.06568442,0.1363984,0.00381901,0.2979629],"study_design_scores_gemma":[0.00001847815,0.00007620656,0.0001713353,0.00001032923,0.00001098846,0.0002047504,0.00000919441,0.9653593,0.01617235,0.01560481,0.002342803,0.00001943772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009203063,0.0002690896,0.9891122,0.00008031767,0.00001811232,0.00001478163,0.00002860045,0.0002417889,0.001032024],"genre_scores_gemma":[0.546975,0.0006524757,0.4480928,0.0002000339,0.00009901234,0.00008100881,0.0001804027,0.00007692321,0.003642308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001356099,"threshold_uncertainty_score":0.004536569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1315251408532472,"score_gpt":0.2851111602717668,"score_spread":0.1535860194185195,"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."}}