scispace - formally typeset
Y

Yih-Fang Huang

Researcher at University of Notre Dame

Publications -  144
Citations -  5586

Yih-Fang Huang is an academic researcher from University of Notre Dame. The author has contributed to research in topics: Adaptive filter & Communication channel. The author has an hindex of 33, co-authored 137 publications receiving 5221 citations. Previous affiliations of Yih-Fang Huang include Princeton University.

Papers
More filters
Journal ArticleDOI

On the value of information in system identification-Bounded noise case

TL;DR: The important new feature of the proposed algorithms is their ability to ignore redundant data and the efficient data extraction property of the new algorithms is achieved with small computational effort and with improved performance when compared to the least square algorithm.
Journal ArticleDOI

Indeterminacy and identifiability of blind identification

TL;DR: In this article, a mathematical structure from which the acceptable indeterminacy is represented by an equivalence relation is formulated, and two identifiable cases are shown along with blind identification algorithms, FOBI (fourth-order blind identification), EFOBI (extended FOBI), and AMUSE algorithm.
Journal ArticleDOI

State Estimation in Electric Power Grids: Meeting New Challenges Presented by the Requirements of the Future Grid

TL;DR: This article provides a survey on state estimation in electric power grids and examines the impact on SE of the technological changes being proposed as a part of the smart grid development.
Journal ArticleDOI

Set-membership filtering and a set-membership normalized LMS algorithm with an adaptive step size

TL;DR: A recursive solution for set membership filtering is derived that resembles a variable step size normalized least mean squares (NLMS) algorithm and shows significant performance improvement in varied environments with a greatly reduced number of updates.

Bounds on the Number of Hidden Neurons in

TL;DR: In this article, a least upper bound is derived for the number of hidden neurons needed to realize an arbitrary function which maps from a finite subset of E' into E'. And a nontrivial lower bound is also obtained for realizations of injective functions.