Search arXivSearch

arXiv · 1611.00459

Asynchronous Peak Detection for Demodulation in Molecular Communication

Abstract

Molecular communication requires low-complexity symbol detection algorithms to deal with the many sources of uncertainty that are inherent in these channels. This paper proposes two variants of a high-performance asynchronous peak detection algorithm for a receiver that makes independent observations. The first variant has low complexity and measures the largest observation within a sampling interval. The second variant adds decision feedback to mitigate inter-symbol interference. Although the algorithm does not require synchronization between the transmitter and receiver, results demonstrate that the bit error performance of symbol-by-symbol detection using the first variant is better than using a single sample whose sampling time is chosen a priori. The second variant is shown to have performance comparable to that of an energy detector. Both variants of the algorithm demonstrate better resilience to timing offsets than that of existing detectors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adam Noel, Andrew W. Eckford. 2017-02-24. Asynchronous Peak Detection for Demodulation in Molecular Communication. https://arxiv.org/abs/1611.00459

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