### Table 4.15: A Tower of Hanoi Program for Arbitrary Starting Constellations

2000

### Table 1: Source vector dimension (L), codebook size (N), and channel space dimension (K) for each class. The case K = 1 corresponds to the real or imaginary axis of a QAM constellation.

1996

"... In PAGE 2: ... In this work, simulated annealing is used to design the index maps as described in the next section. For the proposed system, the choices of source vec- tor dimension (L), codebook size (N), and channel space dimension (K) for each of the three classes are listed in Table1 . The QAM signal constellations were chosen with an odd number of amplitudes in each di- mension.... ..."

Cited by 4

### Table 1: Sample Constellations.

"... In PAGE 8: ...Consider the constellation C1 given in Table1 . This constellation consists of 10 satellites evenly distributed in a circular orbit.... In PAGE 11: ...0 5 10 15 20 25 30 35 40 45 C1 C2 C3 C4 C5 C6 C7 Constellations Fue l e x p e ndit ur e Baseline P2P Strategy E-P2P Strategy Figure 6: Comparison of E-P2P and baseline P2P refueling strategies. Comparison with GRASP We now compare the results obtained using the network flow formulation with those given by the GRASP method10 for the constellations given in Table1 . Such a comparison is depicted in Fig.... ..."

### Table XIII _ ____________________________________________________________________ Generator Constellation

1987

Cited by 26

### Table 2. Self-dual CS solitons for the sign of and various values of e (n means a positive integer and means an arbitrary real number).

### TABLE 1 EVALUATION OF CONSTELLATION MODELS

### TABLE 1. Transformations offered for different constellations on the way to a structured CLD. Depending on the labels of an arbitrary link e = (v1; v2) 2 E and the labels of its start and end factors v1, v2 we can distinguish the following cases. The Xmark indicates that nothing has to be done in this case.

### Table 2: Throughput optimization of non-linear real-life designs with unrestricted amount of unfolding used: ICPL - initial critical path length, ! 0 - arbitrary speed-up

"... In PAGE 4: ... Table 1 shows throughput im- provement achieved using the best previous approach by [2] and using the new approach with optimization engine of general non- linear computation with no unfolding. Table2 shows throughput improvement achieved for non-restricted amount of unfolding. When no unfolding is used, our approach reduces the critical path lengths from the technique of [2] by 35 % on average.... ..."

### Table 2: Throughput optimization of non-linear real-life designs with unrestricted amount of unfolding used: ICPL - initial critical path length, ! 0 - arbitrary speed-up

"... In PAGE 4: ... Table 1 shows throughput im- provement achieved using the best previous approach by [2] and using the new approach with optimization engine of general non- linear computation with no unfolding. Table2 shows throughput improvement achieved for non-restricted amount of unfolding. When no unfolding is used, our approach reduces the critical path lengths from the technique of [2] by 35 % on average.... ..."

### Table 2: Operational properties of the fractional Fourier transform. is an arbitrary real number, k is a real number (k 6 = 0; 1), and n is an integer. 0 = arctan(k2 tan ), where 0 is taken to be in the same quadrant as .

1999

Cited by 1