{"title":"Quasi-orthogonal space-time block codes with full diversity","authors":"Weifeng Su, X. Xia","doi":"10.1109/GLOCOM.2002.1188366","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188366","url":null,"abstract":"Space-time block codes from orthogonal designs proposed by Alamouti (1998), and Tarokh-Jafarkhani-Calderbank (199) have attracted much attention lately due to their fast maximum-likelihood (ML) decoding and full diversity. However, the maximum symbol transmission rate of a space-time block code from complex orthogonal designs for complex constellations is only 3/4 for three and four transmit antennas. Jafarkhani (see IEEE Trans. Commun., vol.49, no.1, p.1-4, 2001), and Tirkkonen-Boariu-Hottinen (see ISSSTA 2000, pp.429-432, September 2000) proposed space-time block codes from quasi-orthogonal designs, where the orthogonality is relaxed to provide higher symbol transmission rates. With the quasi-orthogonal structure, these codes still have a fast ML decoding, but do not have the full diversity. In this paper, we design quasi-orthogonal space-time block codes with full diversity by properly choosing the signal constellations. In particular, we propose that half symbols in a quasi-orthogonal design are from a signal constellation A and another half of them are optimal selections from the rotated constellation e/sup j/spl phi// A. The optimal rotation angles /spl phi/ are obtained for some commonly used signal constellations. The resulting codes have both full diversity and fast ML decoding.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115933361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance of cellular CDMA with voice/data traffic with an SIR based admission control","authors":"S. Anand, A. Chockalingam","doi":"10.1109/GLOCOM.2002.1188207","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188207","url":null,"abstract":"We analyze the performance of an SIR based admission control strategy in cellular CDMA systems with both voice and data traffic. Most studies in the current literature to estimate CDMA system capacity with both voice and data traffic do not take signal-to-interference ratio (SIR) based admission control into account. In this paper, we present an analytical approach to evaluate the outage probability for voice traffic, the average system throughput and the mean delay for data traffic for a voice/data CDMA system which employs an SIR based admission control. We show that for a data-only system, an improvement of about 25% in both the Erlang capacity as well as the mean delay performance is achieved with an SIR based admission control as compared to code availability based admission control. For a mixed voice/data system with 10 Erlangs of voice traffic, the improvement in the mean delay performance for data is about 40%. Also, for a mean delay of 50 ms with 10 Erlangs voice traffic, the data Erlang capacity improves by about 50%.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124588128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Long-range dependence: now you see it, now you don't!","authors":"T. Karagiannis, M. Faloutsos, R. Riedi","doi":"10.1109/GLOCOM.2002.1189015","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189015","url":null,"abstract":"Over the last few years, the network community has started to make heavy use of novel concepts such as self-similarity and long-range dependence (LRD). Despite their wide use, there is still much confusion regarding the identification of such phenomena in real network traffic data. We show that estimating long-range dependence is not straightforward: there is no systematic or definitive methodology. There exist several estimating methodologies, but they can give misleading and conflicting estimates. More specifically, we arrive at several conclusions that could provide guidelines for a systematic approach to LRD. First, long-range dependence may exist, even if the estimators have different estimates of the Hurst exponent in the interval 0.5-1. Second, long-range dependence is unlikely to exist, if there are several estimators that fail to estimate the Hurst exponent. Third, we show that periodicity can obscure the analysis of a signal giving partial evidence of long-range dependence. Fourth, the Whittle estimator is the most accurate in finding the exact value when LRD exists, but it can be fooled easily by periodicity. As a case-study, we analyze real round-trip time data. We find and remove a periodic component from the signal, before we can identify long-range dependence in the remaining signal.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127286181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of the RAKE receiver performance in low spreading gain DS/SS systems","authors":"C. Unger, G. Fettweis","doi":"10.1109/GLOCOM.2002.1188194","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188194","url":null,"abstract":"In wideband DS-SS systems the RAKE receiver is commonly used to utilize the multipath diversity of the mobile radio channel. In the case of good spreading code correlation properties the multipath components of the received signal can be separated with low interpath interference (IPI). At low spreading gains the good correlation properties of the spreading codes are lost and the RAKE receiver performance is degraded by IPI. The IPI consists of symbol self interference (SSI) and intersymbol interference (ISI). In this paper the impact of the IPI on the BER performance of the RAKE receiver is analyzed. It is shown that in the presence of SSI the noise at the RAKE combiner output is correlated with the IPI, which has a significant influence on the receiver performance. Both BPSK and QPSK data and spreading modulation are considered. Numerical results are given for a system employing random spreading.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115237478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Impact of power control error on the outage probability of 2D-RAKE receivers in Nakagami fading channels","authors":"Kaizhi Huang, Jing Wang, Youzheng Wang, Guoan Chen","doi":"10.1109/GLOCOM.2002.1188508","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188508","url":null,"abstract":"The closed-form expressions of signal-to-interference-plus-noise ratio (SINR) and the outage probability are derived for a maximal ratio combining (MRC) two-dimensional (2D)-RAKE receiver with imperfect power control in a frequency-selective Nakagami fading channel. The impact of power control error (PCE) on the performance of the receiver is analyzed for various fading environments. Numerical results show that the performance of 2D-RAKE receivers degrades due to imperfect power control. But when PCE is not serious, increasing the number of antennae and temporal diversity order can compensate for the performance loss. The exact performance improvement due to space-time processing varies with PCE and the fading environment.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116715397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An efficient packet fair queueing (PFQ) architecture for latency rate server","authors":"Haitao Wu, Shiduan Cheng, Jian Ma","doi":"10.1109/GLOCOM.2002.1189065","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189065","url":null,"abstract":"The queuing/scheduling algorithm is one of the most important mechanisms to provide guaranteed quality of service (QoS) in high speed packet-switched networks. By computing the system virtual time and per packet/connection virtual start/finish time, a number of packet fair queueing (PFQ) algorithms are designed to simulate GPS (generalized processor sharing). The difference in computation complexity is due to the variable ways to compute system time. Many algorithms, including WFQ/WF/sup 2/Q, SCFQ, SPFQ, WF/sup 2/Q+, VC, etc., have been proposed to use different system virtual time (also known as system potential) function. This paper proves that all the latency-rate (LR) servers only need to calculate their system virtual times once per packet service time, no matter how many packet arrivals occur in this interval. Thus, it is a general scheme that benefits all the well-known LR PFQ algorithms.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"85 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121015007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the effect of very large nodes in Internet graphs","authors":"H. Reittu, I. Norros","doi":"10.1109/GLOCOM.2002.1189105","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189105","url":null,"abstract":"We analyse a random graph where the node degrees are (almost) independent and have a distribution with finite mean but infinite variance - a region observed in empirical studies of the Internet. We show that the existence of very large nodes has a great influence on the connectivity. If N denotes the number of nodes it seems that the distance between two randomly chosen nodes of the giant component grows as slowly as log log(N). The essential observation is that very large nodes form a spontaneously arising \"core network\", which plays a crucial role in the connectivity, although its proportional size goes to zero as N /spl rarr/ /spl infin/. Several results related to the core are proven rigorously, and a sketch of a full proof is given. Some simulations providing illustration of the findings are presented. Consequences of the results are discussed.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121221797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"2 GHz outdoor to indoor propagation at high elevation angles for mobile communications served by high altitude platform stations","authors":"D. Axiotis, M. Theologou","doi":"10.1109/GLOCOM.2002.1188522","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188522","url":null,"abstract":"High altitude platform stations have been recently proposed as a new means of providing international mobile communications (IMT-2000). One critical issue that has not been resolved yet is the possibility of providing indoor services. This paper examines the penetration into buildings loss at high elevation angles. Two approaches are followed: An empirical model is presented and evaluated through comparison with two measurement campaigns. Furthermore, a 3-D ray-tracing tool was developed In order to simulate a specific environment of 11 buildings and take into account parameters not modeled by the empirical method, such as rooftop diffractions. Both approaches conclude that the penetration loss is an increasing function of the elevation angle, but the range of values obtained shows that indoor coverage is feasible.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127070700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximations to joint-ML and ML symbol-channel estimators in MUD CDMA","authors":"T. Fabricius, O. Nørklit","doi":"10.1109/GLOCOM.2002.1188107","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188107","url":null,"abstract":"In this contribution we conceptually derive two symbol-channel estimators, the joint-ML and the ML, both having exponential complexity. Pragmatically we derive three approximations with polynomial complexity, one to the joint-ML: the pseudo-joint-ML; two to the ML: the naive-ML and the linear-response-ML. We assess the resulting average bit error rates empirically. Performance gains of several dB are observed from using the ML based approximations compared to the joint-ML.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124944355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bluetooth scatternet with a master/slave bridge: a queueing theoretic analysis","authors":"V. Mišić, J. Misic","doi":"10.1109/GLOCOM.2002.1188070","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188070","url":null,"abstract":"We analyze a Bluetooth scatternet with two piconets linked through a master/slave (MS) bridge using a queueing theoretic approach. We derive analytical results for the probability distribution of access delay and end-to-end delay, for both intra- and inter-piconet bursty traffic. We discuss the impact of various traffic parameters on performance, and give some guidelines to help maintain the performance within acceptable limits. All analytical results are confirmed through simulation.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126000829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}