{"paper":{"title":"Multi-Source Transmission for Wireless Relay Networks with Linear Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Jafarkhani, Liangbin Li, Yindi Jing","submitted_at":"2010-07-20T00:38:03Z","abstract_excerpt":"This paper considers transmission schemes in multi-access relay networks (MARNs) where $J$ single-antenna sources send independent information to one $N$-antenna destination through one $M$-antenna relay. For complexity considerations, we propose a linear framework, where the relay linearly transforms its received signals to generate the forwarded signals without decoding and the destination uses its multi-antennas to fully decouple signals from different sources before decoding, by which the decoding complexity is linear in the number of sources. To achieve a high symbol rate, we first propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3315","kind":"arxiv","version":2},"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"}