skip to main content
article
Free Access

Retiming-based factorization for sequential logic optimization

Published:01 July 2000Publication History
Skip Abstract Section

Abstract

Current sequential optimization techniques apply a variety of logic transformations that mainly target the combinational logic component of the circuit. Retiming is typically applied as a postprocessing step to the gate-level implementation obtained after technology mapping. This paper introduces a new sequential logic transformation which integrates retiming with logic transformations at the technology-independent level. This transformation is based on implicit retiming across logic blocks and fanout stems during logic optimization. Its application to sequential network synthesis results in the optimization of logic across register boundaries. It can be used in conjunction with any measure of circuit quality for which a fast and reliable gain estimation method can be obtained. We immplemented our new technique within the SIS framework and demonstrated its effectiveness in terms of cycle-time minimization on a set sequential benchmark circuits.

References

  1. CHAKRADHAR, S. T., DEY, S., POTKONJAK, M., AND ROTHWEILER, S. G. 1993. Sequential circuit delay optimization using global path delays. In Proceedings of the 30th ACM/IEEE International Conference on Design Automation (DAC '93, Dallas, TX, June 14-18), A. E. Dunlop, Ed. ACM Press, New York, NY, 483-489. Google ScholarGoogle Scholar
  2. CHANDRAKASAN, A. P., POTKONJAK, M., MEHRA, R., RABEY, J., AND BRODERSON, R. W. 1995. Optimizing power using transformations. IEEE Trans. Comput.-Aided Des. Integr. Circuits 14, 1 (Jan. 1995), 12-31. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. DE MICHELI, G. 1991. Synchronous logic synthesis: Algorithms for cycle-time optimization. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 10, 1 (Jan. 1991), 63-73.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. DE MICHELI, G. 1994. Synthesis and Optimization of Digital Circuits. McGraw-Hill, Inc., New York, NY. Google ScholarGoogle Scholar
  5. DEY, S., POTKONJAK, M., AND ROTHWEILER, S. G. 1992. Performance optimization of sequential circuits by eliminating retiming bottlenecks. In Proceedings of the 1992 IEEE/ACM International Conference on Computer-Aided Design (ICCAD '92, Santa Clara, CA, Nov. 8-12), L. Trevillyan, Ed. IEEE Computer Society Press, Los Alamitos, CA, 504-509. Google ScholarGoogle Scholar
  6. GUTWIN, P., MCGEER, P., AND BRAYTON, R. 1992. Delay rrediction for technology-independent logic equations. In Proceedings of the IEEE International Conference on Computer Design, IEEE Computer Society Press, Los Alamitos, CA, 468-471. Google ScholarGoogle Scholar
  7. HACHTEL, G. D., HERMIDA, M., PARDO, A., PONCINO, M., AND SOMENZI, F. 1994. Re-encoding sequential circuits to reduce power dissipation. In Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design (ICCAD '94, San Jose, CA, Nov. 6-10, 1994), J. A. G. Jess and R. Rudell, Eds. IEEE Computer Society Press, Los Alamitos, CA, 70-73. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. HASSOUN, S. AND EBELING, C. 1996. Architectural retiming: Pipelining latency-constrained circuits. In Proceedings of the 33rd Annual Conference on Design Automation (DAC '96, Las Vegas, NV, June 3-7), T. P. Pennino and E. J. Yoffa, Eds. ACM Press, New York, NY, 708-713. Google ScholarGoogle Scholar
  9. IMAN, S. AND PEDRAM, M. 1995. Logic extraction and factorization for low power. In Proceedings of the 32nd ACM/IEEE Conference on Design Automation (DAC '95, San Francisco, CA, June 12-16, 1995), B. T. Preas, Ed. ACM Press, New York, NY, 248-253. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. IQBAL, Z., POTKONJAK, M., DEY, S., AND PARKER, A. 1993. Critical path minimization using retiming and algebraic speed-up. In Proceedings of the 30th ACM/IEEE International Conference on Design Automation (DAC '93, Dallas, TX, June 14-18), A. E. Dunlop, Ed. ACM Press, New York, NY, 573-577. Google ScholarGoogle Scholar
  11. LALGUDI, K. N. AND PAPAEFTHYMIOU, M. C. 1995. DELAY: An efficient tool for retiming with realistic delay modeling. In Proceedings of the 32nd ACM/IEEE Conference on Design Automation (DAC '95, San Francisco, CA, June 12-16, 1995), B. T. Preas, Ed. ACM Press, New York, NY, 304-309. Google ScholarGoogle Scholar
  12. LEISERSON, C., ROSE, F., AND SAXE, g. 1983. Optimizing synchronous circuitry by retiming. In Proceedings of the Third Caltech Conference on VLSI, 87-116.Google ScholarGoogle Scholar
  13. LIN, B. 1993. Restructuring of synchronous logic circuits. In Proceedings of the 1993 European Conference on Design Automation (EDAC '93 EURO-ASIC, Feb.), 205-209.Google ScholarGoogle Scholar
  14. MALIK, S., SENTOVICH, E., BRAYTON, R., AND SANGIOVANNI-VINCENTELLI, A. 1991. Retiming and resynthesis: Optimizing sequential networks with combinational techniques. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 10, 1 (Jan. 1991), 74-84.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. MONTEIRO, J., DEVADAS, S., AND GHOSH, A. 1993. Retiming sequential circuits for low power. In Proceedings of the International Conference on Computer-Aided Design (ICCAD '93, Santa Clara, CA, Nov. 7-11), M. Lightner and J. A. G. Jess, Eds. IEEE Computer Society Press, Los Alamitos, CA, 398-402. Google ScholarGoogle Scholar
  16. O'NEILL, N. 1997. Sequential logic synthesis based on retiming-based factorization. Master's Thesis. University of Massachusetts Press, Amherst, MA.Google ScholarGoogle Scholar
  17. POTKONJAK, M., DEY, S., IQBAL, Z., AND PARKER, A. 1993. High performance embedded system optimization using algebraic and generalized retiming techniques. In Proceedings of the IEEE International Conference on Computer Design, IEEE Computer Society Press, Los Alamitos, CA, 498-504.Google ScholarGoogle Scholar
  18. SHENOY, N. AND RUDELL, R. 1994. Efficient implementation of retiming. In Proceedings of the 1994 IEEE /ACM International Conference on Computer-Aided Design (ICCAD '94, San Jose, CA, Nov. 6-10, 1994), J. A. G. Jess and R. Rudell, Eds. IEEE Computer Society Press, Los Alamitos, CA, 226-233. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. SINGHAL, V., PIXLEY, C., RUDELL, R. L., AND BRAYTON, R. K. 1995. The validity of retiming sequential circuits. In Proceedings of the 32nd ACM/IEEE Conference on Design Automation (DAC '95, San Francisco, CA, June 12-16, 1995), B. T. Preas, Ed. ACM Press, New York, NY, 316-321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. TOUATI, H. J. AND BRAYTON, R. K. 1993. Computing the initial states of retimed circuits. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 12, 1 (Jan. 1993), 157-162.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. WALLACE, D. AND CHANDRASEKHAR, M. 1990. High level delay estimation for technologyindependent logic equations. In Proceedings of the IEEE International Conference on Computer Aided Design, IEEE Computer Society Press, Los Alamitos, CA.Google ScholarGoogle Scholar
  22. WEHN, N., BIESENACK, J., DuzY, P., LANGMAIER, T., M NCH, M., PILSL, M., AND RUMLER, S. 1994. Scheduling of behavioral VHDL by retiming techniques. In Proceedings of the European Conference on Design Automation (EURO-DAC '94, Grenoble, France, Sept. 19-23, 1994), J. Mermet, Ed. IEEE Computer Society Press, Los Alamitos, CA, 546-551. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Retiming-based factorization for sequential logic optimization

    Recommendations

    Reviews

    Cristiana Bolchini

    Devices are growing more complex, and design methodologies are moving toward higher levels of abstraction. The authors present the results of their work in introducing retiming issues early in the design process in order to exploit the additional degrees of freedom and to reduce overhead. The main achievement consists of the possibility of performing circuit retiming during the synthesis process, specifically during the design optimization step, rather than in the last stage of the device realization. A thorough review of other approaches found in the literature explains the state of the art of circuit retiming, and highlights the limits of the current methods. In order to explain the goal of their proposed technique, the authors introduce a small but explanatory circuit example that shows the benefits of explicitly taking into account the effects of retiming on logic simplification. The next sections present the theoretical basis of the retiming operation and the algorithms used to carry it out. Several network examples help explain the concepts, allowing readers without a strong background in logic synthesis, optimization, and retiming to follow the discussion. A review of the usual delay models is presented in order to provide a complete background before introducing the theorems supporting the proposed retiming methodology. Experiments with a well-known set of benchmark circuits support the authors' work and demonstrate the advantages of introducing retiming issues at the beginning of the device realization process.

    Access critical reviews of Computing literature here

    Become a reviewer for Computing Reviews.

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Design Automation of Electronic Systems
      ACM Transactions on Design Automation of Electronic Systems  Volume 5, Issue 3
      July 2000
      483 pages
      ISSN:1084-4309
      EISSN:1557-7309
      DOI:10.1145/348019
      Issue’s Table of Contents

      Copyright © 2000 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 July 2000
      Published in todaes Volume 5, Issue 3

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader