{"id":"W2143403648","doi":"10.1109/vetecs.2009.5073528","title":"Efficient User Selection and Ordering Algorithms for Successive Zero-Forcing Precoding for Multiuser MIMO Downlink","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Precoding; Zero-forcing precoding; Dirty paper coding; Telecommunications link; Computer science; Greedy algorithm; Algorithm; Scheduling (production processes); MIMO; Multi-user MIMO; Computational complexity theory; Mathematical optimization; Mathematics; Beamforming; Computer network; Telecommunications","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.0001224178,0.0001757208,0.0001846116,0.0001103677,0.0001532849,0.00005859059,0.00005211184,0.00009465005,0.000004621169],"category_scores_gemma":[0.00007475179,0.0001745395,0.00004406931,0.0001417746,0.000005837148,0.0001829895,0.000009111995,0.00006407828,9.099568e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001063938,"about_ca_system_score_gemma":0.000006887283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007422209,"about_ca_topic_score_gemma":0.00001997026,"domain_scores_codex":[0.9991239,0.000005602873,0.0002625062,0.0002468285,0.000059106,0.0003020404],"domain_scores_gemma":[0.9995567,0.0001259767,0.00005160483,0.0000884394,0.0001193834,0.0000579354],"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.00001323076,0.000009292261,0.00004847749,0.000090234,0.00001561898,1.094551e-7,0.0002045851,0.9750245,0.01093694,0.0002586676,0.00007960801,0.01331875],"study_design_scores_gemma":[0.0008625978,0.00006546651,0.00004434625,0.00006222905,0.00001790172,0.000003689245,0.00006922951,0.9804161,0.01772196,0.00009435805,0.0004184293,0.000223699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02197724,0.0001246472,0.9757574,0.00002923258,0.0002814839,0.001172886,0.000008171591,0.0004427117,0.0002062213],"genre_scores_gemma":[0.7040731,0.00001001593,0.2953496,0.00001852642,0.0001161401,0.0001274062,0.00001411364,0.00003717488,0.0002538966],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6820959,"threshold_uncertainty_score":0.7117513,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0124285412723631,"score_gpt":0.2532442290918975,"score_spread":0.2408156878195344,"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."}}