2015/03/11 by Selma Belhadj Amor, Amor, Selma Belhadj
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1503.03266
5 pages, 1 figure, submitted to the European Conference on Networks and Communications 2015 (EuCNC'2015), Paris, France
arxiv created 2015/03/11 · openalex publication_date 2015/03/11 · arxiv updated 2015/03/12 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
We propose a new coding scheme for the discrete memoryless two-user multi-access channel (MAC) with rate-limited feedback. Our scheme combines ideas from the Venkataramanan-Pradhan scheme for perfect feedback with ideas from the Shaviv-Steinberg scheme for rate-limited feedback. Our achievable region includes the Shaviv-Steinberg achievable region and this inclusion can be strict. For general MACs and for sufficiently large feedback rates, our scheme outperforms the Shaviv-Steinberg scheme as it achieves the same rate region as the Venkataramanan-Pradhan scheme for perfect feedback (which cannot be achieved by the Shaviv-Steinberg scheme). Furthermore, we numerically evaluate our achievable region with a specific (Gaussian) choice of random variables for the memoryless two-user Gaussian MAC. Our simulation results show that for some parameters of the Gaussian MAC and the feedback rate, our scheme achieves a strictly larger sum-rate than the Shaviv-Steinberg scheme.