scispace - formally typeset
Search or ask a question
Author

Ed F. Deprettere

Other affiliations: Delft University of Technology
Bio: Ed F. Deprettere is an academic researcher from Leiden University. The author has contributed to research in topics: Very-large-scale integration & Nested loop join. The author has an hindex of 35, co-authored 168 publications receiving 4702 citations. Previous affiliations of Ed F. Deprettere include Delft University of Technology.


Papers
More filters
Journal ArticleDOI
01 Jan 1993
TL;DR: A unified approach is presented to the related problems of recovering signal parameters from noisy observations and identifying linear system model parameters from observed input/output signals, both using singular value decomposition (SVD) techniques.
Abstract: A unified approach is presented to the related problems of recovering signal parameters from noisy observations and identifying linear system model parameters from observed input/output signals, both using singular value decomposition (SVD) techniques. Both known and new SVD-based identification methods are classified in a subspace-oriented scheme. The SVD of a matrix constructed from the observed signal data provides the key step in a robust discrimination between desired signals and disturbing signals in terms of signal and noise subspaces. The methods that are presented are distinguished by the way in which the subspaces are determined and how the signal or system model parameters are extracted from these subspaces. Typical examples, such as the direction-of-arrival problem and system identification from input/output measurements, are elaborated upon, and some extensions to time-varying systems are given. >

344 citations

Proceedings ArticleDOI
14 Jul 1997
TL;DR: An approach for quantitative analysis of application-specific dataflow architectures that allows the designer to rate design alternatives in a quantitative way and therefore supports him in the design process to find better performing architectures.
Abstract: In this paper we present an approach for quantitative analysis of application-specific dataflow architectures. The approach allows the designer to rate design alternatives in a quantitative way and therefore supports him in the design process to find better performing architectures. The context of our work is video signal processing algorithms which are mapped onto weakly-programmable, coarse-grain dataflow architectures. The algorithms are represented as Kahn graphs with the functionality of the nodes being coarse-grain functions. We have implemented an architecture simulation environment that permits the definition of dataflow architectures as a composition of architecture elements, such as functional units, buffer elements and communication structures. The abstract, clock-cycle accurate simulator has been built using a multi-threading package and employs object oriented principles. This results in a configurable and efficient simulator. Algorithms can subsequently be executed on the architecture model producing quantitative information for selected performance metrics. Results are presented for the simulation of a realistic application on several dataflow architecture alternatives, showing that many different architectures can be simulated in modest time on a modern workstation.

273 citations

Journal ArticleDOI
20 Oct 1999
TL;DR: The methodology provides a means to quickly build models of architectures at an abstract level, to easily map applications, modeled as Kahn Process Networks, onto these architecture models, and to analyze the performance of the resulting system by simulation.
Abstract: We present a methodology for the exploration of signal processing architectures at the system level. The methodology, named SPADE, provides a means to quickly build models of architectures at an abstract level, to easily map applications, modeled as Kahn Process Networks, onto these architecture models, and to analyze the performance of the resulting system by simulation. The methodology distinguishes between applications and architectures, and uses a trace-driven simulation technique for co-simulation of application models and architecture models. As a consequence, architecture models need not be functionally complete to be used for performance analysis while data dependent behavior is still handled correctly. We have used the methodology for the exploration of architectures and mappings of an MPEG-2 decoder application.

229 citations

Proceedings ArticleDOI
16 Feb 2004
TL;DR: This paper shows how for an application written in Matlab, a Kahn process network specification can automatically be derived and systematically mapped onto a target platform composed of a microprocessor and an FPGA.
Abstract: New emerging embedded system platforms in the realm of high-throughput multimedia, imaging, and signal processing will consist of multiple microprocessors and reconfigurable components. One of the major problems is how to program these platforms in a systematic and automated way so as to satisfy the performance need of applications executed on these platforms. In this paper, we present our system design approach as an efficient solution to this programming problem. We show how for an application written in Matlab, a Kahn process network specification can automatically be derived and systematically mapped onto a target platform composed of a microprocessor and an FPGA. Furthermore, we illustrate how the mapping approach is applied on a real-life example, namely an M-JPEG encoder.

218 citations

Journal ArticleDOI
TL;DR: A perturbation error analysis gives bounds on the parameter estimates and provides optimal values for the temporal and spatial smoothing parameters in a joint angle-frequency estimation method based on the multidimensional ESPRIT algorithm.
Abstract: High-resolution parameter estimation techniques have been applied to jointly estimate multiple signal parameters. we consider the problem of determining the directions and center frequencies of a number of narrowband sources in a band of interest. We present a joint angle-frequency estimation method, based on the multidimensional ESPRIT algorithm. A perturbation error analysis gives bounds on the parameter estimates and provides optimal values for the temporal and spatial smoothing parameters. The analysis is shown to be consistent with simulation results.

192 citations


Cited by
More filters
Journal ArticleDOI
01 Feb 1986
TL;DR: Wave digital filters (WDFs) as discussed by the authors are modeled after classical filters, preferably in lattice or ladder configurations or generalizations thereof, and have very good properties concerning coefficient accuracy requirements, dynamic range, and especially all aspects of stability under finite-arithmetic conditions.
Abstract: Wave digital filters (WDFs) are modeled after classical filters, preferably in lattice or ladder configurations or generalizations thereof. They have very good properties concerning coefficient accuracy requirements, dynamic range, and especially all aspects of stability under finite-arithmetic conditions. A detailed review of WDF theory is given. For this several goals are set: to offer an introduction for those not familiar with the subject, to stress practical aspects in order to serve as a guide for those wanting to design or apply WDFs, and to give insight into the broad range of aspects of WDF theory and its many relationships with other areas, especially in the signal-processing field. Correspondingly, mathematical analyses are included only if necessary for gaining essential insight, while for all details of more special nature reference is made to existing literature.

937 citations

Journal ArticleDOI
TL;DR: This work defines system platforms and argues about their use and relevance, and presents a new approach to platform-based design called modern embedded systems, compilers, architectures and languages, based on highly concurrent and software programmable architectures and associated design tools.
Abstract: System-level design issues become critical as implementation technology evolves toward increasingly complex integrated circuits and the time-to-market pressure continues relentlessly. To cope with these issues, new methodologies that emphasize re-use at all levels of abstraction are a "must", and this is a major focus of our work in the Gigascale Silicon Research Center. We present some important concepts for system design that are likely to provide at least some of the gains in productivity postulated above. In particular, we focus on a method that separates parts of the design process and makes them nearly independent so that complexity could be mastered. In this domain, architecture-function co-design and communication-based design are introduced and motivated. Platforms are essential elements of this design paradigm. We define system platforms and we argue about their use and relevance. Then we present an application of the design methodology to the design of wireless systems. Finally, we present a new approach to platform-based design called modern embedded systems, compilers, architectures and languages, based on highly concurrent and software programmable architectures and associated design tools.

886 citations

Journal ArticleDOI
19 Sep 2011
TL;DR: Frenetic provides a declarative query language for classifying and aggregating network traffic as well as a functional reactive combinator library for describing high-level packet-forwarding policies, which facilitates modular reasoning and enables code reuse.
Abstract: Modern networks provide a variety of interrelated services including routing, traffic monitoring, load balancing, and access control. Unfortunately, the languages used to program today's networks lack modern features - they are usually defined at the low level of abstraction supplied by the underlying hardware and they fail to provide even rudimentary support for modular programming. As a result, network programs tend to be complicated, error-prone, and difficult to maintain.This paper presents Frenetic, a high-level language for programming distributed collections of network switches. Frenetic provides a declarative query language for classifying and aggregating network traffic as well as a functional reactive combinator library for describing high-level packet-forwarding policies. Unlike prior work in this domain, these constructs are - by design - fully compositional, which facilitates modular reasoning and enables code reuse. This important property is enabled by Frenetic's novel run-time system which manages all of the details related to installing, uninstalling, and querying low-level packet-processing rules on physical switches.Overall, this paper makes three main contributions: (1) We analyze the state-of-the art in languages for programming networks and identify the key limitations; (2) We present a language design that addresses these limitations, using a series of examples to motivate and validate our choices; (3) We describe an implementation of the language and evaluate its performance on several benchmarks.

788 citations

Journal ArticleDOI
TL;DR: It is seen that under the proposed subspace approach, blind adaptive channel estimation and blind adaptive array response estimation can be integrated with blind adaptive multiuser detection, with little attendant increase in complexity.
Abstract: A new multiuser detection scheme based on signal subspace estimation is proposed. It is shown that under this scheme, both the decorrelating detector and the linear minimum-mean-square-error (MMSE) detector can be obtained blindly, i.e., they can be estimated from the received signal with the prior knowledge of only the signature waveform and timing of the user of interest. The consistency and asymptotic variance of the estimates of the two linear detectors are examined. A blind adaptive implementation based on a signal subspace tracking algorithm is also developed. It is seen that compared with the previous minimum-output-energy blind adaptive multiuser detector, the proposed subspace-based blind adaptive detector offers lower computational complexity, better performance, and robustness against signature waveform mismatch. Two extensions are made within the framework of signal subspace estimation. First, a blind adaptive method is developed for estimating the effective user signature waveform in the multipath channel. Secondly, a multiuser detection scheme using spatial diversity in the form of an antenna array is considered. A blind adaptive technique for estimating the array response for diversity combining is proposed. It is seen that under the proposed subspace approach, blind adaptive channel estimation and blind adaptive array response estimation can be integrated with blind adaptive multiuser detection, with little attendant increase in complexity.

780 citations