Suchergebnisse - Array square-root algorithms
-
1
Kalman Filter Sensitivity Evaluation With Orthogonal and J-Orthogonal Transformations
ISSN: 0018-9286, 1558-2523Veröffentlicht: New York IEEE 01.07.2013Veröffentlicht in IEEE transactions on automatic control (01.07.2013)“… This technical note addresses the array square-root Kalman filtering/smoothing algorithms with the conventional orthogonal and J -orthogonal transformations …”
Volltext
Journal Article -
2
On scalarized calculation of the likelihood function in array square-root filtering algorithms
ISSN: 0005-1179, 1608-3032Veröffentlicht: Dordrecht SP MAIK Nauka/Interperiodica 01.05.2009Veröffentlicht in Automation and remote control (01.05.2009)“… An efficient method of scalarized calculation of the logarithmic likelihood function based on the array square-root implementation methods for Kalman filtering formulas was proposed …”
Volltext
Journal Article -
3
IMPLEMENTATION OF AN ALGORITHM FOR SQUARE ROOT COMPUTATION IN AN FPGA ARRAY BY USING FIXED POINT REPRESENTATION
ISSN: 0121-4470Veröffentlicht: Universidad Nacional de Colombia 01.12.2018Veröffentlicht in Momento (01.12.2018)“… It also consumes much less hardware surface than other algorithms for calculating the square root of a number …”
Volltext
Journal Article -
4
Square-root algorithms for maximum correntropy estimation of linear discrete-time systems in presence of non-Gaussian noise
ISSN: 0167-6911, 1872-7956Veröffentlicht: Elsevier B.V 01.10.2017Veröffentlicht in Systems & control letters (01.10.2017)“… Recent developments in the realm of state estimation of stochastic dynamic systems in the presence of non-Gaussian noise have induced a new methodology called …”
Volltext
Journal Article -
5
Square-root Bryson-Frazier smoothing algorithms
ISSN: 0018-9286Veröffentlicht: New York, NY IEEE 01.04.1995Veröffentlicht in IEEE transactions on automatic control (01.04.1995)“… : square-root algorithms and a fast square-root (or so-called Chandrasekhar type) algorithm. The new square-root algorithms use square-root arrays composed of smoothed estimates and their error covariances …”
Volltext
Journal Article -
6
Parallel-array implementations of a non-restoring square root algorithm
ISBN: 9780818682063, 081868206XISSN: 1063-6404Veröffentlicht: IEEE 01.01.1997Veröffentlicht in Proceedings International Conference on Computer Design VLSI in Computers and Processors (01.01.1997)“… In this paper we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT …”
Volltext
Tagungsbericht -
7
A general approach to constructing parameter identification algorithms in the class of square root filters with orthogonal and J-orthogonal tranformations
ISSN: 0005-1179, 1608-3032Veröffentlicht: Moscow Pleiades Publishing 01.08.2014Veröffentlicht in Automation and remote control (01.08.2014)“… We study modern implementations of the discrete Kalman filter, namely array square-root algorithms …”
Volltext
Journal Article -
8
Likelihood Gradient Evaluation Using Square-Root Covariance Filters
ISSN: 0018-9286, 1558-2523Veröffentlicht: New York, NY IEEE 01.03.2009Veröffentlicht in IEEE transactions on automatic control (01.03.2009)“… Using the array form of numerically stable square-root implementation methods for Kalman filtering formulas, we construct a new square-root algorithm for the log-likelihood gradient (score) evaluation …”
Volltext
Journal Article -
9
Square-root RTS smoothing algorithms
ISSN: 0020-7179, 1366-5820Veröffentlicht: London Taylor & Francis Group 01.11.1995Veröffentlicht in International journal of control (01.11.1995)“… : stable square-root algorithms and a fast square-root (or so-called Chandrasekhar-type) algorithm. The new stable square-root algorithms use square-root arrays composed of smoothed estimates and their error covariances …”
Volltext
Journal Article -
10
FPGA-based Low Latency Square Root CORDIC Algorithm
ISSN: 1509-4553, 1899-8852Veröffentlicht: Warsaw Instytut Lacznosci - Panstwowy Instytut Badawczy (National Institute of Telecommunications) 2025Veröffentlicht in Journal of Telecommunications and Information Technology (2025)“… With that context taken into consideration, this article presents a fast and accurate square root floating point (SQRT FP …”
Volltext
Journal Article -
11
Array algorithms for H-infinity estimation
ISSN: 0018-9286Veröffentlicht: 01.04.2000Veröffentlicht in IEEE transactions on automatic control (01.04.2000)“… The array algorithms considered include two main families: square-root array algorithms, which are typically numerically more stable than conventional ones, and fast …”
Volltext
Journal Article -
12
A parallel square-root algorithm for modified extended Kalman filter
ISSN: 0018-9251, 1557-9603Veröffentlicht: New York, NY IEEE 01.01.1992Veröffentlicht in IEEE transactions on aerospace and electronic systems (01.01.1992)“… A parallel square-root algorithm and its systolic array implementation are proposed for performing modified extended Kalman filtering (MEKF …”
Volltext
Journal Article -
13
Array-Based QR-RLS Multichannel Lattice Filtering
ISSN: 1053-587X, 1941-0476Veröffentlicht: New York, NY IEEE 01.08.2008Veröffentlicht in IEEE transactions on signal processing (01.08.2008)“… Individual units are updated using a square-root recursive least-squares (RLS) algorithm in array form that relies mainly on Givens rotations and exhibits highly …”
Volltext
Journal Article -
14
Generalized square-root adaptive algorithms
ISBN: 9780780362932, 0780362934ISSN: 1520-6149Veröffentlicht: IEEE 2000Veröffentlicht in 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100) (2000)“… We extend the QR-based recursive least squares algorithms to a more general square-root formulation, which involves array transforms using orthogonal and possibly non-orthogonal transforms e.g. Gauss transform …”
Volltext
Tagungsbericht -
15
The square-root overdetermined recursive instrumental variable algorithm
ISSN: 0018-9286Veröffentlicht: New York, NY IEEE 01.06.1989Veröffentlicht in IEEE transactions on automatic control (01.06.1989)“… The algorithm uses square-root arrays, and both orthogonal and hyperbolic rotations, as necessitated by the nature of the ORIV algorithm.< > …”
Volltext
Journal Article -
16
Low-Complexity Square-Root Unscented Kalman Filter Design Methodology
ISSN: 0278-081X, 1531-5878Veröffentlicht: New York Springer US 01.11.2023Veröffentlicht in Circuits, systems, and signal processing (01.11.2023)“… Square-root unscented Kalman filter (SRUKF) is a widely used state estimator for several state of-the-art, highly nonlinear, and critical applications …”
Volltext
Journal Article -
17
An Efficient FPGA Implementation of Orthogonal Matching Pursuit With Square-Root-Free QR Decomposition
ISSN: 1063-8210, 1557-9999Veröffentlicht: New York IEEE 01.03.2019Veröffentlicht in IEEE transactions on very large scale integration (VLSI) systems (01.03.2019)“… However, the least square problem (LSP) in OMP algorithm limits its performance. This paper presents a fast CS reconstruction algorithm implemented on field-programmable gate array (FPGA) using OMP …”
Volltext
Journal Article -
18
Array algorithms for H[infon] estimation
ISSN: 0018-9286, 1558-2523Veröffentlicht: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.04.2000Veröffentlicht in IEEE transactions on automatic control (01.04.2000)“… : square-root array algorithms, which are typically numerically more stable than conventional ones, and fast array algorithms which, when the system is time-invariant, typically offer an order …”
Volltext
Journal Article -
19
A Novel Square Root Algorithm and its FPGA Simulation
ISSN: 1742-6588, 1742-6596Veröffentlicht: Bristol IOP Publishing 01.10.2019Veröffentlicht in Journal of physics. Conference series (01.10.2019)“… The square root operation is a nonlinear operation and cannot be solved directly on FPGA. Many previous square root algorithms have been proposed …”
Volltext
Journal Article -
20
Improving the Accuracy of the Fast Inverse Square Root by Modifying Newton–Raphson Corrections
ISSN: 1099-4300, 1099-4300Veröffentlicht: Switzerland MDPI AG 09.01.2021Veröffentlicht in Entropy (Basel, Switzerland) (09.01.2021)“… We present improved algorithms for fast calculation of the inverse square root function for single-precision and double-precision floating-point numbers …”
Volltext
Journal Article

