{"id":"W3079579528","doi":"10.1109/tcomm.2020.3018184","title":"On the Complexity Reduction of Uplink Sparse Code Multiple Access for Spatial Modulation","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmark (surveying); Decoding methods; Telecommunications link; Computational complexity theory; Reduction (mathematics); Bit error rate; Algorithm; Tree (set theory); Transmission (telecommunications); Code (set theory); Computer engineering; Theoretical computer science; Parallel computing; Mathematics; Computer network; Telecommunications","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005562657,0.000657481,0.0004093479,0.0004700215,0.0002665356,0.0006408591,0.0004627452,0.0003377445,0.001423088],"category_scores_gemma":[0.003412297,0.0001988869,0.0003852079,0.0007154086,0.0004520663,0.0007775294,0.0006634782,0.0007349215,0.0002913912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005722814,"about_ca_system_score_gemma":0.0008912635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001450484,"about_ca_topic_score_gemma":0.002589102,"domain_scores_codex":[0.9990921,0.0002561322,0.00002703893,0.00005860377,0.0005072888,0.00005888467],"domain_scores_gemma":[0.9982279,0.001203779,0.0000968084,0.0001681789,0.0002722994,0.00003107626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003295905,0.00009371741,0.001669156,0.0003328941,0.00007654757,0.0001901924,0.000189784,0.5687677,0.03838468,0.09646726,0.002452063,0.2910464],"study_design_scores_gemma":[0.000008476582,0.00007678734,0.0002372237,0.00001072837,0.000008960519,0.00008278639,0.00000958907,0.9857519,0.007139124,0.005051847,0.001613788,0.000008786922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02957585,0.001050834,0.9644364,0.0001729087,0.00003889546,0.00004099248,0.0000390165,0.0001935806,0.004451573],"genre_scores_gemma":[0.6066665,0.001754476,0.3878331,0.0001163798,0.0001001753,0.0001198598,0.0001894095,0.00008375318,0.003136476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001450484,"threshold_uncertainty_score":0.004760742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1990338196492995,"score_gpt":0.340194147862292,"score_spread":0.1411603282129925,"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."}}