{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008550036,0.0008187758,0.0006034658,0.0003128212,0.0002887903,0.000789199,0.0005679614,0.0008264013,0.001956539],"category_scores_gemma":[0.002835372,0.0004969643,0.000305614,0.0005509586,0.0006848661,0.0006287765,0.0007222219,0.0007303631,0.0007672295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008460399,"about_ca_system_score_gemma":0.001068762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002145338,"about_ca_topic_score_gemma":0.002494544,"domain_scores_codex":[0.9994432,0.0002526905,0.0000196297,0.0000647733,0.0001697189,0.00005001003],"domain_scores_gemma":[0.9991766,0.000563735,0.0000670078,0.00003501777,0.0001422873,0.00001529763],"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.0000508261,0.00002816126,0.000169109,0.00005812677,0.00002334281,0.00002575385,0.00005041706,0.9452732,0.003151523,0.01507539,0.0009723736,0.03512172],"study_design_scores_gemma":[0.000009434797,0.00001921654,0.0000506439,0.000003850428,0.00000425684,0.000006698011,0.000005259957,0.9935797,0.0008613377,0.004933007,0.0005210462,0.000005472713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006775714,0.0003792727,0.9890564,0.0001334651,0.00001971611,0.00002598427,0.00002693162,0.0001514081,0.003431149],"genre_scores_gemma":[0.4998933,0.001199335,0.4869274,0.0001762304,0.00009349723,0.0003658402,0.0001836359,0.0001608258,0.0109999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002145338,"threshold_uncertainty_score":0.006545305,"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."}}