Fei Hua

Fei Hua

Auto-generated profile, based on publicly available information

Fei Hua

School of Marine Science and Technology, Northwestern Polytechnical University

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 January 2020 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
FHFei Hua
Fei Hua
RNRoula Nassif
Roula Nassif
CRCedric Richard
Cedric Richard
HWHaiyan Wang
Haiyan Wang
ASAli H. Sayed
Ali H. Sayed
In this work, we are interested in adaptive and distributed estimation of graph filters from streaming data. We formulate this problem as a consensus estimation problem over graphs, which can be addressed with diffusion LMS strategies. Nevertheless, most popular graph-shift operators such as those based on the graph Laplacian matrix, or the adjacency matrix, are not energy preserving. This may result in an ill-conditioned estimation problem, and reduce the convergence speed of the distributed algorithms. To address this issue and improve the transient performance, we introduce a preconditioned graph diffusion LMS algorithm. We also propose a computationally efficient version of this algorithm by approximating the Hessian matrix with local information. Performance analyzes in the mean and mean-square sense are provided. Finally, we consider a more general problem where the filter coefficients to estimate may vary over the graph. To avoid a large estimation bias, we introduce an unsupervised clustering method for splitting the global estimation problem into local ones. Simulation results show the effectiveness of the proposed algorithms and validate the theoretical results.

23 April 2020 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
FHFei Hua
Fei Hua
RNRoula Nassif
Roula Nassif
CRCedric Richard
Cedric Richard
HWHaiyan Wang
Haiyan Wang
ASAli H. Sayed
Ali H. Sayed
We study the problem of distributed estimation over adaptive networks where communication delays exist between nodes. In particular, we investigate the diffusion Least-Mean-Square (LMS) strategy where delayed intermediate estimates (due to the communication channels) are employed during the combination step. One important question is: Do the delays affect the stability condition and performance? To answer this question, we conduct a detailed performance analysis in the mean and in the mean-square-error sense of the diffusion LMS with delayed estimates. Stability conditions, transient and steady-state mean-square-deviation (MSD) expressions are provided. One of the main findings is that diffusion LMS with delays can still converge under the same step-sizes condition of the diffusion LMS without delays. Finally, simulation results illustrate the theoretical findings.

5 May 2021 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
XWXin Wang
Xin Wang
XSXiaohong Shen
Xiaohong Shen
FHFei Hua
Fei Hua
ZJZhe Jiang
Zhe Jiang
In this letter, we first present a time-domain model for pilot-assisted MMSE channel estimation in the orthogonal chirp division multiplexing (OCDM) systems. Then by proposing a pilot selection criterion, the complexity of MMSE channel estimation is reduced by the simplification of matrix inversion. Meanwhile, we prove that the criterion can lead to the optimal mean square error (MSE) performance. Furthermore, based on the criterion, by adopting the Zadoff-Chu sequences as pilots and presenting a split-and-decomposition algorithm, we propose a low-complexity channel estimator for OCDM. The complexity of the proposed estimator is O (Nlog\frac L2), while the estimator in existing literature for OCDM is O (NlogN), where L is the channel length and N is the number of subcarriers. Numerical results are provided to verify the performance of the proposed algorithm over frequency-selective Rayleigh fading channels. It turns out that the proposed estimator can significantly reduce the computational complexity without any MSE performance loss.

6 September 2018 in IEEE Sensors Journal
Verified
Journal Article
Open access
YYYongsheng Yan
Yongsheng Yan
XSXiaohong Shen
Xiaohong Shen
FHFei Hua
Fei Hua
XZXionghu Zhong
Xionghu Zhong
The received energy has been becoming an efficient and attractive measure for acoustic source localization due to its cost saving in both energy and computation capability. We investigated the acoustic source localization problem based on received energy measurements in sensor networks. Focusing on the non-logarithmic energy attenuation model, we developed and compared a suite of semidefinite programming (SDP) based source localization methods due to computational efficiency and numerical reliability. First, we proposed a general SDP-based estimator by jointly estimating the source location and the source radiation power. It yields an efficient estimate for both the scenario where the source is located inside the convex hull formed by sensors and the scenario where the source is located outside the convex hull. Next, a min-max approximation (MMA) is given to cope with the applicable application of existing energy-based source localization algorithms relying on Gaussian energy noise assumption. Further, a novel norm approximation (NA) method is proposed according to norm equivalence, which can provide comparable performance with lower computational complexity. Simulations show that our proposed methods exhibit superior performance than the existing energy-based source localization estimators.

21 November 2019 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
FHFei Hua
Fei Hua
CRCedric Richard
Cedric Richard
JCJie Chen
Jie Chen
HWHaiyan Wang
Haiyan Wang
PBPierre Borgnat
Pierre Borgnat
PGPaulo Goncalves
Paulo Goncalves
We study the problem of parametric modeling of network-structured signals with graph filters. To benefit from the properties of several graph shift operators simultaneously, and to enhance interpretability, we investigate combinations of parallel graph filters with different shift operators. Due to their extra degrees of freedom, these models might suffer from over-fitting. We address this problem through a weighted ${l_{2}}$ -norm regularization formulation to perform model selection by encouraging group sparsity. What makes this formulation interesting is that it is actually a smooth convex optimization problem. Experiments on real-world data structured by undirected and directed graphs show the effectiveness of this method.

19 April 2020 in arXiv
Verified
Preprint
Open access
PDF file
FHFei Hua
Fei Hua
RNRoula Nassif
Roula Nassif
CRCédric Richard
Cédric Richard
HWHaiyan Wang
Haiyan Wang
ASAli H. Sayed
Ali H. Sayed
We study the problem of distributed estimation over adaptive networks where communication delays exist between nodes. In particular, we investigate the diffusion Least-Mean- Square (LMS) strategy where delayed intermediate estimates (due to the communication channels) are employed during the combination step. One important question is: Do the delays affect the stability condition and performance? To answer this question, we conduct a detailed performance analysis in the mean and in the mean-square-error sense of the diffusion LMS with delayed estimates. Stability conditions, transient and steady-state mean-square-deviation (MSD) expressions are provided. One of the main findings is that diffusion LMS with delays can still converge under the same step-sizes condition of the diffusion LMS without delays. Finally, simulation results illustrate the theoretical findings.