Design, Develop and Implement an Efficient Polynomial Divider
International Journal of Latest Technology in Engineering, Management & Applied Science -IJLTEMAS (www.ijltemas.in)
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Polynomial Division is a most common numerical operation experienced in many filters and similar circuits next to multiplication, addition and subtraction. Due to frequent use of such components in mobile and other communication applications, a fast polynomial division would improve overall speed for many such applications. This project is to design, develop and implement an efficient polynomial divider algorithm, along with the circuit. Next its output performance result is verified using Verilog simulation. A literature survey on the normal division algorithms currently used by ALU’s to perform division for large numbers, yielded Booth’s algorithm, Restoring and Non-restoring algorithm. Verilog simulation of these algorithms were used to derive efficiency in terms of the timing characteristics, required chip area and power dissipation. Initially, performance analysis of the existing algorithms was done based on the simulated outputs. Later similar analysis with the updated polynomial divider circuit is performed.
Related papers
Review of Basic Classes of Dividers Based on Division Algorithm
IEEE Access
The electronics world is very well described in two distinct but dependent interdisciplinary areas, namely hardware and software. Arithmetic operations are very vital building blocks of an electronic system. An algorithm is a systematic arrangement that helps develop a sophisticated electronic system, including hardware and software aspects. Addition, subtraction, multiplication, and division are critical elements of arithmetic implementation in the electronic system, but fewer efforts have been made to implement division than other arithmetic operations, even though the number of transistors on a chip is increasing beyond the Moore's law prediction. It is quite complicated to implement arithmetical operations; here, a sophisticated algorithm is essential to successful implementation. Technological upgrades are leading to a new paradigm of applications, where the performance of a division circuit or block is a vital and critical feature of a successful system. The lexicon of algorithms used in the implementation of the division operation in electronics systems is discussed in detail in the present article, which indicates the mathematical formulation, criticality, conversion pattern, hardware requirements, and logic used for conversion. The current report describes the broad classification of dividers into basic classes named digit recurrence, high radix, functional iteration, estimation, a look-up table, and variable latency. It also illustrates that, in practical implementation, many algorithms have been developed that combine one or many classes and are implemented with different hardware architectures. The study indicated the possibility of improving the presently available algorithms or creating a new algorithm to enhance practical implementation.
THE DESIGN AND IMPLEMENTATION OF A HIGH-PERFORMANCE FLOATING-POINT DIVIDER
1994
The increasing computation requirements of modern computer applications have stim- ulated a large interest in developing extremely high-performance floating-point dividers. A variety of division algorithms are available, with SRT being utilized in many computer systems. A careful analysis of SRT divider topologies has demonstrated that a relatively simple divider designed in an aggressive circuit style can achieve extremely high perfor- mance. Further, an aggressive circuit implementation can minimize many of the perfor- mance advantages of more complex divider algorithms. This paper presents the tradeoffs of the different divider topologies, the design of the divider, and performance results.
Implementation and Comparison of Different Non-Restoring Division Algorithm
https://www.ijrrjournal.com/IJRR_Vol.9_Issue.11_Nov2022/IJRR-Abstract11.html, 2022
The non-restoring algorithm, which is derived from restoring division, determines the residual by repeatedly deducting the dividend from the shifted divisor until the remainder is within the desired range. Since just the shifting operation, arithmetic addition, and subtraction are used in the computation, non-restoring division requires less hardware to accomplish and provides the exact value of the quotient and remainder. In this paper, the Non-Restoring division algorithm is implemented in 2 ways for 64-bit input dividend and divisor and the method which dissipates less power compared to the other is shown.
Novel data dependent divider circuit block implementation for complex division and area critical applications
Scientific Reports
This article elaborates on the state-of-the-art novel Udayan S. Patankar (USP)-Awadhoot algorithm for distinctive implementation area improvement for area-critical electronic applications. The proposed USP-Awadhoot divider is a digit recurrence class, but it can be flexibly implemented as a restoring or nonrestoring algorithm. The implementation example indicates the use of the Baudhayan-Pythagoras triplet method in association with the proposed USP-Awadhoot divider. The triplet method provides an easy way to generate Mat_Term1, Mat_Term2, and T_Term, which are further utilized with the proposed USP-Awadhoot divider. The USP-Awadhoot divider is implemented in three parts. First is preprocessing circuit stage for executing a dynamic separate scaling operation on input operands, ensuring the inputs are in the correct form. Second is the processing circuit stage for implementing the conversion logic expressed by the Awadhoot matrix, and third is the postprocessing circuit stage for rec...
A new divide and conquer method for achieving high speed division in hardware
Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design
In this paper, we present a new method of performing Division in Hardware and explore different ways of implementing it. This method involves computing a preliminary estimate of the quotient by splitting the Dividend, performing division of each of the parts in parallel and merging them. The estimate is refined iteratively to get the final quotient. This method is significantly fast since it carries out parallel operations to compute the preliminary quotient and makes use of a fast multiplier to refine the result. It is possible to pipeline the execution of the unit yielding further increase in throughput. Speed estimates show that this method yields a much higher throughput than other fast methods, while area and latency are comparable ©
A hardware algorithm for variable-precision division
This paper presents an e cient hardware algorithm for variable-precision division. The algorithm is based on a well-known convergence algorithm, however, modi cations are made to allow it to e ciently handle variable-precision operands. The proposed algorithm reduces the number of xed-precision operation by only computing signi cant words in intermediate results. Compared to previous variable-precision division algorithms, this algorithm requires signi cantly fewer xed-point arithmetic operations.
A Dual-field Modular Division Algorithm and Architecture for Application Specific Hardware
2004
This paper presents a dual-field modular division (inversion) algorithm and its hardware design. The algorithm is based on the Extended Euclidean and the Binary GCD algorithms. The use of counters to keep track of the difference between field elements in this algorithm eliminates the need for comparisons which are usually expensive and time-consuming. The algorithm has simple control flow and arithmetic operations making it suitable for application specific hardware implementation. The proposed architecture uses a scheduling method to reduce the number of hardware resources without significantly increasing the total execution time. Its datapath efficiently supports all the operations in the algorithm and uses carry-save unified adders for reduced critical path delay, making the proposed architecture faster than other previously proposed designs. Experimental results using synthesis for AMI 0.5µm CMOS technology are shown and compared with other dividers.
Low-power divider
IEEE Transactions on Computers, 1999
The general objective of our work is to develop methods to reduce the energy consumption of arithmetic modules while maintaining the delay unchanged and keeping the increase in the area to a minimum. Here, we illustrate some techniques for dividers realized in CMOS technology. The energy dissipation reduction is carried out at different levels of abstraction: from the algorithm level down to the implementation, or gate, level. We describe the use of techniques such as switching-off not active blocks, retiming, dual voltage, and equalizing the paths to reduce glitches. Also, we describe modifications in the on-the-fly conversion and rounding algorithm and in the redundant representation of the residual in order to reduce the energy dissipation. The techniques and modifications mentioned above are applied to a radix-4 divider, realized with static CMOS standard cells, for which a reduction of 40 percent is obtained with respect to the standard implementation. This reduction is expected to be about 60 percent if low-voltage gates, for dual voltage implementation, are available. The techniques used here should be applicable to a variety of arithmetic modules which have similar characteristics.
IRJET- DESIGN AND IMPLEMENTATION OF 32-BIT UNSIGNED DIVIDER ON FPGA
IRJET, 2020
Abstract during this project, a 32-bit unsigned divider is intended and enforced victimization verilog code in activity model. The divider is synthesizable and might be enforced on FPGA victimization verilog code. A divider could be a purposeful a part of arithmetic and logic unit. It's enforced to perform whole number primarily based division operations. The division is one in all the foremost difficult operations of the fundamental arithmetic operations. During this project we've designed a divider that performs specific division operation on thirty two bit numbers. As thought of, division operation is a lot of incredible within the calculation of the advanced applications. Binary and decimal division calculations are performed during this work. The synthesized schematic results are enforced on RTL compiler. Finally, the projected absolutely pipelined implementation architectures is co-simulated by Modalism and Simulink, and it's synthesized on FPGA victimization Verilog and VHDL.
Implementing division with field programmable gate arrays
Journal of VLSI Signal Processing, 1994
This article presents a method to map digit-recurrence arithmetic algorithms to lookup-table based Field Programmable Gate Arrays (FPGAs). By reducing the number of binary inputs to combinational logic and merging algorithm steps, the strategy creates new simplified functions to decrease logic depth and area. To illustrate this method, a radix-2 digit-recurrence division algorithm is mapped to the Xilinx XC4010, a lookup-table based FPGA. The mapping develops a linear sequential array design that avoids the common problem of large fanout delay in the critical path. This approach has a cycle time independent of precision while requiring approximately the same number of logic blocks as a conventional design.
Related topics
Related papers
A novel division algorithm for parallel and sequential processing
2002
A new algorithm for reducing the division operation to a series of smaller divisions is introduced. Partitioning the dividend into segments, we perform divisions, shifts, and accumulations taking into account the weight of dividend bits. Each partial division can be performed by any existing division algorithm. From an algorithmic point of view, computational complexity analysis is performed in comparison with existing algorithms. From an implementation point of view, since the division can be performed by any existing divider, the designer can chose the divider which meets his specifications best. Two possible implementations of the algorithm, namely the sequential and parallel are derived, with several variations, allowing performance, cost, and cost/performance trade-offs.
FPGA Implementation of Area-Efficient IEEE 754 Complex Divider
Procedia Technology, 2016
Division algorithms are less often used unlike other arithmetic operations. But it cannot be avoided in some systems to achieve some functionality. The division of complex numbers has got applications in fields like telecommunication, microwave systems, signal processing, GPS etc. This work proposes an area-efficient method for complex divider implementation on FPGA. The operands are represented in single precision floating point (IEEE754) format. A novel method called module reuse technique is used for reducing the device utilization on FPGA. The proposed design is analyzed using the simulation and implementation results on Xilinx Artix-7 and Virtex-5 FPGA families.
IMPLEMENTATION OF LOW POWER DIVIDER TECHNIQUES USING RADIX
IJRET, 2012
This work describes the design of a divder technique Low-power techniques are applied in the design of the unit, and energy-delay tradeoffs considered. The energy dissipation in the divider can be reduced by up to 70% with respect to a standard implementation not optimized for energy, without penalizing the latency. In this dividing technique we compare The radix-8 divider is compared with one obtained by overlapping three radix-2 stages and with a radix-4 divider. Results show that the latency of our divider is similar to that of the divider with overlapped stages, but the area is smaller. The speed-up of the radix-8 over the radix-4 is about 23.58% and the energy dissipated to complete a division is almost the same, although the area of the radix-8 is 67.58% larger.
A Novel Vedic Divider Architecture with Reduced Delay for VLSI Applications
International Journal of Computer Applications, 2015
The ever increasing demand in VLSI architecture to handle complex systems has resulted for designing of high speed divider architecture. The divider is designed using ever known ancient methodology "Vedic mathematics". There are several methods present in Vedic mathematics but here Parvartya sutra is used. It is a general division formula which can be applicable to all cases of division which is an efficient way for dividing large numbers with respect to delay and power consumption. Here thirty-two bit divider architecture is implemented using this sutra & synthesized and simulated using Xilinx ISE simulator and implemented on virtex4 FPGA device XC4VLX15.The output parameters such as propagation delay and device utilization are calculated from synthesis results. Our result shows speed improvement as compared to other architecture presented in this literature. This architecture can be implemented in many applications such as digital signal processing, cryptography, processor arithmetic unit design etc.
Comparative study of single precision floating point division using different computational algorithms
International Journal of Reconfigurable and Embedded Systems (IJRES), 2023
This paper presents different computational algorithms to implement single precision floating point division on field programmable gate arrays (FPGA). Fast division computation algorithms can apply to all division cases by which an efficient result will be obtained in terms of delay time and power consumption. 24-bit Vedic multiplication (Urdhva-Triyakbhyam-sutra) technique enhances the computational speed of the mantissa module and this module is used to design a 32-bit floating point multiplier which is the crucial feature of this proposed design, which yields a higher computational speed and reduced delay time. The proposed design of floating-point divider using fast computational algorithms synthesized using Verilog hardware description language has a 32-bit floating point multiplier module unit and a 32-bit floating point subtractor module unit. Xilinx Spartan 6 SP605 evaluation platform is used to verify this proposed design on FPGA. Synthesis results provide the device utilization and propagation delay parameters for the proposed design and a comparative study is done with previous work. Input to the divider is provided in IEEE 754 32-bit formats.
Design and Implementation of 32-Bit Arithmetic Divider and Multiplier using Single Stage Design
Multiplier and divider are the most important parts of any arithmetic unit. Design parameters area, speed and power consumption are main constraints in designing multiplier and divider. In the proposed work we will use single stage design technique to design multiplier and divider. In single stage implementation design the complex logic operations which consist of various multiple numbers of stages are converted into single stage implementation by using single stage design the many short delays are compensated by a single large delay and performance of the design will improve. Xilinx software is use for coding and simulation will be done using Questa Sim simulator and overall design will be implemented on vertex 5 FPGA.
FPGA Implementation of Fixed-point Divider Using Pre-computed Values
Procedia Technology, 2013
In this paper, we propose a divider block architecture using pre-computed values. At the first stage, the input is scaled so that the denominator, D, has value between 0.5 and 1. Then the block takes a pre-computed value corresponding to 1/D and multiplies it with the nominator. In order to save utilized memory bits, we take only several bits from D. In the end, we compare synthesis result of our divider block with several divider block implementations. The result shows that our divider block gives the smallest total logic elements and the shortest latency among the compared blocks.
A High-Speed Division Algorithm for Modular Numbers Based on the Chinese Remainder Theorem with Fractions and Its Hardware Implementation
Electronics
In this paper, a new simplified iterative division algorithm for modular numbers that is optimized on the basis of the Chinese remainder theorem (CRT) with fractions is developed. It requires less computational resources than the CRT with integers and mixed radix number systems (MRNS). The main idea of the algorithm is (a) to transform the residual representation of the dividend and divisor into a weighted fixed-point code and (b) to find the higher power of 2 in the divisor written in a residue number system (RNS). This information is acquired using the CRT with fractions: higher power is defined by the number of zeros standing before the first significant digit. All intermediate calculations of the algorithm involve the operations of right shift and subtraction, which explains its good performance. Due to the abovementioned techniques, the algorithm has higher speed and consumes less computational resources, thereby being more appropriate for the multidigit division of modular num...
Hardware Implementation of Methodologies of Fixed Point Division Algorithms
International Journal on Smart Sensing and Intelligent Systems
This paper describes the hardware implementation methodologies of fixed point binary division algorithms. The implementations have been extended for the execution of the reciprocal of the binary numbers. Radix-2 (binary) implementations of digit recurrence and multiplicative based methods have been considered for comparison. Functionality of the algorithms have been verified in Verilog hardware description language (HDL) and synthesized in Xilinx ISE 8.2i targeting the device xc4vlx15-12sf363 of Virtex4 family. Implementation was done for both signed and unsigned number systems, having bit width of operands vary as an exponential function of , where =2 to 5. Performance parameters have been calculated in terms of clock frequency, FPGA slice utilization, latency and power consumption. Implementation results indicate that multiplicative based algorithm is superior in terms of latency, while digit recurrence algorithms are consuming low power along-with less area overhead.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.