Concept

Transformée de Fourier quantique

Publications associées (117)

Acquisition of modern GNSS signals using a modified parallel code-phase search architecture

Pierre-André Farine, Cyril Botteron, Jérôme Leclère

The acquisition of global navigation satellite system signals can be performed using a fast Fourier transform (FFT). The FFT-based acquisition performs a circular correlation, and is thus sensitive to potential transitions between consecutive periods of th ...

Elsevier Science Bv2014

An enhanced interpolated-modulated sliding DFT for high reporting rate PMUs

Mario Paolone, Paolo Romano

The field of application of Phasor Measurement Units (PMUs) might be limited by the PMU measurements reporting latencies and achievable reporting rates, particularly with respect to power system protection applications that typically require very low laten ...

2014

An Enhanced Interpolated-Modulated Sliding DFT for High Reporting Rate PMUs

Mario Paolone, Paolo Romano

Ieee2014

Exact Diagonalization of Heisenberg SU(N) Models

Frédéric Mila, Pierre Marcel Nataf

Building on advanced results on permutations, we show that it is possible to construct, for each irreducible representation of SU(N), an orthonormal basis labeled by the set of standard Young tableaux in which the matrix of the Heisenberg SU(N) model (the ...

2014

Improving the accuracy and efficiency of time-resolved electronic spectra calculations: Cellular dephasing representation with a prefactor

Jiri Vanicek, Miroslav Sulc, David Eduardo Zambrano Ramirez

Time-resolved electronic spectra can be obtained as the Fourier transform of a special type of time correlation function known as fidelity amplitude, which, in turn, can be evaluated approximately and efficiently with the dephasing representation. Here we ...

American Institute of Physics2013

Positivity for Kac polynomials and DT-invariants of quivers

Tamás Hausel

We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of Kontsevich Soibelman ...

Annal Mathematics2013

Input-output theory of the unconventional photon blockade

Vincenzo Savona, Hugo Pierre Alexandre Flayac

We study the unconventional photon blockade, recently proposed for a coupled-cavity system, in the presence of input and output quantum fields. Mixing of the input or output channels still allows strong photon antibunching of the output field, but for opti ...

American Physical Society2013

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Modified parallel code-phase search for acquisition in presence of sign transition

Pierre-André Farine, Cyril Botteron, Jérôme Leclère

One of the method to have a fast acquisition of GNSS signals is the parallel code-phase search, which uses the fast Fourier transform (FFT) to perform the correlation. A problem with this method is the potential sign transition that can happen between two ...

2013

Empirical Study of Noise Dependence in Electrochemical Sensors

Giovanni De Micheli, Sandro Carrara, Seyedeh Sara Ghoreishizadeh

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 wi ...

2013

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search