Optimized Synthesis of Self-Testable Finite State Machines (FSM) Using BIST-PST Structures in Altera Structures
暂无分享,去创建一个
[1] Edward A. Lee,et al. Scheduling dynamic dataflow graphs with bounded memory using the token flow model , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[2] Gilles Kahn,et al. The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.
[3] Edward A. Lee,et al. Software Synthesis from Dataflow Graphs , 1996 .
[4] Thomas Martyn Parks,et al. Bounded scheduling of process networks , 1996 .
[5] Hans-Joachim Wunderlich,et al. Optimized synthesis of self-testable finite state machines , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.
[6] Edward A. Lee,et al. Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.