{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004508517,0.0002085938,0.0002528259,0.0001401945,0.0002441244,0.000538226,0.000250879,0.0001327936,0.0000129127],"category_scores_gemma":[0.00003713457,0.0001986514,0.00009169558,0.0001944458,0.0001114081,0.0008559343,0.00000165583,0.0001405572,0.000004248307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002744937,"about_ca_system_score_gemma":0.00008736658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008899106,"about_ca_topic_score_gemma":0.000001249293,"domain_scores_codex":[0.9985314,0.0001453332,0.0003549263,0.0004730381,0.0002000687,0.0002952163],"domain_scores_gemma":[0.9987623,0.0004728487,0.0001304768,0.0003064836,0.0001198484,0.0002080058],"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.0001206165,0.0004105952,0.000002042796,0.0001018276,0.0002989394,0.00001155483,0.00219848,0.04049326,0.3012657,0.008312283,0.002141111,0.6446436],"study_design_scores_gemma":[0.01109237,0.005151209,0.000005296229,0.000139892,0.0001733677,0.0005542794,0.001240993,0.8645205,0.09776131,0.001076659,0.01660438,0.001679697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001085851,0.00002534063,0.995846,0.0002409516,0.001194168,0.000949598,0.0001934676,0.0001165622,0.0003481075],"genre_scores_gemma":[0.9399071,0.00001607546,0.05849663,0.0002504005,0.000061038,0.0002177304,0.00005747114,0.00003356324,0.0009599569],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9388213,"threshold_uncertainty_score":0.8100771,"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."}}