{"id":"W1656026913","doi":"10.1109/pimrc.1998.731444","title":"An adaptive filtering PN code acquisition scheme with improved acquisition based capacity in DS/CDMA","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Code division multiple access; Matched filter; Adaptive filter; Interference (communication); Filter (signal processing); Pseudorandom noise; Code (set theory); Offset (computer science); Electronic engineering; Spread spectrum; Algorithm; Computer network; 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.0005477977,0.0003288757,0.0002915145,0.0004185315,0.0003431366,0.000299497,0.000572384,0.0005944836,0.001004849],"category_scores_gemma":[0.001923464,0.0001495415,0.0001393807,0.0005441323,0.0006427355,0.0009190995,0.0004791739,0.0005125241,0.0002470239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004350529,"about_ca_system_score_gemma":0.0004693126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001650616,"about_ca_topic_score_gemma":0.001382174,"domain_scores_codex":[0.9995667,0.0001063747,0.00002445888,0.00006555355,0.0001717586,0.00006521819],"domain_scores_gemma":[0.9990354,0.0004409272,0.00009180733,0.0001238293,0.0002754234,0.00003260527],"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.0009055617,0.0001858144,0.001429864,0.0001753902,0.00003697954,0.0003589326,0.0001909638,0.1236993,0.3403057,0.03765934,0.002062694,0.4929894],"study_design_scores_gemma":[0.0000581491,0.0005512355,0.001133333,0.00002398568,0.00003593158,0.0005705385,0.000020665,0.8718483,0.1153754,0.004425941,0.005903753,0.00005272275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2129371,0.00120734,0.778316,0.0002568282,0.0001107104,0.0000800318,0.00006115057,0.001107295,0.005923498],"genre_scores_gemma":[0.8461471,0.000365617,0.1504507,0.00008902581,0.00009354423,0.00006033774,0.0000612002,0.00002519236,0.00270739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001650616,"threshold_uncertainty_score":0.003361523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06942003792934001,"score_gpt":0.26754955877043,"score_spread":0.19812952084109,"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."}}