Blind source separation of signals with known alphabets using epsilon -approximation algorithms

Qingyu Li; Er-Wei Bai; Zhi Ding

doi:10.1109/TSP.2002.806561

Back

Blind source separation of signals with known alphabets using epsilon -approximation algorithms

Journal article

Peer reviewed

Blind source separation of signals with known alphabets using epsilon -approximation algorithms

Qingyu Li, Er-Wei Bai and Zhi Ding

IEEE transactions on signal processing, Vol.51(1), pp.1-10

01/01/2003

DOI: 10.1109/TSP.2002.806561

View Online

Abstract

We show that blind separation of signals in given alphabets can be formulated into a quadratic optimization problem with integer constraints. Then, efficient epsilon -approximation algorithms are applied to directly estimate the transmitted signals. The proposed approach does not require any high order statistics. Moreover, the algorithms converge to an epsilon neighborhood of the global optimum with polynomial computational complexity. Simulations show that the algorithm achieves satisfactory performance using a short length of data.

Algorithms

Separation

Computer simulation

Alphabets

Blinds

Estimates

Statistics

Optimization

Details

Title: Subtitle: Blind source separation of signals with known alphabets using epsilon -approximation algorithms
Creators: Qingyu Li
Er-Wei Bai
Zhi Ding
Resource Type: Journal article
Publication Details: IEEE transactions on signal processing, Vol.51(1), pp.1-10
DOI: 10.1109/TSP.2002.806561
ISSN: 1053-587X
eISSN: 1941-0476
Language: English
Date published: 01/01/2003
Academic Unit: Electrical and Computer Engineering
Record Identifier: 9984083824702771

Metrics

11 Record Views

13 Times Cited - Web of Science