{"id":"W2108595831","doi":"10.1109/milcom.1993.408534","title":"Recursive least squares algorithm for blind deconvolution of channels with cyclostationary inputs","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Cyclostationary process; Algorithm; Autocorrelation matrix; Autocorrelation; Cepstrum; Blind deconvolution; Channel (broadcasting); Computer science; Deconvolution; Blind equalization; Signal processing; Recursive least squares filter; Identifiability; Mathematics; Adaptive filter; Speech recognition; Digital signal processing; Statistics; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001547536,0.0000971402,0.000121804,0.0001649635,0.00006567316,0.00004633705,0.0002793716,0.0000570997,0.00003247475],"category_scores_gemma":[0.00001828682,0.00008260925,0.00003970445,0.0002854358,0.00004850734,0.0005891876,0.00004058295,0.00005382851,0.00001129626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002376125,"about_ca_system_score_gemma":0.00002882954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001072207,"about_ca_topic_score_gemma":0.000007150798,"domain_scores_codex":[0.9991853,0.00003938073,0.0001972627,0.0002399863,0.0001945662,0.0001434708],"domain_scores_gemma":[0.9991727,0.00009977667,0.0001316697,0.0002377952,0.0003114261,0.00004658171],"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.00007310474,0.0007609685,0.0002466344,0.00006496067,0.0001099436,0.00000688853,0.01181451,0.001271776,0.0006113686,0.391081,0.03010654,0.5638523],"study_design_scores_gemma":[0.001777215,0.001558337,0.0004215806,0.00006671912,0.00001344683,0.00003625101,0.0001865747,0.9016314,0.05834469,0.02934437,0.006204267,0.000415147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002487163,0.000054635,0.9930275,0.001729962,0.00006759622,0.0004399731,0.000008843168,0.000176376,0.002007945],"genre_scores_gemma":[0.2817688,0.0000169121,0.7166927,0.0004901325,0.00004093229,0.00008579931,0.00001282422,0.000009287295,0.0008825324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9003596,"threshold_uncertainty_score":0.3368708,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0270480241735992,"score_gpt":0.2578259139954264,"score_spread":0.2307778898218272,"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."}}