Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Short Message Noisy Network Coding with Rate Splitting (1404.0061v3)

Published 31 Mar 2014 in cs.IT and math.IT

Abstract: Short message noisy network coding with rate splitting (SNNC-RS) encoding strategy is presented. It has been shown by Hou and Kramer that mixed cooperative strategies in which relays in favorable positions perform decode-and-forward (DF) and the rest of the relays perform short message noisy network coding (SNNC) can outperform noisy network coding (NNC). Our proposed strategy further improves the rate performance of such mixed SNNC-DF cooperative strategy. In the proposed scheme, superposition coding is incorporated into the SNNC encoding in order to facilitate partial interference cancellation at DF relays, thereby increasing the overall rate. To demonstrate gains of the proposed SNNC-RS strategy, the achievable rate is analyzed for the discrete memoryless two-relay network with one DF relay and one SNNC-RS relay and compared to the case without rate-splitting. The obtained rate is evaluated in the Gaussian two-relay network and gains over the rate achieved without rate splitting are demonstrated.

Citations (2)

Summary

We haven't generated a summary for this paper yet.