Concept

Overshoot (signal)

Publications associées (41)

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

Sampling methods for parametric non-bandlimited signals

Irena Maravic

Sampling theory has experienced a strong research revival over the past decade, which led to a generalization of Shannon's original theory and development of more advanced formulations with immediate relevance to signal processing and communications. For e ...

EPFL2004

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Cont rols: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2003

Optical speedup at transparency of the gain recovery in semiconductor optical amplifiers

Benoît Marie Joseph Deveaud, Marc-André Dupertuis

Experimental demonstration of optical speedup at transparency (OSAT) has been performed on a 1 mm long semiconductor optical amplifiers (SOA). OSAT is a recently proposed scheme that decreases the recovery time of an SOA while maintaining the available gai ...

2002

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Controls: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2002

Sampling innovations

Pina Marziliano

Sampling theory has prospered extensively in the last century. The elegant mathematics and the vast number of applications are the reasons for its popularity. The applications involved in this thesis are in signal processing and communications and call out ...

EPFL2002

Sampling of Periodic Signals: A Quantitative Error Analysis

Michaël Unser, Thierry Blu, Mathews Jacob

We present an exact expression for the

L _{ 2 }

error that occurs when one approximates a periodic signal in a basis of shifted and scaled versions of a generating function. This formulation is applicable to a wide variety of linear approximation schem ...

IEEE2002

Sampling signals with finite rate of innovation

Martin Vetterli, Pina Marziliano, Thierry Blu

Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform ...

Institute of Electrical and Electronics Engineers2002

A sampling theorem for periodic piecewise polynomial signals

Martin Vetterli, Pina Marziliano, Thierry Blu

We consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomials. We demonstrate that by using an adequate sampling kernel and a sampli ...

2001

Turbo Codes with Non-Uniform Constellation

Christina Fragouli

This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellatio ...

2001

Generalized Sampling: Stability and Performance Analysis

Michaël Unser

Generalized sampling provides a general mechanism for recovering an unknown input function

f(x) \in H

from the samples of the responses of m linear shift-invariant systems sampled at 1 ⁄ mth the reconstruction rate. The system can be designed to perform ...

IEEE1997

Sampling of Periodic Signals: A Quantitative Error Analysis

Michaël Unser, Thierry Blu, Mathews Jacob

We present an exact expression for the

L _{ 2 }

IEEE2002

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Cont rols: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2003

A Note on the Stochastic Bias of Some Increase-Decrease Congestion Controls: HighSpeed TCP Case Study

Jean-Yves Le Boudec, Milan Vojnovic

We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate

\fpp

and time-average window

\taw

for some known parti ...

2002

Generalized Sampling: Stability and Performance Analysis

Michaël Unser

Generalized sampling provides a general mechanism for recovering an unknown input function

f(x) \in H

from the samples of the responses of m linear shift-invariant systems sampled at 1 ⁄ mth the reconstruction rate. The system can be designed to perform ...

IEEE1997