{"id":"W2119870830","doi":"10.1109/glocom.1994.512804","title":"Spread spectrum code phase acquisition using a cyclic accumulation matched filter","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"University of Saskatchewan","keywords":"Computer science; Matched filter; Direct-sequence spread spectrum; Code (set theory); Spread spectrum; Pseudorandom noise; Phase (matter); Data acquisition; Filter (signal processing); Algorithm; Electronic engineering; Real-time computing; Telecommunications; Code division multiple access; Engineering; Physics; Computer vision","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006256209,0.0002929349,0.0002551395,0.0005570382,0.0002936611,0.000410919,0.0004385221,0.0005920178,0.001546001],"category_scores_gemma":[0.001692692,0.0002042139,0.0001683743,0.0004853142,0.0003029518,0.0006799751,0.0004313845,0.000395806,0.000558768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003567597,"about_ca_system_score_gemma":0.0007248137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009180942,"about_ca_topic_score_gemma":0.001558854,"domain_scores_codex":[0.9996071,0.00006654476,0.00001853372,0.00005443234,0.0002122415,0.00004109795],"domain_scores_gemma":[0.999256,0.0002069969,0.00009349061,0.0001332287,0.0002735694,0.00003662584],"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.001122225,0.0002573057,0.004981188,0.0002158934,0.0001038792,0.00022069,0.0001172565,0.01863582,0.4127926,0.01714945,0.001856552,0.5425472],"study_design_scores_gemma":[0.0002378397,0.00160698,0.004782964,0.00003818413,0.0001200118,0.002491292,0.00002464683,0.3920026,0.5765562,0.002786797,0.01923024,0.0001222326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1235547,0.0004712203,0.8702364,0.0001749063,0.0001051902,0.0002191904,0.00008823587,0.001398528,0.003751577],"genre_scores_gemma":[0.5159335,0.0001963612,0.4800391,0.0001160328,0.0000466983,0.0000729012,0.00007992242,0.00001848477,0.003497033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001546001,"threshold_uncertainty_score":0.005171895,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.153594436390645,"score_gpt":0.3784283495808407,"score_spread":0.2248339131901957,"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."}}