{"id":"W1979837465","doi":"10.1016/j.sigpro.2014.06.003","title":"A low-complexity variable forgetting factor constant modulus RLS algorithm for blind adaptive beamforming","year":2014,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; Department of Education of Zhejiang Province; National Natural Science Foundation of China","keywords":"Recursive least squares filter; Constant (computer programming); Adaptive beamformer; Beamforming; Algorithm; Mathematics; Computational complexity theory; Convexity; Mean squared error; Variable (mathematics); Adaptive filter; Control theory (sociology); Computer science; Mathematical optimization; Statistics; Artificial intelligence; Mathematical analysis","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.0008838279,0.001101597,0.0006847049,0.0006017052,0.000349217,0.0008167221,0.001364672,0.001023773,0.006592413],"category_scores_gemma":[0.002780413,0.0004301173,0.0006331794,0.001007895,0.0006388963,0.001199918,0.000940231,0.001798654,0.004334931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004640124,"about_ca_system_score_gemma":0.001243755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002108391,"about_ca_topic_score_gemma":0.003366635,"domain_scores_codex":[0.9992906,0.0001638805,0.00005322879,0.0001097808,0.0003384806,0.00004402074],"domain_scores_gemma":[0.9992599,0.0002613781,0.00004796018,0.0001384916,0.0002612133,0.00003103863],"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.0004299794,0.0001139103,0.0002747125,0.0002093,0.00008609665,0.00008093741,0.0001018907,0.06648029,0.06505904,0.03233327,0.008744709,0.8260859],"study_design_scores_gemma":[0.00007810917,0.0001346374,0.0002309124,0.00003591797,0.00003640852,0.0001803192,0.0000195723,0.9492865,0.02418811,0.009364492,0.01639773,0.00004739282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008036494,0.0001596741,0.9980265,0.00005531071,0.00006552605,0.00001347303,0.00001825964,0.0003272293,0.0005303168],"genre_scores_gemma":[0.03294035,0.000324554,0.9621875,0.000123196,0.0001202538,0.00007976584,0.0001610939,0.0001102132,0.003953185],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006592413,"threshold_uncertainty_score":0.02205384,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03330700995063559,"score_gpt":0.2619760045008315,"score_spread":0.2286689945501959,"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."}}