{"id":"W2033243544","doi":"10.1109/newcas.2009.5290498","title":"Design of nearly linear-phase recursive digital filters by constrained optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Transfer function; Filter design; Control theory (sociology); Digital filter; Filter (signal processing); Convergence (economics); Network synthesis filters; Computer science; Adaptive filter; Block (permutation group theory); Cascade; Design methods; Prototype filter; Linear phase; Linear filter; Stability (learning theory); Mathematical optimization; Algorithm; Mathematics; 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.00008706895,0.0001052565,0.0001146691,0.00007087922,0.00003202044,0.0002605878,0.0003082046,0.0000292752,0.00004274142],"category_scores_gemma":[0.00003389546,0.00009791418,0.00003612256,0.0002652831,0.00003626184,0.00196239,0.00002472633,0.00003290711,0.00001324276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001783848,"about_ca_system_score_gemma":0.00004989544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002057507,"about_ca_topic_score_gemma":2.839388e-8,"domain_scores_codex":[0.9991343,0.00002656065,0.0002644433,0.0002141628,0.0001911824,0.0001693625],"domain_scores_gemma":[0.9994586,0.00006188166,0.0001042458,0.0001985089,0.000100838,0.00007589348],"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.0002000575,0.001281341,0.00002840569,0.00001413982,0.00007502573,0.00002119957,0.002083872,0.03509422,0.03530198,0.04673907,0.06342646,0.8157342],"study_design_scores_gemma":[0.002915276,0.00342696,0.00001631004,0.00002409099,0.000009324165,0.00001812776,0.000108342,0.926308,0.06144241,0.004802122,0.0005489931,0.000380003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004274859,0.000009087877,0.9933407,0.0004724183,0.00005429395,0.0002423768,0.00002458798,0.0000918431,0.005337181],"genre_scores_gemma":[0.5731358,0.000004955139,0.4254546,0.0006732891,0.00001439956,0.000003951109,0.0001125755,0.000005911102,0.000594531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8912138,"threshold_uncertainty_score":0.3992824,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02574440114219765,"score_gpt":0.2826519201936714,"score_spread":0.2569075190514737,"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."}}