This paper overviews a total solution for frequencydomain blind source separation (BSS) of convolutive mixtures of audio signals, especially speech. Frequency-domain BSS performs independent component analysis (ICA) in each frequency bin, and this is more efficient than time-domain BSS. We describe a sophisticated total solution for frequency-domain BSS, including permutation, scaling, circular...

A k × n Latin rectangle is a k × n array of numbers such that (i) each row is a permutation of [n] = {1, 2, . . . , n} and (ii) each column contains distinct entries. If the first row is 12 · · ·n, the Latin rectangle is said to be reduced. Since the number k × n Latin rectangles is clearly n! times the number of reduced k× n Latin rectangles, we shall henceforth consider only reduced Latin rec...

The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the first explicit major results on the topology of intervals in this poset. We show that almost all (open) intervals in this poset have a disconnected subinterval and are thus not shellable. Nevertheless, there seem to be large classes of intervals that are shellable and thus have the homotopy type ...

Li, Liu, Tan, Viswanathan, and Yang [3] introduced a technique for resolving overlapping channel transmissions that used an interesting new type of combinatorial structure. In connection with this problem, they provided an example of a 4× 4 array having certain desirable properties. We define a class of combinatorial structures, which we term retransmission permutation arrays, that generalise t...

We present a computationally-efficient matrix-vector expression for the solution of a matrix linear least squares problem that arises in multistatic antenna array processing. Our derivation relies on an explicit new relation between Kronecker, Khatri-Rao and Schur-Hadamard matrix products, which involves a selection matrix (i.e., a subset of the columns of a permutation matrix). Moreover, we sh...

We consider permutation routing problems on mesh connected processor arrays under a very weak model of reconnguration: we allow only uni-directional row or column buses, point-to-point communication, one-port-at-the-time serve by each processor. We present a scheme which is asympotically optimal for k-permutations, for any arbitrary k > 0. It works optimally on meshes of arbitrary dimensions d,...

In array processors, complex data reordering is often needed to realize the interconnection topologies between the computational nodes in algorithms. Several important algorithms, e.g., discrete trigonometric transforms and Viterbi decoding, can be represented in a radix-R form where the principal topology is stride by R permutation. In this paper, a general factorialization of stride permutati...

introduction: in this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. epilepsy is considered as a dynamical change in nonlinear and complex brain system. the ability of the proposed measure for characterizing the normal and epileptic eeg signals when the signal is short or is...

Let C be a conjugation class of permutations of a finite field Fq. We consider the function NCðqÞ defined as the number of permutations in C for which the associated permutation polynomial has degree 5q 2. In 1969, Wells proved a formula for N1⁄23 ðqÞ where 1⁄2k denotes the conjugation class of k-cycles. We will prove formulas for N1⁄2k ðqÞ where k 1⁄4 4; 5; 6 and for the classes of permutation...

We show how to onstru t pseudo-random permutations that satisfy a ertain y le restri tion, for example that the permutation be y li ( onsisting of one y le ontaining all the elements) or an involution (a self-inverse permutation) with no xed points. The onstru tion an be based on any (unrestri ted) pseudo-random permutation. The resulting permutations are de ned su in tly and their evaluation a...