Many DSP and Control applications that require the user to know how various numerical errors(uncertainty) affect the result. This uncertainty is eliminated by replacing non-interval values with intervals. Since most DSPs operate in real time environments, fast processors are required to implement interval arithmetic. The goal is to develop a platform in which Interval Arithmetic operations are performed at the same computational speed as present day signal processors. So we have proposed the design and implementation of Interval Arithmetic multiplier, which operates with IEEE 754 numbers. The proposed unit consists of a floating point CSD multiplier, Interval operation selector. This architecture implements an algorithm which is faster than conventional algorithm of Interval multiplier . The cost overhead of the proposed unit is 30% with respect to a conventional floating point multiplier. The
performance of proposed architecture is better than that of a conventional CSD floating-point multiplier, as it can perform both interval multiplication and floating-point multiplication as well as Interval comparisons
Case study of Divide and Conquer approach contains information about-merge sort and quick sort algorithms, closest pair of points, binary search, la-russe multiplicaton, min-max problems and also strassen multiplication.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
This presentation contains information about the divide and conquer algorithm. It includes discussion regarding its part, technique, skill, advantages and implementation issues.
Case study of Divide and Conquer approach contains information about-merge sort and quick sort algorithms, closest pair of points, binary search, la-russe multiplicaton, min-max problems and also strassen multiplication.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
This presentation contains information about the divide and conquer algorithm. It includes discussion regarding its part, technique, skill, advantages and implementation issues.
It is rather surprising that in software engineering, standard measurement units have yet to be
widely accepted and used. Every other engineering discipline has their own. By and large, effort
is the most commonly used parameter for measuring software initiatives. The problem of
course is that effort is not an independent variable – it depends on who is doing the work and
how it is done. This presentation looks at an approach that has been used to convert the large
amount of effort data usually collected in an organization into something that can meaningfully
be used for estimation and comparison purposes.
Unit 1: Fundamentals of the Analysis of Algorithmic Efficiency, Units for Measuring Running Time, PROPERTIES OF AN ALGORITHM, Growth of Functions, Algorithm - Analysis, Asymptotic Notations, Recurrence Relation and problems
Design & Analysis of Algorithms Lecture NotesFellowBuddy.com
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
I am Joe B. I am a Logistics Assignment Expert at statisticshomeworkhelper.com. I hold a Bachelor's Degree in Business Logistics Management, from Texas University, USA. I have been helping students with their homework for the past 3 years. I solve assignments related to business and logistics.
Visit statisticshomeworkhelper.com or email info@statisticshomeworkhelper.com.
You can also call on +1 678 648 4277 for any assistance with Logistic Assignment.
Basics of Algorithms and Analysis of algorithm is in there, which includes Time complexity , space complexity, three cases ( best, average, worst) and analysis of Insertion sort.
*For knowledge purpose only*
*Hope you'll come up with better one*
Implementation of an arithmetic logic using area efficient carry lookahead adderVLSICS Design
An arithmetic logic unit acts as the basic building blocks or cell of a central processing unit of a computer.
And it is a digital circuit comprised of the basic electronics components, which is used to perform various
function of arithmetic and logic and integral operations further the purpose of this work is to propose the
design of an 8-bit ALU which supports 4-bit multiplication. Thus, the functionalities of the ALU in this
study consist of following main functions like addition also subtraction, increment, decrement, AND, OR,
NOT, XOR, NOR also two complement generation Multiplication. And the functions with the adder in the
airthemetic logic unit are implemented using a Carry Look Ahead adder joined by a ripple carry approach.
The design of the following multiplier is achieved using the Booths Algorithm therefore the proposed ALU
can be designed by using verilog or VHDL and can also be designed on Cadence Virtuoso platform.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
It is rather surprising that in software engineering, standard measurement units have yet to be
widely accepted and used. Every other engineering discipline has their own. By and large, effort
is the most commonly used parameter for measuring software initiatives. The problem of
course is that effort is not an independent variable – it depends on who is doing the work and
how it is done. This presentation looks at an approach that has been used to convert the large
amount of effort data usually collected in an organization into something that can meaningfully
be used for estimation and comparison purposes.
Unit 1: Fundamentals of the Analysis of Algorithmic Efficiency, Units for Measuring Running Time, PROPERTIES OF AN ALGORITHM, Growth of Functions, Algorithm - Analysis, Asymptotic Notations, Recurrence Relation and problems
Design & Analysis of Algorithms Lecture NotesFellowBuddy.com
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
I am Joe B. I am a Logistics Assignment Expert at statisticshomeworkhelper.com. I hold a Bachelor's Degree in Business Logistics Management, from Texas University, USA. I have been helping students with their homework for the past 3 years. I solve assignments related to business and logistics.
Visit statisticshomeworkhelper.com or email info@statisticshomeworkhelper.com.
You can also call on +1 678 648 4277 for any assistance with Logistic Assignment.
Basics of Algorithms and Analysis of algorithm is in there, which includes Time complexity , space complexity, three cases ( best, average, worst) and analysis of Insertion sort.
*For knowledge purpose only*
*Hope you'll come up with better one*
Implementation of an arithmetic logic using area efficient carry lookahead adderVLSICS Design
An arithmetic logic unit acts as the basic building blocks or cell of a central processing unit of a computer.
And it is a digital circuit comprised of the basic electronics components, which is used to perform various
function of arithmetic and logic and integral operations further the purpose of this work is to propose the
design of an 8-bit ALU which supports 4-bit multiplication. Thus, the functionalities of the ALU in this
study consist of following main functions like addition also subtraction, increment, decrement, AND, OR,
NOT, XOR, NOR also two complement generation Multiplication. And the functions with the adder in the
airthemetic logic unit are implemented using a Carry Look Ahead adder joined by a ripple carry approach.
The design of the following multiplier is achieved using the Booths Algorithm therefore the proposed ALU
can be designed by using verilog or VHDL and can also be designed on Cadence Virtuoso platform.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
In this paper, a novel architecture of RNS based 1D Lifting Integer Wavelet Transform (IWT) has been introduced. Advantage of Residue Number System (RNS) based Lifting Scheme over RNS based Filter Bank and non-binary IWT has been discussed. The performance of traditional predicts and updates stage of binary Lifting Scheme (LS) for Discrete Wavelet Transform (DWT) generates huge carry propagation
delay, power and complexity. As a result non binary number system is becoming popular in the field of Digital Signal Processing (DSP) due to its efficient performance. In this paper also a new fixed number ROM based RNS division circuit has been proposed. The proposed architecture has been validated on Xilinx Vertex5 FPGA platform and the corresponding result and reports are shown in here.
An efficient hardware logarithm generator with modified quasi-symmetrical app...IJECEIAES
This paper presents a low-error, low-area FPGA-based hardware logarithm generator for digital signal processing systems which require high-speed, real time logarithm operations. The proposed logarithm generator employs the modified quasi-symmetrical approach for an efficient hardware implementation. The error analysis and implementation results are also presented and discussed. The achieved results show that the proposed approach can reduce the approximation error and hardware area compared with traditional methods.
Time domain analysis and synthesis using Pth norm filter designCSCJournals
In this paper, a new approach for the design and implementation of FIR filter banks for multirate analysis and synthesis is explored. The method is based on the least algorithm and takes into consideration the characteristics of the individual filters. Features of the proposed approach include; it does not need to adapt the weighting function involved and no constraints are imposed during the course of optimization. Mostly, the FIR filter design is concentrated around linear phase characteristics but with the help of minimax solution for FIR filters using the least- algorithm, this optimal filter design approach helps us to enhance the properties of LTI systems with better stability filter coefficient convergence. Hence norm algorithm will be used in multirate to explore the stability and other properties. We have proposed the band analysis system for analysis and synthesis purpose to explore multirate filter banks. The Matlab toolbox has been used for implementing the filters and its properties will be verified with various plots and tables. The results of this paper enable us to achieve good signal to noise ratio with analysis and synthesis level operations.
Chaotic Secure Communication Using Iterated Filtering Method P. Karthik -Assistant Professor,
D. Gokul Prashanth -UG Scholar,
T. Gokul - UG Scholar,
Department of Electronics and Communication Engineering,
SNS College of Engineering, Coimbatore, India.
EFFICIENT IMPLEMENTATION OF 16-BIT MULTIPLIER-ACCUMULATOR USING RADIX-2 MODIF...VLSICS Design
In this paper, we propose a new multiplier-and-accumulator (MAC) architecture for low power and high speed arithmetic. High speed and low power MAC units are required for applications of digital signal processing like Fast Fourier Transform, Finite Impulse Response filters, convolution etc. For improving the speed and reducing the dynamic power, there is a need to reduce the glitches (1 to 0 transition) and spikes (0 to 1 transition). Adder designed using spurious power suppression technique (SPST) avoids the unwanted glitches and spikes, thus minimizing the switching power dissipation and hence the dynamic power. Radix -2 modified booth algorithm reduces the number of partial products to half by grouping of bits from the multiplier term, which improves the speed. The proposed radix-2 modified Booth algorithm
MAC with SPST gives a factor of 5 less delay and 7% less power consumption as compared to array MAC
PERFORMANCE AND COMPLEXITY ANALYSIS OF A REDUCED ITERATIONS LLL ALGORITHMIJCNCJournal
Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recent
wireless communication. The complexity and the performance of the systems are driving the different
studies and researches. Lattices Reduction techniques bring more resources to investigate the complexity
and performances of such systems.
In this paper, we look to modify a fixed complexity verity of the LLL algorithm to reduce the computation
operations by reducing the number of iterations without important performance degradation. Our proposal
shows that we can achieve a good performance results while avoiding extra iteration that doesn’t bring
much performance.
A Predictive Stock Data Analysis with SVM-PCA Model .......................................................................1
Divya Joseph and Vinai George Biju
HOV-kNN: A New Algorithm to Nearest Neighbor Search in Dynamic Space.......................................... 12
Mohammad Reza Abbasifard, Hassan Naderi and Mohadese Mirjalili
A Survey on Mobile Malware: A War without End................................................................................... 23
Sonal Mohite and Prof. R. S. Sonar
An Efficient Design Tool to Detect Inconsistencies in UML Design Models............................................. 36
Mythili Thirugnanam and Sumathy Subramaniam
An Integrated Procedure for Resolving Portfolio Optimization Problems using Data Envelopment
Analysis, Ant Colony Optimization and Gene Expression Programming ................................................. 45
Chih-Ming Hsu
Emerging Technologies: LTE vs. WiMAX ................................................................................................... 66
Mohammad Arifin Rahman Khan and Md. Sadiq Iqbal
Introducing E-Maintenance 2.0 ................................................................................................................. 80
Abdessamad Mouzoune and Saoudi Taibi
Detection of Clones in Digital Images........................................................................................................ 91
Minati Mishra and Flt. Lt. Dr. M. C. Adhikary
The Significance of Genetic Algorithms in Search, Evolution, Optimization and Hybridization: A Short
Review ...................................................................................................................................................... 103
COMPUTATIONAL PERFORMANCE OF QUANTUM PHASE ESTIMATION ALGORITHMcsitconf
A quantum computation problem is discussed in this paper. Many new features that make
quantum computation superior to classical computation can be attributed to quantum coherence
effect, which depends on the phase of quantum coherent state. Quantum Fourier transform
algorithm, the most commonly used algorithm, is introduced. And one of its most important
applications, phase estimation of quantum state based on quantum Fourier transform, is
presented in details. The flow of phase estimation algorithm and the quantum circuit model are
shown. And the error of the output phase value, as well as the probability of measurement, is
analysed. The probability distribution of the measuring result of phase value is presented and
the computational efficiency is discussed.
COMPUTATIONAL PERFORMANCE OF QUANTUM PHASE ESTIMATION ALGORITHMcscpconf
A quantum computation problem is discussed in this paper. Many new features that make quantum computation superior to classical computation can be attributed to quantum coherence
effect, which depends on the phase of quantum coherent state. Quantum Fourier transform algorithm, the most commonly used algorithm, is introduced. And one of its most important
applications, phase estimation of quantum state based on quantum Fourier transform, is presented in details. The flow of phase estimation algorithm and the quantum circuit model are
shown. And the error of the output phase value, as well as the probability of measurement, is analysed. The probability distribution of the measuring result of phase value is presented and the computational efficiency is discussed.
Design and implementation of different audio restoration techniques for audio...eSAT Journals
Abstract
Audio signals are corrupted with many types of distortions. Major audio distortions are categorized into Globalized and
Localized distortions. Localized distortion includes clipping and clicks where only certain samples are affected and globalized
distortions include broadband noise where complete bandwidth is consumed by noise. Audio restoration is a technique for giving
back the audio signals from these distortions. In this paper, audio restoration techniques for removing clipping, clicks and
broadband noise are put forwarded. Recent approaches to solving audio restoration problem is with respect to sparse
representation algorithms. Clipping distortion is addressed with a Sparse representation framework, it is treated as a reverse
problem, where the distorted samples is estimated from the surrounding undistorted samples, they are embedded in frame based
scheme, and reconstructed by using an overlap add method in conjunction with OMP algorithm and Gabor/DCT dictionary for
modelling audio signals. Broadband denoising is done by using spectral subtraction and Click removal is done by using an
adaptive filter method as the first step. Performance measures are done based on perception, average SNR calculation and
defined parameter variations. This paper also targeting towards the software and hardware implementation of the restoration
methods using TMS320C6713 DSK kit with help of tools mainly MATLAB and Code Composer studio.
Key Words: Audio Distortions, OMP algorithm, Gabor/DCT dictionary, TMS320C6713DSK
Fpga implementation of optimal step size nlms algorithm and its performance a...eSAT Journals
Abstract The Normalized Least Mean Square error (NLMS) algorithm is most popular due to its simplicity. The conflicts of fast convergence and low excess mean square error associated with a fixed step size NLMS are solved by using an optimal step size NLMS algorithm. The main objective of this paper is to derive a new nonparametric algorithm to control the step size and also the theoretical performance analysis of the steady state behavior is presented in the paper. The simulation experiments are performed in Matlab. The simulation results show that the proposed algorithm as superior performance in Fast convergence rate, low error rate, and has superior performance in noise cancellation. Index Terms: Least Mean square algorithm (LMS), Normalized least mean square algorithm (NLMS)
Fpga implementation of optimal step size nlms algorithm and its performance a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A NEW METHOD OF SMALL-SIGNAL CALIBRATION BASED ON KALMAN FILTERijcseit
The basic principle of Kalman filter (KF) is introduced in this paper, based on which, it presents a new
method for high precision measurement of small-signal instead of the unreal direct one. We have designed a
method of multi-meter information infusion. With this method, we filter the measured value of a type of
special equipment and extract the optimal estimate for true value. Experimental results show that this
method can effectively eliminate the random error of the measurement process. The optimal estimate error
meets the basic requirements of conformity assessment, 3푈95 ≤ 푀푃퐸푉. This method can provide an
algorithm reference for the design of automatic calibration equipment.
Similar to Design of optimized Interval Arithmetic Multiplier (20)
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Top 10 Oil and Gas Projects in Saudi Arabia 2024.pdf
Design of optimized Interval Arithmetic Multiplier
1. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
DOI : 10.5121/vlsic.2011.2205 56
Design of optimized Interval Arithmetic Multiplier
Rajashekar B.Shettar1
and Dr.R.M.Banakar2
1
Department of Electronics and Communication
BVB College of Engg and Technology,
Hubli, Karnataka, India
raj@bvb.edu
2
Department of Electronics and Communication
BVB College of Engg and Technology,
Hubli, Karnataka, India
banakar@bvb.edu
ABSTRACT
Many DSP and Control applications that require the user to know how various numerical
errors(uncertainty) affect the result. This uncertainty is eliminated by replacing non-interval values with
intervals. Since most DSPs operate in real time environments, fast processors are required to implement
interval arithmetic. The goal is to develop a platform in which Interval Arithmetic operations are
performed at the same computational speed as present day signal processors. So we have proposed the
design and implementation of Interval Arithmetic multiplier, which operates with IEEE 754 numbers. The
proposed unit consists of a floating point CSD multiplier, Interval operation selector. This architecture
implements an algorithm which is faster than conventional algorithm of Interval multiplier . The cost
overhead of the proposed unit is 30% with respect to a conventional floating point multiplier. The
performance of proposed architecture is better than that of a conventional CSD floating-point multiplier,
as it can perform both interval multiplication and floating-point multiplication as well as Interval
comparisons
KEYWORDS
DSP, Floating-point, Interval arithmetic, comparator.
1. INTRODUCTION
Digital Signal Processing has become the choice for many applications related to
communications, control, multimedia, etc., because of the high performance it achieves for
applications that involve limited instruction set for implementing repetitive linear operations such
as addition, multiplication, delay, etc. on a stream of sampled data. Often a DSP has been used as
an attached coprocessor or combined with one or more FPGA devices to meet the performance
and cost requirements for a particular application. Underlying many of these is key to computing
digital filters, Fourier transforms an applications is the need for accurate and reliable results, but
2. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
57
errors due to rounding, uncertainty of the data, quantization noise and catastrophic cancelation in
floating point computations can lead to inaccuracies[1,2,3]. Sometimes these inaccuracies can go
unnoticed. Since many of the applications in signal processing algorithms, operation are recursive
and act on a sequence of data. It implies that the numerical errors can grow unbounded over time.
An efficient method for monitoring and controlling these inaccuracies is to replace Floating-point
arithmetic with Interval arithmetic. Interval Arithmetic began as a methodology to analyze and
control numerical errors in computers. Ramon E. Moore published the first book on the subject
entitled "Interval Analysis" [4] in 1966. In the 1990's, the interval arithmetic community saw
significant growth and today interval algorithms are being used to solve numerical analysis,
global optimization, and several engineering and CAD problems [5,6]. One of the drawbacks in
using interval algorithms is their slower computational speed. This is due to the fact that interval
arithmetic requires the manipulation of two numbers that define the interval. A complete
implementation in software has the disadvantage of extra overhead that results from error and
range checking, changing rounding modes and memory management. As a result, interval
algorithms end up running slower on current computer architectures, compared to real arithmetic
their counterparts [7,8,9]. To overcome the overhead due to rounding, a hardware solution is
required that will simultaneously compute the rounding for each interval. This can be achieved
by using Interval arithmetic units that are specially designed to manipulate interval numbers.
The paper presents Interval Multiplier unit that will provide the basis for building digital signal
processing systems that gives reliable results efficiently. Section 2 will provide background
information on Interval arithmetic. In section3, we present the basic architecture of the Interval
Multiplier unit. Performance analysis of the design in terms of area and delay estimates will be
discussed in Section 4, and finally, section 5 provides the conclusion.
2. INTERVAL ARITHMETIC
In the following discussions, intervals are denoted by capital letters and real numbers are denoted
by small letters. The lower and upper interval end points of an interval X are denoted as xl and xu,
respectively. A closed interval X= [ xl , xu] consists of set of real numbers between and including
the two endpoints xl and xu (i.e., X={x: xl < x < xu}). When performing arithmetic operation on
computer, one or both of the interval endpoints may be not represent able. In this case, the
interval endpoints are computed by outward rounding. Outward rounding requires that the lower
endpoint is rounded towards negative infinity (∇), and the upper endpoint is rounded towards
positive infinity (∆). Outward rounding ensures that the resulting interval encloses the true result.
The four basic arithmetic operations (i.e. addition, subtraction, multiplication, and division) are
defined for intervals. Interval addition and subtraction are defined as: Z=X+Y=[xl+yl,xu +yu],
Z=X-Y=[xl-yu, xu – yl]
3. INTERVAL ARITHMETIC MULTIPLIER
Interval multiplication is defined as follows:
3. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
58
Z = X*Y = min(xlyl, xlyu, xuyl, xuylu), max(xlyl, xlyu, xuyl, xuylu). Several algorithms have been
developed in order to increase the performance of the interval multiplication, by either reducing
the number of the required operations, or by increasing the throughput of the multiplier. The first
approach consists of examining the signs of the operands. Nine cases for interval multiplication
are obtained, as presented in Table 1. For the first eight cases, only two floating point
multiplications are needed. However, in the ninth case (when both intervals contain zero) four
floating point multiplications followed by four comparisons are required[10]. But, there is no
significant difference between this algorithm and performing the multiplication with above
expression. The main disadvantage of this type of algorithm is that the number of steps for the
multiplication are variable from case to case, which makes it hard to implement with pipelined
structures. We propose new algorithm to evaluate the result for Interval Arithmetic
multiplication shown in Table 2. Interval multiplication evaluation is done in two stages. During
the stage1 evaluation, we obtain the product of two 64 bit double precision IEEE 754 floating
point numbers is done. Here we obtain the following result for stage1, i.e. p = xl .yl, q = xl .yu ,
r = xu.y1, t= xu.yu .. The stage2 evaluation is mainly related to finding minimum and maximum
values of compared results of p, q, r & t, and storing the final result of multiplication in Zl and Zu
registers. During stage2, minimum1 and maximum 1 values are obtained by comparing p and q.
Also minimum 2 and maximum 2 values is obtained by comparing minimum1 and r. Finally Zl
and Zu are obtained by comparing minimum2 and t, and maximum2 and t. The final result is
stored in Zl, Zu registers. With the help of proposed algorithm, we need only three floating-point
comparisons and four floating-point multiplications to get result of interval multiplication. But
with the conventional interval multiplication, we need to verify all the nine case, which consumes
more time and hardware.
Table1. Cases for Interval multipication
4. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
59
Table 2. Efficient Algorithm used for Interval multiplication
It has much less calculations than the conventional interval multiplication shown in Table 1.The
figure 1 shows the calculation of p and q, same can be used to find the values of r and t.
Figure 1.Stage 1 evaluation of Interval multiplier
Figure2.Stage2 evaluation
5. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
60
The stage 2 evaluation of the interval multiplier is shown in figure 2. The calculated values of p,q
are used as input to mux 1 and r, t to mux2 in stage 2 evaluation. When select line is (s0,s1) ”0”,
p and q are selected and passed to 64 bit comparator. When select line is ”1”, r and t are selected
and passed to 64 bit comparator, the comparator produces the min1 and max1 values,min1 along
with r is given to the mux3 and mux4 respectively,max1 along with r is given to the mux 5 and
mux6 respectively. The output of mux3 and mux4(r,min1) are fed into the 64 bit comparator and
the output of mux5 and mux6(r,max1) are fed into the 64 bit comparator. Select line along with p,
q are passed to muxM5 and muxM6 to evaluate minimum1 (min1) and Maximum1 (Max1)
respectively. Next time select line (s02,s12) becomes 01, minimum1 (min1) and r are selected
from mux3 and mux4, passed to 64 bit comparator, resultant select line(sel3)along with
minimum1 and r are given to mux M7 to get minimum 2 (min2) value. Now select line (s02,s12)
become 10 and minimum2 (mim2)and t are passed to 64 bit comparator, depending on select
line(sel323) and minimum2(min2),t the result minimum3 (min3) is obtained through mux m9
which is stored in Zl. Now select line is (s02,s12) made 01, maximum1 (Max1) and r are selected
through multiplexers 3 and 4 ,and passed to 64 bit comparator. 3 bit select line (sel321) along
with Max1 and r given to multiplexer M8 to obtain the result maximum2 (Max2). Next select
line(so2,s12) becomes 10, maximum 2 (Max2) and t are selected through mux3 and mux4, passed
to 64 bit comparator, compared, the resultant select line(sel322M) along with max2 and t are
given to mux M10 to get maximum 3 (Max3), the result Maximum3 is stored at Zu. Thus interval
multiplication result Z is represented as (Zl, Zu). By implementing this algorithm, we have
reduced the number of comparisons to almost half of the required.
The proposed interval multiplier is presented in figure 3. The block diagram consists of one 64
bit double precision CSD (Canonic Signed Digit) floating point multiplier[10] and Interval
operation selector, multiplexors and registers[10]. The mux1 and mux2 multiplexors select upper
or lower end point numbers of intervals based on select inputs s1 and s2 to calculate floating
point multiplication. The output of floating-point multiplier is then fed to interval operation
selector block [11,12] so as to compare interval arithmetic numbers or floating point number
comparisons depending on s3 select line input. In the following discussions we discuss the CSD
multiplier used in our proposed implementation of Interval multiplier.
3.1 CSD multiplier
The IEEE 754 complaint floating-point multiplier uses CSD algorithm for faster multiplication of
two floating-point numbers[10]. The product of two n- bit binary number is obtained using CSD
multiplication algorithm in [(n/2)-1] steps. This in turn significantly reduces the hardware (i.e. the
number of adders required) as compared to other multiplication algorithms. The block diagram of
complete CSD multiplier unit is shown in figure4. It consists of Two 106-bit registers i.e.
mantREG(X) and mantREG(Y) respectively. One 106-bit 2’s Complement unit A CSD
multiplication unit. mantREG(X): It is a 106-bit register containing the 48-bit multiplier.
mantREG(Y): It is a 106-bit register containing the 48-bit multiplicand. 2’s. Complement unit is
used to perform the 2’s complement operation on the 106-bit multiplicand. The CSD
Multiplication unit is shown in figure5. This unit provides the 106-bit product by multiplying the
contents of mantREG(X) and mantREG(Y) using the Canonic Signed Digit Algorithm.
6. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
61
Figure3. The proposed block diagram of Interval multiplier and comparator
Figure4. Block diagram of complete CSD multiplier unit
This unit receives three inputs of which one is of 53-bits (contents of mantREG(X)) and two are
of 106-bits each ( mantREG(Y) and the output of the 2’s complement unit).The output of this unit
is a 106-bit product which is CSD multiplier output. The unit consists of a CSD Vector
Generation Unit, CSD Logic and Shift Control Unit and 106-bit Adder Block.
3.2 Interval operation selector
Interval selector block can perform the Interval hull, intersection, Interval comparisons and
Interval maxima and minimum and floating-point comparisons[12]. For the floating-point
comparison, the floating-point numbers to be compared are stored in the registers Xl and Xu. The
minimum of the two numbers is stored in Zl register and the maximum is stored in the register Zu.
7. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
62
This operation is completed in one cycle. For comparison purposes, number of instructions
required to execute interval operations is taken as bench mark to examine the efficiency of
compiler support and interval operation selector. The compiler support for interval arithmetic
represents the current state of the art in terms of software support for the interval arithmetic[14 ].
For this study, the Sun's Forte Fortran 95 compiler is used to produce sequences of instructions to
implement interval and floating-point selection operations The number of instructions required
for these operations is shown in Table 3. With the interval operation selector, interval
intersection, comparisons and interval selection operations require only one instruction as shown
in Table 3. With the interval operation selector, there is 80% reduction in number of instructions
required to execute interval operations as compared to software solutions.
4. COST AND PERFORMANCE ANALYSIS
The architecture we have described in the last section has been synthesized following a VHDL–
based design flow [15]. First of all, the logic blocks have been described in VHDL, and simulated
to guarantee a correct behavior. Then a single VHDL file has been written, hierarchically
connecting all the blocks. After exhaustive simulation, this architecture has been synthesized
employing a FPGA Advantage tool. The resulting file of this pre-layout synthesis has been
mapped, placed and routed into a Xilinx XC2VP30 FPGA device. A cycle time of 17.347 ns has
been achieved as a result of this implementation, which leads to an operation frequency over 60
MHz. The relative area of the used basic gates is presented in Table 4. Two models were build,
one for CSD floating-point multiplier and another one for Interval multiplier. The analysis was
performed for IEEE 754 double precision number formats[14]. As it is shown in Table 4, the
proposed implementation has about 30% cost increase with respect to a conventional multiplier.
5. CONCLUSIONS
This paper presents an effective way to design and implement interval arithmetic units, by
proposing a new type of interval multiplier. This multiplier is suitable both for interval
multiplication and as well as for floating-point multiplication. The performance of the interval
multiplication is better as compared to conventional floating point multiplication as it also does
interval comparisons. The proposed IA multiplier uses four multiplications and three
comparisons to compute given any two Interval numbers, where as for convention interval
multiplication algorithm, the number of steps for the multiplication is variable from case to case,
which makes it hard to implement with pipelined structures. The cost overhead of the proposed
unit is almost 30% higher, mainly due to the two floating comparators. However, the comparator
can also be used for other important interval operations, such as interval hull and intersection.
This way, the functionality and performance of the proposed Interval multiplier is increased and,
at the same time, a more efficient usage of the active area is achieved.
8. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
63
Table 3. Number of instructions required to execute
the operation
Table 4. Estimated Area for Interval Multiplier unit
and for floating- point multiplier Unit
References:
[1] Bohlender G, ″What Do We Need Beyond IEEE Arithmetic?'', Computer Arithmetic and Self-
Validating Numerical Methods, ed., pp. 1-32, Boston Academic Press, 1990.
[2] Goldberg D, “What Every Computer Scientist Should Know About Floating-Point Arithmetic”,
Computing Surveys, vol.23,no. 1, pp 5-48, 1991.
[3] Schulte M. J, Akkas A, Zelov V, and Burley J.C, “The Interval Enhanced GNU Fortran Compiler”,
Reliable Computing, vol.5, no. 3, pp. 311-322, Aug. 1999.
[4] Moore, R.E, Interval Analysis, Prentice Hall,Englewood Cliffs, 1966.
[5] L. Jaulin, M. Kieffer, 0. Didrit, and E. Walter, Applied Interval Analysis.Springer, 2001.
[6] W. Edmonson, R. Gupte, S. Ocloo, J. Gianchandani, and W. Alexander, “Highly pipelined Interval
Arithmetic Logic Unitfor Signal Processing and Control Applications," in Proc. NSF Workshop
Reliable Engineering Computing,Feb. 2006, pp.189-196.
Operation
Number of instructions
SUN's Forte Fortran 95
Compiler
Interval
Operation
Selector
Interval Floating-point Inte
rval
Floati
ng-
point
Min Max Min Max
Intersection 5 15 N/A N/A 1 N/A
Hull 5 11 N/A N/A 1 N/A
Minimum 5 11 2 2 1 1
Maximum 5 11 2 2 1 1
Basic Gates Not And,Or,Nand, Nor Xor Total
Floating
point
Multiplier
340 9800 3200 13340
Proposed
Interval
multiplier
610 11400 6240 18250
9. International Journal of VLSI design & Communication Systems (VLSICS) Vol.2, No.2, June 2011
64
[7] M. Schulte and E. Swartzlander, Jr., "Software and hardware techniquesfor accurate self-validating
arithmetic," in Applications of Interval Com putations, R. Kearfott and V. Kreinovich, Eds.
Kluwer, 1996.
[8] U. Kulisch, Advanced Arithmetic for the DigitalComputer. New York, Springer-Verlag, 2002.
[9] A. Amaricai, M. Vladutiu, L. Prodan, M. Udrescu, O. Boncalo, “Design of Addition and
Multiplication Units for HighPerformance Interval Arithmetic Processor”, Proceedings of 10th IEEE
Design and Diagnostics of Electronic Circuits and Systems, 2007,pp. 223-226
[10] Y Wang, L.S.De Brunner, D.Zhou. Victor DeBrunner, “A multiplier structure based recoding. IEEE
computers, 2007.
[11] A. Akkas, “A Combined Interval and Floating-Point Comparator/Selector”, Proceedings of 13th
IEEE Conference of Application-Specific Systems, Architectures and Processors (ASAP), 2002, pp.
[12] Rajashekar B. Shettar, Dr. R.M.Banakar, Dr. P.S.V.Nataraj, “Design and implementation of Interval
arithmetic Algorithms”ICIIS , Srilanka,2006.
[13] M.J. Schulte,V. Zelov, A. Akkas, and J.C.Burley,”Adding Interval support to the GNU Fortran
Compiler,”Manuscript, Lehigh University, 1997
[14] IEEE Standard for Binary Floating Point Arithmetic, ANSI/IEEE-754/1985
[15] S. Sjoholm and L. Lindh. VHDL for designers. Prentice Hall,cop., 1997.
Authors
Rajashekar Shettar received B.E degree in Electronics and Communication
Engineering, From Karnatak University, India in 1990 and M.Tech in System and
Controls from IIT Bombay, Mumbai. He is pursuing his PhD at Visveswaraya
Technological University, Presently he is working as Assistant Professor in
Electronics and Communication Engg Dept, BVB Engineering College Hubli
Karnataka.
Dr.R.M.Banakar received B.E degree in Electronics and Communication
Engineering From Karnatak University India in 1984 and M.Tech in Digital
Communication from Regional Engineering College, Surathkal, and Karnataka. She
has a couple of years experience in Indian Space Research Organization (ISRO). She
completed her PhD in the area of low power application specific design methodology
from IIT Delhi in 2004.Presently she is working as Professor and Head of Electronics
and Communication Engg Dept, BVB Engineering College Hubli Karnataka. She is
the Member of ISTE, IETE, MIE and IEEE scientific and professional societies. Her
current areas of research include SOC, VLSI Architecture and WCDMA.