{"id":"W2111124108","doi":"10.1109/iscas.2008.4541418","title":"The application of lattice-reduction to the K-Best algorithm for near-optimal MIMO detection","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Lattice reduction; Scalability; Computer science; Reduction (mathematics); MIMO; A priori and a posteriori; Algorithm; Very-large-scale integration; Lattice (music); Computational complexity theory; Communication complexity; Sorting; Random access; Parallel computing; Theoretical computer science; Mathematics; Channel (broadcasting); 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":[],"consensus_categories":[],"category_scores_codex":[0.0003522633,0.00005846773,0.00005130352,0.00002999765,0.0006737895,0.00005360497,0.0004163782,0.00002516577,0.000001038263],"category_scores_gemma":[0.00001404231,0.000034358,0.00006950266,0.0004040106,0.00007632079,0.0001262496,0.00005390142,0.00004717262,0.00001775942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009294054,"about_ca_system_score_gemma":0.00001692124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003377584,"about_ca_topic_score_gemma":0.00001491816,"domain_scores_codex":[0.9994394,0.00003616381,0.0001246468,0.0001632103,0.0001149939,0.0001215765],"domain_scores_gemma":[0.9993195,0.0001257344,0.00005401652,0.0003814688,0.00009113042,0.00002818218],"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.00001329538,0.00002953272,0.00000779457,0.000001623938,0.000009407564,4.558346e-8,0.000502898,0.0004300533,0.001664239,0.0386626,0.0001588291,0.9585197],"study_design_scores_gemma":[0.0002753588,0.0005123194,0.0005037943,0.000004937714,0.00001858061,0.00006427697,0.0004015256,0.8362313,0.05704206,0.01021094,0.09455814,0.0001767843],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02481494,0.00003495343,0.9732548,0.0009639335,0.00025239,0.0003526583,8.994263e-7,0.0000594974,0.0002659525],"genre_scores_gemma":[0.8608174,0.00001131614,0.1385792,0.00008935654,0.0001354986,0.000162639,5.742418e-7,0.00000487145,0.0001991464],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9583429,"threshold_uncertainty_score":0.5182312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01557417750224503,"score_gpt":0.2445723545596544,"score_spread":0.2289981770574094,"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."}}