{"id":"W1417226415","doi":"10.48550/arxiv.1504.03777","title":"Near-Optimal Hybrid Processing for Massive MIMO Systems via Matrix Decomposition","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Baseband; Precoding; MIMO; Singular value decomposition; Matrix decomposition; QR decomposition; Convex optimization; Matrix (chemical analysis); Computer science; Orthogonal matrix; Mathematical optimization; Signal processing; Algorithm; Control theory (sociology); Topology (electrical circuits); Mathematics; Regular polygon; Telecommunications; Physics; Eigenvalues and eigenvectors","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001835366,0.000450627,0.0005117878,0.0002157106,0.0001716118,0.0001689645,0.000393046,0.0003333903,0.000005336567],"category_scores_gemma":[0.00002000871,0.000584427,0.0001598825,0.0002442666,0.0000613824,0.0004543221,0.0001943882,0.0003811048,0.00003773073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000928193,"about_ca_system_score_gemma":0.0001451334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003939659,"about_ca_topic_score_gemma":0.00000495318,"domain_scores_codex":[0.9983919,0.00005686687,0.0003543695,0.0006939448,0.00007711635,0.0004258604],"domain_scores_gemma":[0.9985074,0.00005018207,0.0002892608,0.0004945472,0.0004631046,0.0001955027],"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.00005812514,0.0000207068,0.0000764611,0.001126322,0.00008862826,0.00005770491,0.000107219,0.9971696,0.000174974,0.0004110317,0.0005620272,0.0001471846],"study_design_scores_gemma":[0.0006843662,0.00003921421,0.000006010224,0.0003807006,0.0001699584,0.0000184273,0.0001492156,0.9964277,0.0002444644,0.0009213004,0.0003711091,0.0005875098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06906262,0.0006321169,0.9265451,0.000006293149,0.001127127,0.001245851,0.0001107954,0.0007459341,0.0005241036],"genre_scores_gemma":[0.9872307,0.00004818802,0.01142127,0.00000375582,0.0002556541,0.00001960124,0.0003208958,0.0001293324,0.0005706022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9181681,"threshold_uncertainty_score":0.9996607,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03389359703916214,"score_gpt":0.2085361066666459,"score_spread":0.1746425096274837,"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."}}