Publication

Empirical Study of Noise Dependence in Electrochemical Sensors

Giovanni De Micheli, Sandro Carrara, Seyedeh Sara Ghoreishizadeh
2013
Conference Papers

Abstract

We report the experimental study of noise in electrochemical biosensors as related to voltage and concentration. A comparison with experiments is performed for H2O2 and Ferrocyanide with bare sensors and with sensors functionalized with Multi-Walled Carbon Nanotubes (MWCNT) modified electrodes. Chronoamperometry measurements at different voltages were carried out, followed by fast Fourier transform analysis of noise at different concentration of analyte to understand the effect of concentration and voltage on the noise Power Spectral Density (PSD) and the Signal over Noise (SNR) ratio. Experimental results demonstrate the presence of 1/f noise and its dependence on the state variables. The parameters of 1/f noise i.e. the amplitude coefficient and frequency power coefficients are extracted by curve fitting, and are characterized by comparing the coefficient in different molecules, electrodes, voltages and concentration.

Official source

https://infoscience.epfl.ch/entities/publication/93c37a63-2866-44e4-8805-5c1702f14a94

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Giovanni De Micheli, Sandro Carrara, Seyedeh Sara Ghoreishizadeh
2013
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/93c37a63-2866-44e4-8805-5c1702f14a94

About this result

Related concepts (22)

Fast Fourier transform

A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical.

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

Fourier analysis

In mathematics, Fourier analysis (ˈfʊrieɪ,_-iər) is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer. The subject of Fourier analysis encompasses a vast spectrum of mathematics.

Related publications (32)

Verification of the Fourier-enhanced 3D finite element Poisson solver of the gyrokinetic full-f code PICLS

Stephan Brunner, Laurent Villard, Alberto Bottino, Moahan Murugappan

We introduce and derive the Fourier -enhanced 3D electrostatic field solver of the gyrokinetic full -f PIC code PICLS. The solver makes use of a Fourier representation in one periodic direction of the domain to make the solving of the system easily paralle ...

Elsevier2024

Impact of beam-coupling impedance on the Schottky spectrum of bunched beam

Tatiana Pieloni, Nicolas Frank Mounet, Christophe Emmanuel R. Lannoy

The Schottky monitors of the Large Hadron Collider (LHC) can be used for non-invasive beam diagnostics to estimate various bunch characteristics, such as tune, chromaticity, bunch profile or synchrotron frequency distribution. However, collective effects, ...

Iop Publishing Ltd2024

Stability of the Faber-Krahn inequality for the short-time Fourier transform

Joao Pedro Gonçalves Ramos

We prove a sharp quantitative version of the Faber–Krahn inequality for the short-time Fourier transform (STFT). To do so, we consider a deficit which measures by how much the STFT of a function fails to be optimally concentrated on an arbitrary set of pos ...

Springer Heidelberg2024