Search arXivSearch

arXiv · 2108.07830

Higher Order Derivative-Based Receiver Pre-processing for Molecular Communications

Abstract

While molecular communication via diffusion experiences significant inter-symbol interference (ISI), recent work suggests that ISI can be mitigated via time differentiation pre-processing which achieves pulse narrowing. Herein, the approach is generalized to higher order differentiation. The fundamental trade-off between ISI mitigation and noise amplification is characterized, showing the existence of an optimal derivative order that minimizes the bit error rate (BER). Theoretical analyses of the BER and a signal-to-interference-plus-noise ratio are provided, the derivative order optimization problem is posed and solved for threshold-based detectors. For more complex detectors which exploit a window memory, it is shown that derivative pre-processing can strongly reduce the size of the needed window. Extensive numerical results confirm the accuracy of theoretical derivations, the gains in performance via derivative pre-processing over other methods and the impact of the optimal derivative order. Derivative pre-processing offers a low complexity/high-performance method for reducing ISI at the expense of increased transmission power to reduce noise amplification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mustafa Can Gursoy, Urbashi Mitra. 2021-08-17. Higher Order Derivative-Based Receiver Pre-processing for Molecular Communications. https://arxiv.org/abs/2108.07830

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT