{"id":"W2151078383","doi":"10.1109/icct.1996.545076","title":"A reduced state Viterbi algorithm for multiuser detection in DS/CDMA systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Code division multiple access; Computer science; Viterbi algorithm; Asynchronous communication; Multiuser detection; Algorithm; Spread spectrum; Additive white Gaussian noise; Interference (communication); Time division multiple access; Detector; Computational complexity theory; Single antenna interference cancellation; Electronic engineering; Real-time computing; Telecommunications; Decoding methods; 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.0007131086,0.0004270379,0.0006170233,0.0005131764,0.0003573513,0.0007098257,0.001014705,0.0007283686,0.002224528],"category_scores_gemma":[0.002344595,0.0003653002,0.0002830582,0.000544033,0.0004967925,0.0007440151,0.0005196463,0.0009135712,0.001159635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007300667,"about_ca_system_score_gemma":0.001047404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002451102,"about_ca_topic_score_gemma":0.00243616,"domain_scores_codex":[0.9993405,0.0002713483,0.00002777395,0.00007904528,0.0002335125,0.00004790225],"domain_scores_gemma":[0.9993604,0.0003381472,0.00003619028,0.00007579927,0.0001728178,0.00001657674],"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.0003495915,0.0001027796,0.0007021864,0.0001979493,0.00007223259,0.00007796526,0.0001441178,0.4878184,0.02800388,0.06329268,0.003379781,0.4158584],"study_design_scores_gemma":[0.00002199804,0.00004589229,0.0001006386,0.000005495383,0.000007791685,0.0000252419,0.000004568995,0.9882626,0.004200211,0.005611378,0.001705068,0.000009093153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008202264,0.000338831,0.9895732,0.0001087472,0.00002894072,0.00003040572,0.00002971112,0.0005083634,0.001179595],"genre_scores_gemma":[0.3222333,0.000471781,0.6724839,0.0001285264,0.00006836056,0.0002018528,0.0002366751,0.00008905496,0.004086656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002451102,"threshold_uncertainty_score":0.007441819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04468500072520325,"score_gpt":0.2870438380766533,"score_spread":0.24235883735145,"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."}}