{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004604145,0.0006479075,0.0005932101,0.0003731211,0.0004055313,0.0004549658,0.0005214611,0.0004671501,0.001329704],"category_scores_gemma":[0.001858438,0.0002425085,0.0003129227,0.0005686144,0.0003740648,0.0005287371,0.0004461863,0.0005286567,0.0004534945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005581053,"about_ca_system_score_gemma":0.001393232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002036244,"about_ca_topic_score_gemma":0.003620039,"domain_scores_codex":[0.999493,0.0001906977,0.00002311622,0.00005260853,0.0001652679,0.00007534415],"domain_scores_gemma":[0.9992927,0.0004335121,0.00007044519,0.00007885147,0.00009372974,0.0000307189],"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.0001822182,0.000111802,0.0008207332,0.0001193644,0.00003462607,0.0001064267,0.0001769072,0.6714598,0.01415479,0.02990448,0.002246583,0.2806822],"study_design_scores_gemma":[0.0000235027,0.00006853736,0.0001679748,0.000006604113,0.000005227672,0.00004734725,0.00001937014,0.9882935,0.002848818,0.00761152,0.0008991261,0.000008530771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0092985,0.0001246731,0.989223,0.0000405785,0.0000133424,0.00005277631,0.00001943527,0.0001732762,0.001054478],"genre_scores_gemma":[0.3081488,0.0003231892,0.6896246,0.00008436877,0.00003883717,0.0002040776,0.0001429985,0.00004198282,0.001391178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002036244,"threshold_uncertainty_score":0.004448235,"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."}}