{"id":"W2559813799","doi":"10.1049/iet-com.2016.1160","title":"Semidefinite further relaxation on likelihood ascent search detection algorithm for high‐order modulation in massive MIMO system","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"QAM; Algorithm; MIMO; Quadrature amplitude modulation; Relaxation (psychology); Computational complexity theory; Mathematics; Computer science; Detection theory; Spectral efficiency; Detector; Bit error rate; Channel (broadcasting); Telecommunications; Decoding methods","routes":{"ca_aff":true,"ca_fund":true,"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.0003531276,0.0001848905,0.0001892722,0.000311846,0.000180208,0.00002873021,0.0006357775,0.0001660808,0.000006656902],"category_scores_gemma":[0.00007524014,0.0001714974,0.00005429767,0.0004578217,0.00006274964,0.0002962357,0.0001219123,0.0002654554,0.00005400043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007346139,"about_ca_system_score_gemma":0.00002260437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004623521,"about_ca_topic_score_gemma":0.0001688889,"domain_scores_codex":[0.9987026,0.0001992072,0.0004525154,0.0002072804,0.0001774022,0.0002609279],"domain_scores_gemma":[0.9969428,0.0005990926,0.0001170756,0.002011324,0.0002754694,0.00005430196],"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.00001315409,0.0001117412,0.00009659577,0.00004431594,0.00003326945,2.222122e-7,0.0004721986,0.009286722,0.02711294,0.01038012,0.0000628571,0.9523858],"study_design_scores_gemma":[0.001858009,0.0001828298,0.007603963,0.0009927368,0.00002853243,0.000003893819,0.0006112132,0.8893161,0.08713296,0.007366658,0.004218441,0.0006846192],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008277696,0.0002524699,0.9868985,0.001355259,0.0001228527,0.001045871,0.00008019047,0.001023114,0.0009440767],"genre_scores_gemma":[0.8900909,0.0008779191,0.107679,0.00002233401,0.00003146376,0.001089598,0.0000959932,0.00006851616,0.00004422535],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9517012,"threshold_uncertainty_score":0.6993462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01967350818756038,"score_gpt":0.2685452292999823,"score_spread":0.2488717211124219,"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."}}