CiteSeerX — Table search results

Results 1 - 10 of 35,335

Table V. Specification of Turbo decoder core.

in W-CDMA CHANNEL CODEC BY CONFIGURABLE PROCESSORS

by Masanao Ise, Yasuhiro Ogasahara

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

in The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding

by Xian-ping Ge, David Eppstein, Padhraic Smyth 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.

in The Distribution of Loop Lengths in Graphical Models for Turbo Decoding

by Xianping Ge, David Eppstein, Padhraic Smyth 2001

Cited by 4

Table 1. Number of operations for full search motion estimation

in Towards Rate-decoder Complexity Optimisation in

by Turbo-Coder Based Distributed

"... 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 III TURBO EQUALIZATION ALGORITHM

in Turbo Equalization

by Ralf Koetter, Andrew C. Singer, Michael Tüchler 2004

Cited by 12

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 Combined MMSE Interference Suppression and Turbo Coding for a Coherent DS-CDMA System

by Kai Tang, Laurence B. Milstein, Paul H. Siegel

"... 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

by Danilo Gligoroski, Svein Johan Knapskog

"... 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.

in Multi-Stage Aeroelastic Analysis for Propulsion

by Dr. The, G. Keith, Dr. Milind, A. Bakhle, Dr. The, G. Keith 2003

Table III. Profiling result of Turbo decoder.