{"id":"W2158628801","doi":"10.1109/tcomm.2004.823584","title":"Optimization of Linear Iterative Interference-Cancellation Receivers for CDMA Communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Single antenna interference cancellation; Eigendecomposition of a matrix; Iterative method; Decorrelation; Convergence (economics); Interference (communication); Code division multiple access; Multiuser detection; Eigenvalues and eigenvectors; Computer science; Spread spectrum; Algorithm; Mathematics; Channel (broadcasting); Mathematical optimization; Telecommunications; Decoding methods","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004854237,0.0002201783,0.0002834282,0.0004464667,0.001149513,0.0001071754,0.005728461,0.0001473856,0.00002278597],"category_scores_gemma":[0.00004455081,0.0002439502,0.0001884824,0.001321525,0.0005012074,0.0007901242,0.00008996281,0.0005565772,0.00002687168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003080126,"about_ca_system_score_gemma":0.0003360833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009490155,"about_ca_topic_score_gemma":0.0003236911,"domain_scores_codex":[0.9979634,0.0004053541,0.000684126,0.0003542766,0.0003033034,0.0002894948],"domain_scores_gemma":[0.9908882,0.001083922,0.0003333953,0.006649364,0.0009251808,0.000119935],"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.00004232964,0.0007765177,0.000005667688,0.00002065182,0.00009028518,8.936441e-8,0.002626312,0.9164444,0.0006828525,0.05717529,0.00009553645,0.02204009],"study_design_scores_gemma":[0.001148101,0.0002660739,0.00002318779,0.0001787238,0.00002956054,0.000003593204,0.0002294658,0.9839244,0.009054444,0.002718618,0.002152641,0.0002711508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000161319,0.0002441724,0.9870881,0.008697104,0.0001769845,0.0009511834,0.00007613333,0.0002088305,0.002396218],"genre_scores_gemma":[0.5831197,0.002106757,0.4140794,0.00008147077,0.000009979703,0.000389336,0.00005148925,0.00001914206,0.0001426699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5829584,"threshold_uncertainty_score":0.999651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0832216226944393,"score_gpt":0.3406116210238397,"score_spread":0.2573899983294005,"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."}}