Optimal Detection for Diffusion-Based Molecular Timing Channels

This work studies optimal detection for communication over diffusion-based molecular timing (DBMT) channels. The transmitter simultaneously releases multiple information particles, where the information is encoded in the time of release. The receiver decodes the transmitted information based on the random time of arrival of the information particles, which is modeled as an additive noise channel. For a DBMT channel without flow, this noise follows the L\'evy distribution. Under this channel model, the maximum-likelihood (ML) detector is derived and shown to have high computational complexity. It is also shown that under ML detection, releasing multiple particles improves performance, while for any additive channel with $\alpha$-stable noise where $\alpha<1$ (such as the DBMT channel), under linear processing at the receiver, releasing multiple particles degrades performance relative to releasing a single particle. Hence, a new low-complexity detector, which is based on the first arrival (FA) among all the transmitted particles, is proposed. It is shown that for a small number of released particles, the performance of the FA detector is very close to that of the ML detector. On the other hand, error exponent analysis shows that the performance of the two detectors differ when the number of released particles is large.Comment: 16 pages, 9 figures. Submitted for publicatio

ML Detection in Phase Noise Impaired SIMO Channels with Uplink Training

The problem of maximum likelihood (ML) detection in training-assisted single-input multiple-output (SIMO) systems with phase noise impairments is studied for two different scenarios, i.e. the case when the channel is deterministic and known (constant channel) and the case when the channel is stochastic and unknown (fading channel). Further, two different operations with respect to the phase noise sources are considered, namely, the case of identical phase noise sources and the case of independent phase noise sources over the antennas. In all scenarios the optimal detector is derived for a very general parametrization of the phase noise distribution. Further, a high signal-to-noise-ratio (SNR) analysis is performed to show that symbol-error-rate (SER) floors appear in all cases. The SER floor in the case of identical phase noise sources (for both constant and fading channels) is independent of the number of antenna elements. In contrast, the SER floor in the case of independent phase noise sources is reduced when increasing the number of antenna elements (for both constant and fading channels). Finally, the system model is extended to multiple data channel uses and it is shown that the conclusions are valid for these setups, as well.Comment: (To appear in IEEE Transactions on Communications, 2015), Contains additional material (Appendix B. T-slot Detectors

Demodulation and Detection Schemes for a Memoryless Optical WDM Channel

It is well known that matched filtering and sampling (MFS) demodulation together with minimum Euclidean distance (MD) detection constitute the optimal receiver for the additive white Gaussian noise channel. However, for a general nonlinear transmission medium, MFS does not provide sufficient statistics, and therefore is suboptimal. Nonetheless, this receiver is widely used in optical systems, where the Kerr nonlinearity is the dominant impairment at high powers. In this paper, we consider a suite of receivers for a two-user channel subject to a type of nonlinear interference that occurs in wavelength-division-multiplexed channels. The asymptotes of the symbol error rate (SER) of the considered receivers at high powers are derived or bounded analytically. Moreover, Monte-Carlo simulations are conducted to evaluate the SER for all the receivers. Our results show that receivers that are based on MFS cannot achieve arbitrary low SERs, whereas the SER goes to zero as the power grows for the optimal receiver. Furthermore, we devise a heuristic demodulator, which together with the MD detector yields a receiver that is simpler than the optimal one and can achieve arbitrary low SERs. The SER performance of the proposed receivers is also evaluated for some single-span fiber-optical channels via split-step Fourier simulations

Gaussian Belief Propagation Based Multiuser Detection

In this work, we present a novel construction for solving the linear multiuser detection problem using the Gaussian Belief Propagation algorithm. Our algorithm yields an efficient, iterative and distributed implementation of the MMSE detector. We compare our algorithm's performance to a recent result and show an improved memory consumption, reduced computation steps and a reduction in the number of sent messages. We prove that recent work by Montanari et al. is an instance of our general algorithm, providing new convergence results for both algorithms.Comment: 6 pages, 1 figures, appeared in the 2008 IEEE International Symposium on Information Theory, Toronto, July 200