{"id":"W4396817504","doi":"10.1109/twc.2024.3392443","title":"Low Complexity SLP: An Inversion-Free, Parallelizable ADMM Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Key Science and Technology Program of Shaanxi Province; Queen's University Belfast; Horizon 2020 Framework Programme; Young Elite Scientists Sponsorship Program by Tianjin; Shaanxi Science and Technology Association; University of Patras; Queen's University; National Key Research and Development Program of China; University College London; Southeast University; National Natural Science Foundation of China; University of Manchester; National Mobile Communications Research Laboratory, Southeast University; Engineering and Physical Sciences Research Council","keywords":"Computational complexity theory; Computer science; Algorithm; Singular value decomposition; Precoding; Mathematical optimization; Inversion (geology); Rate of convergence; Parallelizable manifold; Mathematics; MIMO; Channel (broadcasting)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704515,0.001112792,0.0008299296,0.0003398366,0.0003231951,0.0007753918,0.001310729,0.0009394116,0.002316608],"category_scores_gemma":[0.001377058,0.0005187189,0.0005260181,0.0007300566,0.0007436696,0.0009981979,0.001255712,0.001735503,0.0008933818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004087388,"about_ca_system_score_gemma":0.001201096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001912185,"about_ca_topic_score_gemma":0.002111191,"domain_scores_codex":[0.9996367,0.0001019364,0.00001553126,0.00006275535,0.0001450956,0.00003795278],"domain_scores_gemma":[0.9995733,0.0001824048,0.00005149524,0.00006798532,0.0001008024,0.00002400513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008535637,0.00005398721,0.0002947153,0.0001943568,0.00004985749,0.0001570432,0.00009654689,0.860544,0.006740056,0.02842353,0.003390789,0.09996968],"study_design_scores_gemma":[0.00001257132,0.00002860668,0.00002192278,0.000004977956,0.000005023275,0.00003091536,0.000007137819,0.9936252,0.0008092934,0.004400174,0.001050054,0.000004150481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00141899,0.00008905889,0.997148,0.00008403796,0.00002093463,0.00001444785,0.00001728513,0.0001314229,0.001075968],"genre_scores_gemma":[0.2517088,0.0004877936,0.7424016,0.0003162438,0.0001425437,0.0002266021,0.0002473046,0.0001271506,0.00434198],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002316608,"threshold_uncertainty_score":0.007749796,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04108308614738084,"score_gpt":0.2652210186096169,"score_spread":0.2241379324622361,"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."}}