1998
DOI: 10.1109/97.704975
|View full text |Cite
|
Sign up to set email alerts
|

Blind separation of discrete sources

Abstract: A polynomial criterion is proposed to perform blind source separation, extending previous works to MIMO systems. The criterion is proved to be asymptotically MAP-equivalent in presence of PSK sources. An efficient minimization algorithm dedicated to polynomial criteria is then developed, improving on the fixed-step stochastic gradient previously utilized in this framework.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2001
2001
2011
2011

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 36 publications
(16 citation statements)
references
References 17 publications
0
12
0
Order By: Relevance
“…Exact line search is in general computationally intensive and presents other limitations [15], which explains why, despite being a well-known optimization method, it is very rarely used. However, for criteria that can be expressed as rational functions of μ, such as the kurtosis, the constant modulus [16], [17] and the constant power [18], [19] contrasts, the optimal step size μ opt can easily be determined by finding the roots of a low-degree polynomial. At each iteration, optimal step-size (OS) optimization performs the following steps: S1) Compute OS polynomial coefficients.…”
Section: Robusticamentioning
confidence: 99%
“…Exact line search is in general computationally intensive and presents other limitations [15], which explains why, despite being a well-known optimization method, it is very rarely used. However, for criteria that can be expressed as rational functions of μ, such as the kurtosis, the constant modulus [16], [17] and the constant power [18], [19] contrasts, the optimal step size μ opt can easily be determined by finding the roots of a low-degree polynomial. At each iteration, optimal step-size (OS) optimization performs the following steps: S1) Compute OS polynomial coefficients.…”
Section: Robusticamentioning
confidence: 99%
“…This idea constitutes the basis for the RobustICA algorithm. The technique is also applicable to any other contrasts that can be expressed as polynomials or rational functions of µ, such as the constant modulus [37,83] or the constant power [39,81] criteria used for blind equalization of digital communication channels, even in the semi-blind case (Chapter 15). The RobustICA algorithm repeats the following steps until convergence:…”
Section: The Robustica Algorithmmentioning
confidence: 99%
“…However, it has been observed in [14,34] that, for a number of equalization criteria including the CM, the CP and their semi-blind versions studied herein, functional Υ(f−µg) is a rational function in the step size µ. This allows us to find µ opt algebraically, so that it is possible to globally minimize the cost function in the descent direction while reducing complexity.…”
Section: Step-size Polynomialsmentioning
confidence: 99%
“…These strategies are not exclusive to the equalization principles considered in this chapter (CM, CP), but can also profit other criteria such as the KM [96] (see also Chapter 6) or those of [34].…”
Section: Summary Conclusion and Outlookmentioning
confidence: 99%