{"paper":{"title":"Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chulong Liang, Li Ping, Stephan ten Brink, Xiaojie Wang","submitted_at":"2019-07-25T17:09:40Z","abstract_excerpt":"We establish a multiuser extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple access (IDMA) scheme, a special form of superposition coding, in multiple access channels (MACs). A low-cost multi-user detection (MUD) based on the Gaussian approximation (GA) is assumed. The evolution of mean-square errors (MSE) of the GA-based MUD during iterative processing is studied. We show that the K-dimensional tuples formed by the MSEs of K users constitute a conservative vector field. The achievable rate is a potential function of this conservative field, so it is t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11518","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}