{"id":"W2100032763","doi":"10.1109/tcsi.2005.846225","title":"Multiuser detectors for synchronous DS-CDMA systems based on a recursive p-norm convex relaxation approach","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Detector; Semidefinite programming; Code division multiple access; Multiuser detection; Computer science; Convex optimization; Relaxation (psychology); Algorithm; Norm (philosophy); Interference (communication); Mathematical optimization; Regular polygon; Mathematics; Telecommunications","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.001285965,0.0006724775,0.0008452023,0.0003389407,0.0002027831,0.0008034207,0.0008606173,0.0006381955,0.001056479],"category_scores_gemma":[0.00294391,0.0004899167,0.0007048576,0.0004787331,0.000590108,0.001035331,0.0006734006,0.001450943,0.0003388407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006812477,"about_ca_system_score_gemma":0.001064605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001023554,"about_ca_topic_score_gemma":0.001549083,"domain_scores_codex":[0.9992079,0.0003278195,0.00003080517,0.000105702,0.0002679328,0.00005989666],"domain_scores_gemma":[0.9988116,0.0007425874,0.0001141495,0.0000903996,0.0002033122,0.00003781917],"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.0001380793,0.00007785367,0.0004106344,0.0001579418,0.00005887361,0.0001320736,0.0001176373,0.7666349,0.01769676,0.08145694,0.00257727,0.130541],"study_design_scores_gemma":[0.000007684106,0.00002223415,0.00003893253,0.000002738536,0.000003395135,0.00002003064,0.000003945162,0.9939599,0.001584572,0.003887862,0.000462628,0.000005980742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003520804,0.00008300532,0.995631,0.00007913024,0.000007153469,0.0000137521,0.0000157649,0.00006898105,0.0005804296],"genre_scores_gemma":[0.2065869,0.0004127808,0.7897401,0.0001628184,0.00004721558,0.0001739146,0.0001335295,0.00006198758,0.002680721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001285965,"threshold_uncertainty_score":0.00680095,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02607812354241723,"score_gpt":0.269264148010722,"score_spread":0.2431860244683047,"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."}}