A Novel and Fast Algorithm for Solving Permutation in Convolutive BSS, Based on Real and Imaginary Decomposition.
Mostafa EsmaeilbeigHamid SheikhzadehFarbod RazzaziPublished in: Circuits Syst. Signal Process. (2016)
Keyphrases
- dynamic programming
- computational complexity
- improved algorithm
- convergence rate
- detection algorithm
- k means
- computational cost
- learning algorithm
- decomposition algorithm
- significant improvement
- worst case
- preprocessing
- segmentation algorithm
- neural network
- cost function
- times faster
- matching algorithm
- optimization algorithm
- theoretical analysis
- expectation maximization
- simulated annealing
- high accuracy
- algebraic equations
- decomposition method
- quadratic optimization problems
- combinatorial optimization
- computationally efficient
- input data
- experimental evaluation
- np hard
- evolutionary algorithm