Please use this identifier to cite or link to this item:
https://dspace.iiti.ac.in/handle/123456789/18302
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Bhatia, Vimal | en_US |
| dc.date.accessioned | 2026-05-14T12:28:23Z | - |
| dc.date.available | 2026-05-14T12:28:23Z | - |
| dc.date.issued | 2025 | - |
| dc.identifier.citation | Chouksey, M., Jain, S., & Bhatia, V. (2025). Sparsity-Aware Logarithmic Hyperbolic Cosine Adaptive Filter with Variable Center. International Symposium on Advanced Networks and Telecommunication Systems, ANTS. https://doi.org/10.1109/ANTS66931.2025.11430099 | en_US |
| dc.identifier.isbn | 979-833152681-8 | - |
| dc.identifier.issn | 2153-1684 | - |
| dc.identifier.other | EID(2-s2.0-105036583664) | - |
| dc.identifier.uri | https://dx.doi.org/10.1109/ANTS66931.2025.11430099 | - |
| dc.identifier.uri | https://dspace.iiti.ac.in:8080/jspui/handle/123456789/18302 | - |
| dc.description.abstract | Sparsity-aware adaptive filtering algorithms based on the hyperbolic cosine (HC) and logarithmic HC adaptive filter (AF) called LHCAF have emerged as robust approaches for sparse channel estimation under non-Gaussian noise environments. However, the conventional zero-attracting LHCAF (ZA-LHCAF) algorithm delivers suboptimal performance under non-zero-mean non-Gaussian noise, as it relies on error statistics centered around the origin. To address this issue, we propose a novel ZA-LHCAF with variable center (ZA-LHCAF-VC) algorithm that is robust against non-Gaussian distortions having non-zero mean by incorporating higher-order central moments of error. Furthermore, we propose different variants of sparsity-aware LHCAF-VC (SA-LHCAF-VC) by incorporating the re-weighted L1-norm and the arc-tangent based sparsifying norm into the LHCAF-VC cost function. To further enhance the convergence performance, a variable step size (VSS) mechanism is also integrated into SA-LHCAF-VC to yield a novel VSS-SA-LHCAF-VC algorithm. Simulation results demonstrate that the proposed algorithm exhibits superior convergence performance compared to existing state-of-the-art methods. © 2025 IEEE. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE Computer Society | en_US |
| dc.source | International Symposium on Advanced Networks and Telecommunication Systems, ANTS | en_US |
| dc.title | Sparsity-Aware Logarithmic Hyperbolic Cosine Adaptive Filter with Variable Center | en_US |
| dc.type | Conference Paper | en_US |
| Appears in Collections: | Department of Electrical Engineering | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Altmetric Badge: