{"id":"W2122315352","doi":"10.1109/ccece.2002.1012954","title":"Iterative semi-blind multiuser detection using subspace approach for MC-CDMA uplink","year":2003,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Telecommunications link; Multiuser detection; Code division multiple access; Single antenna interference cancellation; Subspace topology; Computer science; Iterative method; Interference (communication); Algorithm; Minimum mean square error; Synchronous CDMA; Spread spectrum; Electronic engineering; Mathematics; Telecommunications; Decoding methods; Statistics; Artificial intelligence; Channel (broadcasting); 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.0004894422,0.0003001129,0.0003899139,0.0003290146,0.0002727201,0.0003540674,0.0004454721,0.000488453,0.0006623956],"category_scores_gemma":[0.001707216,0.0001853028,0.0003118883,0.0004148251,0.0004267214,0.0004443367,0.0003649585,0.0003623157,0.0002352004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002975797,"about_ca_system_score_gemma":0.0005481978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001803134,"about_ca_topic_score_gemma":0.00189298,"domain_scores_codex":[0.99963,0.0001655376,0.00001397711,0.00002608222,0.0001375889,0.00002681744],"domain_scores_gemma":[0.9993499,0.0003759283,0.0000606733,0.00006066023,0.0001358157,0.00001705136],"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.0001685207,0.00004934966,0.0006505232,0.0001276585,0.00006330558,0.00009975467,0.0001637224,0.7770312,0.02419511,0.02962529,0.001039269,0.1667863],"study_design_scores_gemma":[0.000003909267,0.00002037209,0.0000641173,0.000001978986,0.000003343046,0.00003284446,0.000004595063,0.9944358,0.002758134,0.002342004,0.0003258916,0.000006983279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01085644,0.0002511093,0.988036,0.00003991995,0.000007841566,0.00001267282,0.000007892622,0.0001643169,0.0006236443],"genre_scores_gemma":[0.4671156,0.0005415209,0.53009,0.00005759979,0.00003853886,0.00009752504,0.00005105998,0.00003119383,0.001977005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001803134,"threshold_uncertainty_score":0.003585339,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09056730943410565,"score_gpt":0.3386432882020345,"score_spread":0.2480759787679288,"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."}}