{"id":"W2117301983","doi":"10.1109/iscas.2005.1465446","title":"A High-Throughput DLMS Adaptive Algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Algorithm; Throughput; Rate of convergence; Adaptive filter; Computer science; Computational complexity theory; Convergence (economics); Least mean squares filter; Adaptive algorithm; Algorithm design; Key (lock); Wireless; 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.000571056,0.0004563353,0.0003660725,0.0005460857,0.0003807365,0.0008447277,0.00087102,0.0006852631,0.003351115],"category_scores_gemma":[0.001709696,0.0002098299,0.0002834796,0.0005306683,0.0003954344,0.0007470456,0.0006443851,0.0009567823,0.001626522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007591864,"about_ca_system_score_gemma":0.001197763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002623994,"about_ca_topic_score_gemma":0.002916464,"domain_scores_codex":[0.9993987,0.00007647528,0.00003895544,0.0001117791,0.0003320138,0.00004205962],"domain_scores_gemma":[0.9994018,0.0001401705,0.00004487325,0.0001013409,0.0002818849,0.00002988274],"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.0003921695,0.0001212708,0.0009344907,0.000140473,0.00006597641,0.0001877907,0.000134704,0.1695831,0.07243363,0.02799626,0.008554226,0.719456],"study_design_scores_gemma":[0.0000814528,0.00008219449,0.0003501129,0.00001325917,0.00001743126,0.0001403013,0.00001640116,0.9587214,0.02491673,0.003721055,0.01191799,0.00002171417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00634396,0.0001715805,0.9884356,0.0001750922,0.0001061866,0.00006517788,0.00003034825,0.001205405,0.003466588],"genre_scores_gemma":[0.3511944,0.0004060538,0.6306801,0.0002572744,0.0001954278,0.0002194299,0.0002015145,0.00009681736,0.01674902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003351115,"threshold_uncertainty_score":0.01121062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01072197546343045,"score_gpt":0.2202882665909731,"score_spread":0.2095662911275427,"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."}}