scholarly journals Maximally Flat IIR Fullband Differentiators with Flat Group Delay Responses

2020 ◽  
Vol 5 (11) ◽  
pp. 1365-1367
Author(s):  
Slavisa Ilić ◽  
Ahmad Mohammed Salih ◽  
Majid Hamid Abdullah ◽  
Dragiša Milić

A new design method for maximally flat IIR fullband differentiators with flat group delay responses is derived in this paper. The design method starts from the flatness conditions of magnitude response and group delay response at the origin. After mathematical manipulations it shows that presented design method reduces to solving the system of linear equations. By increasing the orders of polynomials in numerator and denominator, degrees of flatness are increased, that is improvement in magnitude responses and group delay responses in terms of flatness is obtained.

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Madhu Jain ◽  
Maneesha Gupta ◽  
N. K. Jain

Proposed work deals with the design of a family of stable IIR digital integrators via use of minimax and pole, zero, and constant optimization methods. First the minimax optimization method is used to design a family of second-, third-, and fourth-order digital integrators by optimizing the magnitude response in a min-max sense under the satisfactory condition of constant group delay. Then the magnitude and group delay response is further improved using pole, zero, and constant optimization method. Subsequently, by modifying the transfer function of all of the designed integrators appropriately, new differentiators are obtained. Simulation results show that proposed approach outperforms existing design methods in terms of both magnitude and phase response.


Author(s):  
David Ek ◽  
Anders Forsgren

AbstractThe focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton’s method. There is a trade-off between solving Newton systems directly, which give high quality solutions, and solving many approximate Newton systems which are computationally less expensive but give lower quality solutions. We propose partial and full approximate solutions to the Newton systems. The specific approximate solution depends on estimates of the active and inactive constraints at the solution. These sets are at each iteration estimated by basic heuristics. The partial approximate solutions are computationally inexpensive, whereas a system of linear equations needs to be solved for the full approximate solution. The size of the system is determined by the estimate of the inactive constraints at the solution. In addition, we motivate and suggest two Newton-like approaches which are based on an intermediate step that consists of the partial approximate solutions. The theoretical setting is introduced and asymptotic error bounds are given. We also give numerical results to investigate the performance of the approximate solutions within and beyond the theoretical framework.


2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
A. Khalid ◽  
M. N. Naeem ◽  
P. Agarwal ◽  
A. Ghaffar ◽  
Z. Ullah ◽  
...  

AbstractIn the current paper, authors proposed a computational model based on the cubic B-spline method to solve linear 6th order BVPs arising in astrophysics. The prescribed method transforms the boundary problem to a system of linear equations. The algorithm we are going to develop in this paper is not only simply the approximation solution of the 6th order BVPs using cubic B-spline, but it also describes the estimated derivatives of 1st order to 6th order of the analytic solution at the same time. This novel technique has lesser computational cost than numerous other techniques and is second order convergent. To show the efficiency of the proposed method, four numerical examples have been tested. The results are described using error tables and graphs and are compared with the results existing in the literature.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohsen Alipour ◽  
Dumitru Baleanu ◽  
Fereshteh Babaei

We introduce a new combination of Bernstein polynomials (BPs) and Block-Pulse functions (BPFs) on the interval [0, 1]. These functions are suitable for finding an approximate solution of the second kind integral equation. We call this method Hybrid Bernstein Block-Pulse Functions Method (HBBPFM). This method is very simple such that an integral equation is reduced to a system of linear equations. On the other hand, convergence analysis for this method is discussed. The method is computationally very simple and attractive so that numerical examples illustrate the efficiency and accuracy of this method.


Sign in / Sign up

Export Citation Format

Share Document