Publication

Synthesis of uniform amplitude focused beam arrays

Publications associées (36)

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

Optimal polarization synthesis of arbitrary arrays with focused power pattern

Benjamin Fuchs

The joint synthesis of the spatial power pattern and polarization of arbitrary arrays is addressed. Specifically, the proposed approach gives the solution to a frequently encountered problem, namely the array design (i.e., the determination of the radiatin ...

Institute of Electrical and Electronics Engineers2011

RRB-Trees: Efficient Immutable Vectors

Tiark Rompf

Immutable vectors are a convenient data structure for functional programming and part of the standard library of modern languages like Clojure and Scala. The common implementation is based on wide trees with a fixed number of children per node, which allow ...

2011

BROADBAND BEAMPATTERN FOR MULTI-CHANNEL SPEECH ACQUISITION AND DISTANT SPEECH RECOGNITION

Hervé Bourlard, Philip Neil Garner, Mohammadjavad Taghizadeh

Spatial filtering is the fundamental characteristic of microphone array based signal acquisition which plays an important role in applications such as speech enhancement and distant speech recognition. In the array processing literature, this property is f ...

Idiap2011

A union of incoherent spaces model for classification

Pierre Vandergheynst, Karin Schnass

We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data is well represented by a dictionary of features. In order to ensure low miscla ...

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

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Martin Vetterli, Yue Lu, Mina Karzand

Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a well-known and influential demosaicking algorithm based on alternating projections (AP), proposed by Gunturk, Altunbasak and Mersereau in 2002. Since its p ...

Institute of Electrical and Electronics Engineers2010

Fast Space-Variant Elliptical Filtering Using Box Splines

Michaël Unser, Kunal Narayan Chaudhury

The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is possible to filter an image with a Gaussian-like elliptic window of varying siz ...

IEEE2010

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Jean-Yves Le Boudec

Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxi ...

arxiv.org2010

The Subconvexity Problem For Gl(2)

Philippe Michel

Generalizing and unifying prior results, we solve the subconvexity problem for the L-functions of GL(1) and GL(2) automorphic representations over a fixed number field, uniformly in all aspects. A novel feature of the present method is the softness of our ...

Springer-Verlag2010

Achieving Linear Scaling with Interference Alignment

Ayfer Özgür Aydin

Recent results have shown that interference alignment can achieve K/2 degrees of freedom in a K-user interference channel with time or frequency varying channel coefficients. For fixed number of users K, the number of degrees of freedom characterizes the a ...

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

Exchange of Limits: Why Iterative Decoding Works

Rüdiger Urbanke, Satish Babu Korada

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes under MP decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given by density e ...

2008