{"id":"W2150096652","doi":"10.1002/ett.2538","title":"Asymptotic optimal detection for MIMO communication systems employing tree search with incremental channel partition preprocessing","year":2012,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Computational complexity theory; Algorithm; Partition (number theory); Tree traversal; Preprocessor; Tree (set theory); Channel (broadcasting); Computer science; Mathematics; Variable (mathematics); Telecommunications","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005103585,0.0003303878,0.000289838,0.0006673735,0.001278015,0.0001037124,0.00102897,0.0002360955,0.000006114107],"category_scores_gemma":[0.00003829681,0.0003480926,0.00008906617,0.0009032152,0.000260548,0.001055677,0.00004638562,0.00075093,0.00001261691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004563327,"about_ca_system_score_gemma":0.00002235746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003536126,"about_ca_topic_score_gemma":0.00007736921,"domain_scores_codex":[0.9983183,0.0001231216,0.0005183365,0.0002547997,0.0002300431,0.0005553936],"domain_scores_gemma":[0.9970978,0.0003449903,0.0001421675,0.002159455,0.0001945449,0.00006096694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000939353,0.0006227599,0.0001780656,0.0002923748,0.0002971712,1.545972e-7,0.002005429,0.7396207,0.017572,0.00220192,0.00006716495,0.2370483],"study_design_scores_gemma":[0.001035657,0.0003567466,0.0003685465,0.0007278942,0.0001855399,0.00004721441,0.01575344,0.4861676,0.4907325,0.0005053755,0.002960688,0.001158809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05109514,0.002656582,0.9366721,0.0004044041,0.00007606108,0.001145859,0.00002240465,0.007442489,0.0004849605],"genre_scores_gemma":[0.8841632,0.002218152,0.1104616,0.00000803824,0.00001245752,0.002938723,0.00006974321,0.0001017291,0.00002640525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8330681,"threshold_uncertainty_score":0.9998971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02845499159316633,"score_gpt":0.2796036124450516,"score_spread":0.2511486208518852,"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."}}