{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328402,0.0007271564,0.0006219649,0.0005040183,0.0003527381,0.0006004866,0.0007799389,0.0009346495,0.001940549],"category_scores_gemma":[0.001693277,0.0004016449,0.0004738534,0.0005791754,0.000584512,0.0008132972,0.0006058317,0.001091536,0.001353058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004495457,"about_ca_system_score_gemma":0.0009439623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002338863,"about_ca_topic_score_gemma":0.002884737,"domain_scores_codex":[0.9995766,0.0001214044,0.00001860147,0.00007469644,0.0001740523,0.00003463397],"domain_scores_gemma":[0.9996506,0.0001619612,0.00003870596,0.0000447538,0.00009427349,0.000009663653],"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.0002084863,0.00007497201,0.0004042005,0.0001910822,0.0001166576,0.0001404909,0.0001919703,0.349053,0.03262587,0.08218485,0.006427097,0.5283812],"study_design_scores_gemma":[0.00002367349,0.00002833926,0.000131234,0.000008851824,0.00001180726,0.00008642596,0.000008991263,0.9789593,0.007046076,0.008401926,0.005274535,0.00001879037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001332799,0.0001303696,0.9978655,0.00003680617,0.00002016406,0.00001068305,0.00001236542,0.0002658171,0.0003254466],"genre_scores_gemma":[0.04051779,0.000265673,0.9558887,0.0000612068,0.00003980258,0.00008882389,0.0001088079,0.0001106879,0.00291855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002338863,"threshold_uncertainty_score":0.00649178,"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."}}