Elsevier

Integration

Volume 47, Issue 1, January 2014, Pages 148-159
Integration

Dual-rail asynchronous logic multi-level implementation

https://doi.org/10.1016/j.vlsi.2013.02.002Get rights and content

Abstract

A synthesis flow oriented on producing the delay-insensitive dual-rail asynchronous logic is proposed. Within this flow, the existing synchronous logic synthesis tools are exploited to design technology independent single-rail synchronous Boolean network of complex (AND-OR) nodes. Next, the transformation into a dual-rail Boolean network is done. Each node is minimized under the formulated constraint to ensure hazard-free implementation. Then the technology dependent mapping procedure is applied. The MCNC and ISCAS benchmark sets are processed and the area overhead with respect to the synchronous implementation is evaluated. The implementations of the asynchronous logic obtained using the proposed (with AND-OR nodes) and the state-of-the-art (nodes are designed based on DIMS, direct logic and NCL) network structures are compared. A method, where nodes are designed as simple (NAND, NOR, etc.) gates is chosen for a detailed comparison. In our approach, the number of completion detection logic inputs is reduced significantly, since the number of nodes that should be supplied with the completion detection is less than in the case of the network structure that is based on simple gates. As a result, the improvement in sense of the total complexity and performance is obtained.

Highlights

► A synthesis flow producing a boolean network of complex nodes is proposed. ► Each node is minimized under the constraint to ensure hazard-free implementation. ► The technology-dependent mapping procedure is proposed. ► The number of completion detection logic inputs is reduced significantly. ► The improvement in sense of the total complexity and performance is obtained.

Introduction

Asynchronous logic attracts an increasing interest of designers because asynchronous (delay-insensitive—DI) circuits are extremely robust. This means, the design is able to adapt to variations of manufacturing process parameters, gate and wire delays, temperature changes, noise, etc. [1]. The correct function is guaranteed, only the operational speed changes adaptively. Furthermore, a DI paradigm is very similar to the synchronous one and generally, the DI design process follows the same steps as in synchronous logic design. As a result, the developed DI design flow can be easily incorporated into the design industry, since the tools and design processes are familiar to designers. The DI design process can be easier implemented, since a minimal delay analysis is required to ensure the circuit correct behavior. DI paradigm has additional advantages in designing complex circuits including substantially reduced crosstalk between analog and digital circuits, ease of multi-rate circuits cooperation and facilitation of component reuse [15].

The general disadvantages of DI asynchronous circuits with regard to the synchronous ones are high area and huge power consumption overheads, although the thermal distribution is uniform across the chip.

We propose a synthesis flow of multi-level DI dual-rail implementation. It is based on exploiting synchronous logic synthesis tools to produce a single-rail Boolean network of a two-level (AND-OR) nodes, and further transformation of the network into a dual-rail one. Based on results [18], each node is designed as a hazard-free structure. Finally, the technology-dependent mapping procedure is applied. For the comparison, several state-of-the-art methods are considered, where nodes are designed based on DIMS [13], direct logic [11], and NCL [15]. For the detailed comparison, the method [17], where each single-rail Boolean network node is designed as a simple gate (NAND, NOR, etc.) was chosen. We believe that this method is the closest one to our approach. Although [17] is supposed for designing some other class of circuits, it is clear that the method can easily be adapted for DI logic synthesis. Indeed, the Boolean network [17] is designed as a dual-rail hazard-free logic. The indication of the new input state and internal stability can be done using the completion detection (CD) logic proposed in this paper.

The main disadvantage of the method [17] is a large number of nodes that should be supplied with the CD—the completion detection must be provided for each simple gate. It is not the case of our approach, where the number of nodes of the synthesized Boolean network is significantly less than in [17]. Therefore, in our approach, the CD logic complexity is reduced, although the functional logic implementation complexity may be slightly increased (to ensure hazard-free implementation of the AND-OR nodes). As a result, the improvement in sense of the total complexity and performance is obtained. The other approaches to CD optimization can be found in literature. Namely, in [30], the optimization method based on evaluation of the gates relative timing was proposed. In [31], the method in a cost-aware manner was described.

The rest of the paper is organized as follows. In Section 2, the review of the related works is given. The information and notations regarding dual-rail logic is presented in Section 3. Also, details of DI logic behavior rules that are based on Seitz's strong and weak constraints [10] are described. Section 4 is devoted to the description of the model with modified weak constraints. Next, the node minimization constraint to ensure hazard-free implementation is formulated and the structure of the dual-rail network is proposed. Examples illustrating the state-of-the-art and our approaches are given. It is shown that our approach produces networks with significantly less number of signals the CD logic is supplied with. Section 5 describes the technology-independent and technology-dependent synthesis procedure. Experimental results are given in Section 6. Statements summarizing the results conclude the paper.

Section snippets

Related work

The asynchronous logic is classified depending on the mode of interaction with the environment [27]. In the input–output mode, the environment is allowed to change the input state once a new output state is produced. There is no assumption about internal signals and the environment is allowed to change the input state before the circuit is stabilized in response to the previous input state.

In the fundamental mode (assumed in this paper, too), the logic operates based on the following

Single and dual-rail encoding

Let F={f1, f2,…,fq} be a multi-output function of n primary inputs X: X={x1, x2,…,xn} and q primary outputs. Let Y={y1, y2,…,ym}, f1, f2,…,fqY, mq, be a set of single-output Boolean nodes obtained as a result of a decomposition of F. Each node function yc depends on given k or less number on inputs: yc=yc(zc1, zc2,…,zck), |yc|≤k, zc1, zc2,…,zck∈{XY\{f1, f2,…,fq, yc}}. We call it a single-rail multi-level implementation. In [17], the node is a simple gate (NOR, NAND, etc). In our case it may

Behavior rule

To design the minimized two-level AND-OR logic, we introduce the model with modified weak constraints [18] under the following behavior rules (Fig. 3):

  • 1.

    If some inputs are in a working state then all outputs are going to a working state.

  • 2.

    If all inputs are in a working state then all outputs remain in a working state.

  • 3.

    If some inputs are in the spacer state then all outputs are going to the spacer state.

  • 4.

    If all inputs are in the spacer state then all outputs remain in the spacer state.

The structure

Technology-independent synthesis

The proposed procedure of synthesis of the multi-level dual-rail logic with AND-OR nodes is based on tools ABC [19] used for multi-level synthesis, Espresso [20] minimizing two-level (represented as AND-OR structure) nodes, and DSOP [21] used to obtain two-level nodes with orthogonal terms.

We start with an initial circuit description. First, an ABC script is applied to it, to obtain a multi-level single-rail Boolean network with the fan-in of each node limited to a given k. For this purpose, we

Experimental background

We have processed the MCNC [23] and ISCAS [24], [25] sets of benchmarks, 228 circuits altogether. We evaluate the complexity (expressed as the number of transistors) and the performance (by summarizing gates logical efforts [26] within the critical path) of the proposed asynchronous implementation of these circuits and compare it to the state-of-the-art [13], [15], [17].

We suppose a technology dependent synthesis (fan-ins of NAND gates and C-elements do not exceed a given k).

Suppose, given a

Discussion and conclusions

A novel synthesis flow of the dual-rail asynchronous multi-level logic is proposed. The logic is implemented as a monotonous multi-level network of minimized AND-OR nodes together with the CD logic. Each node is a hazard-free structure. We have formulated an additional minimization constraint (the SOP terms must be mutually orthogonal) for that purpose.

The proposed method offers a possibility of designing asynchronous circuits using both synchronous design tools and standard target technology

Igor Lemberski received a mathematician engineer diploma (1974) from Riga Polytechnical Institute, Riga, Latvia and Ph.D. degree in computer engineering (1982) from Institute of Electronics and Computer Science, Riga, Latvia. After that, he has been a researcher with several research institutes, a docent and an associate professor with Riga Aviation University and Transport and Telecommunication Institute, Riga, Latvia. Since 2000 till 2002, he has been a visiting researcher with Delft

References (31)

  • A.J. Martin

    The first asynchronous microprocessor: the test results

    ACM SIGARCH Computer Architecture News

    (1989)
  • W.J. Bainbridge et al., Delay-Insensitive, Point-to-Point Interconnect using m-of-n codes, in: Proceedings of the 9th...
  • S.H Unger

    Asynchronous Sequential Switching Circuits

    (1969)
  • S.M. Nowick, Automatic Synthesis of Burst-Mode Asynchronous Controllers, Ph.D. Thesis, Stanfort University, March...
  • S.M. Nowick et al.

    Exact two-level minimization of hazard-free logic with multiple-input changes

    IEEE Transactions on Computer-Aided Design

    (1995)
  • D. Kung, Hazard-non-increasing gate-level optimization algorithm, in: Peoceedings of the IEEE International Conference...
  • P. Beerel, K.Y. Yun, W.C. Chou, Opimizing average-case delay in technology mapping of burst-mode circuits, in:...
  • P. Siegel, G.D. Micheli, D. Dill, Automatic technology mapping for generalized fundamental mode asynchronous designs,...
  • W.J. Dally et al.

    Digital Systems Engineering

    (1998)
  • C.L. Seitz
  • C.D Nielsen, Evaluation of Function Block Designs, Technical Report 1994–135, Department of Computer Science, Technical...
  • W.B. Toms, D.A. Edwards, Prime indicants: a synthesis method for indicating combinational logic blocks, in: Proceedings...
  • E.J. Sparsø, J. Staunstrup, M. Dantzer-Sørensen, Design of delay insensitive circuits using multi-ring structures, in:...
  • M. Ligthart, K. Fant, R. Smith, A. Taubin, A. Kondratyev, Asynchronous design using commercial HDL synthesis tools, in:...
  • S.C. Smith et al.

    Designing Asynchronous Circuits using NULL Convention Logic (NCL)

    (2009)
  • Cited by (7)

    • Efficient adders for assistive devices

      2017, Engineering Science and Technology, an International Journal
    • Comments on "dual-rail asynchronous logic multi-level implementation"

      2016, Integration
      Citation Excerpt :

      Thus, a compact DSOP form would be either: f=ab'c+bc+dc' or f=ac+a'bc+dc'. Moreover, [1, Fig. 8a and b] is in fact similar, and either one of them is redundant. The second problem with [1] is indeed highly critical.

    • Asynchronous dual-rail transition logic for enhanced DPA resistance

      2015, International Journal of Engineering and Technology
    View all citing articles on Scopus

    Igor Lemberski received a mathematician engineer diploma (1974) from Riga Polytechnical Institute, Riga, Latvia and Ph.D. degree in computer engineering (1982) from Institute of Electronics and Computer Science, Riga, Latvia. After that, he has been a researcher with several research institutes, a docent and an associate professor with Riga Aviation University and Transport and Telecommunication Institute, Riga, Latvia. Since 2000 till 2002, he has been a visiting researcher with Delft University of Technology, Delft, Netherlands and a research fellow with South Bank University, London, UK. Since 2003 he has been an IT professor with Gwangju Institute of Science and Technology, Gwangju, South Korea. Currently, he is a professor with the Baltic International Academy, Riga, Latvia. His research interests include all aspects of logic synthesis for both synchronous and asynchronous discrete circuits.

    Petr FISˇER received his MSc. and Ph.D. degrees in Computer Science and Engineering at the Czech Technical University in Prague in 2002 and 2007, respectively. He currently works as an assistant professor at the same university, Faculty of Information Technology. His main areas of interest are logic synthesis, two-level and multi-level optimization, build-in self-test (BIST), test compression and on-line testing.

    View full text