### Table 10: Evaluation Results in OFDM Transmitter

2003

"... In PAGE 42: ... While BusSynth can generate a Bus Subsystem having any number of PEs according to the user options, the examples presented in detail in this section all have the same number of PEs in order to provide a basis for fair comparisons later in Section 7.3 (please note that the examples shown in Figure 7 and Figure 8 have 40MB total of non-L1 cache memory; nevertheless, the bus examples of Figures 7 and 8 do not result in the best performance as shown in Table10 of Chapter 7 Experiments and Results). In all examples in this thesis, we use the Motorola PowerPC (MPC755) for the PE core, which, however, can be changed to any other core simply by adding a CBI module for the new PE core (e.... In PAGE 121: ... Data: 2048 complex samples and 512 guard complex samples per packet 3. Each Bus System having four PowerPCs supports instruction and data cache operations Table10 shows the results of our evaluation using an OFDM transmitter that in our example has 922 lines of C code for the algorithm implementation (7,909 lines of assembly code for the algorithm implementation) and 696 lines of assembly code... In PAGE 122: ... Therefore, in SplitBA, it is more reasonable to use the FPA style. SplitBA (Case 7 in Table10 ) using the FPA style shows the best performance among the Bus Systems in our example: OFDM transmission reaches a rate of 5.1132Mbps, 16.... In PAGE 122: ...ransmission reaches a rate of 5.1132Mbps, 16.44% faster than GGBA, which we take as representative of a typical commercial bus. We can see in Table10 that the throughput of each Bus System is significantly affected by the bus types we described and programming style (PPA vs. FPA): (a) In software programming style, FPA outperforms PPA in the OFDM transmit- ter application (e.... ..."

Cited by 15

### Table 2. Positive local operational semantics (fragment)

2007

Cited by 1

### Table 1: XPath Fragment

"... In PAGE 3: ...Table 1: XPath Fragment In Table1 , locpath is the start production, axis denotes the XPath axis relations2 and ntst is a node test that can be a node label, ? (that matches all labels), or function text() that tests whether a node is a text node. op is one of the XPath comparison operators ( lt;, gt;, , , 6 =, =) and v is a value.... ..."

### Table I Duality of evolutionary spectrum and transitory evolutionary spectrum (F denotes the Fourier transform operator).

in Generalized Evolutionary Spectral Analysis and the Weyl Spectrum of Nonstationary Random Processes

### Table 3. Methods of class Fragment

"... In PAGE 6: ... These operations are not implemented by Smalltalk meth- ods, but by code slots connected to fragments. They depend upon the Self-like object system, that is implemented by the Smalltalk classes we have seen in Figure 4 and the methods that are described in Table3 and Table 4. Operation Meaning addRole: roleName type: aType cardMin: anInt cardMax: anotherInt Add new role to the fragment.... ..."

### Table 1: Code fragments for the front-of-deque operations

1994

Cited by 47

### Table 9: Land fragmentation in Orissa by operational holding size

"... In PAGE 53: ... Thus, much of this discussion is based on village studies, National Sample Survey (NSS) data, and informed estimates. The trend in fragmentation over time and across land sizes is shown in Table9 . In 1961-62 there were an average of 6.... ..."

### Table 5: Number of fragment lighting operations performed by Mesa, RC and IMBRIS

1999

"... In PAGE 14: ...Lighting Load Table5 reports the amountoflighting work performed. Wechose this metric because the less work done lighting, the more e#0Bective the visible surface technique.... ..."

Cited by 1

### Table 1 PSL2 A5 G168

1993

"... In PAGE 15: ... Therefore this symmetric power must be reducible. Table1 shows that G(L) cannot be a nite primitive group.... In PAGE 15: ... We then have that G(L) is one of the nite prim- itive groups or all of SL(2; C). Table1 implies that L s 6(y) is reducible. Conversely, Proposition 2.... In PAGE 17: ...roof. Lemma 3.5 states that the solution space of L s m(y) = 0 is isomorphic to the mth symmetric power of V , the solution space of L(y) = 0. Table1 gives the decom- positions of these spaces for small m and Proposition 3.1 gives the rst three results.... In PAGE 19: ...ince G(L) acts irreducibly (i.e. case 1 does not hold), we get from Theorem 4.1 and Table1 that G(L) is imprimitive if and only if L s 2(y) = 0 is reducible. The fact that the algebraic degree 2 for ! is best possible follows from [0] p.... In PAGE 23: ... But since in this example L(y) = 0 is the second symmetric power of the equation d2 y dx2 + 3 16x2 + 2 9(x ? 1)2 ? 3 16x(x ? 1) y = 0 whose di erential galois group is ASL2 4 ([0], p. 23), we get by construction that G(L) = A4 (from Table1 it now also follow that L(y) = 0 is irreducible). For third order di erential equations very few examples can be found in the literature.... In PAGE 25: ... 342). According to Table1 , the third symmetric power of this di erential equation L(y) = d3y dx3 + 21(x2 ? x + 1) 25x2(x ? 1)2 d2y dx2 + 21(?2x3 + 3x2 ? 5x + 2) 50x3(x ? 1)3 y is irreducible and has galois group A5. In order to prove that G(L) = A5 using factoriza- tion of di erential operators over over Q(x), it is enough (cf.... ..."

Cited by 48