{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004473678,0.000186556,0.0001685491,0.0002881047,0.0003886594,0.00033877,0.0002574039,0.0001273117,0.00009671276],"category_scores_gemma":[0.000006194462,0.0001923389,0.00006220531,0.0008180392,0.0000666746,0.001179899,0.000001347063,0.0002290018,0.00002288215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007789457,"about_ca_system_score_gemma":0.0002146397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004513933,"about_ca_topic_score_gemma":0.000003120975,"domain_scores_codex":[0.9984154,0.0002035789,0.0003632499,0.000405587,0.0003796406,0.0002326045],"domain_scores_gemma":[0.9991785,0.00005952333,0.000162601,0.0002495346,0.0002548089,0.00009507202],"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.00003161554,0.0002654803,0.00000265675,0.00003212427,0.00001793516,0.000004638211,0.001341938,0.8903536,0.006024852,0.01032077,0.0000393665,0.09156498],"study_design_scores_gemma":[0.0004533812,0.00009388717,7.041439e-7,0.00004295939,0.00001165266,0.00002424164,0.00003548008,0.8242632,0.1720926,0.002524137,0.000231777,0.0002260225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001999923,0.00005406162,0.9957232,0.0001947052,0.0001603647,0.0002658094,0.000001898128,0.0005889559,0.002810996],"genre_scores_gemma":[0.862374,0.00001114974,0.1368053,0.0005801792,0.00001088669,0.00003730176,0.000002071532,0.00001917768,0.0001599317],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.862174,"threshold_uncertainty_score":0.7843353,"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."}}