Some complexity issues in digital signal processing
- 1 October 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 32 (5) , 1037-1041
- https://doi.org/10.1109/tassp.1984.1164433
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Completely-pipelined architectures for digital signal processingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- VLSI Systems and ComputationsPublished by Springer Nature ,1981
- Special-Purpose Devices For Signal And Image Processing: An Opportunity In Very Large Scale Integration (VLSI)Published by SPIE-Intl Soc Optical Eng ,1980
- The Pebbling Problem is Complete in Polynomial SpaceSIAM Journal on Computing, 1980
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum LatenessMathematics of Operations Research, 1977
- Code Generation for Expressions with Common SubexpressionsJournal of the ACM, 1977
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Complete Register Allocation ProblemsSIAM Journal on Computing, 1975
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975