{"id":"W2129451693","doi":"10.1109/spawc.2004.1439225","title":"A low complexity turbo detection for coded DS-CDMA systems in multipath channels at rake computational load","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Intersymbol interference; Algorithm; Rake receiver; Multiuser detection; Detector; Rake; Code division multiple access; Channel (broadcasting); Multipath propagation; Decoding methods; Maximum a posteriori estimation; Computational complexity theory; Single antenna interference cancellation; Turbo code; EXIT chart; Turbo; Detection theory; Real-time computing; Fading; Telecommunications; Mathematics; Maximum likelihood; Statistics; Concatenated error correction code; Block code; 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.0007185113,0.0006492825,0.0006706396,0.0006379794,0.0006167009,0.0008935853,0.000818468,0.0009131747,0.001928721],"category_scores_gemma":[0.002739649,0.0003962256,0.0004343855,0.000569457,0.0007328839,0.0009179898,0.0008049058,0.0009421926,0.001419975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007222896,"about_ca_system_score_gemma":0.001349829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194158,"about_ca_topic_score_gemma":0.002462359,"domain_scores_codex":[0.9991725,0.0001976809,0.00003685237,0.0000740416,0.0004614817,0.00005747474],"domain_scores_gemma":[0.9988075,0.0005208149,0.00006929299,0.0001217476,0.0004297985,0.00005077597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006832232,0.000156504,0.001977646,0.0004620828,0.0001850484,0.0006945283,0.0003063639,0.3083315,0.09569767,0.1126126,0.008234811,0.4706579],"study_design_scores_gemma":[0.00002406873,0.000199108,0.0002413895,0.00002396118,0.00003868833,0.0005099954,0.00001985501,0.9625539,0.02488402,0.006753514,0.004709183,0.00004232852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008030733,0.0003093189,0.9895067,0.0001001956,0.00004856771,0.00003370603,0.00003439247,0.0004445636,0.001491869],"genre_scores_gemma":[0.2958228,0.0006588118,0.6957628,0.0001634962,0.0001284364,0.0001344011,0.0001419989,0.00007419038,0.007113092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001928721,"threshold_uncertainty_score":0.006452203,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06463883706047872,"score_gpt":0.3126725706084933,"score_spread":0.2480337335480146,"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."}}