This tutorial is in continuation with our previous tutorial on Genus Synthesis Without Constraints (Timing Constraints). The timing constraints are written in Synopsys Design Constraint (SDC) file. 1. Open the terminal and type csh 2. Source the cadence.cshrc. 3. In ASIC lab folder, make a new directory. In this, make design.v (in this example counter.v). […]
GENUS Synthesis With Constraints Read More »
In this tutorial Cadence GENUS Synthesis without Constraints is presented. 1. Open the terminal and type csh 2. Source the cadence.cshrc. After sourcing the file, check whether genus is installed in the current system or not by typing the below command [sudi@sankh] genus –gui 7. Minimize the gui and follow below instructions, mentioning the proper
GENUS Synthesis Without Constraints Read More »
Logic Equivalence Checking is a very important step to be performed after synthesis step. This operation checks for similarity between the original code and the synthesis Netlist. This operation is important as the synthesis tool may trim or remove some unused and unconnected ports and redundant logics. The steps of performing Logic Equivalence Checking in
Logic Equivalence Checking Read More »
Code coverage is a basic coverage type which is collected automatically. It tells you how well your HDL code has been exercised by your test bench. In other words, how thoroughly the design has been executed by the simulator using the tests used in the regression. Functional coverage measures how well the functionality of the
Linting is a process of running a program that will analysis the code for potential errors. This tutorial is for checking errors and warnings in a Verilog code using Cadence tool. Open the terminal Source the cadence.cshrc In a new ASIC lab directory, write a Verilog coded design (in this example fifo.v) Write the linting
This tutorial is on functional simulation of digital circuits on Genus tool of CADENCE software for ASIC Implementation. Open the terminal Source the cadence.cshrc Check whether the commands are working as below: – Create a directory for saving files as below Create design_file.v as shown below: – (gedit counter.v) Check the syntax of design.v (in
Basic Simulation on CADENCE Read More »
In this tutorial, we will discuss another architecture for Matrix Multiplication. This architecture is a systolic matrix multiplier. A systolic architecture is a homogeneous network of tightly coupled data processing units. Each data processing units compute partial result independently. The systolic architectures are very suitable for implementing any kind of digital systems as they are
Systolic Matrix Multiplier Read More »
Apart from scalar-vector multiplication, Vector-Vector multiplication is another very important arithmetic operation in implementing signal or image processing algorithms. The matrix multiplications can also be achieved through vector-vector multiplication which is also called as inner product computation. In this tutorial, we will discuss multiplication of matrix A (6X6) with matrix B (6X6) using Vector-Vector multiplication.
Vector-Vector Multiplication Read More »
Scalar-Vector multiplication is a very important arithmetic operation in implementing signal or image processing algorithms. In this tutorial, we will discuss the hardware for multiplication between a 6X3 Matrix (A) and a 3X1 Matrix (B) and the result is a 6X1 column vector (C). This multiplication is shown below in Figure 1. This multiplication can
Scalar-Vector Multiplication Read More »
The signal processing algorithms or image processing algorithms deal with matrices. In every step, various matrix multiplications may be computed for evaluation of these algorithms. In implementation of these algorithms on hardware, matrix multiplication is an important operation that decides the performance of the implementations. We intentionally divides the matrix multiplication operation into three categories
Matrix Multiplication Read More »
Here a simple Behavioral coding of the Selection Sort algorithm is given. This code is written in such a way that it can support any number of inputs with any size. This code is a basic version of the Selection sort algorithm and sorts the given array in one clock cycle. The code is written
Selection Sort Behavioral Read More »
Here a simple Behavioral coding of the Insertion Sort algorithm is given. This code is written in such a way that it can support any number of inputs with any size. This code is a basic version of the Insertion sort algorithm and sorts the given array in one clock cycle. The code is written
Insertion Sort Behavioral Read More »
Here a simple Behavioral coding of the Bubble Sort algorithm is given. This code is written in such a way that it can support any number of inputs with any size. This code is a basic version of the Bubble sort algorithm and sorts the given array in one clock cycle. The code is written
Bubble Sort Behavioral Read More »
The parallel sort architecture described in [1] for n=8 has a regular structure. This structure can be divided in similar stages. This structure consumes 23 basic node blocks but sorts 8 data elements in just 1 iteration. A serial sort architecture can be derived from this structure which sorts 8 data elements in some iterations.
Serial Sort Architecture Read More »
Bubble sort is a very popular and a basic technique to sort an array elements. This technique is hardly used anywhere due to its high computational complexity. But here the concept of Bubble sort is demonstrated. In this technique, adjacent elements are sorted in every run. This way after some runs the array is sorted.
