Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Logic gate
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Data storage and sequential logic == [[File:R-S mk2.gif|thumb|Animation of how an SR [[NOR gate]] latch works.]] {{Main|Sequential logic}} Logic gates can also be used to hold a state, allowing data storage. A storage element can be constructed by connecting several gates in a "[[Latch (electronics)|latch]]" circuit. Latching circuitry is used in [[static random-access memory]]. More complicated designs that use [[clock signal]]s and that change only on a rising or falling edge of the clock are called edge-triggered "[[flip-flop (electronics)|flip-flops]]". Formally, a flip-flop is called a [[bistable circuit]], because it has two stable states which it can maintain indefinitely. The combination of multiple flip-flops in parallel, to store a multiple-bit value, is known as a register. When using any of these gate setups the overall system has memory; it is then called a [[sequential logic]] system since its output can be influenced by its previous state(s), i.e. by the ''sequence'' of input states. In contrast, the output from [[combinational logic]] is purely a combination of its present inputs, unaffected by the previous input and output states. These logic circuits are used in computer [[computer memory|memory]]. They vary in performance, based on factors of [[speed]], complexity, and reliability of storage, and many different types of designs are used based on the application.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)