Some complexity issues in digital signal processing

@article{Cappello1984SomeCI,
  title={Some complexity issues in digital signal processing},
  author={Peter R. Cappello and Kenneth Steiglitz},
  journal={IEEE Transactions on Acoustics, Speech, and Signal Processing},
  year={1984},
  volume={32},
  pages={1037-1041},
  url={https://api.semanticscholar.org/CorpusID:18476140}
}
  • P. CappelloK. Steiglitz
  • Published 1 October 1984
  • Computer Science, Engineering
  • IEEE Transactions on Acoustics, Speech, and Signal Processing
The theory discriminates between tractable and intractable problems, Sometimes identifies fast algorithms for the former, and justifies heuristics for the latter, and illustrates the usefulness of asymptotic complexity theory in the field of digital signal processing.
View via Publisher
cs.princeton.edu
108 Citations
Highly Influential Citations
2
Background Citations
53
Methods Citations
6

Figures and Tables from this paper

108 Citations

Area optimization algorithms in high-speed digital FIR filter synthesis

An exact common subexpression elimination (CSE) algorithm is introduced that finds the minimum number of CSA blocks in the implementation of MCM and an approximate algorithm based on the exact CSE algorithm that can also handle general number representation of constants is presented.

Efficient design of FIR filters using hybrid multiple constant multiplications on FPGA

A 0-1 integer linear programming (ILP) formulation of this problem is presented, yielding an exact common subexpression elimination (CSE) method and an approximate graph-based (GB) algorithm is introduced.

An Exact Breadth-First Search Algorithm for the Multiple Constant Multiplications Problem

This work proposes an exact algorithm based on the breadth-first search that finds the minimum number of operations solution of mid-size MCM instances in a reasonable time and is compared with the previously proposed efficient heuristics.

Optimization of Area, Power & Delay By Using Efficient Digit Serial FIR Filter

The problem of minimizing the gate-level area in digit-serial MCM designs is pitched and high-level synthesis algorithms, design constructions, and a computer aided design tool are presented and the efficiency of the given optimization algorithms and of the digit- serial MCM architectures are shown.

New Algorithms for Constant Coefficient Multiplication in Custom Hardware

This thesis presents several new algorithms for solving the constant multiplication problem given a set of constants, and proposes new strategies which are fundamentally different from the existing methods, such as the integration of a heuristic algorithm within an optimal algorithm.

Design and Implementation of FIR FILTER using MCM Architecture

This paper introduces high level synthesis algorithms, design architectures and CAD tools and also addresses the problem of optimizing the gate level area in digit serial MCM design and the experimental results shows the efficiency of digit-serial MCM architectures and the proposed optimization algorithms in the design of MCM operations and finite impulse response filters.

A Tutorial on Multiplierless Design of FIR Filters: Algorithms and Architectures

This article reviews how constant multiplications can be designed using shifts and adders/subtractors that are maximally shared through a high-level synthesis algorithm based on some optimization criteria and shows how constant multiplierless realization of each filter form can be realized under a shift-adds architecture.

Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications

This paper proposes an exact common subexpression elimination algorithm for the optimum sharing of partial terms in multiple constant multiplications (MCMs) and describes how this algorithm can be modified to target the minimum area solution under a user-specified delay constraint.

Time Constrained Multiple-Constant-Multiplication Structures for Real-Time Applications

This research proposed a modular and structural adder, to be integrated in each MCM node, that optimally implements each addition operation according to the particular requisites and characteristics of the operands that are being considered at each MCM node.

Optimization Algorithms for the Multiplierless Realization of Linear Transforms

This article introduces an exact common subexpression elimination (CSE) algorithm that formalizes the minimization of the number of operations as a 0-1 integer linear programming problem, and introduces a CSE heuristic algorithm that iteratively finds the most common 2-term subexpressions with the minimum conflicts among the expressions.
...

16 References

VLSI Systems and Computations

The book is divided into nine sections: Invited Papers, Models of Computation, Layout Theory and Algorithms, Languages and Verification, Systems and Processors, and Systems and processes, which contains papers describing frameworks for entire systems.

Digital Signal Processing Applications of Systolic Algorithms

VLSI structures and algorithms are given for bit-serial FIR filtering, IIR filtering, and convolution, and a bit-parallel FIR filter design that is completely pipelined and independent of both word size and filter length.

Completely-pipelined architectures for digital signal processing

It is shown that, asymptotically, the area required for power distribution actually dominates the rest of the area for a wide class of structures, illustrating the importance of studying the constants of proportionality in evaluating area, time, and energy requirements.

Complete register allocation problems

It is shown that several variants of the register allocation problem for straight line programs are polynomial complete, and the case when each value is computed exactly once, and when values may be recomputed as necessary.

Bit-level fixed-flow architectures for signal processing

It is shown that, asymptotically, the area required for power distribution actually dominates the rest of the area for a wide class of structures.

Let's Design Algorithms for VLSI Systems

Examples of algorithms that are suitable for VLSI implementation are given, a taxonomy for algorithms based on their communication structures is provided, and some of the insights that are beginning to emerge from efforts in designing algorithms for V LSI systems are discussed.

NP-Complete Scheduling Problems

A Two-Level Pipelined Systolic Array for Convolutions

A two-level pipelined systolic array that is capable of performing convolutions of any dimension and the designs take full advantages of the pipelining assumed to be available at each cell are described.

Special-Purpose Devices For Signal And Image Processing: An Opportunity In Very Large Scale Integration (VLSI)

    H. T. Kung
    Engineering, Physics
    Optics & Photonics
  • 1980
Based on the systolic array approach, new designs of special-purpose devices for filtering, correlation, convolution, and discrete Fourier transform are proposed and discussed. It is argued that…

The NP-Completeness Column: An Ongoing Guide