{"id":"W2130498245","doi":"10.1109/tsp.2002.808112","title":"Blind constant modulus equalization via convex optimization","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Blind equalization; Constant (computer programming); Convex optimization; Modulus; Mathematics; Computer science; Mathematical optimization; Equalization (audio); Signal processing; Regular polygon; Applied mathematics; Algorithm; Digital signal processing","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.0009704808,0.0009502419,0.0008506467,0.0004243588,0.0002855302,0.000923306,0.0006998362,0.00066945,0.001906186],"category_scores_gemma":[0.002747852,0.0002980838,0.0004758588,0.0006696727,0.001124184,0.001489519,0.001111528,0.001230506,0.0007415882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005258319,"about_ca_system_score_gemma":0.0008846135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001010744,"about_ca_topic_score_gemma":0.0008464221,"domain_scores_codex":[0.9993705,0.0002339615,0.00002403031,0.0001017745,0.0002254916,0.00004415789],"domain_scores_gemma":[0.999295,0.0004797331,0.00005643636,0.00005321425,0.00009917215,0.00001632932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000123639,0.00005836162,0.0001865295,0.0001574946,0.00004618999,0.00008632225,0.00005860747,0.7566218,0.008220647,0.1036081,0.002425711,0.1284067],"study_design_scores_gemma":[0.000008949786,0.0000215219,0.00002937647,0.000004488564,0.000003757255,0.00002148606,0.000004943938,0.9827495,0.002010787,0.01429068,0.0008501954,0.000004422272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001452914,0.00005477179,0.9976375,0.00005357903,0.000009066554,0.000007545481,0.000006807887,0.00005379648,0.0007240347],"genre_scores_gemma":[0.2407338,0.0007844951,0.750922,0.0001818282,0.0001443733,0.0001631825,0.0001651443,0.0001663351,0.00673885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001906186,"threshold_uncertainty_score":0.006376803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02890498679912284,"score_gpt":0.2770447839136855,"score_spread":0.2481397971145627,"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."}}