Fast Converging Algorithm for Blind Equalization With Gaussian and Impulsive Noises

This paper proposes a blind equalization algorithm for dispersive wireless communication systems that employ high throughput quadrature amplitude modulation signals under both Gaussian and impulsive noise environments. A novel cost function that combines the modulus match error function with the negative Gaussian kernel function is established to efficiently obtain the weight vector associated with the blind equalizer. Some preferable properties of the novel cost function are presented. Intensive studies show that the proposed cost function efficiently reduces the maladjustment caused by the modulus mismatch error and efficiently suppresses the negative influence resulting from large errors. Moreover, an efficient successive approximation method for minimizing the established cost function is proposed for fast searching of the optimal weight vector. Very importantly, it is proved that the proposed successive approximation method possesses superlinear convergence. Finally, extensive simulations are provided to demonstrate that the proposed blind equalizer has better performances than the existing methods under both Gaussian and impulsive noise circumstances in terms of equalization quality and equalization efficiency.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Signal Processing
Published
2025-01-01
DOI
https://doi.org/10.1109/tsp.2025.3525663
Citations
2
Primary Topic
Blind Source Separation Techniques
Type
article
Field-Weighted Citation Impact
2.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast Converging Algorithm for Blind Equalization With Gaussian and Impulsive Noises

Long Yang, Jin Li, Wei Xing Zheng
2 citations
IEEE Transactions on Signal Processing
Blind Source Separation Techniques
2.97
article

Fast Converging Algorithm for Blind Equalization With Gaussian and Impulsive Noises

Long Yang, Jin Li, Wei Xing Zheng
article en
2 citations

Abstract

This paper proposes a blind equalization algorithm for dispersive wireless communication systems that employ high throughput quadrature amplitude modulation signals under both Gaussian and impulsive noise environments. A novel cost function that combines the modulus match error function with the negative Gaussian kernel function is established to efficiently obtain the weight vector associated with the blind equalizer. Some preferable properties of the novel cost function are presented. Intensive studies show that the proposed cost function efficiently reduces the maladjustment caused by the modulus mismatch error and efficiently suppresses the negative influence resulting from large errors. Moreover, an efficient successive approximation method for minimizing the established cost function is proposed for fast searching of the optimal weight vector. Very importantly, it is proved that the proposed successive approximation method possesses superlinear convergence. Finally, extensive simulations are provided to demonstrate that the proposed blind equalizer has better performances than the existing methods under both Gaussian and impulsive noise circumstances in terms of equalization quality and equalization efficiency.

IEEE Transactions on Signal ProcessingVol. 73
Xidian University (CN), Western Sydney University (AU)
Openalex Percentile: Top 12%
Blind Source Separation Techniques
2.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Fast Converging Algorithm for Blind Equalization With Gaussian and Impulsive Noises — Long Yang, Jin Li, et al. · IEEE Transactions on Signal Processing (2025) | TGRS Research Map | TGRS