{"id":"W2127238581","doi":"10.1109/vetec.1995.504900","title":"A PHASE algorithm for blind adaptive optimum diversity combining","year":2002,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Cyclostationary process; Computer science; Diversity combining; Interference (communication); Wireless; Sample matrix inversion; Computation; Adaptive filter; Rate of convergence; Computational complexity theory; Adaptive algorithm; Channel (broadcasting); Covariance matrix; Telecommunications; Fading; Decoding methods","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.0007033833,0.0007248945,0.000616018,0.0006880524,0.0003732948,0.0008835988,0.0007045134,0.0006956364,0.002517154],"category_scores_gemma":[0.002055098,0.0003322598,0.0005284625,0.0009299039,0.0006629984,0.001119461,0.0009934987,0.001053756,0.001360311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004357795,"about_ca_system_score_gemma":0.0008828974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005224621,"about_ca_topic_score_gemma":0.0005773214,"domain_scores_codex":[0.9994891,0.0001310361,0.00002680014,0.0000627875,0.0002590742,0.00003123415],"domain_scores_gemma":[0.9995447,0.000162134,0.00004400095,0.0000519534,0.0001761563,0.00002110943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001850178,0.0000514062,0.0004793055,0.0001566261,0.00006481469,0.00006622427,0.00007531883,0.1989219,0.02187348,0.1699855,0.005198224,0.6029422],"study_design_scores_gemma":[0.00005568695,0.0001334595,0.0002298683,0.00001733899,0.00001811538,0.0001772895,0.00001329292,0.942175,0.008143997,0.03522147,0.01378451,0.00003001795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006829491,0.00007385734,0.9985373,0.00003129339,0.0000283363,0.00001377446,0.000009645898,0.00007512423,0.0005477713],"genre_scores_gemma":[0.05551847,0.0004091626,0.9403251,0.00008051666,0.0001238698,0.0001800406,0.0001023185,0.0000694703,0.003191105],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002517154,"threshold_uncertainty_score":0.008420765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07690110843069478,"score_gpt":0.3032376360139325,"score_spread":0.2263365275832377,"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."}}