Docstoc

mustang

Document Sample
mustang Powered By Docstoc
					MUSTANG                                       Manual Section                                   MUSTANG


     # HG 00 00
     # HY 01 01
     # FG 10 10
     # FY 11 11
     .i 5
     .o 7
     0-- 00 00 00010
     -0- 00 00 00010
     11- 00 01 10010
     --0 01 01 00110
     --1 01 10 10110
     10- 10 10 01000
     0-- 10 11 11000
     -1- 10 11 11000
     --0 11 11 01001
     --1 11 00 11001
   The state assigned finite automaton is in PLA(5OCTTOOLS) format, suitable for input to
   ESPRESSO(1OCTTOOLS) or MISII(1OCTTOOLS).

DIAGNOSTICS
   The input routine gives out error messages in case of wrong specification of the input and exits.

SEE ALSO
   kiss(1OCTTOOLS), misII(1OCTTOOLS), espresso(1OCTTOOLS)

AUTHOR
   Srinivas Devadas (devadas@ic.berkeley.edu)

BUGS
   You find 'em, we squash 'em.




Sprite v1.0                                       Page 71                                 7 November 1987
MUSTANG                                         Manual Section                                   MUSTANG




   -t
        A variation in fanin and fanout oriented heuristics which sometimes produces better results. Should
        be used with -n or -p, not alone.

   -c
        a wedge clustering algorithm is used for embedding the graph generated by the fanin and fanout ori-
        ented algorithms.

   -a
        graph embedding performed by using a simulated annealing based algorithm. Not very robust.

   -i
        annealing parameters i.e. number of states at each temperature point in the beginning and the end and
        the starting temperature can be specified. This has to be used with the -a option.

   -x
        approximation used in graph embedding which speeds up embedding. Only for debugging purposes.

INPUT FILE FORMAT
   An example input file is shown below.
      .i 3
      .o 5
      .s 2
      0-- HG HG 00010
      -0- HG HG 00010
      11- HG HY 10010
      --0 HY HY 00110
      --1 HY FG 10110
      10- FG FG 01000
      0-- FG FY 11000
      -1- FG FY 11000
      --0 FY FY 01001
      --1 FY HG 11001
   The numbers following the .i, .o and .s declarations specify the number of inputs, number of outputs and
   number of encoding bits to be used respectively. The number of encoding bits used has to be greater
   than or equal to log(N) where N is the number of states.

OUTPUT FILE FORMAT
   An example output file is shown below.

        #STATE ASSIGNED FINITE AUTOMATON



Sprite v1.0                                        Page 70                                  7 November 1987
MUSTANG                                         Manual Section                                   MUSTANG


NAME
   mustang - A State Assignment Program

SYNOPSIS
   mustang [options] inputfile [ > outputfile ]

DESCRIPTION
   Mustang is a program that performs state assignment of finite state machines. The primary goal is to
   optimize the silicon area occupied by the finite state machine. The area occupied by the finite state
   machine after multi-level optimization using MISII(1OCTTOOLS) is minimized.
   Mustang is run in a batch mode. Mustang reads the symbolic representation of the machine to be
   encoded in an input file. The input format used is similar to the KISS(1OCTTOOLS) input format with
   minor variations. The output is the state assigned finite automaton with the symbolic states replaced by
   binary codes.

OPTIONS
   -d
        debug option. Useful only to persons with intimate knowledge of algorithms used in Mustang.

   -r
        machine is encoded using random encoding. The seed for the random encoding is the default seed.
        So different runs with -r will produce identical results.

   -ran
      machine is encoded using random encoding with a random seed. Different runs can produce grossly
      different results.

   -s
        states of the machine are assigned sequential codes.

   -l
        States of the machine are assigned one hot codes. The number of bits used by a one hot encoding
        may be unacceptable.

   -n
        a state assignment option which uses a fanin-oriented algorithm to produce an encoding of states.

   -e
        expand state codes to use up unused state codes. (e.g. 1011 expanded to 1-11).

   -p
        a state assignment option which uses a fanout-oriented algorithm to produce an encoding of states.



Sprite v1.0                                         Page 69                                 7 November 1987

				
DOCUMENT INFO
Shared By:
Categories:
Tags:
Stats:
views:0
posted:5/4/2013
language:Latin
pages:3
iasiatube.news iasiatube.news http://
About