### Table 1 Comparison between existing multi-user 3D virtual environments

2001

"... In PAGE 5: ... Progressive 3D streaming as proposed in [29] sends the more important bits to represent the 3D model and then the less important bits, allowing the user to see the model when only a few bits are received, and the user can stop the download at any time and yet retain the best available quality of the model. Existing Multi-User 3D Virtual Environments A comparison of existing multi-user 3D virtual environments is shown on Table1 . Each of these systems has its pros and cons.... ..."

Cited by 2

### Table 1-1 Power of Various Architectures Running Multi-user Detection for a DS-CDMA System

"... In PAGE 9: ...1, custom ASIC implementations can exploit application specific parallelism and control flow. Therefore, ASICs can offer order of magnitude improvement in terms of energy consumption [as shown in Table1 -1] when compared to programmable processors. Table1-1 shows the power consumption of implementing a multi-user detection algorithm for CDMA systems on two programmable processors (StrongARM [ref] and Texas Instrument DSP [ref]) and on an ASIC.... In PAGE 9: ... Therefore, ASICs can offer order of magnitude improvement in terms of energy consumption [as shown in Table1-1] when compared to programmable processors. Table1 -1 shows the power consumption of implementing a multi-user detection algorithm for CDMA systems on two programmable processors (StrongARM [ref] and Texas Instrument DSP [ref]) and on an ASIC. A two to three order of magnitude of power saving is shown in the ASIC implementation.... ..."

### Table 2: Multi-user response time and throughput for n-step conversations with and without CIC

2004

"... In PAGE 36: ...hink times (i.e., using a closed system model). Table2 shows the measured average response time and throughput in terms of the simulated n-step user sessions. The figures show that the performance degradation is less than 10 percent and thus well within the range of acceptable overhead.... ..."

Cited by 10

### Table 1: Optimum q-state 2 b/s/Hz 4-PSK space-time codes (ePmin from [6]).

2002

"... In PAGE 8: ... As previously discussed q = 2(Q?1)R with Q = 2 or 3 if the number of states is 4 or 16, while [9] q = 2(Q?2)R+1 with Q = 2 or 3 if the number of states is 8 or 32. Our results for this case are summarized in Table1 . Besides providing ; AP (L) and CP (L), for convenience we provide the \e ective product distance quot;, ePmin, from [6] in Table 1.... In PAGE 8: ... Our results for this case are summarized in Table 1. Besides providing ; AP (L) and CP (L), for convenience we provide the \e ective product distance quot;, ePmin, from [6] in Table1 . To help the reader understand the process taken to arrive at Table 1, we describe some of the details.... In PAGE 8: ... Besides providing ; AP (L) and CP (L), for convenience we provide the \e ective product distance quot;, ePmin, from [6] in Table 1. To help the reader understand the process taken to arrive at Table1 , we describe some of the details. In particular, we found that there are 1840 di erent 4-state codes (not counting4 permutations of the columns of G) which satis ed the su cient conditions for maximum diversity gain while simultaneously providing the highest coding gain, = 2, of any codes satisfying the su cient conditions for maximum diversity gain.... In PAGE 8: ... The 4 state case was atypical in this respect, it being the only case where we could not nd optimum codes, with the largest possible diversity and coding gain, which satis ed the su cient conditions for maximum diversity. From these 288 codes, we selected one of the 24 codes with largest AP (2), CP (2) and AP (3) to put in Table1 . By examining the slope of the FER performance 4In the count of 1840 given, several of the codes counted could be considered to be equivalent.... In PAGE 9: ... All of the 96 codes provided the same AP (3) of 5:76, and 24 of them gave best CP (3) of 6:24. Thus we selected the rst one we encountered with CP (3) = 6:24 to put in Table1 . We were also able to show that any codes satisfying the necessary conditions for maximum diversity could not provide = p32 without yielding AP (3) lt; 5:76.... In PAGE 9: ... We were also able to show that any codes satisfying the necessary conditions for maximum diversity could not provide = p32 without yielding AP (3) lt; 5:76. For the 32-state case we found that the maximum coding gain is = 6 and one such code with best CP (3) = 6:33 and best CP (4) = 8:72 is put in Table1 . Further this code satis es the su cient conditions for maximum diversity gain.... In PAGE 9: ... Further this code satis es the su cient conditions for maximum diversity gain. We note that a few of our calculations concerning the cases in Table1 di er from those in [1] and [4]. The coding gain for the 8-state case from [1] is = p12 based on our calculations, as opposed to = p20 as stated in [1].... In PAGE 11: ... We conjecture it achieves near optimum (if not optimum) coding gain. 5 Probability of Frame Error Performance Figure 1 shows the frame error rate of the space-time codes listed in Table1 for cases with 2 transmit and 2 receive antennas. Figure 1 illustrates the gain achieved by increasing the constraint length of the codes.... In PAGE 11: ... Figures 2 through 4 compare the performance of our codes and those from [1, 4, 6]. Clearly, the codes in Table1 are better than the codes from [1, 4, 6] when judged in terms of frame error rate. In all our simulations, each frame consists of 130 transmissions from of each transmit antenna (` = 130).... In PAGE 14: ... We discuss the signi cance of augmenting with AP (L) and CP (L), using the cases in Figure 2 as an example. Consider the 4 state code GT = 0 B @ 2 0 1 2 2 2 2 1 1 C A (9) given in Table1 . Recall this code provides a coding gain of p8.... ..."

Cited by 15

### Table 2: Recognition results for multi-user system

"... In PAGE 5: ...bove. An average recognition rate of 94.2% was achived. Table2 shows the recognition result of the... ..."

### Table 1 Figure 5: Performance comparisons of some 2 b/s/Hz, QPSK, 8-state Space-time Codes with 2 transmit and 2 receive antennas. Zero symmetry (ZS) is de ned in [11] (` = 130).

"... In PAGE 15: ... of the code from [1] our AP ( ^ Q) CP ( ^ Q) our GT 4 2 p8 3:54 3:80 0 B B @ 2 0 1 2 2 2 2 1 1 C C A 8 p12 4 3:42 4:00 0 B B @ 0 2 1 0 2 2 1 0 2 2 1 C C A 16 p12 p32 5:76 6:24 0 B B @ 0 2 1 1 2 0 2 2 1 2 0 2 1 C C A 32 p12 6 5:63 6:33 0 B B @ 2 0 1 2 1 2 2 2 2 0 1 2 0 2 1 C C A Table1 : Optimum q-state 2 b/s/Hz 4-PSK space-time codes. As an example consider the 8-state case with two transmit antennas and QPSK modulation.... In PAGE 15: ... An additional 188 codes were found that achieved = 4 which satis ed only the necessary conditions for maximum diversity and not the su cient conditions. Of the codes achieving = 4 and satisfying the su cient conditions for maximum diversity, we found a group of codes which provided the largest AP (3) = 3:42 and the largest CP (3) = 4:00 and one such code is listed in Table1 . The for the best 8-state, QPSK code found in [1] is also given in Table 1 illustrating the improvement in provided by our code.... In PAGE 15: ... Of the codes achieving = 4 and satisfying the su cient conditions for maximum diversity, we found a group of codes which provided the largest AP (3) = 3:42 and the largest CP (3) = 4:00 and one such code is listed in Table 1. The for the best 8-state, QPSK code found in [1] is also given in Table1 illustrating the improvement in provided by our code. Table 1 also provides optimum codes for some other interesting cases with two antennas and QPSK modulation.... In PAGE 16: ... Figure 5 illustrates the gain provided by the 8-state code in Table 1 when compared to other codes from [10, 11] with the same complexity. The other codes in Table1 provide similar gains for comparisons with the codes from [10, 11]. Due to space limitations, we have only presented simulation results for cases with two receive antennas.... ..."

### Table 1 After to have performed ML detection Log-Likelihood-Ratios (LLRs) related to the encoded data bits are calculated, as described in [4], and passed to an outer convolutional decoder which provides hard decision bits. Fig. 1 summarize the analysis related to Orthogonal-Space-Time-Codes (OSTBC), showing the results for three different data-rate: 9, 18 and 48 Mbps. In the figure are compared Alamouti scheme (OSTBC 2xN) with Tarokh scheme [3] (OSTBC 3xN) varying modulation order and code-rate parameters in order to

2004

"... In PAGE 54: ... Date 02/03/2006 . Doc Id Issue PROGETTO PRIMO (FIRB 2002) Access scheme Research unit FH-OFDMA POLITO OFDMA TILAB TDMA UNIPI MC-CDMA UNIPD Table1 : Simulated access schemes. In particular the simulations carried on by TILAB, concerning the OFDMA access technique, have given the following outputs shown in Figure 1, Figure 2, Figure 3 and Figure 4.... ..."

### Table 3.1: Classi cation scheme for multi-user applications for design.

### Table 1. Optimum a20 -state 1 b/s/Hz QPSK 2-space-time codes over a40a6a41 for quasi-static fading.

2001

"... In PAGE 1: ... We use the systematic approach [4] with minor modifica- tions to search for the 1 b/s/Hz optimum 2-space-time trel- lis codes for rapid fading and quasi-static fading cases. In Table1... ..."

Cited by 1