The Experts below are selected from a list of 7116 Experts worldwide ranked by ideXlab platform
Radovan Stojanovic - One of the best experts on this subject based on the ideXlab platform.
-
single clock square root algorithm based on Binomial Series and its fpga implementation
Mediterranean Conference on Embedded Computing, 2018Co-Authors: Tomas Bagala, Adam Fibich, Miroslav Hagara, Peter Kubinec, Oldrich Ondracek, Vladimir Stofanik, Radovan StojanovicAbstract:Signal processing is frequently discussed topic nowadays. Digital Signal Processors (DSP) or Field Programmable Gate Array (FPGA) can process data at high rates. Arithmetic operations such as addition, subtraction, multiplication, division or square root are often used in DSP and FPGA. Several algorithms for square root computation on FPGA were designed in past years. This paper describes a proposal of single clock square root algorithm applicable on FPGA. The algorithm is formulated generally for any number of bits. Simulations and experiments for 16-bits binary numbers have confirmed that obtained results are equal to square root values rounded to nearest integer.
-
MECO - Single clock square root algorithm based on Binomial Series and its FPGA implementation
2018 7th Mediterranean Conference on Embedded Computing (MECO), 2018Co-Authors: Tomas Bagala, Adam Fibich, Miroslav Hagara, Peter Kubinec, Oldrich Ondracek, Vladimir Stofanik, Radovan StojanovicAbstract:Signal processing is frequently discussed topic nowadays. Digital Signal Processors (DSP) or Field Programmable Gate Array (FPGA) can process data at high rates. Arithmetic operations such as addition, subtraction, multiplication, division or square root are often used in DSP and FPGA. Several algorithms for square root computation on FPGA were designed in past years. This paper describes a proposal of single clock square root algorithm applicable on FPGA. The algorithm is formulated generally for any number of bits. Simulations and experiments for 16-bits binary numbers have confirmed that obtained results are equal to square root values rounded to nearest integer.
P O Babatola - One of the best experts on this subject based on the ideXlab platform.
-
a class of convergent rational runge kutta schemes for solution of ordinary differential equations odes
Journal of the Nigerian Association of Mathematical Physics, 2011Co-Authors: P O BabatolaAbstract:In this paper, a class of convergent implicit Rational Runge-Kutta schemes using Taylor and Binomial Series expansion, are developed, analysed and computerized to solve ODEs. Numerical results arising from the new schemes compare favourably with the existing Euler’s method. Furthermore, the results show that the schemes are effective and efficient. Keywords : Implicit, Rational, Runge-Kutta, effective, efficient and convergent.
-
Numerical Integration of Stiff System of Ordinary Differential Equations with a New K-step Rational Runge-Kutta Method
Journal of the Nigerian Association of Mathematical Physics, 2011Co-Authors: P O Babatola, Ra Ademiluyi, Ea AreoAbstract:The goal of this work is to develop, analyse and implement a K-step Implicit Rational Runge-Kutta schemes for Integration of Stiff system of Ordinary differential Equations. Its development adopted Taylor and Binomial Series expansion Techniques to generate its parameters. The analysis of its basic properties adopted Dahlquist, A-stability model test equation and the results show that the scheme is Consistent, Convergent and A-stable. Numerical results show that the method is accurate and effective Keywords : Rational, Runge-Kutta, Convergent, Consistent , Effective, Error bound, Implementation, Development, A-stable.
-
A New Inverse Runge–Kutta Scheme for Stiff Ordinary Differential Equation
Journal of the Nigerian Association of Mathematical Physics, 2010Co-Authors: P O BabatolaAbstract:The paper, discusses semi-implicit inverse Runge –Kutta Scheme for numerical solution of stiff ordinary differential equation of the form y'=f(x,y), a≤x≤b. Its derivation adopts Taylor and Binomial Series expansion , while it analysis of its stability uses the well known A-stability test model equation. Both theoretical and experimental results show that the scheme is A-stable. Numerical results compared favourably with existing Euler’s method.
-
K-Step Rational Runge-Kutta Method for Solution of Stiff System of Ordinary Differential Equations
Journal of Mathematics and Statistics, 2008Co-Authors: P O Babatola, Ra Ademiluyi, Ea AreoAbstract:This study described the development, analysis and implementation of K-step implicit rational Runge-Kutta schemes for solution of stiff system of ordinary differential equations. Its development adopted taylor and Binomial Series expansion techniques to generate its parameters. The analysis of its basic properties adopted dalhquist a-stability model test equation and the results showed that the scheme was a-stable, consistent and convergent. Numerical results showed that the method was accurate and effective.
Mark W. Coffey - One of the best experts on this subject based on the ideXlab platform.
-
Series of zeta values, the Stieltjes constants, and a
2009Co-Authors: Mark W. CoffeyAbstract:We present a variety of Series representations of the Stieltjes and related constants, the Stieltjes constants being the coefficients ofthe Laurent expansion of the Hurwitz zeta function �(s,a) about s = 1. Additionally we obtain Series and integral representations of a sum Sγ(n) formed as an alternating Binomial Series from the Stieltjes constants. The slowly varying sum Sγ(n) + n is an important subsum in application of the Li criterion for the Riemann hypothesis.
-
On harmonic Binomial Series
arXiv: Mathematical Physics, 2008Co-Authors: Mark W. CoffeyAbstract:We evaluate Binomial Series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and calculations of theoretical physics, as well as other applications.
-
Series of zeta values, the Stieltjes constants, and a sum S_\gamma(n)
arXiv: Mathematical Physics, 2007Co-Authors: Mark W. CoffeyAbstract:We present a variety of Series representations of the Stieltjes and related constants, the Stieltjes constants being the coefficients of the Laurent expansion of the Hurwitz zeta function zeta(s,a) about s=1. Additionally we obtain Series and integral representations of a sum S_\gamma(n) formed as an alternating Binomial Series from the Stieltjes constants. The slowly varying sum S_\gamma(n)+n is an important subsum in application of the Li criterion for the Riemann hypothesis.
Joseph D. Warfield - One of the best experts on this subject based on the ideXlab platform.
-
Objective Comparison of Confidence Bound Methods for Binomial Series System Reliability
IEEE Transactions on Reliability, 2020Co-Authors: Edward Schuberg, Janet Myhre, Daniel R. Jeske, Allan D. Mcquarrie, Joseph D. WarfieldAbstract:Obtaining lower confidence bounds on the reliability of a Series system remains a problem of interest. Engineers and practitioners desire methods with good properties to obtain lower confidence bounds when only component-level Binomial test data are available. With numerous methods proposed in the literature–none of which are uniformly superior–it can be an overwhelming task to select the method which best handles the scenario at hand. We develop a software tool in R (available in the “Serieslcb” package) through which users can discover the methods that best suit their situation. The tool runs user-defined simulations and then ranks the best performing methods based on objective comparisons utilizing a delta coverage metric. This article outlines the methods and comparison strategy implemented in the package. It also discusses the design of the software tool and illustrates it with an example.
Tomas Bagala - One of the best experts on this subject based on the ideXlab platform.
-
single clock square root algorithm based on Binomial Series and its fpga implementation
Mediterranean Conference on Embedded Computing, 2018Co-Authors: Tomas Bagala, Adam Fibich, Miroslav Hagara, Peter Kubinec, Oldrich Ondracek, Vladimir Stofanik, Radovan StojanovicAbstract:Signal processing is frequently discussed topic nowadays. Digital Signal Processors (DSP) or Field Programmable Gate Array (FPGA) can process data at high rates. Arithmetic operations such as addition, subtraction, multiplication, division or square root are often used in DSP and FPGA. Several algorithms for square root computation on FPGA were designed in past years. This paper describes a proposal of single clock square root algorithm applicable on FPGA. The algorithm is formulated generally for any number of bits. Simulations and experiments for 16-bits binary numbers have confirmed that obtained results are equal to square root values rounded to nearest integer.
-
MECO - Single clock square root algorithm based on Binomial Series and its FPGA implementation
2018 7th Mediterranean Conference on Embedded Computing (MECO), 2018Co-Authors: Tomas Bagala, Adam Fibich, Miroslav Hagara, Peter Kubinec, Oldrich Ondracek, Vladimir Stofanik, Radovan StojanovicAbstract:Signal processing is frequently discussed topic nowadays. Digital Signal Processors (DSP) or Field Programmable Gate Array (FPGA) can process data at high rates. Arithmetic operations such as addition, subtraction, multiplication, division or square root are often used in DSP and FPGA. Several algorithms for square root computation on FPGA were designed in past years. This paper describes a proposal of single clock square root algorithm applicable on FPGA. The algorithm is formulated generally for any number of bits. Simulations and experiments for 16-bits binary numbers have confirmed that obtained results are equal to square root values rounded to nearest integer.