Title :
Non-linear network coding in two-way relaying discrete channels
Author :
Koike-Akino, Toshiaki ; Larsson, Peter ; Popovski, Petar ; Tarokh, Vahid
Author_Institution :
Sch. of Eng. & Appl. Sci., Harvard Univ., Cambridge, MA, USA
Abstract :
In this paper, we present optimal network coding which can maximize achievable rate region in two-way relaying discrete channels, where there are two communicating nodes and one relaying node. We focus on a low-complexity relaying protocol termed the detect-and-forward (DtF) scheme, in which the relaying node does not require channel decoding but detection. We first analyze the achievable rate region of any digital network coding function including non-linear types. We then search for the optimal network code in favor of maximizing two kinds of performance measures: the sum rate and the product rate. For high SNR regimes, linear network codes like the exclusive-or (XOR) function can offer the maximum-achievable rate region. Whereas, for low SNR regimes, it is verified that non-linear network codes like the negate-or (NOR) function can outperform linear codes due to the effect of error occurrence at the intermediate relaying node.
Keywords :
channel coding; network coding; nonlinear codes; routing protocols; telecommunication channels; NOR; XOR; channel detection; communicating nodes; detect-and-forward scheme; digital network coding function; exclusive-or function; linear network codes; low-complexity relaying protocol; negate-or function; nonlinear network coding; performance measures; product rate; relaying node; sum rate; two-way relaying discrete channels; AWGN; Communications technology; Decoding; Digital relays; Entropy; Modulation coding; Network coding; Protocols; Transmitters; Zinc;
Conference_Titel :
Wireless Communications & Signal Processing, 2009. WCSP 2009. International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-4856-2
Electronic_ISBN :
978-1-4244-5668-0
DOI :
10.1109/WCSP.2009.5371759