{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007111707,0.0005613511,0.0006855851,0.0004406918,0.0003872664,0.0006343772,0.0009970195,0.001084063,0.001144284],"category_scores_gemma":[0.001542807,0.0003520897,0.0003853488,0.0003886324,0.000361482,0.0005426955,0.0005079434,0.0009050752,0.001079382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003092637,"about_ca_system_score_gemma":0.0008161892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009564288,"about_ca_topic_score_gemma":0.001183351,"domain_scores_codex":[0.9993041,0.0001889619,0.00003613617,0.00006267759,0.0003596396,0.00004860901],"domain_scores_gemma":[0.999299,0.0002311044,0.00006778186,0.00008665084,0.0002810892,0.00003423559],"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.0005048702,0.0001347018,0.002280783,0.0004069502,0.0002021004,0.0005426797,0.0003120898,0.3063655,0.2257664,0.0275593,0.004037831,0.4318869],"study_design_scores_gemma":[0.0000422208,0.000336499,0.0003578441,0.00001903672,0.00005377336,0.0005143542,0.00001166189,0.9555035,0.03741201,0.001280039,0.004422001,0.0000470594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01021602,0.0002631666,0.9877967,0.00007384706,0.0000359885,0.0000436375,0.00002114945,0.0004554385,0.001093985],"genre_scores_gemma":[0.32725,0.0003319902,0.6681392,0.0001256324,0.0001156786,0.0001488704,0.0000883105,0.00004298266,0.003757358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001144284,"threshold_uncertainty_score":0.003828049,"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."}}