Francesco Nesta
Fondazione Bruno Kessler (FBK-IRST), Trento (Italy)

Main parameters:

FFT size=4096
Frame shift=1024
Number of ICA iterations per frequency=20
Step-size=0.1

Sources have been separated with an algorithm based on a Regularized Recursive ICA (RR-ICA)[1] which extends the method in [2]. 
RR-ICA reduces the permutation if there is no aliasing but wrong permutations may occur if there is spatial aliasing. Thus, for the test files with microphone spacing of 6cm and 10cm the permutation of higher frequencies are corrected by means of the TDOA estimated by the SCT [3]

A not-well optimized Matlab version of the algorithm takes about 20 seconds per mixture on a Intel Core Duo 2.1 Ghz. An extended real-time version of this algorithm is also available (with a variable cpu load, depending on the parameters, of about 20-30%).

[1] Francesco Nesta, Piergiorgio Svaizer, Maurizio Omologo, "Convolutive BSS of short mixtures by ICA recursively regularized across frequencies", (accepted) in IEEE  Transactions on Audio, Speech and Language Processing.
[2] Francesco Nesta, Piergiorgio Svaizer, Maurizio Omologo, "A BSS method for short utterances by a recursive solution to the permutation problem", (in proceedings), SAM2008
[3] Francesco Nesta, Piergiorgio Svaizer, Maurizio Omologo, "A novel robust solution to the permutation problem based on a joint multiple TDOA estimation", (in proceedings), IWAENC 2008