### Table 2: Technology Mapping results

"... In PAGE 8: ... The results show that the Boolean approach reduces the number of matching algorithm calls, nd smaller area circuits in better CPU time, and reduces the initial network graph because generic 2-input base function are used. Table2 presents a comparison between SIS and Land for the library 44-2.genlib, which is distributed with the SIS package.... ..."

### Table 2 Comparison of coding gain and decoding search space per decoder of unitary DSTM schemes for four transmit antennas

"... In PAGE 11: ... PERFORMANCE RESULTS We now compare our two proposed double-symbol-decodable unitary DSTM schemes (one based on O-STBC with spherical code, the other based on QO-STBC with optimized joint constellation set specified in (17) and Theorem 1) against each other, as well as against existing unitary DSTM schemes. In Table2... ..."

### Table 2. Performance of graph-based propagation approach.

2007

Cited by 1

### Table 2. Sequential stratified sampling for belief propagation

Cited by 1

### TABLE I COMPLEXITY COMPARISON OF PROPOSED OPTIMAL SISO AND WOLF TRELLIS DECODERS FOR VARIOUS REED-SOLOMON CODES. COMPLEXITY IS MEASURED BY THE BASE-2 LOGARITHM OF REAL OPERATIONS PER CODEWORD.

2005

Cited by 2

### Table 6: Rule Base Expressed as a Decision Table Inputs Rules

1997

"... In PAGE 19: ... After a mapping is obtained, the second step in concept formation is to convert the decision table into a compressed form. The compressed decision table for the credit granting rule base is shown in Table6 . We note that a compressed decision table is not the only representation of concepts suitable for cost optimization.... ..."

Cited by 4

### Table 6: Threshold value for the binary-input Laplace channel with belief propagation for various code parameters. Also listed is the maximal allowed value opt according to equation (5).

2001

Cited by 102

### Table 6: Threshold value for the binary-input Laplace channel with belief propagation for various code parameters. Also listed is the maximal allowed value opt according to equation (5).

### Table 2: Combination of optimizations opt1 copy propagation

2005

"... In PAGE 20: ... The case of 20 registers is the model for architectures such as SPARC and MIPS, while the use of eight registers investigates the tendency for CPUs in embedded systems to have few registers. The combinations of optimizations used are shown in Table2 . -opt1 in the graphs of this section corresponds to opt1 in Table 2, and so on.... In PAGE 20: ... The combinations of optimizations used are shown in Table 2. -opt1 in the graphs of this section corresponds to opt1 in Table2 , and so on. For benchmarks, we used gzip and mcf from SPECint2000.... ..."