### Table 2: Testing the independence between Lk and Lk+1 in turbo graphs with chain length n = 64000.

1999

"... In PAGE 21: ... To test the accuracy of our independence assumption, we compare the product of the estimated marginal probabilities with the estimated joint probability. Table2 provides the comparison for turbo graphs for n = 64000. The products of the marginal probabilities are quite close to the joint probabilities, indicating that the independence assumption leads to a good approximation for turbo graphs.... ..."

Cited by 10

### TABLE I Simulation vs. theoretical estimates of the probability of no loops of length c or less, at a randomly chosen node in the ADG model of turbo codes with K=64000, as a function of c. The U nodes are ignored.

2001

Cited by 4

### Table 1. Number of operations for full search motion estimation

"... In PAGE 2: ... Below, the computational burden for motion estimation and that of turbo decoding is derived, and the two quantities are compared. Not differentiating between operations for the sake of conciseness and simplification, full search motion estimation requires P(2N + Nb) operations (see Table1 ), while turbo decoding de- mands 2NpITCOMAP operations, with OMAP operations per Maximum- A-Posteriori (MAP) decoding [10], (see Table 2). For turbo decoding, given typical parameters (Ta- ble 3), approximately 7.... ..."

### Table 2: The modified weight spectra vs. the actual weight spectra for the rate-1/2 turbo code with the chosen S-Random interleaver (dmin=8), N = 192.

"... In PAGE 8: ... To verify the validity of the proposed modification, we compute a few initial terms of the weight spectra for the rate-1/2 code with the specific S-Random interleaver, using the algorithm in [9]. The true spectra are compared to our modified spectra in Table2 , and it is evident why the modified union bounds yield a better estimate for this specific interleaver than the conventional union bounds. The modification to the union bounds is used in the performance analysis that follows.... ..."

### Table 1. Logical functions for Turbo SHA-2

in Turbo SHA-2

"... In PAGE 3: ...Turbo SHA-2 logical functions Turbo SHA-2 uses the same six logical functions as SHA-2 (listed in Table1 ). Each function operates on 32-bit (resp.... ..."

### Table I. Summary of conditions used in TURBO calculations.

2003