Design and Optimizing of On-Chip Kinesin Substrates for Molecular Communication

Lab-on-chip devices and point-of-care diagnostic chip devices are composed of many different components such as nanosensors that must be able to communicate with other components within the device. Molecular communication is a promising solution for on-chip communication. In particular, kinesin driven microtubule (MT) motility is an effective means of transferring information particles from one component to another. However, finding an optimal shape for these channels can be challenging. In this paper we derive a mathematical optimization model that can be used to find the optimal channel shape and dimensions for any transmission period. We derive three specific models for the rectangular channels, regular polygonal channels, and regular polygonal ring channels. We show that the optimal channel shapes are the square-shaped channel for the rectangular channel, and circular-shaped channel for the other classes of shapes. Finally, we show that among all 2 dimensional shapes the optimal design choice that maximizes information rate is the circular-shaped channel.Comment: accepted for publication in IEEE Transactions on Nanotechnolog

A Unified Scheme for Two-Receiver Broadcast Channels with Receiver Message Side Information

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.Comment: accepted and to be presented at the 2015 IEEE International Symposium on Information Theory (ISIT 2015

Information transmission through a noisy quantum channel

Noisy quantum channels may be used in many information-carrying applications. We show that different applications may result in different channel capacities. Upper bounds on several of these capacities are proved. These bounds are based on the coherent information, which plays a role in quantum information theory analogous to that played by the mutual information in classical information theory. Many new properties of the coherent information and entanglement fidelity are proved. Two nonclassical features of the coherent information are demonstrated: the failure of subadditivity, and the failure of the pipelining inequality. Both properties arise as a consequence of quantum entanglement, and give quantum information new features not found in classical information theory. The problem of a noisy quantum channel with a classical observer measuring the environment is introduced, and bounds on the corresponding channel capacity proved. These bounds are always greater than for the unobserved channel. We conclude with a summary of open problems

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.Comment: Author's final version (accepted and to appear in IEEE Transactions on Communications