{"id":"W2146863541","doi":"10.1109/newcas.2007.4488012","title":"A two-stage multi-path searcher for uplink WCDMA base station","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications link; Interleaving; Computer science; Base station; Rake receiver; Path (computing); Computational complexity theory; W-CDMA; Code division multiple access; Algorithm; Offset (computer science); Computer network; Decoding methods; Fading","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.0002905237,0.0003344507,0.000527964,0.0005271296,0.0003777957,0.0003859611,0.0007961577,0.0006109218,0.00247263],"category_scores_gemma":[0.0006714746,0.0002753445,0.0002404262,0.0003874619,0.0001664768,0.0005955183,0.0003586672,0.0006619368,0.000738544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004411594,"about_ca_system_score_gemma":0.0009476028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001053381,"about_ca_topic_score_gemma":0.002548111,"domain_scores_codex":[0.9997414,0.0000455873,0.00001784406,0.00005288129,0.0001167474,0.00002544842],"domain_scores_gemma":[0.9996237,0.0001213895,0.00006221382,0.00006781869,0.0001031702,0.00002172806],"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.0007500445,0.0001065028,0.001362593,0.0002690362,0.00007534034,0.0002581373,0.0001040199,0.02564048,0.2971797,0.006371075,0.002398958,0.6654841],"study_design_scores_gemma":[0.0001991851,0.0008985261,0.003892089,0.00004125218,0.0001164821,0.001799579,0.0000410879,0.6792779,0.293471,0.001642616,0.01852188,0.0000982584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03431297,0.000516817,0.9610606,0.0001276953,0.0000722796,0.0001107905,0.0000826535,0.00171858,0.00199768],"genre_scores_gemma":[0.3282627,0.0001931128,0.6649407,0.0001145171,0.00005323163,0.0001335808,0.0001308183,0.00004273163,0.006128729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00247263,"threshold_uncertainty_score":0.008271813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1121843794097331,"score_gpt":0.4016353584675721,"score_spread":0.289450979057839,"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."}}