{"id":"W2156658126","doi":"10.1109/tcsi.2009.2035412","title":"Design Methodology for Nearly Linear-Phase Recursive Digital Filters by Constrained Optimization","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Control theory (sociology); Filter design; Digital filter; Filter (signal processing); Transfer function; Convergence (economics); Computer science; Adaptive filter; Cascade; Linear phase; Stability (learning theory); Design methods; Network synthesis filters; Prototype filter; Polynomial; Linear filter; Mathematical optimization; Mathematics; Algorithm; Electronic engineering; Engineering; Control (management)","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.0006291925,0.0006590108,0.0005763867,0.0004097346,0.0002876513,0.0006342059,0.0007875207,0.0005592384,0.003300223],"category_scores_gemma":[0.000953302,0.0004830831,0.0004994551,0.0004694345,0.0004213515,0.0004728932,0.000586364,0.0007022069,0.0008620084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004385421,"about_ca_system_score_gemma":0.0007867613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00115524,"about_ca_topic_score_gemma":0.001767236,"domain_scores_codex":[0.9996849,0.00007766354,0.00001450807,0.00004369203,0.0001619583,0.00001729907],"domain_scores_gemma":[0.9997773,0.00009553086,0.00003066768,0.00002161234,0.00006637663,0.000008611251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004582682,0.00004673977,0.0002281969,0.0003479163,0.00007485993,0.0001535361,0.000154648,0.6149842,0.05137679,0.14665,0.002098549,0.1838388],"study_design_scores_gemma":[0.00001990305,0.00006736528,0.00008939672,0.00002471407,0.00001617971,0.0001042015,0.00001156927,0.9694747,0.0058414,0.0125746,0.01175763,0.00001832222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003101419,0.0000273095,0.9991869,0.000009444799,0.000003245294,0.00001211672,0.000004155487,0.00004159522,0.0004049303],"genre_scores_gemma":[0.04992825,0.0002738007,0.9472077,0.00005645623,0.00001885648,0.0002807522,0.00004646749,0.00008173027,0.002105931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003300223,"threshold_uncertainty_score":0.01104033,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06026998769404746,"score_gpt":0.2979873278853047,"score_spread":0.2377173401912573,"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."}}