Papers
Topics
Authors
Recent
Search
2000 character limit reached

Asynchronous Peak Detection for Demodulation in Molecular Communication

Published 2 Nov 2016 in cs.IT and math.IT | (1611.00459v2)

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.

Citations (21)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.