✦ LIBER ✦

An efficient algorithm for computing Pisarenko's harmonic decomposition using Levinson's recursion

✍ Scribed by Hayes, M.; Clements, M.

Book ID: 117906422
Publisher: IEEE
Year: 1986
Weight: 787 KB
Volume: 34
Category: Article
ISSN: 0096-3518
DOI: 10.1109/tassp.1986.1164835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient approach for computing non-

An efficient approach for computing non-Gaussian ARMA model coefficients using Pisarenko's method

✍ Adnan Al-Smadi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

On efficient implementations of Kogbetli

On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition

✍ J. P. Charlier; M. Vanbegin; P. Van Dooren 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 1023 KB

An algorithm for the quadratic assignmen

An algorithm for the quadratic assignment problem using Bender's decomposition

✍ L. Kaufman; F. Broeckx 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 621 KB

An efficient algorithm for generalized d

An efficient algorithm for generalized discriminant analysis using incomplete Cholesky decomposition

✍ Haixian Wang; Zilan Hu; Yu’e Zhao 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Generalized discriminant analysis (GDA) has provided an extremely powerful approach to extracting nonlinear features via kernel trick. And it has been suggested for a number of applications, such as classification problem. Whereas the GDA could be solved by the utilization of Mercer kernels, a drawb

An efficient recursive cell architecture

An efficient recursive cell architecture of modified Euclid's algorithm for decoding Reed-Solomon codes

✍ Sang Seol Lee; Moon Kyou Song 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 308 KB

A test of a modified algorithm for compu

A test of a modified algorithm for computing spherical harmonic coefficients using an FFT

✍ Mark Elowitz; Frank Hill; Thomas L Duvall Jr. 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 313 KB