### Table 2. BKYY DR for ICA and Blind Source Separation (BSS)

1997

Cited by 19

### Table 1: Blind source separation results of speech mixtures (a) Noiseless

"... In PAGE 3: ... However, the Euler-like integration preserves the orthogonalityin a satisfactory way as well. Table1 lists results of blind source separation of speech mix- tures. Twenty speech signals, each of 3,500 samples, were mixed by a randomly generated mixing matrix.... ..."

### Table 1: The convolutive mixing equation and its corresponding separation equation are shown for different domains in which blind source separation algorithms have been derived. Mixing Process Separation Model

"... In PAGE 4: ... (15) As with the mixing process, the separation system can be expressed in the z-domain as Y (z) = W (z)X(z), (16) and it can also be expressed in block Toeplitz form with the corresponding definitions for hatwide y(t) and hatwider W [25]: hatwide y(t) = hatwider W hatwide x(t). (17) Table1 summarizes the mixing and separation equations in the different domains. 3.... ..."

### Table 2. Operation count of the blind algorithms

1998

"... In PAGE 8: ... We will use the parameters shown in Table 1 to estimate the operation counts. The operation counts are listed in Table2 and are derived from a close analysis of the various steps in the channel estimation and detection algorithms. Table 1.... In PAGE 8: ... Notation Symbol Den0cnition K No. of users N c n28= T=T c n29 Spreading code size W s Window size for channel estimation algorithms fT c Granularity of sliding correlator For the channel estimation algorithms, the estimate in Table2 refers to the number of operations required to calculate eachchannel estimate. In addition, for the maximum likelihood algorithm, one would have to estimate the covariance of the colored noise whenever the interference characteristics change.... ..."

Cited by 6

### Table 8. Constraint values for context blind and sensitive analysis

2005

"... In PAGE 18: ... This in turn reduces the calculated worst-case values for the constrained parameters. Table8 shows that, in contrast to the inter context blind anal- ysis, all system constraints are satisfied when performance analysis takes inter context into account. In other words, a context blind analysis would have discarded a solution which is in reality valid.... ..."

Cited by 2

### Table 8. Constraint values for context blind and sensitive analysis

2005

"... In PAGE 18: ... This in turn reduces the calculated worst-case values for the constrained parameters. Table8 shows that, in contrast to the inter context blind anal- ysis, all system constraints are satisfied when performance analysis takes inter context into account. In other words, a context blind analysis would have discarded a solution which is in reality valid.... ..."

Cited by 2

### Table 1: Summary of procedures for blind source separation using generalized eigenvalue decomposition. Given a N T matrix X containing

2003

"... In PAGE 3: ...diagonal cross-statistics Q. A summary of the different assumptions and choices for Q is given in Table1 . We also show experimental results for signals that simultaneously satisfy the various assumptions.... In PAGE 7: ...g. see Table1 ), we believe that it is a simple framework for understanding and comparing the various approaches, as well as a method for verifying the underlying statistical assumptions. Acknowledgments We would like to thank Clay Spence and Craig Fancourt for their help and discussions.... ..."

Cited by 7

### Table 1: Blind decomposition versus technology driven

"... In PAGE 3: ... Followed byeachde- composition, we applied a covering algorithm, and recorded the number of 5-LUTs in the #0Cnal result. The benchmark circuits used in these and the following experiments are run through the following SIS script prior to applying any other step, and the resulting circuits are used as the input to our problem: source script; full simplify; source script; full simplify Table1 shows the results of these experiments. The table indicates that a blind decomposition leads to mapping results with an average of 70#25 to 150#25 more LUTs, compared to the decomposition obtained by TDD.... ..."