{"id":"W1673798896","doi":"10.1109/vtc.2002.1002913","title":"A low-complexity iterative multiuser receiver for turbo-coded MC-CDMA system","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Single antenna interference cancellation; Multiuser detection; Computer science; Rayleigh fading; Maximum a posteriori estimation; Turbo; Turbo code; Algorithm; Code division multiple access; Multipath propagation; Turbo equalizer; Iterative method; Interference (communication); Fading; Maximum likelihood sequence estimation; Computational complexity theory; Decoding methods; Electronic engineering; Maximum likelihood; Telecommunications; Estimation theory; Channel (broadcasting); Mathematics; Low-density parity-check code; Engineering; Statistics","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.0007831805,0.0001855113,0.0002464175,0.0001149034,0.0003440647,0.0003315988,0.001706906,0.0000932137,0.0000639331],"category_scores_gemma":[0.0001484395,0.0001551866,0.0001053535,0.0005500535,0.0001052156,0.0005675444,0.000316669,0.0002233844,0.0001512537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001813984,"about_ca_system_score_gemma":0.0001163239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003413122,"about_ca_topic_score_gemma":0.000064192,"domain_scores_codex":[0.9978046,0.0005131564,0.000332564,0.0004950349,0.0003695879,0.000485003],"domain_scores_gemma":[0.9971166,0.0005862004,0.00009738993,0.001567862,0.0004684792,0.0001634501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002571301,0.0001632016,0.0001343656,0.00007419936,0.0000380946,0.000004381448,0.001370163,0.000587709,0.000572931,0.982738,0.007461809,0.006829429],"study_design_scores_gemma":[0.001620832,0.00009549278,0.0006653566,0.000103969,0.000004570807,0.00001663796,0.0002384042,0.9593877,0.02182351,0.002859202,0.01274875,0.0004355802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007621718,0.00007225148,0.9676546,0.000888421,0.0002649532,0.001017297,0.00000642585,0.0004108391,0.02206351],"genre_scores_gemma":[0.802265,0.000007941816,0.1947412,0.0002076936,0.00003550698,0.0002081545,0.000005750015,0.00001554734,0.002513194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9798788,"threshold_uncertainty_score":0.6328326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06388497822428396,"score_gpt":0.3108655607120061,"score_spread":0.2469805824877221,"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."}}