Skip to main content

List of Operators

>> Logical Operators
>> Relational Operators
>> Equality Operators
>> Arithmetic Operators
>> Bitwise Operators
>> Reduction Operators
>> Shift Operators
>> Conditional Operators
>> Replication Operators
>> Concatenation Operators
>> Operator Precedence


Logical Operators

Symbol Description #Operators
! Logical negation One
|| Logical OR Two
&& Logical AND Two

Relational Operators

Symbol Description #Operators
> Greater than Two
< Less than Two
>= Greater than or equal to Two
<= Less than or equal to Two

Equality Operators

Symbol Description #Operators
== Equality Two
!= Inequality Two
=== Case equality Two
!== Case inequality Two

Arithmetic Operators

Symbol Description #Operators
+ Add Two
- Substract Two
* Multiply Two
/ Divide Two
** Power Two
% Modulus Two

Bitwise Operators

Symbol Description #Operators
~ Bitwise negation One
& Bitwise AND Two
| Bitwise OR Two
^ Bitwise XOR Two
^~ or ~^ Bitwise XNOR Two

Reduction Operators

Symbol Description #Operators
& Reduction AND One
~& Reduction NAND One
| Reduction OR One
~| Reduction NOR One
^ Reduction XOR One
^~ or ~^ Reduction XNOR One

Shift Operators

Symbol Description #Operators
>> Right shift Two
<< Left shift Two
>>> Arithmetic right shift Two
<<< Arithmetic left shift Two

Conditional Operators

Symbol Description #Operators
?: Conditional Two

Replication Operators

Symbol Description #Operators
{ { } } Replication > One

Concatenation Operators

Symbol Description #Operators
{ } Concatenation > One

Operator Precedence




<< Previous Home Next >>

Labels:

Comments

Post a Comment

Popular posts from this blog

Digital Design Interview Questions - All in 1

1. How do you convert a XOR gate into a buffer and a inverter (Use only one XOR gate for each)? Answer 2. Implement an 2-input AND gate using a 2x1 mux. Answer 3. What is a multiplexer? Answer A multiplexer is a combinational circuit which selects one of many input signals and directs to the only output. 4. What is a ring counter? Answer A ring counter is a type of counter composed of a circular shift register. The output of the last shift register is fed to the input of the first register. For example, in a 4-register counter, with initial register values of 1100, the repeating pattern is: 1100, 0110, 0011, 1001, 1100, so on. 5. Compare and Contrast Synchronous and Asynchronous reset. Answer Synchronous reset logic will synthesize to smaller flip-flops, particularly if the reset is gated with the logic generating the d-input. But in such a case, the combinational logic gate count grows, so the overall gate count savings may not be that significant. The clock works as a filter for sma...
226 comments
Read more

One-hot Encoding

Designing a FSM is the most common and challenging task for every digital logic designer. One of the key factors for optimizing a FSM design is the choice of state coding, which influences the complexity of the logic functions, the hardware costs of the circuits, timing issues, power usage, etc. There are several options like binary encoding, gray encoding, one-hot encoding, etc. The choice of the designer depends on the factors like technology, design specifications, etc. One-hot encoding In one-hot encoding only one bit of the state vector is asserted for any given state. All other state bits are zero. Thus if there are n states then n state flip-flops are required. As only one bit remains logic high and rest are logic low, it is called as One-hot encoding. Example : If there is a FSM, which has 5 states. Then 5 flip-flops are required to implement the FSM using one-hot encoding. The states will have the following values: S0 - 10000 S1 - 01000 S2 - 00100 S3 - 00010 S4 - 00001 Adv...
3 comments
Read more

Gate-Level Modeling

>> Introduction >> Gate Primitives >> Delays >> Examples Introduction In Verilog HDL a module can be defined using various levels of abstraction. There are four levels of abstraction in verilog. They are: Behavioral or algorithmic level: This is the highest level of abstraction. A module can be implemented in terms of the design algorithm. The designer no need to have any knowledge of hardware implementation. Data flow level: In this level the module is designed by specifying the data flow. Designer must how data flows between various registers of the design. Gate level: The module is implemented in terms of logic gates and interconnections between these gates. Designer should know the gate-level diagram of the design. Switch level: This is the lowest level of abstraction. The design is implemented using switches/transistors. Designer requires the knowledge of switch-level implementation details. Gate-level modeling is virtually the lowest-level of abstraction, ...
26 comments
Read more