{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003911004,0.0003959987,0.0006787899,0.0004355224,0.0004988111,0.0007299686,0.0007833891,0.000462006,0.00249124],"category_scores_gemma":[0.001163027,0.0002210938,0.0004170654,0.0005813811,0.0006313951,0.000778931,0.0008405229,0.0007643277,0.001165215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004314454,"about_ca_system_score_gemma":0.0009872717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007240208,"about_ca_topic_score_gemma":0.001495607,"domain_scores_codex":[0.9995909,0.0001453488,0.0000188113,0.00004985897,0.0001502895,0.00004474908],"domain_scores_gemma":[0.9996561,0.0001411642,0.00003050058,0.00008880396,0.00006201035,0.00002146438],"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.0004317688,0.0002048925,0.0006925779,0.0002615498,0.00008799356,0.0003129837,0.0001795108,0.1999496,0.09568813,0.1539561,0.007033812,0.541201],"study_design_scores_gemma":[0.00004972731,0.0001559872,0.0001457703,0.00001409583,0.00001351344,0.0004149074,0.00003155099,0.9225341,0.03641574,0.03400762,0.006175037,0.00004188426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0102212,0.0001488229,0.9854776,0.0001177201,0.00004841352,0.00002968014,0.00003008708,0.0005545211,0.003371921],"genre_scores_gemma":[0.1961115,0.000133598,0.8011283,0.00008160195,0.00003645277,0.00006029185,0.00007847913,0.00005059557,0.002319208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00249124,"threshold_uncertainty_score":0.008334041,"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."}}