{"id":"W2128369455","doi":"10.1109/vetecs.2007.538","title":"Convergence Speed of Iterative Multi-user Detection for Turbo-Coded CDMA","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Convergence (economics); Computer science; Turbo; Speedup; Algorithm; Turbo code; Turbo equalizer; Decoding methods; Iterative method; Code division multiple access; Interference (communication); Iterative and incremental development; Channel (broadcasting); Theoretical computer science; Telecommunications; Low-density parity-check code; Parallel computing; Engineering","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.002590222,0.000473284,0.0005258757,0.00115196,0.0004100341,0.0007279849,0.000428384,0.0005580428,0.0007944858],"category_scores_gemma":[0.02146365,0.0002319558,0.0003876004,0.0007121673,0.001082617,0.001032133,0.0006329727,0.0007567458,0.0001802164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001060562,"about_ca_system_score_gemma":0.0009440779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001840943,"about_ca_topic_score_gemma":0.0007972228,"domain_scores_codex":[0.9987665,0.000480952,0.00004774725,0.0001065016,0.0004474658,0.000150843],"domain_scores_gemma":[0.9837379,0.01268676,0.0007777804,0.0006347731,0.002018352,0.0001444752],"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.0003568221,0.00003204754,0.004335722,0.0001204639,0.00005997961,0.0001286736,0.0002813721,0.9307047,0.009430473,0.02183155,0.0003180972,0.0324001],"study_design_scores_gemma":[0.000004367969,0.00003497917,0.0006837141,0.000008757922,0.000006010834,0.0000604499,0.00001656969,0.9925992,0.003751948,0.002695682,0.0001262681,0.00001209119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4122537,0.001337809,0.5802655,0.0002474868,0.00005277917,0.00006224632,0.00006316695,0.0004102658,0.005307038],"genre_scores_gemma":[0.95672,0.0002985611,0.04198772,0.00002647847,0.00001106926,0.00003830868,0.00004948565,0.00008381833,0.0007845906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002590222,"threshold_uncertainty_score":0.01369858,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04828721281306724,"score_gpt":0.3381590687214145,"score_spread":0.2898718559083473,"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."}}