Noisy analog network coding for the two-way relay channel
2011 (English)In: Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 2011, 2065-2069 p.Conference paper (Refereed)
An achievable rate region based on Shannon’s inner bound is given for the two-way relay channel. The relaying scheme operates on noisy received signals and generates new analog values to be transmitted to a destination. The scheme is therefore referred to as noisy analog network coding. The achievable rates are then optimized for a Gaussian two-way relay channel, when the relay is memoryless (this type of relaying is also known as instantaneous relaying). For one particular instance of the channel when the received signal at the relay is noiseless, it is shown that instantaneous noisy analog network coding can be optimal. For the noisy case, a numerical optimization algorithm is presented in order to optimize the instantaneous coding strategy. The optimized analog mapping turns out to be nonlinear and periodic. Finally, it is demonstrated that the achievable rates associated with optimized mappings can outperform those achieved by linear relaying, compress-and-forward, and can operate close to the recently proposed noisy network coding scheme.
Place, publisher, year, edition, pages
2011. 2065-2069 p.
IdentifiersURN: urn:nbn:se:kth:diva-59957DOI: 10.1109/ISIT.2011.6033919ISI: 000297465102069ScopusID: 2-s2.0-80054823727ISBN: 978-1-4577-0596-0OAI: oai:DiVA.org:kth-59957DiVA: diva2:476789
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011; St. Petersburg; 31 July 2011 through 5 August 2011
QC 201201132012-01-122012-01-122012-04-03Bibliographically approved