
Implementation of Goldschmidt's Algorithm with hardware reduction
Division algorithms have been developed to reduce latency and to improve...
read it

An efficient floating point multiplier design for high speed applications using Karatsuba algorithm and UrdhvaTiryagbhyam algorithm
Floating point multiplication is a crucial operation in high power compu...
read it

A floating point division unit based on TaylorSeries expansion algorithm and Iterative Logarithmic Multiplier
Floating point division, even though being an infrequent operation in th...
read it

High Speed and Area Efficient 2D DWT Processor based Image Compression" Signal & Image Processing
This paper presents a high speed and area efficient DWT processor based ...
read it

Design and Implementation of an Improved Carry Increment Adder
A complex digital circuit comprises of adder as a basic unit. The perfor...
read it

FMMU: A HardwareAutomated Flash Map Management Unit for Scalable Performance of NAND FlashBased SSDs
NAND flashbased Solid State Drives (SSDs), which are widely used from e...
read it

Model based neurofuzzy ASR on Texas processor
In this paper an algorithm for recognizing speech has been proposed. The...
read it
High Speed SRT Divider for Intelligent Embedded System
Increasing development in embedded systems, VLSI and processor design have given rise to increased demands from the system in terms of power, speed, area, throughput etc. Most of the sophisticated embedded system applications consist of processors, which now need an arithmetic unit with the ability to execute complex division operations with maximum efficiency. Hence the speed of the arithmetic unit is critically dependent on division operation. Most of the dividers use the SRT division algorithm for division. In IoT and other embedded applications, typically radix 2 and radix 4 division algorithms are used. The proposed algorithm lies on parallel execution of various steps so as to reduce time critical path, use fuzzy logic to solve the overlap problem in quotient selection, hence reducing maximum delay and increasing the accuracy. Every logical circuit has a maximum delay on which the timing of the circuit is dependent and the path, causing the maximum delay is known as the critical path. Our approach uses the previous SRT algorithm methods to make a highly parallel pipelined design and use Mamdani model to determine a solution to the overlapping problem to reduce the overall execution time of radix 4 SRT division on 64 bits double precision floating point numbers to 281ns. The design is made using Bluespec System Verilog, synthesized and simulated using Vivado v.2016.1 and implemented on Xilinx Virtex UltraScale FPGA board.
READ FULL TEXT
Comments
There are no comments yet.