{"id":"W1972111226","doi":"10.1109/tvt.2014.2380775","title":"Full-Duplex MIMO Precoding for Sum-Rate Maximization With Sequential Convex Programming","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; Maximization; Convex optimization; Mathematical optimization; Rate of convergence; MIMO; Mathematics; Algorithm; Convex function; Convergence (economics); Regular polygon; Computer science; Telecommunications; Beamforming","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.0008195122,0.0007852213,0.0007693047,0.0002812111,0.0002701099,0.0008069851,0.0006116282,0.0005018067,0.001565589],"category_scores_gemma":[0.002346257,0.0003894986,0.0005066635,0.0007452495,0.0005870988,0.0008301922,0.0006414127,0.0009584812,0.0003979083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000646393,"about_ca_system_score_gemma":0.001376561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001827498,"about_ca_topic_score_gemma":0.002162258,"domain_scores_codex":[0.9994357,0.0002294366,0.00001922215,0.00007017972,0.0002002369,0.00004522915],"domain_scores_gemma":[0.9990074,0.0006876577,0.00005839474,0.00006154011,0.0001614238,0.00002375567],"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.00004846444,0.00004345543,0.0002217626,0.00009056734,0.00002946101,0.0000519723,0.00005201132,0.9168214,0.003679627,0.02533725,0.00130679,0.05231727],"study_design_scores_gemma":[0.000002922904,0.00001496837,0.00001976685,0.000002580022,0.000001727745,0.00001053521,0.000004145237,0.995891,0.0007625142,0.002980794,0.0003073566,0.000001718095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003967721,0.00007833082,0.9946343,0.00005787177,0.00001063457,0.00001404623,0.00001399369,0.00005088996,0.001172363],"genre_scores_gemma":[0.4226539,0.0007588766,0.5708882,0.0001790433,0.00007712183,0.0002853784,0.0001533436,0.0001091772,0.004895066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001827498,"threshold_uncertainty_score":0.005237401,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01247713503605276,"score_gpt":0.2187978376185193,"score_spread":0.2063207025824665,"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."}}