Journal article
Blind channel equalization and epsilon -approximation algorithms
IEEE transactions on signal processing, Vol.49(11), pp.2823-2831
01/01/2001
DOI: 10.1109/78.960429
Abstract
We show that a blind equalizer can be obtained without estimating any statistics based on the received data if the constellation alphabet is known. The idea is to formulate the blind channel equalization problem into a quadratic optimization with binary constraints. Then, efficient member of -approximation algorithms are presented and applied to find the equalizer coefficients. The proposed approach blindly equalizes the channel at symbol baud rates, does not rely on estimating any statistics, applies to nonminimum phase channels, and converges to an member of neighborhood of a global optimum. Simulation results support the theoretical analysis
Details
- Title: Subtitle
- Blind channel equalization and epsilon -approximation algorithms
- Creators
- Qingyu LiEr-Wei BaiYinyu Ye
- Resource Type
- Journal article
- Publication Details
- IEEE transactions on signal processing, Vol.49(11), pp.2823-2831
- DOI
- 10.1109/78.960429
- ISSN
- 1053-587X
- eISSN
- 1941-0476
- Language
- English
- Date published
- 01/01/2001
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984083854302771
Metrics
6 Record Views