{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622411,0.0006910767,0.0004391203,0.0002444565,0.0002453791,0.0006467803,0.0003107965,0.0004776701,0.001515174],"category_scores_gemma":[0.0008631709,0.000293849,0.0004436266,0.0004187917,0.0006171145,0.0007524338,0.0007891783,0.0008074674,0.000354767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003740054,"about_ca_system_score_gemma":0.0005410737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008401902,"about_ca_topic_score_gemma":0.001006411,"domain_scores_codex":[0.9997646,0.0000986709,0.000007466138,0.00002737062,0.00008164533,0.00002021243],"domain_scores_gemma":[0.9997571,0.000135433,0.00003215021,0.00002114923,0.00004101969,0.00001311423],"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.0000620281,0.00003021472,0.0001911526,0.0000824182,0.00003289444,0.00005825222,0.00005412349,0.8929663,0.009010532,0.06776547,0.001155944,0.02859057],"study_design_scores_gemma":[0.000005292885,0.00002273258,0.0000280318,0.000003467936,0.000002268268,0.00001186801,0.00000578508,0.9895909,0.0006887006,0.009167051,0.0004702358,0.000003601464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008165833,0.0002272557,0.9888776,0.0001016505,0.00001712687,0.00001527349,0.00001758132,0.00006591051,0.002511726],"genre_scores_gemma":[0.5400395,0.0007215875,0.454987,0.00010941,0.00006430924,0.000151683,0.0001048505,0.00006486266,0.003756835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001515174,"threshold_uncertainty_score":0.005068779,"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."}}