• https://doi.org/10.1007/978-1-4615-1713-9_13Copy DOI Icon

Combinational logic sensitivity lists

  • Jan 1, 2002
  • Stuart Sutherland
Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

In hardware, combinational logic outputs reflect the values of the inputs to that block of logic. There is no storage in combinational logic, so each time any input changes, the output may be affected. To properly model the behavior of combinational logic using a Verilog always procedure requires using an @( ) construct at the very beginning of the procedure. The list of signals must include every input to that block of combinational logic. An input to the logic is any signal whose value may be read by that procedure. Two examples of a simple block of combinational logic modeled using a Verilog always procedure are:

Similar Papers
  • Research Article
  • Citations206

Retiming and resynthesis: optimizing sequential networks with combinational techniques

  • Jan 01, 1991
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • S Malik +3
  • Conference Article
  • Citations44

The effect of logic block complexity on area of programmable gate arrays

  • Jan 01, 1989
  • J Rose +3
  • Conference Article

Mapping algorithms to the Amalgam programmable-reconfigurable processor

  • Sep 22, 2002
  • J.J Cook +5
  • Research Article
  • Citations3

Design of an All-Magnetic Computing System: Part I-Circuit Design

  • Jun 01, 1961
  • IEEE Transactions on Electronic Computers
  • H D Crane +1
  • Conference Article
  • Citations5

An on-line reconfigurable FPGA architecture

  • Oct 25, 2000
  • P.K Lala +1
  • Research Article
  • Citations5

A fast and accurate delay dependent method for switching estimation of large combinational circuits

  • Nov 21, 2002
  • Journal of Systems Architecture
  • S Theoharis +4
  • PDF
  • Research Article
  • Citations31

Constructing Low-latency Involutory MDS Matrices with Lightweight Circuits

  • Mar 08, 2019
  • IACR Transactions on Symmetric Cryptology
  • Shun Li +4
  • Conference Article
  • Citations1

A practical cut-based physical retiming algorithm for field programmable gate arrays

  • Jan 01, 2005
  • Peter Suaris +2
  • Research Article
  • Citations89

Computing the initial states of retimed circuits

  • Jan 01, 1993
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • H.J Touati +1
  • Research Article
  • Citations37

Partitioning circuits for improved testability

  • Jun 01, 1991
  • Algorithmica
  • Sandeep N Bhatt +2
  • Research Article
  • Citations1

Hardware Optimized Modular Reduction

  • Jan 29, 2025
  • Electronics
  • Alexander Magyari +1
  • Conference Article
  • Citations3

State-holding in Look-Up Tables: application to asynchronous logic

  • Oct 01, 2006
  • Laurent Fesquet +3
  • Research Article
  • Citations13

I/sub DDQ/ testing of bridging faults in logic resources of reconfigurable field programmable gate arrays

  • Jan 01, 1998
  • IEEE Transactions on Computers
  • Lan Zhao +2
  • Conference Article
  • Citations19

In-place decomposition for robustness in FPGA

  • Nov 01, 2010
  • Ju-Yueh Lee +2
  • Research Article
  • Citations1

Ternary Representation of Zero Cubes in the Design of Combinational Switching Circuits

  • Jul 01, 1988
  • IETE Journal of Education
  • K Deergha Rao
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.