{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001634608,0.001024867,0.000944188,0.0003387136,0.0002621993,0.0008073462,0.0007451092,0.0009214819,0.002883733],"category_scores_gemma":[0.004018354,0.0004779778,0.0006442824,0.0004536367,0.0008756191,0.001070209,0.001095069,0.0020444,0.0006633486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005592366,"about_ca_system_score_gemma":0.001090242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001487177,"about_ca_topic_score_gemma":0.001131768,"domain_scores_codex":[0.9991409,0.0004076519,0.00003707812,0.0001176328,0.0002220304,0.00007480892],"domain_scores_gemma":[0.9983112,0.001077586,0.0001492938,0.0001096258,0.0002902056,0.00006214013],"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.0002776801,0.00008498836,0.0004862976,0.0002206546,0.00004882608,0.0001536702,0.0001612503,0.8658862,0.01169955,0.05183835,0.003605257,0.06553724],"study_design_scores_gemma":[0.00001214769,0.00003084596,0.00003018949,0.000003941947,0.000001712396,0.00001809944,0.000004110595,0.9964365,0.0007366182,0.002408329,0.0003125051,0.000004920321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004809143,0.00009659887,0.9938916,0.0001306772,0.0000183201,0.00002211819,0.00002368151,0.0001008046,0.0009070026],"genre_scores_gemma":[0.3549196,0.0004248811,0.6377057,0.0003932268,0.00008049592,0.000290281,0.0002922965,0.0001307,0.005762795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002883733,"threshold_uncertainty_score":0.009647071,"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."}}