Recursive blind equalization with an optimal bounding ellipsoid algorithm.
Mathieu PouliquenMiloud FrikelMatthieu DenoualPublished in: EUSIPCO (2014)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- significant improvement
- globally optimal
- experimental evaluation
- optimization algorithm
- recursive algorithm
- computational complexity
- k means
- weighting coefficients
- locally optimal
- exhaustive search
- recognition algorithm
- detection algorithm
- computationally efficient
- worst case
- cost function
- high accuracy
- data sets
- objective function
- preprocessing
- computational cost
- times faster
- tree structure
- probabilistic model
- theoretical analysis
- particle swarm optimization
- classification algorithm
- convergence rate
- clustering method
- improved algorithm
- np hard
- space complexity
- optimal parameters
- segmentation algorithm