{"id":"W2782666205","doi":"10.1109/tcomm.2017.2789211","title":"Stair Matrix and Its Applications to Massive MIMO Uplink Data Detection","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Development Corporation of Newfoundland and Labrador","keywords":"MIMO; Telecommunications link; Diagonal; Computer science; Algorithm; Matrix (chemical analysis); Computational complexity theory; Base station; Convergence (economics); Iterative method; Channel (broadcasting); Performance improvement; Transmission (telecommunications); Data transmission; Diagonal matrix; Mathematical optimization; Computer engineering; Mathematics; Telecommunications; Engineering; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.0001246904,0.0001771452,0.0001486055,0.0002442438,0.000615404,0.00005199059,0.0008155146,0.0001035613,0.00003170983],"category_scores_gemma":[0.00001214011,0.0002104381,0.00002740032,0.0006366867,0.00008046295,0.0004124354,0.00001961392,0.0002632484,0.0003484346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001232733,"about_ca_system_score_gemma":0.00002269159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779261,"about_ca_topic_score_gemma":0.000496988,"domain_scores_codex":[0.9990366,0.00004983218,0.0003162231,0.0002972264,0.00009663762,0.0002034649],"domain_scores_gemma":[0.996882,0.0001755009,0.00004866252,0.002567659,0.0001879254,0.0001382714],"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.00005634864,0.0004088768,0.000006377734,0.0001797337,0.0003211308,7.239018e-7,0.001848896,0.6816161,0.0786253,0.002613707,0.001103494,0.2332193],"study_design_scores_gemma":[0.0003727253,0.0001001502,0.00002213682,0.00006136767,0.00009090143,0.00001432643,0.0002819579,0.9304683,0.0266801,0.00020317,0.04128161,0.0004232097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003870167,0.000445699,0.9957002,0.0004874274,0.0002362134,0.0009374003,0.0002520012,0.0006147299,0.0009392608],"genre_scores_gemma":[0.9603044,0.0006751507,0.03771998,0.00003787266,0.00007215804,0.00067185,0.00005465481,0.00006003616,0.0004038403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9599174,"threshold_uncertainty_score":0.8581417,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04023690209758715,"score_gpt":0.311482366768363,"score_spread":0.2712454646707758,"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."}}