Associate Professor Sarah Johnson

IEEE Machine-to-machine (M2M) constitutes the communication paradigm at the basis of Internet of Things (IoT) vision. M2M solutions allow billions of multi-role devices to communicate with each other or with the underlying data transport infrastructure without, or with minimal, human intervention. Current solutions for wireless transmissions originally designed for human-based applications thus require a substantial shift to cope with the capacity issues in managing a huge amount of M2M devices. In this paper, we consider the multiple access techniques as promising solutions to support a large number of devices in cellular systems with limited radio resources. We focus on non-orthogonal multiple access (NOMA) where, with the aim to increase the channel efficiency, the devices share the same radio resources for their data transmission. This has been shown to provide optimal throughput from an information theoretic point of view.We consider a realistic system model and characterize the system performance in terms of throughput and energy efficiency in a NOMA scenario with a random packet arrival model, where we also derive the stability condition for the system to guarantee the performance.

© The Institution of Engineering and Technology 2016. This study considers the optimisation of multi-edge type low-density parity-check (MET-LDPC) codes to maximise the decoding threshold. The authors propose an algorithm to jointly optimise the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees. This joint optimisation is particularly important for MET-LDPC codes as it is not clear a priori which structures will be good. Using several examples, they demonstrate that the MET-LDPC codes designed by the proposed joint optimisation algorithm exhibit improved decoding thresholds compared with previously reported MET-LDPC codes.

© 2017 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft. The maximum operational range of continuous variable quantum key distribution protocols has shown to be improved by employing high-efficiency forward error correction codes. Typically, the secret key rate model for such protocols is modified to account for the non-zero word error rate of such codes. In this paper, we demonstrate that this model is incorrect: firstly, we show by example that fixed-rate error correction codes, as currently defined, can exhibit efficiencies greater than unity. Secondly, we show that using this secret key model combined with greater than unity efficiency codes, implies that it is possible to achieve a positive secret key over an entanglement breaking channel - an impossible scenario. We then consider the secret key model from a post-selection perspective, and examine the implications for key rate if we constrain the forward error correction codes to operate at low word error rates.

© 2017 by the authors. We consider two-receiver broadcast channels where each receiver may know a priori some of the messages requested by the other receiver as receiver message side information (RMSI). We devise a general approach to leverage RMSI in these channels. To this end, we first propose a pre-coding scheme considering the general message setup where each receiver requests both common and private messages and knows a priori part of the private message requested by the other receiver as RMSI.We then construct the transmission scheme of a two-receiver channel with RMSI by applying the proposed pre-coding scheme to the best transmission scheme for the channel without RMSI. To demonstrate the effectiveness of our approach, we apply our pre-coding scheme to three categories of the two-receiver discrete memoryless broadcast channel: (i) channel without state; (ii) channel with states known causally to the transmitter; and (iii) channel with states known non-causally to the transmitter. We then derive a unified inner bound for all three categories. We show that our inner bound is tight for some new cases in each of the three categories, as well as all cases whose capacity region was known previously.

© 2015 IBRO. Sickness behaviors have become the focus of great interest in recent years as they represent a clear case of how peripheral disturbances in immune signaling can disrupt quite complex behaviors. In the current study, we were interested in examining whether we could identify any significant morphological disturbances in microglia associated with these sickness-like behaviors in adult male Sprague-Dawley rats. We chose lipopolysaccharide (LPS 100 µg/kg/i.p.), to induce sickness-like behaviors as it is the most well-validated approach to do so in rodents and humans. We were particularly interested in examining changes in microglia within the prefrontal cortex (PFC) as several recent neuroimaging studies have highlighted significant functional changes in this region following peripheral LPS administration. Paraformaldehyde-fixed tissue was collected from animals 24 h post LPS administration and labeled immunohistochemically with an antibody directed to bind to Iba-1, a protein known to be involved in the structural remodeling of microglia. To analyze changes, we have made use of two recently described image analysis procedures. The first is known as cumulative threshold spectra (CTS) analysis. The second involves the unsupervised digital reconstruction of microglia. We undertook these complementary analysis of microglial cells in the both the pre- and infralimbic divisions of the PFC. Our results indicated that microglial soma size was significantly enlarged, while cell processes had contracted slightly following LPS administration. To our knowledge this study is to first to definitely demonstrate substantial microglial disturbances within the PFC following LPS delivered at a dose that was sufficient to induce significant sickness-like behavior.

© 2015 IEEE. A source coding problem over a noiseless broadcast channel where the source is preinformed about the contents of the cache of all receivers, is an index coding problem. Furthermore, if each message is requested by one receiver, then we call this an index coding problem with a unicast message setting. This problem can be represented by a directed graph. In this paper, we first define a structure (we call generalized interlinked cycle (GIC)) in directed graphs. A GIC consists of cycles which are interlinked in some manner (i.e., not disjoint), and it turns out that the GIC is a generalization of cliques and cycles. We then propose a simple scalar linear encoding scheme with linear time encoding complexity. This scheme exploits GICs in the digraph. We prove that our scheme is optimal for a class of digraphs with message packets of any length. Moreover, we show that our scheme can outperform existing techniques, e.g., partial clique cover, local chromatic number, composite-coding, and interlinked cycle cover.

© 2015 IEEE. Intrinsic Optical Signal imaging is a technique which allows the visualisation and mapping of activity related changes within the brain with excellent spatial and temporal resolution. We analysed a variety of signal and image processing techniques applied to real mouse imaging data. The results were compared in an attempt to overcome the unique issues faced when performing the technique on mice and improve the understanding of post processing options available.

© 2015 IEEE. We study the index coding problem in the unicast message setting, i.e., where each message is requested by one unique receiver. This problem can be modeled by a directed graph. We propose a new scheme called interlinked cycle cover, which exploits interlinked cycles in the directed graph, for designing index codes. This new scheme generalizes the existing clique cover and cycle cover schemes. We prove that for a class of infinitely many digraphs with messages of any length, interlinked cycle cover provides an optimal index code. Furthermore, the index code is linear with linear time encoding complexity.

© 2015 IEEE. This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side information. We first propose a transmission scheme and derive an inner bound for the two-receiver memoryless broadcast channel. We next prove that this inner bound is tight for the deterministic channel and the more capable channel, thereby establishing their capacity regions.We show that this inner bound is also tight for all classes of two-receiver broadcast channels whose capacity regions were known prior to this work. Our proposed scheme is consequently a unified capacity-achieving scheme for these classes of broadcast channels.

This paper considers the finite-field multi-way relay channel with pairwise message sharing, where multiple users exchange messages through a single relay and where the users may share parts of their source messages (meaning that some message parts are known/common to more than one user). In this paper, we design an optimal functional-decode-forward coding scheme that takes the shared messages into account. More specifically, we design an optimal function for the relay to decode (from the users on the uplink) and forward (back to the users on the downlink). We then show that this proposed function-decode-forward coding scheme can achieve the capacity region of the finite-field multi-way relay channel with pairwise message sharing. This paper generalizes our previous result for the case of three users to any number of users. © 2014 IEEE.

This paper investigates the capacity region of three-receiver AWGN broadcast channels where the receivers (i) have private-message requests and (ii) know the messages requested by some other receivers as side information. We classify these channels based on their side information into eight groups, and construct different transmission schemes for the groups. For six groups, we characterize the capacity region, and show that it improves both the best known inner and outer bounds. For the remaining two groups, we improve the best known inner bound by using side information during channel decoding at the receivers. © 2014 IEEE.

In this paper low-density parity-check (LDPC) codes are considered for burst erasure channels. Multiple burst erasure correcting LDPC codes are constructed using superposition and the burst erasure correcting performances of the resulting codes are derived as a property of the stopping set size of the base matrices and the choice of permutation matrices for the superposition.

We investigate the effect of channel gain quantization on the information capacity of unknown time varying flat fading channels. The phase and/or amplitude of the flat fading channel gain is modelled as a finite state Markov (FSM) process and the information capacity of the FSM channel is calculated numerically as a measure for choosing the number of channel quantization levels, as well as quantization thresholds. The results indicate that for binary signalling, the capacity is saturated beyond 8 to 16 levels of phase and 8 to 16 levels of amplitude quantization.