{"id":"W2164633985","doi":"10.1109/iscas.2007.378108","title":"Adaptive Duplicated Filters and Interference Canceller for DS-CDMA Systems: Part I - Algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada; Max-Planck-Institut für Chemie","keywords":"Computer science; Interference (communication); Multiuser detection; Block (permutation group theory); Code division multiple access; Adaptive filter; Context (archaeology); Algorithm; Cascade; Reduction (mathematics); Single antenna interference cancellation; Spread spectrum; Field-programmable gate array; Electronic engineering; Telecommunications; Computer hardware; Mathematics; Engineering; Decoding methods","routes":{"ca_aff":true,"ca_fund":true,"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.0007960882,0.0001273978,0.0001648909,0.0001054347,0.0001565635,0.0001937351,0.001169587,0.00006910945,0.0000129722],"category_scores_gemma":[0.00002736255,0.0001094983,0.00003021815,0.0003517249,0.0001083422,0.0002915716,0.0005444819,0.0001634187,0.00001821621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007794445,"about_ca_system_score_gemma":0.00006111805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002665349,"about_ca_topic_score_gemma":0.00009509218,"domain_scores_codex":[0.998644,0.00007002174,0.0002767871,0.0003848865,0.0002069563,0.0004173492],"domain_scores_gemma":[0.998088,0.0005984489,0.00007795308,0.0008137495,0.0002560746,0.0001657565],"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.00006795455,0.000125531,0.0002355313,0.0000494024,0.0001011074,0.000009412552,0.001151031,0.000890599,0.0003490766,0.08292267,0.04069686,0.8734008],"study_design_scores_gemma":[0.0003289692,0.0001260935,0.0003649016,0.00005216911,0.00000208079,0.000009024488,0.0001992333,0.976872,0.0006760653,0.0001853656,0.02101102,0.0001730485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007736698,0.0005427726,0.9943666,0.000625261,0.0002047208,0.000522245,0.00000536499,0.0001482571,0.002811088],"genre_scores_gemma":[0.8718495,0.0001875949,0.1243066,0.0002135014,0.00009830489,0.0001936103,0.000006247128,0.00001542237,0.003129192],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9759814,"threshold_uncertainty_score":0.4465209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04953311286809217,"score_gpt":0.3004203186092611,"score_spread":0.250887205741169,"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."}}