Publication

A theory of multirate filter banks

Related publications (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Filter Bank Design based on Minimization of Individual Aliasing Terms for Minimum Mutual Information Subband Adaptive Beamforming

Philip Neil Garner, Weifeng Li

This paper presents new filter bank design methods for sub- band adaptive beamforming. In this work, we design analysis and synthesis prototypes for modulated filter banks so as to minimize each aliasing term individually. We then drive the total response ...

2008

Regularized frequency domain equalization algorithm and its VLSI implementation

Andreas Peter Burg

Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a novel technique to compute linear equalizer coefficients in the frequency domain. It is s ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Reverse Search for Parametric Linear Programming

Colin Neil Jones

This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based on the reverse-search paradigm. We prove that the proposed algorithm has a computational complexity that is linear in the size of the output (number of so- ...

IEEE2006

Approximations in Distributed Optimization

Boi Faltings, Adrian Petcu

We present in this paper an approximative method for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. The largest message is in the worst c ...

2005

Efficient Kalman Smoothing for Harmonic State-Space Models

Harmonic probabilistic models are common in signal analysis. Framed as a linear-Gaussian state-space model, smoothed inference scales as

O(TH^2)

where

H

is twice the number of frequencies in the model and

T

is the length of the time-series. Due to th ...

IDIAP2005

Multi-Object Tracking using the Particle Filter Algorithm on the Top-View Plan

Jean-Philippe Thiran

In this paper we address the problem of multi-object tracking in video sequences, with application to pedestrian tracking in a crowd. In this con- text, particle ¯lters provide a robust tracking framework under ambiguity conditions. The particle ¯lter tech ...

2004

Monocular 3-D Tracking of the Golf Swing

Pascal Fua, Raquel Urtasun

We propose an approach to incorporating dynamic models into the human body tracking process that yields full 3--D reconstructions from monocular sequences. We formulate the tracking problem is terms of minimizing a differentiable criterion whose differenti ...

2004

On the coupling of 3D and 1D Navier-Stokes equations for flow problems in compliant vessels

Alfio Quarteroni, Fabio Nobile, Luca Formaggia

For the analysis of flows in compliant vessels, we propose an approach to couple the original 3D equations with a convenient 1D model. This multi-scale strategy allows for a dramatic reduction of the computational complexity and is suitable for "absorbing" ...

2001

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

This work is concerned with the computational complexity of the recognition of

\mbox{LP}_2

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Several subclasses of

\mbox{LP}_2

of particular interest ...

IDIAP1996

A unified derivation of square-root multichannel least-squares filtering algorithms

Ali H. Sayed

The authors present a new derivation of exact least-squares multichannel and multidimensional adaptive algorithms, based on explicitly formulating the problem as a state-space estimation problem and then using different square-root versions of the Kalman, ...

IEEE1993