Fast continuous Fourier and Haar transforms of rectilinear polygons from very-large-scale integration layouts
Related publications (116)
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.
We introduce an algorithm for the efficient computation of the continuous Haar transform of 2D patterns that can be described by polygons. These patterns are ubiquitous in VLSI processes where they are used to describe design and mask layouts. There speed i ...
We propose a novel algorithm for sparse system identification in the frequency domain. Key to our result is the observation that the Fourier transform of the sparse impulse response is a simple sum of complex exponentials, whose parameters can be efficient ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
In this work, we present a novel way of computing the continuous Haar, Fourier and cosine series coefficients of rectilinear polygons. We derive algorithms to compute the inner products with the continuous basis functions directly from the vertices of the ...
We use a Fourier-space imaging technique relying on outcoupling grating probes to study the coupled mode interaction and dispersion properties of guided modes in silicon-on-insulator codirectional couplers. Our approach allows us to measure the mode splitt ...
The capacity of a printing system to accurately reproduce details has an impact on the quality of printed images. The ability of a system to reproduce details is captured in its modulation transfer function (MTF). In the first part of this work, we compare ...
In a previous recent paper we discussed the limitations of the Fourier-based model in the prediction of visible moiré effects. Here, we extend the discussion to other mathematical models that are also being used in the moiré theory: the classical indicial ...
We propose a Fourier analytical condition linking alias-free sampling with the Fourier transform of the indicator function defined on the given frequency support. Our discussions center around how to develop practical computation algorithms based on the pr ...
Institute of Electrical and Electronics Engineers2009
We provide a method for constructing regular sampling lattices in arbitrary dimensions together with an integer dilation matrix. Subsampling using this dilation matrix leads to a similarity-transformed version of the lattice with a chosen density reduction ...
Experiments have shown that the quality of printed images depends on the capacity of the printing system to accurately re- produce details. We propose to improve the quality by compensat- ing for the Modulation Transfer Function (MTF) of the printing syste ...
A fast computational method is given for the Fourier transform of the polyharmonic B-spline autocorrelation sequence in d dimensions. The approximation error is exponentially decaying with the number of terms taken into account. The algorithm improves spee ...
Institute of Electrical and Electronics Engineers2008