Results 1  10
of
1,272,727
Maximum likelihood from incomplete data via the EM algorithm
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract

Cited by 11717 (17 self)
 Add to MetaCart
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value
An Efficient SquareRoot Algorithm for BLAST
 IEEE Trans. Sig. Proc
, 2000
"... Bell Labs Layered SpaceTime (BLAST) is a scheme for transmitting information over a richscattering wireless environment using multiple receive and transmit antennas. The main computational bottleneck in the BLAST algorithm is a "nulling and cancelation" step, where the optimal ordering f ..."
Abstract

Cited by 118 (9 self)
 Add to MetaCart
for the sequential estimation and detection of the received signals is determined. To reduce the computational cost of BLAST, in this paper we develop an efficient squareroot algorithm for the nulling and cancellation step. The main features of the algorithm include efficiency: the computational cost is reduced
Implementation of Different Square Root Algorithms
"... Abstract. This paper presents the operation and the implementation of novel fixed point square root algorithms with an input range of 0 to 1 into CMOS. These algorithms are referred to as nonrestoring and restoring algorithm and were compared with a square root implementation into a lookup table (L ..."
Abstract
 Add to MetaCart
Abstract. This paper presents the operation and the implementation of novel fixed point square root algorithms with an input range of 0 to 1 into CMOS. These algorithms are referred to as nonrestoring and restoring algorithm and were compared with a square root implementation into a lookup table
Formal verification of square root algorithms
 Formal Methods in Systems Design
, 2003
"... Abstract. We discuss the formal verification of some lowlevel mathematical software for the Intel ® Itanium ® architecture. A number of important algorithms have been proven correct using the HOL Light theorem prover. After briefly surveying some of our formal verification work, we discuss in more ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
detail the verification of a square root algorithm, which helps to illustrate why some features of HOL Light, in particular programmability, make it especially suitable for these applications. 1. Overview The Intel ® Itanium ® architecture is a new 64bit architecture jointly developed by Intel
Multiplicative square root algorithms for FPGAs
 INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS
, 2010
"... Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computingoriented FPGAs include embedded multipliers and RAM blocks which can also be used to implement quadratic convergence algorithms, very high radix ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computingoriented FPGAs include embedded multipliers and RAM blocks which can also be used to implement quadratic convergence algorithms, very high
SquareRoot Algorithms for LeastSquares Estimation
"... AbstractWe present several new algorithms, and more generally a new approach, to recursive estimation algorithms for linear dynamical systems. Earlier results in this area have been obtained by several others, especially Potter, Golub, Dyer and McReynolds, Kaminskj, Schmidt, Bryson, and Bierman o ..."
Abstract
 Add to MetaCart
on what are known as squareroot algorithms. Our results are more comprehensive. They also show how constancy of parameters can be exploited to reduce the number of Computations and to obtain new forms of the chaodrasekhartype equations for computing the filter gain. Our approach is essentially based
ParallelArray Implementations of A NonRestoring Square Root Algorithm
"... Abstract In this paper, we present a parallelarray implementation of a new nonrestoring square root algorithm ..."
Abstract
 Add to MetaCart
Abstract In this paper, we present a parallelarray implementation of a new nonrestoring square root algorithm
Derivation of a Fast Integer Square Root Algorithm
"... In a constructive setting, the formula ∀n ∃r r 2 ≤n ∧ n<(r+1) 2 specifies an algorithm for computing the integer square root r of a natural number x. A proof for this formula implicitly contains an integer square root algorithm that mirrors the way in which the formula was proven correct. In this ..."
Abstract
 Add to MetaCart
In a constructive setting, the formula ∀n ∃r r 2 ≤n ∧ n<(r+1) 2 specifies an algorithm for computing the integer square root r of a natural number x. A proof for this formula implicitly contains an integer square root algorithm that mirrors the way in which the formula was proven correct
AN OPTIMIZED SQUARE ROOT ALGORITHM FOR IMPLEMENTATION IN FPGA HARDWARE
"... Makalah ini menyajikan metode kalkulasi digitdemidigit yang dioptimalkan untuk menyelesaikan perhitungan akar kuadrat yang rumit dalam perangkat keras, sebagai algoritma sederhana yang diusulkan untuk implementasi pada field programmable gate array (FPGA). Prinsip utama dari metode ini adalah oper ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Makalah ini menyajikan metode kalkulasi digitdemidigit yang dioptimalkan untuk menyelesaikan perhitungan akar kuadrat yang rumit dalam perangkat keras, sebagai algoritma sederhana yang diusulkan untuk implementasi pada field programmable gate array (FPGA). Prinsip utama dari metode ini adalah operasioperasi penggeseran duabit dan pengurangmultipleks, untuk mendapatkan implementasi yang lebih sederhana dan perhitungan yang lebih cepat. Algoritma ini telah digunakan untuk implementasi akar kuadrat biner tak bertanda 32bit dan 64bit berbasis FPGA secara sukses. Hasil penelitian menunjukkan bahwa metode yang diusulkan paling efisien sumber daya perangkas keras, bila dibandingkan metode lainnya. Selain itu, strategi ini dapat dengan mudah dikembangkan untuk implementasi akar kuadrat yang lebih besar.
Results 1  10
of
1,272,727