Mobile
Verilog Online Help Prev Page Prev Page
Table of Contents
Bit-select
Block Statements
Built-in Primitives
Case Statement
Continuous Assignments
Conversion Functions
Comments
Compiler Directives
Concatenations
Conditional Operator
Delays
Disable Statement
Display Tasks
Edge Sensitive Path
Expression Bit Length
File I/O Functions
Functions
Identifiers
If Statement
Integer Constants
Intra-assignment Timing Controls
Keywords
Loop Statements
Memories
min:typ:max Delays
Module Declaration
Module Instantiation
Module Path Declaration
Module Path Polarity
Net Data Types
Operators
Parameters
Part-select
PLA Modeling Tasks
Probabilistic Distribution Functions
Procedural Assignments
Procedural Continuous Assignments
Procedural Timing Control
Range Specification
Real Constants
Register Data Types
Simulation Control Tasks
Simulation Time Functions
Specify Block
State Dependent Path
Stochastic Analysis Tasks
Strengths
Strings
Structured Procedures
Tasks
Timescale System Tasks
Timing Check Tasks
UDP Declaration
UDP Instantiation
UDP State Table
Value Change Dump (VCD) File
Vectors

Edge Sensitive Path

Formal Definition

The edge sensitive path is a module path described with an edge transition at the source.

Simplified Syntax

Paralel_path:

  ([edge_identifier] input_terminal =>

  output_terminal [polarity]:data_source) = delays;

Full_path :

  ([edge_identifier] input_terminal *>

  output_terminal [polarity]:data_source) = delays;

Edge identifier:

  posedge

  negedge

Polarity:

  + -

Description

The edge sensitive path is the same as simple module path. The difference is that in the edge sensitive path, the source edge transition is used. The edge identifier can be either a posedge or a negedge. If an input is declared as a vector port then the least significant bit is used to detect the edge transition. If no transition is specified, then the edge sensitive path works as a simple module path (i.e. at any transition that occurs on an input terminal).

The polarity operator describes if data passing from the source to the output is inverted (-) or not inverted (+).

The keywords posedge and negedge can be used both in parallel and in full paths.

Examples

Example 1

(posedge clk => (q +: d)) = (3,1);

At a positive edge on a 'clk' signal the value of 'q' will change, using the rising delay of 3 and the falling delay of 1 time unit. The data path travels from 'd' to 'q' and data is not inverted.

Important Notes

  • The polarity operator is used by timing analysis tools and is ignored by the simulator.

 

Powered by IXwebhosting