- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

International Journal of Reconfigurable Computing

Volume 2008 (2008), Article ID 926851, 10 pages

http://dx.doi.org/10.1155/2008/926851

## Burst-Mode Asynchronous Controllers on FPGA

^{1}Electronic Engineering Division, Aeronautics Institute of Technology, Praça Marechal Eduardo Gomes 50, 12228-900 São José dos Campos, SP, Brazil^{2}Microelectronic Laboratory, Polytechnic School, University of São Paulo, Avenida Prof. Luciano Gualberto, Trav 3, 158 05508-900 São Paulo, SP, Brazil

Received 5 July 2008; Revised 8 October 2008; Accepted 30 October 2008

Academic Editor: Gustavo Sutter

Copyright © 2008 Duarte L. Oliveira et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

FPGAs have been mainly used to design synchronous circuits. Asynchronous design on FPGAs is difficult because the resulting circuit may suffer from hazard problems. We propose a method that implements a popular class of asynchronous circuits, known as burst mode, on FPGAs based on look-up table architectures. We present two conditions that, if satisfied, guarantee essential hazard-free implementation on any LUT-based FPGA. By doing that, besides all the intrinsic advantages of asynchronous over synchronous circuits, they also take advantage of the shorter design time and lower cost associated with FPGA designs.

#### 1. Introduction

Due to the increasing complexity of digital systems combined with the market drive for higher performance, there has been an increased interest about asynchronous circuits [1, 2]. Asynchronous circuits do not present clock distribution related problems like clock skew. The circuits have low power consumption, better modularity, robustness toward variations in temperature, and low emission of electromagnetic radiation [3]. One known weakness of asynchronous circuits has been the difficulty to design hazard-free circuits and to solve the critical races [3]. Furthermore, asynchronous circuits frequently cannot benefit from the use of FPGAs due to the extra difficulty imposed by their fixed architecture to deal with hazards [4].

Asynchronous circuits can be classified according to different criteria like its function (controller—datapath); delay model (delay insensitive—quasi-delay insensitive—speed independent—generalized fundamental mode (GFM)) [2]; styles (global asynchronous local synchronous—self-timed systems—micropipeline—speed-independent controllers—burst-mode controllers) [5–9].

Burst-mode asynchronous controllers proposed by Nowick [9, 10] are a popular class of finite state machines. They allow multiple inputs changes. They operate according to the GFM, meaning that a new state transition may only start when the whole circuit (gates and lines) is stable. This paper addresses burst-mode asynchronous controllers. Their advantages are the use of basic gates, similarity with synchronous design. These controllers have been adopted in important industrial and academic designs [11–13].

FPGAs are popular components for prototyping and production of digital circuits due to their low cost and short design time. Their focus has been on synchronous digital circuits. There have been some recent efforts to prototype asynchronous circuits on both commercial [14–17] and academic FPGAs [4, 18–20].

Burst-mode
controllers are usually designed using a logic-driven design methodology [21]. There are two reasons why off-the-shelf FPGAs are not fit for
burst-mode asynchronous controllers [4, 14, 22].
(1)The
*mapping process*
of burst-mode Booleans functions (equations of next state—controllers) to
logic blocks (macrocells) may introduce *logic hazards*.(2)The *internal routing* among logic blocks may introduce significant delays
that may result in *essential hazards*.

##### 1.1. Avoiding Logic Hazards in Burst-Mode Controllers

The burst-mode specification proposed by Nowick is *functional-hazard
free* [23]. Nowick also proposed a method to produce *logic-hazard free* burst-mode Boolean functions [24]. Furthermore, Siegel et al. [25] proposed a technique to decompose large
fan-in burst-mode Boolean functions without
introducing *logic-hazards*. Finally, Maheswaran and Akella [15] and Hauck et al. [4] showed that
if Booleans functions are *functional-hazard free* then they can be mapped
on ordinary LUT-based FPGAs without presenting *logic hazards* [26].

##### 1.2. Avoiding Essential Hazards in Burst-Mode Controllers

Yun and Dill [27] and Nowick and Coates [10] proposed the insertion of delay elements on the feedback wires to avoid essential hazards in burst-mode controllers. However, this solution is not adequate for FPGAs because these components are not designed to ease the insertion of delay elements. Furthermore, delay elements degrade the circuit cycle time, area, and reliability.

In this paper, we demonstrated a *sufficient
condition* that guarantees *essential hazard-free operation* of *any
type of burst-mode controller* when mapped on *any type of LUT-based FPGA* component
without the need of extra delay elements. The proof is based on two new
concepts: (1) *essential signals*; (2) *essential super states*. The
essential hazard-free operation is guaranteed if the following conditions are
satisfied:
(1)essential hazard-free
specification: for all state transitions in a burst-mode specification, if the
label contains a nonempty output burst, it must also contain at least
one *essential* input signal;(2)essential hazard-free
implementation: starting from an essential hazard-free specification, while
building the burst-mode flow map, all *single
states* whose incident state transitions are labeled with nonempty output
bursts must be transformed into *essential super states*.

Furthermore, whenever a burst-mode
specification does not satisfy the first condition, we present two *functional
transformations* that *create essential input signals* without
altering the original functionality:
(1)reduction of
input concurrency: transforms concurrent transitions into sequential
transitions whenever acceptable (but there is a latency penalty);(2)addition of dummy input signals (but
there is an area penalty).

This paper is divided in four sections. Section 3 briefly explains the burst-mode specifications. Section 2 presents the essential signal and essential super-state concepts and explains the two functional transformations. Section 4 presents our method and illustrated with an example. Section 5 shows our experimental results presenting the latency and area penalties found on nine known and one homemade benchmark. Section 6 presents our conclusions and future work.

#### 2. Burst-Mode Specification

The BM specification is
represented as a state transition diagram. Each transition is triggered by an
input burst (single- or multiple-input changes) causing the occurrence of an
output burst (that may be empty or nonempty). It is necessary to define an
initial state. State transitions are represented by arcs, which are labeled
with their corresponding input/output bursts. The signals are always transition
sensitive (0*→*1, or 1*→*0). Input bursts may not be empty. The
input signals are monotonic, changing only once during each state transition.
The BM specification has to obey the polarity property, the unique entry point
and the maximal set property [23].

Figure 1 shows a BM specification. The
input signals are and *c* while the output signals are *x* and *y*. For example, state transition means that if *a* changes from 0 to 1 and *b* changes from 1 to 0, the output *x* will change from 0 to 1. State 0 is
the initial state. Figure 2 shows the corresponding burst-mode flow map (2D map) [27]. Several
tools, like Minimalist [28], 3D [27], and ATACS [29] have been proposed to
synthesize controllers from a textual description of the burst-mode
specification. These tools generate an
independent *netlist* of the technology
(next-state equations of the type sum of products).

#### 3. Hazard-Free BM Conditions

BM asynchronous controllers may be subject to sequential hazards. Essential hazards, like transient essential hazard or steady-state essential hazard, are inherent to the sequential function and are not necessarily associated to a particular implementation of the circuit. The concept of essential hazard has been originally defined by Unger [30] in connection with fundamental-mode controllers.

This concept has been generalized for BM
controllers and may be explained using the total state concept. A total state is a vector composed of all the input (*I*) and output (*O*)
signal values in the specification. A total state corresponds to one single
cube (cell) on a burst-mode flow map (see Figure 2). For
example, the total state 2 of the
Figure 2 is There may be *n*! paths on the BM flow map
corresponding to the transition from total state to total state (labeled with an
input/output burst ), *n* being the number input signals in These paths cover the set where *A* is the initial
total state, *B* is the final total state, and are
intermediary total states.

##### 3.1. Essential Hazard

*Generalized Unger Rule (30) (gur): The Triple Sequential Input Burst*

Let and be two total states in the BM flow map and the input/output burst that activates the transition *A →B*. Let be the number of the input burst
signals. Consider the following transitions sequence:
T1: ; (transition 1 is

*A*activated by ) T2: ( are possible final states); T3: ( are possible initial states), ( are possible final states).

*→*B*Definition 1. *There is a potential *steady-state essential hazard* in
the *A → B* transition if, applying the GUR rule, any final total state

*Definition 2. *There is a potential *transient essential hazard* in the *A →B* transition if, applying the GUR rule, there is a total state

*I*and ) on any path of transitions or that produces an output signal different from any value occurring on any path of transition

*A*.

*→*BA potential essential hazard can be detected applying the GUR rule from any initial state. For example, Figures 3(a) and 3(b) show two paths for the 0

*→*1 state transition on the BM flow map of Figure 2. Consider the path on Figure 3(a). According to the GUR rule we must apply the following activation sequence: The corresponding paths on the BM flow table are T1: T2: T3: As the final total state (11001) after the last activation (T3) is different from the final total state (11010) after the first activation (T1), then a steady-state essential hazard has occurred. Figure 3(a) shows the path T2 and Figure 3(b) shows the path T3.

##### 3.2. BM-EHF Condition

An input signal in a BM specification is a *context signal* in an *A →B* transition if it does not change during this transition (it is not on the
label) while it is a

*trigger signal*if it is labeled during this transition. The input burst of each state transition can be represented by an input transition cube (ITC). For example, the ITC for state transition 7

*→*2 on Figure 1 is (2 means do not care). In this example

*a*and

*b*are trigger signals while

*c*is a context signal (whose value is 0).

*Definition 3. *Let *A* and *B* be a
pair of total states in a BM specification and be the input/output burst for the *A →B* transition. Let be one input signal is an

*essential signal*if it is a context signal on all transitions incident on state

*A*and is a trigger signal on the transition

*A*.

*→*BFor instance (see Figure 1), are not essential on transitions 4

*→*0, 1

*→*2, and 2

*→*3 because they are trigger signals on transitions 3

*→*4, 0

*→*1, and 7

*→*2. Signal

*b*is essential on transition 7

*→*2 because it is a context signal on transition 6

*→*7. On transition 6

*→*7 both

*a*and

*c*are essential signals.

Lemma 1. *A BM specification is essential hazard free (BM-EHF) if and only if for each state transition labeled by if there must
be at least one essential input signal.*

*Proof. *Let T1*(A →B)* and T2

*(B*be two sequential state transitions of a BM-EHF specification. IT and IT are their respective input transition cubes. Suppose that the transition T2 input burst does not contain as essential signal. Then which means that the

*→*C)*C*final total state belongs to a path on IT This fact violates Definitions 1 or 2.

Figure 4 shows the *HP-mp-for-pkt* benchmark [12, 13]. On all transition labels there is at least one essential
signal. Therefore, it is a BM-EHF specification.

There are two ways to transform nonessential hazard-free BM specifications into a BM-EHF specification.

##### 3.3. Reduction of Input Burst Concurrency

The transformation consists of decomposing the input burst
labeled on a state transition generating two-state transitions. For example,
Figure 5 shows a reduced concurrency BM-EHF specification equivalent to the BM
specification in Figure 1 in which the concurrency has been reduced. Analyzing the BM specification in Figure 1,
we found state transitions 1*→*2 and 2*→*3
without essential signals. Decomposing state transitions
into and
decomposing state transition
into we obtained
the BM-EHF specification shown in Figure 5. It
is EHF because transitions 4*→*0 and 7*→**B*
contain empty output bursts while all other transitions contain essential
signals.

##### 3.4. Insertion of Essential Signals

This transformation
consists of inserting the smallest number of dummy essential signals in all
state transitions without essential signal. For example, Figure 6 shows an
BM-EHF specification equivalent to the specification in Figure 1 in which adummy
essential signal
*d*
has been
added to state transitions 1*→*2 and 2*→*3. This transformation has a higher cost
than the previous one because it increases the number of input signals modifying the interaction with the external environment.

If one observes the 2*→*3 state transition in Figure 6, the
conclusion is that *a* is essential on transitions 1*→*2*→*3, while *d* is essential on
transitions 7*→*2*→*3.

##### 3.5. Super-State Condition

Lemma 1 is a necessary
and sufficient condition for an essential hazard free *specification* but not for hazard-free *implementation*. The
super-state concept will guarantee the latter condition.

*Definition 4 (super-state). *Consider an input burst and an output burst We call a *super-state* the set of single total
states defined by all 0/1 combinations of a subset of the
input burst signals, keeping fixed the remaining input signals and all the
output signals.

*Definition 5 (essential super-state). *Consider a BM-EHF specification in which a total state *F* is
reached by a set of *N* incident transitions
Each incident transition is activated by an input burst Each input burst is labeled with a subset of the input signals set An *essential super-state* is the super-state defined by the union of all input signals
active on the incident transitions set labeled *with
nonempty output bursts*.

An essential super-state BM
flow map is derived from a BM-EHF specification by applying Definition 5 to
all total states. Figure 7 is such a map for the specification in Figure 6.
Cells in red are used to compose essential super-states. For example, the transition creates essential super-state 1 composed of four total states: State 110010 is the final total state. Total
state 2 may be reached from either
state 1 or state 7. Applying Definition 5, we find that it must be composed of six
total states (essential super-state 2): This set of total states can be described by
a cube (super-state transition cube—SSTC). Figure 8 shows the description in states
transition diagram of the BM-ESS flow map.

Preposition. *If a total state F in a BM-EHF specification is reached by one or more incident
transitions labeled with empty output bursts, then F is an essential super-state.*

*Proof. *Let T1*(A →F)* be a state transition with an
empty output burst. SST and SST are super-state transition cubes for final total
states

*A*and

*F*. As

*A*must be essential, and as because both output bursts are empty, then

*F*is also an essential super-state.

Lemma 2. *The BM-EHF specification has an EHF implementation if and only if for total state BM-EHF it is an essential super-state.*

*Proof. *Let T1*(B →A)* and T2

*(A*be state transitions with output bursts. SST and SST are the super-state transition cubes of final total states

*→*C)*A*and

*C*. Suppose that the T2

*(A*input burst does not contain an essential signal. Then hence This means that

*→*C)*A*cannot be an essential super-state because this would violate Definition 5.

#### 4. Metodolology

Our method begins from
the BM specification and implements the asynchronous controllers in the
architecture of Huffman with feedback output. The synthesis procedure has five
steps.
(1)If the BM specification satisfies Lemma
1 to go for Step (3), otherwise, Step (2).(2)Apply in the BM specification the
functional transformations that satisfy Lemma 1 (Sections 3.3 and 3.4).(3)Generate the BM-EHF specification with essential super-states (BM-ESS)
according to Section 3.5 (applying Definition 5).(4)Use the Minimalist tool that starts from
the BM-ESS specification and produces the equations of next-state hazard-free (sum
of products—*netlist*).(5)Use the Quartus tool [31] that starts
from the *netlist* in structural VHDL.

The BM specification shown in Figure 1
has been used to illustrate our method. Figure 5 shows BM-EHF specification
(Steps (1) and (2)). Figure 9 shows the BM-ESS specification (Step (3)). Steps (4) and (5)
accomplish the automatic synthesis. One-state variable *y*0 was required to solve the existing conflicts (see Figure 10)
[28]. Figure 11 shows logic circuit (RTL view—Altera). Figure 12 shows result of simulation of
the circuit that was obtained by our method (hazard-free waveforms).

#### 5. Discussion & Results

##### 5.1. Discussion

Figures 13 and 14 show, respectively, the
simulation results and the logic circuit of the mp-for-pkt
benchmark whose specification is shown in Figure 4. The synthesis was performed
using the Minimalist tool followed by the Quartus tool. Figure 13 shows two
glitches, one on the *Allocoutbound* output and one on the *AllocPB* output. For example, the glitch on
signal *Allocoutbound* occurs on state
transition Figure
14 shows the behavior in the logic circuit of the state transition 1*→*2. The
reason of the glitch: input signal *Req+* acts in the paths 1 and 2, where the change in the path 1 arrives first in LUT-5 (see Figure 14). This glitche can also be identified
in the BM flow map. Thespecification
is EHF (Lemma 1 is satisfied) but the implementation is not (Lemma 2 is not
satisfied), causing a transient essential hazard shown in Figure 15 (to apply
GUR rule—T2: ).

The result of simulation of the circuit that was obtained by our method shows that the glitches have been eliminated (see Figure 16). The area penalty was 8 LUTs against 5 LUTs in the first solution. The latency penalty was 2,2%.

##### 5.2. Results

We applied our theory to 9 known [8, 9, 12, 13] and one homemade benchmark. Table 1 presents the number of input and output signals, states, and transitions for each benchmark. Table 2 presents the area and timing results for these benchmarks synthesized as Huffman machines (with feedback output) before applying our theory. Syntheses performed using Minimalist followed by Quartus. The area was measured in terms of the number of LUTs while the latency was derived from simulations of the circuits already fitted on an EP2C35F672C7 device from Altera (Cyclone II family).

Table 3 presents the number of inputs and output signals, states, transitions, and dummy signals for the same benchmarks after applying the functional transformations required to satisfy Lemmas 1 and 2. Table 4 shows the same results for the benchmarks after adhering to Lemmas 1 and 2.

As expected we found an area
penalty (average of 54%), a latency penalty (average of 4,8%), and a state
variables penalty (average of 75%). The *call-proc* benchmark showed a
smaller area (less LUTs) and the *rev-setup* benchmark showed a reduced
latency time. However, the area penalties did not impact significantly the FPGA
usage 1%) still leaving
enough free space for a datapath and other components that could be placed on
the same device.

#### 6. Conclusions

This work presented two conditions that, if satisfied, guarantee that burst-mode asynchronous controllers can be mapped on any commercial LUT-based FPGA without incurring in essential hazards.

When these conditions are not satisfied, we presented functional transformations that may be used to solve the problem. In this case, there is an area (mainly are added state variables—75%) and a latency penalty. However, our experimental results on a set of known benchmark showed low latency penalty (4,8%) and low FPGA occupation overhead 1%). This type of burst-mode controllers may be combined with a self-timed datapath that have already been successfully synthesized on commercial FPGAs, in order to create fully asynchronous processor on FPGAs.

#### References

- C. J. Myers,
*Asynchronous Circuit Design*, John Wiley & Sons, New York, NY, USA, 2001. - S. Hauck, “Asynchronous design methodologies: an overview,”
*Proceedings of the IEEE*, vol. 83, no. 1, pp. 69–93, 1995. View at Publisher · View at Google Scholar - S. H. Unger, “Hazards, critical races, and metastability,”
*IEEE Transactions on Computers*, vol. 44, no. 6, pp. 754–768, 1995. - S. Hauck, S. Burns, G. Borriello, and C. Ebeling, “An FPGA for implementing asynchronous circuits,”
*IEEE Design & Test of Computers*, vol. 11, no. 3, pp. 60–69, 1994. View at Publisher · View at Google Scholar - D. M. Chapiro,
*Globally-asynchronous locally-synchronous systems*, Ph.D. thesis, Stanford University, Stanford, Calif, USA, 1984. - S. Burns and A. Martin, “Syntax-directed translation of concurrent programs into self-timed circuits,” in
*Proceedings of the 5th MIT Conference on Advanced Research in VLSI*, J. Allen and T. Leighton, Eds., pp. 35–50, MIT Press, Cambridge, Mass, USA, March 1988. - I. E. Sutherland, “Micropipelines,”
*Communications of ACM*, vol. 32, no. 6, pp. 720–738, 1989. View at Publisher · View at Google Scholar - T.-A. Chu,
*Synthesis of self-timed VLSI circuits from graph-theoretic specifications*, Ph.D. thesis, Department of EECS, MIT, Cambridge, Mass, USA, June 1987. - S. M. Nowick, K. Y. Yun, and D. L. Dill, “Practical asynchronous controller design,” in
*Proceedings of the IEEE International Conference on Computer Design (ICCD '92)*, pp. 341–345, Cambridge, Mass, USA, October 1992. View at Publisher · View at Google Scholar - S. M. Nowick and B. Coates, “UCLOCK: automated design of high-performance unclocked state machines,” in
*Proceedings of the IEEE International Conference on Computer Design (ICCD '94)*, pp. 434–441, Cambridge, Mass, USA, October 1994. View at Publisher · View at Google Scholar - S. M. Nowick, M. E. Dean, D. L. Dill, and M. Horowitz, “The design of a high-performance cache controller: a case study in asynchronous synthesis,”
*Integration, the VLSI Journal*, vol. 15, no. 3, pp. 241–262, 1993. View at Publisher · View at Google Scholar - A. Marshall, B. Coates, and F. Siegel, “Designing an asynchronous communications chip,”
*IEEE Design & Test of Computers*, vol. 11, no. 2, pp. 8–21, 1994. View at Publisher · View at Google Scholar - A. Davis, B. Coates, and K. Stevens, “Automatic synthesis of fast compact self-timed control circuits,” in
*Proceedings of the IFIP Working Conference on Asynchronous Design Methodologies*, Manchester, UK, April 1993. - E. Brunvand, “Using FPGAs to implement self-timed systems,”
*The Journal of VLSI Signal Processing*, vol. 6, no. 2, pp. 173–190, 1993. View at Publisher · View at Google Scholar - K. Maheswaran and V. Akella, “Hazard-free implementation of the self-timed cell set in a Xilinx FPGA,” University of California, Davis, Calif, USA, 1994.
- Y. Zafar and M. M. Ahmed, “A novel FPGA compliant micropipeline,”
*IEEE Transactions on Circuits and Systems II*, vol. 52, no. 9, pp. 611–615, 2005. View at Publisher · View at Google Scholar - A. Ejnioui, “FPGA prototyping of a two-phase self-oscillating micropipeline,” in
*Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI '07)*, pp. 437–438, Porto Alegre, Brazil, March 2007. View at Publisher · View at Google Scholar - N. Huot, H. Dubreuil, L. Fesquet, and M. Renaudin, “FPGA architecture for multi-style asynchronous logic,” in
*Proceedings of the Conference on Design, Automation and Test in Europe (DATE '05)*, vol. 1, pp. 32–33, Munich, Germany, March 2005. View at Publisher · View at Google Scholar - X. Jia and R. Vemuri, “The GAPLA: a globally asynchronous locally synchronous FPGA architecture,” in
*Proceedings of the 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM '05)*, pp. 291–292, Napa, Calif, USA, April 2005. View at Publisher · View at Google Scholar - S. C. Smith, “Design of an FPGA logic element for implementing asynchronous NULL convention logic circuits,”
*IEEE Transactions on Very Large Scale Integration (VLSI) Systems*, vol. 15, no. 6, pp. 672–683, 2007. View at Publisher · View at Google Scholar - D. Sokolov and A. Yakovlev, “Clockless circuits and system synthesis,”
*IEE Proceedings: Computers and Digital Techniques*, vol. 152, no. 3, pp. 298–316, 2005. View at Publisher · View at Google Scholar - H. Jacobson,
*Asynchronous circuit design: a case study of a framework called ACK*, M.S. thesis, Luleå University of Technology, Luleå, Sweden, 1996. - S. M. Nowick, “Automatic synthesis of burst-mode asynchronous controllers,” Stanford University, Stanford, Calif, USA, 1995.
- S. M. Nowick and D. L. Dill, “Exact two-level minimization of hazard-free logic with multiple-input changes,”
*IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems*, vol. 14, no. 8, pp. 986–997, 1995. View at Publisher · View at Google Scholar - P. Siegel, G. De Micheli, and D. Dill, “Automatic technology mapping for generalized fundamental-mode asynchronous designs,” in
*Proceedings of the 30th ACM/IEEE Design Automation Conference (DAC '93)*, pp. 61–67, Dallas, Tex, USA, June 1993. - B. Lin and S. Devadas, “Synthesis of hazard-free multilevel logic under multiple-input changes from binary decision diagrams,”
*IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems*, vol. 14, no. 8, pp. 974–985, 1995. View at Publisher · View at Google Scholar - K. Y. Yun and D. L. Dill, “Automatic synthesis of extended burst-mode circuits. I. (Specification and hazard-free implementations),”
*IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems*, vol. 18, no. 2, pp. 101–117, 1999. View at Publisher · View at Google Scholar - R. M. Fuhrer, S. M. Nowick, M. Theobald, N. K. Jha, and L. A. Plana, “Minimalist: an environment for the synthesis and verification of burst-mode asynchronous machines,” in
*Proceedings of the International Workshop on Logic Synthesis (IWLS '98)*, Lake Tahoe, Calif, USA, June 1998. - H. M. Jacobson and C. J. Myers, “Efficient algorithms for exact two-level hazard-free logic minimization,”
*IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems*, vol. 21, no. 11, pp. 1269–1283, 2002. View at Publisher · View at Google Scholar - S. H. Unger, “Hazards and delays in asynchronous sequential switching circuits,”
*IRE Transactions on Circuit Theory*, vol. 6, no. 1, pp. 12–25, 1959. - Altera Corporation, http://www.altera.com/.