The Three-User Finite-Field Multi-Way Relay Channel with Correlated Sources

This paper studies the three-user finite-field multi-way relay channel, where the users exchange messages via a relay. The messages are arbitrarily correlated, and the finite-field channel is linear and is subject to additive noise of arbitrary distribution. The problem is to determine the minimum achievable source-channel rate, defined as channel uses per source symbol needed for reliable communication. We combine Slepian-Wolf source coding and functional-decode-forward channel coding to obtain the solution for two classes of source and channel combinations. Furthermore, for correlated sources that have their common information equal their mutual information, we propose a new coding scheme to achieve the minimum source-channel rate.

[1]  Soheil Mohajer,et al.  On source transmission over deterministic relay networks , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[2]  H. Vincent Poor,et al.  Energy-Distortion Tradeoffs in Gaussian Joint Source-Channel Coding Problems , 2012, IEEE Transactions on Information Theory.

[3]  Lawrence Ong,et al.  Multi-Way Relay Networks: Orthogonal Uplink, Source-Channel Separation and Code Design , 2012, IEEE Transactions on Communications.

[4]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[5]  Lawrence Ong,et al.  On the Equal-Rate Capacity of the AWGN Multiway Relay Channel , 2012, IEEE Transactions on Information Theory.

[6]  Lawrence Ong,et al.  An optimal coding strategy for the binary multi-way relay channel , 2010, IEEE Communications Letters.

[7]  Slawomir Stanczak,et al.  Achievable rates for the restricted half-duplex two-way relay channel under a partial-decode-and-forward protocol , 2008, 2008 IEEE Information Theory Workshop.

[8]  R. Knopp.  Two-Way Radio Networks with a Star Topology , 2006, 2006 International Zurich Seminar on Communications.

[9]  Gunter Dueck.  The Capacity Region of the Two-Way Channel Can Exceed the Inner Bound , 1979, Inf. Control..

[10]  H. Chernoff,et al.  A Central Limit Theorem for Sums of Interchangeable Random Variables , 1958 .

[11]  Gunter Dueck,et al.  A note on the multiple access channel with correlated sources , 1981, IEEE Trans. Inf. Theory.

[12]  Armin Wittneben,et al.  Spectral efficient protocols for half-duplex fading relay channels , 2007, IEEE Journal on Selected Areas in Communications.

[13]  Shi Jin,et al.  Outage Performance for Decode-and-Forward Two-Way Relay Network with Multiple Interferers and Noisy Relay , 2013, IEEE Transactions on Communications.

[14]  Andrea J. Goldsmith,et al.  Source and Channel Coding for Correlated Sources Over Multiuser Channels , 2008, IEEE Transactions on Information Theory.

[15]  Prakash Narayan,et al.  When Is a Function Securely Computable? , 2011, IEEE Trans. Inf. Theory.

[16]  Sumei Sun,et al.  Gaussian Two-Way Relay Channel with Private Information for the Relay , 2012, IEEE Transactions on Communications.

[17]  Natasha Devroye,et al.  Capacity bounds on multi-pair two-way communication with a base-station aided by a relay , 2010, 2010 IEEE International Symposium on Information Theory.

[18]  Masoud Salehi,et al.  Multiple access channels with arbitrarily correlated sources , 1980, IEEE Trans. Inf. Theory.

[19]  Alex J. Grant,et al.  Lossy Broadcasting in Two-Way Relay Networks with Common Reconstructions , 2010, ArXiv.

[20]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[21]  Aaron D. Wyner,et al.  Communicating via a processing broadcast satellite , 2002, IEEE Trans. Inf. Theory.

[22]  Salama Ikki,et al.  Performance Analysis of Two-Way Amplify-and-Forward Relaying in the Presence of Co-Channel Interferences , 2012, IEEE Transactions on Communications.

[23]  Andrea J. Goldsmith,et al.  The Multiway Relay Channel , 2013, IEEE Transactions on Information Theory.

[24]  Sachin Katti,et al.  Embracing wireless interference: analog network coding , 2007, SIGCOMM.

[25]  J. L. Massey.  Channel Models for Random-Access Systems , 1988 .

[26]  Lawrence Ong,et al.  The Capacity Region of the Restricted Two-Way Relay Channel with Any Deterministic Uplink , 2012, IEEE Communications Letters.

[27]  Lawrence Ong,et al.  Capacity Theorems for the AWGN multi-way relay channel , 2010, 2010 IEEE International Symposium on Information Theory.

[28]  Tracey Ho,et al.  Memoryless relay strategies for two-way relay channels , 2009, IEEE Transactions on Communications.

[29]  Ertem Tuncel,et al.  Slepian-Wolf coding over broadcast channels , 2006, IEEE Transactions on Information Theory.

[30]  J. Nayak,et al.  Rate regions for the separated two-way relay channel , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[31]  Lawrence Ong,et al.  The Capacity Region of Multiway Relay Channels Over Finite Fields With Full Data Exchange , 2011, IEEE Transactions on Information Theory.

[32]  H. Witsenhausen.  ON SEQUENCES OF PAIRS OF DEPENDENT RANDOM VARIABLES , 1975 .

[33]  Tobias J. Oechtering,et al.  Broadcast Capacity Region of Two-Phase Bidirectional Relaying , 2007, IEEE Transactions on Information Theory.

[34]  Armin Wittneben,et al.  Achievable Rate Regions for the Two-way Relay Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[35]  Te Sun Han,et al.  The Capacity Region of General Multiple-Access Channel with Certain Correlated Sources , 1979, Inf. Control..

[36]  Thomas M. Cover,et al.  A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .