default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShaohui Lv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Shaohui Lv, Haiquan Zhao
, Wenjing Xu:
Robust Variable Step Size Widely Linear Complex-Valued Least Mean M-estimate Adaptive Algorithm: Derivation and Performance Analysis. Circuits Syst. Signal Process. 43(6): 3888-3908 (2024)- [j16]Wenjing Xu, Haiquan Zhao, Shaohui Lv:
Constrained Normalized Subband Adaptive Filter Algorithm and Its Performance Analysis. Circuits Syst. Signal Process. 43(7): 4605-4623 (2024) - [j15]Shaohui Lv, Haiquan Zhao, Wenjing Xu:
Robust Affine Projection KRSMPL Adaptive Filtering Algorithm and Its Application. IEEE Trans. Circuits Syst. II Express Briefs 71(3): 1506-1510 (2024) - [j14]Wenjing Xu, Haiquan Zhao, Shaohui Lv:
Robust Constrained Normalized M-Estimate Subband Adaptive Filter: Algorithm Derivation and Performance Analysis. IEEE Trans. Circuits Syst. II Express Briefs 71(8): 4010-4014 (2024) - 2023
- [j13]Shaohui Lv, Haiquan Zhao:
Robust Diffusion Recursive Least M-Estimate Adaptive Filtering and Its Performance Analysis. Circuits Syst. Signal Process. 42(8): 4929-4952 (2023) - [j12]Shaohui Lv, Haiquan Zhao, Wenjing Xu:
Robust augmented complex-valued normalized M-estimate subband adaptive filtering algorithm against colored non-circular inputs and impulsive noise. J. Frankl. Inst. 360(12): 7645-7675 (2023) - [j11]Wenjing Xu, Haiquan Zhao, Shaohui Lv:
Robust multitask diffusion normalized M-estimate subband adaptive filter algorithm over adaptive networks. J. Frankl. Inst. 360(15): 11197-11219 (2023) - [j10]Wenjing Xu, Haiquan Zhao, Shaohui Lv:
Robust Constrained Affine-Projection-Like Adaptive Filtering Algorithms Using the Modified Huber Function. IEEE Trans. Circuits Syst. II Express Briefs 70(3): 1214-1218 (2023) - [j9]Haiquan Zhao, Wang Xiang, Shaohui Lv:
A Variable Parameter LMS Algorithm Based on Generalized Maximum Correntropy Criterion for Graph Signal Processing. IEEE Trans. Signal Inf. Process. over Networks 9: 140-151 (2023) - [j8]Shaohui Lv, Haiquan Zhao, Wenjing Xu:
Robust Widely Linear Affine Projection M-Estimate Adaptive Algorithm: Performance Analysis and Application. IEEE Trans. Signal Process. 71: 3623-3636 (2023) - 2022
- [j7]Shaohui Lv, Haiquan Zhao, Lijun Zhou:
Robust Proportionate Normalized Least Mean M-Estimate Algorithm for Block-Sparse System Identification. IEEE Trans. Circuits Syst. II Express Briefs 69(1): 234-238 (2022) - [j6]Haiquan Zhao, Dongxu Liu, Shaohui Lv:
Robust Maximum Correntropy Criterion Subband Adaptive Filter Algorithm for Impulsive Noise and Noisy Input. IEEE Trans. Circuits Syst. II Express Briefs 69(2): 604-608 (2022) - [j5]Haiquan Zhao, Yida Chen, Shaohui Lv:
Robust Diffusion Total Least Mean M-estimate Adaptive Filtering Algorithm and Its Performance Analysis. IEEE Trans. Circuits Syst. II Express Briefs 69(2): 654-658 (2022) - [j4]Shaohui Lv, Haiquan Zhao:
Robust Multi-Task Diffusion Least Mean M-Estimate Adaptive Algorithm and Its Performance Analysis. IEEE Trans. Circuits Syst. II Express Briefs 69(4): 2386-2390 (2022) - 2021
- [j3]Lei Li, Haiquan Zhao, Shaohui Lv:
Diffusion recursive total least square algorithm over adaptive networks and performance analysis. Signal Process. 182: 107954 (2021) - [j2]Shaohui Lv, Haiquan Zhao, Xiaoqiong He:
Geometric algebra based least mean m-estimate robust adaptive filtering algorithm and its transient performance analysis. Signal Process. 189: 108235 (2021) - [j1]Shaohui Lv, Haiquan Zhao, Lijun Zhou:
Maximum mixture total correntropy adaptive filtering against impulsive noises. Signal Process. 189: 108236 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 01:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
