{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394645,0.0001697609,0.0002477347,0.0001896804,0.0002784925,0.0002449624,0.001180748,0.0001050797,0.00001929174],"category_scores_gemma":[0.00007446163,0.0001644822,0.00007466867,0.0005405901,0.00009709573,0.00047651,0.0005554353,0.0002153652,0.00009975666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007500012,"about_ca_system_score_gemma":0.0001233426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002794883,"about_ca_topic_score_gemma":0.00205685,"domain_scores_codex":[0.9977755,0.0002641849,0.0004560943,0.0004555412,0.0005924691,0.0004562247],"domain_scores_gemma":[0.9979713,0.0006263483,0.0001275959,0.0007261972,0.0004157996,0.0001327522],"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.00008577966,0.0003281036,0.0001922923,0.00007305399,0.00001829919,0.000002277623,0.000904381,0.9076347,0.0008385967,0.01523773,0.001334048,0.07335076],"study_design_scores_gemma":[0.001353572,0.00005175957,0.002051887,0.00003706332,0.000001036295,0.00001360086,0.00002290062,0.9912865,0.001705502,0.0006676336,0.002620262,0.0001883029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06941235,0.0001871228,0.9267743,0.001525325,0.0002852793,0.001111034,0.0000086689,0.0002352623,0.0004606819],"genre_scores_gemma":[0.9530279,0.0000111745,0.04574694,0.0001635959,0.000143836,0.0002846187,0.00002332556,0.00001456117,0.000584026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8836156,"threshold_uncertainty_score":0.6707389,"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."}}