| |||||||||
hardware description language, used for the design of ASICs and FPGAs. Verilog has a syntax reminiscent of C, which helps explain its rapid take up among engineers who had already learned to use that language. It is case-sensitive.
It differs from C primarily in how the language represents literals and the ability to deal with time. The language (as do most hardware description languages) has the ability to simulate parallel execution of multiple threads.
Verilog was first developed at Gateway Design Automation around 1984 as a hardware modeling language. Gateway Design Automation was later purchased by Cadence Design Systems in 1990. Cadence now had full proprietary rights to Gateway's Verilog and the Verilog-XL simulator logic simulators.
With the increasing success of VHDL, Cadence moved down the Accellera) organization. Verilog was later submitted to IEEE and became IEEE Standard 1364-1995, commonly referred to as Verilog-95.
Extensions to Verilog-95 were submitted back to IEEE to cover the deficiencies that users had found in the original Verilog standard. These extensions became IEEE Standard 1364-2001 known as Verilog 2001
The advent of High Level Verification languages such as OpenVera, and Verisity's E language encouraged the development of Superlog by Co-Design Automation Inc. Co-Design Automation Inc was later purchased by Synopsys. The foundations of Superlog and Vera have been donated to Accellera. It has been transformed and updated to SystemVerilog which will likely become the next IEEE standard.
An example counter circuit follows:
The "<=" operator in verilog is another aspect of it's being a hardware description language as oppossed to a normal procedural language. This is known as a "non-blocking" statement. When the simulation runs, all of the signals with a "<=" operator are evaluated in parallel. This is very similar to the behavior of a real Flip/Flop.
The other choice for assignment is an "=" operator and this is known as a blocking assignment. When the "=" operator is used, things occur in the sequence they occur much like a procedural language.
The always clause above illustrates the other type of method of use, i.e. the always clause executes any time any of the entities in the list change, i.e. the a,b, or c change.
The resulting values of a,b,c and d above would be 0 since first "a = 0" executes, followed by "b = a", etc.