Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ISCAS
1999
IEEE

favoriteEmaildiscussreport

72views Hardware» more ISCAS 1999»

Shape-based sequential machine analysis

13 years 8 months ago

Shape-based sequential machine analysis

Download bears.ece.ucsb.edu

In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constraints not on the logical makeup of the automata, but on the distribution of information required to support correct output behavior. These constraints allow the machine to be distributed into partitions with predefined communication and bit-level encoding complexity. For example, construction of a machine in the form of a feedback shift-register is a simple case of a shape constraint. Such constraints are based on the notion of a "D-atom" which is somewhat similar to dichotomy based encoding.

A. Crews, F. Brewer

Real-time Traffic

Bit-level Encoding Complexity | Correct Output Behavior | Hardware | ISCAS 1999 | Shape Constraint |

claim paper

Related Content

» DegreeofFreedom Analysis for Sequential Machines Targeting BIST Quality and Gate Area

» Data Dependent Concentration Bounds for Sequential Prediction Algorithms

» Tonal Harmony Analysis A Supervised Sequential Learning Approach

» Melodic analysis with segment classes

» Hybrid MMSVM structural sensors for stochastic sequential data

» Robust and Efficient Chinese Word Dependency Analysis with Linear Kernel Support Vector Ma...

» Three sequential positions of query repair in interactions with internet search engines

» Sequential Hierarchical Pattern Clustering

» The semantics of x86CC multiprocessor machine code

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	ISCAS
Authors	A. Crews, F. Brewer

Comments (0)