Lower bounds on memory requirements for statically scheduled DSP programs.
Tracy C. DenkKeshab K. ParhiPublished in: J. VLSI Signal Process. (1996)
Keyphrases
- memory requirements
- lower bound
- upper bound
- memory space
- computational complexity
- scheduling problem
- signal processing
- memory usage
- branch and bound algorithm
- computational speed
- branch and bound
- objective function
- low memory
- np hard
- lower bounding
- quadratic assignment problem
- digital signal processor
- digital signal processing
- optimal cost
- answer sets
- vc dimension
- high speed
- worst case
- lower and upper bounds
- upper and lower bounds
- computer programs
- linear programming relaxation
- online algorithms
- computer vision
- online learning
- programming language
- high accuracy
- randomly generated problems
- optimal solution
- arrival times