Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Christophe Jardin

dblp:125/2137 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2016
0000-0003-1627-6960ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.212016
Channel Estimation for Diffusive Molecular Communications · IEEE Trans. Commun. 2016
Physical-layer communications › channel estimation › channel parameter estimation
channel impulse response estimation
0.212016
Channel Estimation for Diffusive Molecular Communications · IEEE Trans. Commun. 2016
Physical-layer communications
molecular communication
0.212016
Channel Estimation for Diffusive Molecular Communications · IEEE Trans. Commun. 2016
Physical-layer communications › channel estimation
training-based estimation
0.212016
Channel Estimation for Diffusive Molecular Communications · IEEE Trans. Commun. 2016
Physical-layer communications
equalization and detection
0.112016
Channel Estimation for Diffusive Molecular Communications · IEEE Trans. Commun. 2016

Methods — techniques the papers use, named apart from their topics

maximum likelihood estimation · 0.2maximum a posteriori · 0.2linear minimum mean square error · 0.2least squares · 0.2cramer-rao lower bound · 0.2
YearPublicationVenuePosition
2016 Channel estimation techniques for diffusion-based molecular communications
abstract
In molecular communication (MC) systems, the expected number of molecules observed at the receiver over time after the instantaneous release of molecules by the transmitter is referred to as the channel impulse response (CIR). Knowledge of the CIR is needed for the design of detection and equalization schemes. In this paper, we present a training-based CIR estimation framework for MC systems which aims at estimating the CIR based on the observed number of molecules at the receiver due to emission of a sequence of known numbers of molecules by the transmitter. In particular, we derive maximum likelihood (ML) and least sum of square errors (LSSE) estimators. We also study the Cramer Rao (CR) lower bound and training sequence design for the considered system. Simulation results confirm the analysis and compare the performance of the proposed estimation techniques with the CR lower bound.
Vahid Jamali, Arman Ahmadzadeh, Christophe Jardin, Heinrich Sticht, Robert Schober
ICC3
2016 Channel Estimation for Diffusive Molecular Communications
abstract
In molecular communication (MC) systems, the expected number of molecules observed at the receiver over time after the instantaneous release of molecules by the transmitter is referred to as the channel impulse response (CIR). Knowledge of the CIR is needed for the design of detection and equalization schemes. In this paper, we present a training-based CIR estimation framework for MC systems, which aims at estimating the CIR based on the observed number of molecules at the receiver due to emission of a sequence of known numbers of molecules by the transmitter. Thereby, we distinguish two scenarios depending on whether or not statistical channel knowledge is available. In particular, we derive maximum likelihood and least sum of square errors estimators, which do not require any knowledge of the channel statistics. For the case, when statistical channel knowledge is available, the corresponding maximum a posteriori and linear minimum mean square error estimators are provided. As performance bound, we derive the classical Cramer Rao (CR) lower bound, valid for any unbiased estimator, which does not exploit statistical channel knowledge, and the Bayesian CR lower bound, valid for any unbiased estimator, which exploits statistical channel knowledge. Finally, we propose the optimal and suboptimal training sequence designs for the considered MC system. Simulation results confirm the analysis and compare the performance of the proposed estimation techniques with the respective CR lower bounds.
Vahid Jamali, Arman Ahmadzadeh, Christophe Jardin, Heinrich Sticht, Robert Schober
IEEE Trans. Commun.3