pulkitag22 Goto Github PK

abc

ABC: System for Sequential Logic Synthesis and Formal Verification

arduinowachamole

This project includes the code for Arduino UNO, in which I implemented the Wach-A-Mole game. So this setup is quite similar to the setup we see in original game-set. In this I have used LEDs for random mole selection, and corresponding to each LED there is a Light Dependent Resistor (LDR), if the analog value of the LDR gets low corresponding to the LED glowing (mole), the score increases

branchpredictors

In this library various branck predictors are impemented. All the alrorithms are implemented using C Language.

cachecoherencesimulation

kitty

C++ truth table library

mockturtle

C++ logic network library

multiplicationcomplexnumbermultithread

To perform multiplication of 'n' complex numbers by creating multiple threads and execute them in parallel.

multiprocessorschalgo

This project consist of three scheduling algorithm implemented in ADA Language for performing simulations in Cheddar. The algorithms included are namely, Earliest Deadline first till Zero-Laxity (EDZL), Fixed Priority till Zero-Laxity, and Least Laxity Group First (LLGF). Hard Real-Time Systems are all about meeting deadlines. We need various algorithms to make sure that all the tasks meet their deadlines. The algorithms proposed are improved version of well-known preexisting algorithms. These algorithms are modified versions of the parent algorithm. This is coded considering global multiprocessor scheduling only. The proposed algorithms are written using ADA Language in a Low-Level Program. This is done so as to run simulations in Cheddar. Since we are writing a low-level program, hence, further information about the system is required so as to implement the algorithms. All the required information for implementation of the algorithm are discussed in this paper.

pcbdesigneagle

Designed a circuit using Timer 555 IC for controlling speed of small DC Motor and successfully made a circuit diagram for controlling DC Motor speed and prepared a single layered PCB Layout using EAGLE 8.3.2.

percy

An advanced header-only exact synthesis library

pulkitag22.github.io

Personal Webpage

readerwritermultithread

tspproblem

Problems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problems is minimizing wire length. The Traveling Salesperson Problem (TSP) — finding whether all the cities in a salesperson’s route can be visited exactly once with a specified limit on travel time — is one of the canonical examples of an NP-complete problem; solutions appear to require an inordinate amount of time to generate, but are simple to check. This problem deals with finding a minimal path through a grid of points while traveling only from left to right. Given an m×n matrix of integers, you are to write a program that computes a path of minimal weight. A path starts anywhere in column 1 (the first column) and consists of a sequence of steps terminating in column n (the last column). A step consists of traveling from column i to column i + 1 in an adjacent (horizontal or diagonal) row. The first and last rows (rows 1 and m) of a matrix are considered adjacent, i.e., the matrix “wraps” so that it represents a horizontal cylinder. Legal steps are illustrated on the right. The weight of a path is the sum of the integers in each of the n cells of the matrix that are visited.

uniprocessorschalgo

This project consist of scheduling algorithms written in ADA Language, for performing Uni-processor (Uni-core) simulations in Cheddar.