#### Filter Results:

- Full text PDF available (143)

#### Publication Year

1997

2017

- This year (4)
- Last 5 years (38)
- Last 10 years (109)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Key Phrases

#### Method

Learn More

- Markus Püschel, José M. F. Moura, +10 authors Nicholas Rizzolo
- Proceedings of the IEEE
- 2005

Fast changing, increasingly complex, and diverse computing platforms pose central problems in scientific computing: How to achieve, with reasonable effort, portable optimal performance? We present SPIRAL that considers this problem for the performance-critical domain of linear digital signal processing (DSP) transforms. For a specified transform, SPIRAL… (More)

- Yevgen Voronenko, Markus Püschel
- ACM Trans. Algorithms
- 2007

A variable can be multiplied by a given set of fixed-point constants using a multiplier block that consists exclusively of additions, subtractions, and shifts. The generation of a multiplier block from the set of constants is known as the multiple constant multiplication (MCM) problem. Finding the optimal solution, namely, the one with the fewest number of… (More)

- Jeremy R. Johnson, Markus Püschel
- ICASSP
- 2000

This paper describes an approach to implementing and optimizing fast signal transforms. Algorithms for computing signal transforms are expressed by symbolic expressions, which can be automatically generated and translated into programs. Optimizing an implementation involves searching for the fastest program obtained from one of the possible expressions. In… (More)

- Sung-Chul Han, Franz Franchetti, Markus Püschel
- 2006 International Conference on Parallel…
- 2006

A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly complex computing platforms. Examples include ATLAS, SPIRAL, and the codelet generator in FFTW. Each of these generators produces highly optimized source code directly from a problem… (More)

- Peter Tummeltshammer, James C. Hoe, Markus Püschel
- IEEE Transactions on Computer-Aided Design of…
- 2007

This paper studies area-efficient arithmetic circuits to multiply a fixed-point input value selectively by one of several preset fixed-point constants. We present an algorithm that generates a class of solutions to this time-multiplexed multiple-constant multiplication problem by ldquofusingrdquo single-constant multiplication circuits for the required… (More)

- João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, Markus Püschel
- IEEE Transactions on Signal Processing
- 2013

We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost… (More)

- Markus Püschel
- 2002

SPIRAL is a generator of libraries for fast software implementations of signal processing transforms. These libraries are adapted to the computing platform and can be re-optimized as the hardware is upgraded or replaced. In this overview talk we explain SPIRAL’s infrastructure and its main components: the mathematical framework that concisely describes… (More)

- Grace Nordin, Peter A. Milder, James C. Hoe, Markus Püschel
- Proceedings. 42nd Design Automation Conference…
- 2005

This paper presents a parameterized soft core generator for the discrete Fourier transform (DFT). Reusable IPs of digital signal processing (DSP) kernels are important time-saving resources in DSP hardware development. Unfortunately, reusable IPs, however optimized, can introduce inefficiencies because they cannot fit the exact requirements of every… (More)

- Markus Püschel, Peter A. Milder, James C. Hoe
- J. ACM
- 2009

This article presents a method for constructing hardware structures that perform a fixed permutation on streaming data. The method applies to permutations that can be represented as linear mappings on the bit-level representation of the data locations. This subclass includes many important permutations such as stride permutations (corner turn, perfect… (More)

- João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, Markus Püschel
- IEEE Transactions on Signal Processing
- 2012

We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least ℓ<sub>1</sub>-norm solution of the underdetermined linear system Ax = b and is used, for example, in compressed sensing for reconstruction. Our algorithm solves BP on a distributed platform such as a sensor network, and is designed to… (More)