{"id":"W2167558576","doi":"10.1109/wcnc.2007.198","title":"A Capacity Achieving Precoding Scheme Based on Partial Channel Information for Broadcast MIMO Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; MIMO; Zero-forcing precoding; Computer science; Channel capacity; Ergodic theory; Channel (broadcasting); Limit (mathematics); Transmission (telecommunications); Interference (communication); Reduction (mathematics); Mutual information; Dirty paper coding; Forcing (mathematics); Noisy-channel coding theorem; Multi-user MIMO; Electronic engineering; Control theory (sociology); Computer network; Algorithm; Mathematics; Telecommunications; Decoding methods; Engineering; Block code","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.0004558943,0.0001640986,0.000166201,0.0001843245,0.00009610612,0.00006769437,0.00007675107,0.000110558,0.000006703696],"category_scores_gemma":[0.0001058098,0.0001669499,0.00005031502,0.0001630943,0.000008952751,0.0007111235,0.000007784426,0.0000962705,0.00002535704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001887538,"about_ca_system_score_gemma":0.000008704415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001685764,"about_ca_topic_score_gemma":0.000007796458,"domain_scores_codex":[0.9989913,0.00001057929,0.0004271629,0.0001150308,0.000130069,0.0003258239],"domain_scores_gemma":[0.9994633,0.0001148487,0.00008012685,0.0001767198,0.00008548518,0.00007947189],"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.00002708541,0.000008967217,0.00004304906,0.0003255902,0.00001032463,1.790849e-7,0.0001839953,0.9942675,0.001963857,0.001088065,0.0001497098,0.001931743],"study_design_scores_gemma":[0.0004188347,0.00004192974,0.00002813366,0.0001266796,0.000005558487,0.000002126698,0.0001614651,0.9877635,0.009348204,0.000005937079,0.001905025,0.0001926326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007285911,0.00002198158,0.9855936,0.00001475868,0.0007849444,0.0008265701,0.00001772361,0.0005662745,0.004888281],"genre_scores_gemma":[0.971972,0.000001768728,0.0275489,0.00003619632,0.0002180759,0.0001036331,0.00004980633,0.00003042375,0.00003914217],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646862,"threshold_uncertainty_score":0.6808018,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01986015426060464,"score_gpt":0.226568761575998,"score_spread":0.2067086073153933,"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."}}