{"id":"W2584560421","doi":"10.1109/icecs.2016.7841180","title":"Performance analysis of a reduced complexity SCMA decoder exploiting a low-complexity maximum-likelihood approximation","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Decoding methods; Message passing; Soft-decision decoder; Computational complexity theory; Algorithm; Code (set theory); Exponential function; Parallel computing; Function (biology); Field-programmable gate array; Wireless; Implementation; Theoretical computer science; Set (abstract data type); Computer hardware; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001800185,0.000183584,0.0003848166,0.0004389859,0.00008491756,0.0000131951,0.0004862936,0.00009099871,0.0001898731],"category_scores_gemma":[0.00009111442,0.000144705,0.0001150086,0.001045182,0.0002338837,0.0004273923,0.0001493571,0.0001160817,0.00002323389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001269335,"about_ca_system_score_gemma":0.00001147684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001339084,"about_ca_topic_score_gemma":0.000055449,"domain_scores_codex":[0.9987783,0.00002877603,0.0004972111,0.0002106785,0.0001935245,0.0002915379],"domain_scores_gemma":[0.9986567,0.0001146815,0.0001407253,0.0009159971,0.0001268521,0.0000450336],"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.00004095985,0.0001778515,0.01159307,0.0003924216,0.0009282897,6.955798e-7,0.0006336142,0.03516256,0.3296402,0.01797564,0.00009855705,0.6033562],"study_design_scores_gemma":[0.0005044369,0.00002697493,0.03365769,0.0001181919,0.000100601,0.000001490802,0.0004262805,0.6092235,0.3434921,0.01202659,0.00003884811,0.0003833047],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.642132,0.00003518693,0.3547915,0.0001002149,0.00002186111,0.0001153801,0.00001342924,0.000873514,0.001916917],"genre_scores_gemma":[0.9168459,0.0001655645,0.0828611,0.000009445499,0.000007048954,0.00005320814,0.00001990568,0.00002358862,0.00001423214],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6029729,"threshold_uncertainty_score":0.5900898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04480828514830325,"score_gpt":0.2589351698253433,"score_spread":0.2141268846770401,"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."}}