arXiv subjects

Christopher M. Kellett

Publications and source records attributed to Christopher M. Kellett.

25 records · Page 2Linked to original sources

arXiv2011

Joint Channel-Network Coding Strategies for Networks with Low Complexity Relays

We investigate joint network and channel coding schemes for networks when relay nodes are not capable of performing channel coding operations. Rather, channel encoding is performed at the source node while channel decoding is done only at the destination nodes. We examine three different decoding strategies: independent network-then-channel decoding, serial network and channel decoding, and joint network and channel decoding. Furthermore, we describe how to implement such joint network and channel decoding using iteratively decodable error correction codes. Using simple networks as a model, we derive achievable rate regions and use simulations to demonstrate the effectiveness of the three decoders.

cs.IT↗

arXiv2011

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

The three-user finite field multi-way relay channel with correlated sources is considered. The three users generate possibly correlated messages, and each user is to transmit its message to the two other users reliably in the Shannon sense. As there is no direct link among the users, communication is carried out via a relay, and the link from the users to the relay and those from the relay to the users are finite field adder channels with additive noise of arbitrary distribution. The problem is to determine the set of all possible achievable rates, defined as channel uses per source symbol for reliable communication. For two classes of source/channel combinations, the solution is obtained using Slepian-Wolf source coding combined with functional-decode-forward channel coding.

cs.IT↗

arXiv2011

On Achievable Rate Regions of the Asymmetric AWGN Two-Way Relay Channel

This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different power levels. We modify and improve existing coding schemes to obtain three new achievable rate regions. Comparing four downlink-optimal coding schemes, we show that the scheme that gives the best sum-rate performance is (i) complete-decode-forward, when both users transmit at low signal-to-noise ratio (SNR); (ii) functional-decode-forward with nested lattice codes, when both users transmit at high SNR; (iii) functional-decode-forward with rate splitting and time-division multiplexing, when one user transmits at low SNR and another user at medium--high SNR.

cs.IT↗

arXiv2011

The Capacity Region of Multiway Relay Channels Over Finite Fields with Full Data Exchange

The multi-way relay channel is a multicast network where L users exchange data through a relay. In this paper, the capacity region of a class of multi-way relay channels is derived, where the channel inputs and outputs take values over finite fields. The cut-set upper bound to the capacity region is derived and is shown to be achievable by our proposed functional-decode-forward coding strategy. More specifically, for the general case where the users can transmit at possibly different rates, functional-decode-forward, combined with rate splitting and joint source-channel decoding, is proved to achieve the capacity region; while for the case where all users transmit at a common rate, rate splitting and joint source-channel decoding are not required to achieve the capacity. That the capacity-achieving coding strategies do not utilize the users' received signals in the users' encoding functions implies that feedback does not increase the capacity region of this class of multi-way relay channels.

cs.IT↗

arXiv2010

The Binary-Symmetric Parallel-Relay Network

We present capacity results of the binary-symmetric parallel-relay network, where there is one source, one destination, and K relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals, achieve the capacity in two ways: with coded transmission at the source and a finite number of relays, or uncoded transmission at the source and a sufficiently large number of relays. On the other hand, decoding relays, where the relays decode the source message, re-encode, and forward it to the destination, achieve the capacity when the number of relays is small.

cs.IT↗

arXiv2010

Capacity Theorems for the AWGN Multi-Way Relay Channel

The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and compress-forward are shown to be bounded away from the cut-set upper bound at high signal-to-noise ratios (SNR). It is known that the gap between the compress-forward rate and the capacity upper bound is a constant at high SNR, and that between the complete-decode-forward rate and the upper bound increases with SNR at high SNR. In this paper, a functional-decode-forward coding strategy is proposed. It is shown that for L >= 3, complete-decode-forward achieves the capacity when SNR <= 0 dB, and functional-decode-forward achieves the capacity when SNR >= 0 dB. For L=$, functional-decode-forward achieves the capacity asymptotically as SNR increases.

cs.IT↗

arXiv2010

An Optimal Coding Strategy for the Binary Multi-Way Relay Channel

We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the functional-decode-forward coding strategy, the relay decodes functions of the users' messages without needing to decode individual messages. The functions to be decoded by the relay are defined such that when the relay broadcasts the functions back to the users, every user is able to decode the messages of all other users.

cs.IT↗