Finite state machine has unlimited concurrency
- 1 May 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 38 (5) , 465-475
- https://doi.org/10.1109/31.76483
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Improving the iteration bound of finite state machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Algorithms and architectures for concurrent Viterbi decodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- High throughput reconstruction of Huffman-coded imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Pipeline interleaving and parallelism in recursive digital filters. II. Pipelined incremental block filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Digital CommunicationPublished by Springer Nature ,1988
- Implementation of digital filtering algorithms using pipelined vector processorsProceedings of the IEEE, 1987
- High-speed recursive digital filter realizationCircuits, Systems, and Signal Processing, 1984
- An Algorithm for Solving Linear Recurrence Systems on Parallel and Pipelined MachinesIEEE Transactions on Computers, 1981
- Time and Parallel Processor Bounds for Linear Recurrence SystemsIEEE Transactions on Computers, 1975
- Completeness of Sets of Delayed-Logic DevicesIEEE Transactions on Electronic Computers, 1965