{"id":"W2789886422","doi":"10.1109/tvt.2018.2808237","title":"Low Complexity and Fast Processing Algorithms for V2I Massive MIMO Uplink Detection","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Computer science; Telecommunications link; Computational complexity theory; Algorithm; Iterative method; Block (permutation group theory); Efficient energy use; Low latency (capital markets); Computer engineering; Real-time computing; Channel (broadcasting); Engineering; Telecommunications; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006179979,0.0001997237,0.000211606,0.000361461,0.0003058665,0.00002466159,0.0000992294,0.0003400921,0.000007220663],"category_scores_gemma":[0.00000648112,0.0002188288,0.00004738635,0.00042902,0.0002561465,0.0001660442,0.00000139343,0.0002521432,0.00001420971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001166493,"about_ca_system_score_gemma":0.0000118496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003927144,"about_ca_topic_score_gemma":0.00006045481,"domain_scores_codex":[0.9991053,0.00001071005,0.000232862,0.0003069251,0.00006784924,0.0002763915],"domain_scores_gemma":[0.9994862,0.00002042161,0.00005294595,0.000228533,0.0001656585,0.0000462221],"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.00003847487,0.00007308584,0.000003657292,0.0002687746,0.00007080667,0.00000387861,0.0001735257,0.2691413,0.1052557,0.0001065504,0.00001242656,0.6248519],"study_design_scores_gemma":[0.0004177984,0.0001615816,0.000003721219,0.00005156898,0.00002704949,0.00003283802,0.0001022447,0.5882053,0.4100848,0.0005337595,0.0002087632,0.0001705922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01873214,0.00009740255,0.9788001,0.0001165948,0.0004504974,0.0005628706,0.00001988319,0.001182752,0.00003777915],"genre_scores_gemma":[0.9481421,0.00002640577,0.05139316,0.00001568876,0.00006855999,0.0002561919,0.00000387414,0.00005818995,0.00003590015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9294099,"threshold_uncertainty_score":0.8923578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01445095976569383,"score_gpt":0.2431033366786443,"score_spread":0.2286523769129505,"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."}}