{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006301791,0.0003227385,0.0004256368,0.0005032332,0.0002786145,0.0005593163,0.0005037608,0.0003210332,0.0008438974],"category_scores_gemma":[0.0025671,0.0001854567,0.000243881,0.0006642229,0.0005521549,0.0006630749,0.0007107208,0.0004107442,0.0002428815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000418481,"about_ca_system_score_gemma":0.001063852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001013619,"about_ca_topic_score_gemma":0.001902738,"domain_scores_codex":[0.999432,0.000204486,0.00002143756,0.00005795952,0.0002165387,0.00006752112],"domain_scores_gemma":[0.9988638,0.0007097714,0.0001336653,0.0001203778,0.0001388193,0.00003346916],"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.0006775048,0.0001368598,0.001904473,0.0001363555,0.00006477255,0.0001690858,0.0002021342,0.6596146,0.06014315,0.04655452,0.001924208,0.2284724],"study_design_scores_gemma":[0.00002071934,0.00008254172,0.0002729987,0.000003977505,0.000006170041,0.00004869809,0.00001244245,0.9857693,0.007304518,0.006115074,0.0003548571,0.000008705883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05183582,0.0001203007,0.94648,0.00006805461,0.00001312919,0.00002253878,0.00003415614,0.0003045175,0.001121394],"genre_scores_gemma":[0.6518865,0.00009761618,0.3469366,0.00007510633,0.00002257472,0.00004841863,0.000128283,0.00002514418,0.0007797212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001013619,"threshold_uncertainty_score":0.003332794,"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."}}