{"title":"Noncoherent sequence detection of continuous phase modulations","authors":"G. Colavolpe, R. Raheli","doi":"10.1109/GLOCOM.1998.775789","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775789","url":null,"abstract":"In this paper, noncoherent sequence detection (NSD) proposed Colavolpe and Raheli (see Proc. IEEE Int. Conf. Commun. (ICC '97), Montreal, p.21-5, 1997, IEEE Commun. Lett., 1998, and Proc. IEEE Intern. Conf. Commun. (ICC '98), Atlanta, GA, USA, p.438-43, 1998) is extended to continuous phase modulation (CPM). CPM is treated here jointly with linear modulations with intersymbol interference (ISI) since it is mathematically equivalent to a sum of ISI-affected linearly modulated components, according to Laurent (1986) representation. We first consider combined noncoherent sequence detection and decoding of coded linear modulations in the presence of ISI. The results we then extended to the case of M-ary CPM signals. The proposed sub-optimal detection schemes have a performance which approaches that of coherent detection with an affordable level of complexity. The robustness of noncoherent sequence detection schemes to phase noise is also demonstrated.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"93 27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128980764","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 virtual channel borrowing scheme for cellular mobile systems","authors":"K. Al Agha, A. Beylot","doi":"10.1109/GLOCOM.1998.775898","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775898","url":null,"abstract":"We examine the performance of the virtual channel borrowing scheme (VCB) using an approximated analytical model and computer simulations. The VCB is used to improve the resource sharing performance of a fixed channel assignment (FCA) scheme. The underlying idea is to exploit regions of cell overlap to achieve a balanced distribution of traffic while reducing call blocking and handoff failures. Numerical and simulation results show a performance improvement of 30% in terms of the blocking and forced termination probabilities. The results depict also the forced handoff rate representing the additional signaling that occurs when applying VCB.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124754996","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":"Low-complexity fast-convergence blindly adaptive array processing techniques for wideband CDMA networks","authors":"Shang-Chieh Liu, E. Geraniotis","doi":"10.1109/GLOCOM.1998.775818","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775818","url":null,"abstract":"We present a linear-complexity fast-convergence blindly adaptive space-time processing which maximizes the received signal to interference and noise ratio (SINR) in wideband direct sequence code division multiple access (W-CDMA) networks. Compared to the other famous array processing algorithms, the proposed blind space-time processing technique outperforms the least mean square (LMS) algorithm. Both the aforementioned algorithms operate at the same order of complexity and, furthermore, the proposed one need no training sequence or feedback training. The convergence speed of the low-complexity algorithm almost competes which of the recursive least square (RLS) algorithm which is well-known for its fast convergence by using a training sequence and high computational complexity.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129453255","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":"Random preamble code selection for slotted ALOHA radio network with a multibeam adaptive array","authors":"T. Ohgane, K. Ito, Y. Ogawa","doi":"10.1109/GLOCOM.1998.775687","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775687","url":null,"abstract":"This paper proposes random code selection for a slotted ALOHA radio network with a multibeam adaptive array, which can decompose and detect the packets from the collision ones. The multibeam adaptive array requires that the multiple references are uncorrelated with each other. The aim of our proposal is to realize quasi-user-own preamble, which can be known by the communication server (CS) in advance. When packet transmission, each user selects a code from several available codes, randomly. Then, most of the packets have unique codes. In this paper, the throughput performance and code collision effect of the proposed system are investigated. Computer simulations show that the obtained maximum throughput reaches almost 2.2 with a 4-element adaptive array and 16-code selection even under the code collision condition.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130300109","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":"A passive test and measurement system: traffic sampling for QoS evaluation","authors":"I. Cozzani, S. Giordano","doi":"10.1109/GLOCOM.1998.776919","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776919","url":null,"abstract":"We present a test and measurement system with real time end-to-end monitoring capabilities able to provide reliable performance evaluations through sampling techniques. Sampling is introduced for relieving the complexity of management functions, which are usually carried out by means of heavy routines dealing with a huge amount of data especially in the current heterogeneous broadband networks providing several services with multimedia traffic. Our results show how to manage the trade-off-between the sampling rate and attained estimation accuracy, representing a theoretical/quantitative method usable by network operators to design control instrumentation.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129281589","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 adaptive genetic algorithm for channel sharing in high speed networks","authors":"M. Markaki, I. Kassotakis, A. Vasilakos","doi":"10.1109/GLOCOM.1998.776468","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776468","url":null,"abstract":"The evolving broadband integrated services digital network (B-ISDN) is reinforcing the demand for high-speed and high-performance fiber optic local and metropolitan area networks (LANs and MANs). The number of channels available to support the isochronous traffic in high-speed LANs/MANs is limited by technology, in order to minimize the implementation costs. We provide a method using channel sharing/reusing to provide efficient management of isochronous traffic under this limitation. The proposed method is based on a hybrid genetic algorithm called hybrid genetic reuse algorithm (HGRA) and aims to accomplish the establishment of a maximal number of connections with the minimal number of isochronous channels. Simulation results are provided and they are compared with those of a graph coloring algorithm, named ICRA. The results show that the proposed method exhibits better performance than ICRA in almost all simulation runs and shows the robustness, flexibility, efficiency of using evolutionary approaches to complex real-world problems.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123825580","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":"A novel threshold technique for minimizing error propagation in MDFE read channel","authors":"G. Mathew, Yuan Xing Lee, V. Krachkovsky","doi":"10.1109/GLOCOM.1998.775827","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775827","url":null,"abstract":"MDFE (multi-level decision feedback equalization) is an excellent detector for magnetic recording channels using (1,k) codes. However, being a decision feedback based scheme, MDFE also suffers from the phenomenon of error propagation. In this paper, a novel threshold approach is proposed for detection and partial suppression of error propagation in MDFE. A theoretical analysis of this approach is presented to quantify the probability of false detection of error propagation. Computer simulations performed over different user densities show that the proposed technique reduces error propagation significantly. In particular, the decay rate of cumulative error burst-length distribution has been almost doubled by this approach.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123342651","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":"Refined approximations for design and optimization of wide-area, multi-service broadband networks","authors":"D. Mitra, J. Morrison, K. G. Ramakrishnan","doi":"10.1109/GLOCOM.1998.775803","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775803","url":null,"abstract":"The problems of route optimization, and the sizing of virtual paths and explicit routes in wide-area multi-service broadband networks are considered. The problems are formulated at the call-level in the framework of multi-rate, circuit-switched, loss networks, with effective bandwidth encapsulating cell and packet-level behavior. Various asymptotic results based on uniform asymptotic approximations (UAA) have previously been obtained to substantially reduce the complexity of the numerical calculations. This paper offers refinements (RUAA) to UAA to the loss probabilities and their sensitivities to the offered traffic for individual links. These results are used to obtain refined asymptotic approximations to the network's loss probabilities and implied costs. While the numerical accuracy is considerably enhanced, the computational complexity remains effectively unchanged. The network design tool TALISMAN has been extended to implement the refined approximations. Numerical examples illustrate the accuracy of the RUAA.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121100769","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":"Scalability and routing performance of label switching networks","authors":"P. Boustead, J. Chicharo, G. Anido","doi":"10.1109/GLOCOM.1998.776628","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776628","url":null,"abstract":"Scalability is one of the major concerns associated with current label switching proposals. The aim of label switching is to provide an economical solution to the provision of high speed Internet IP networks. Previous research effort has concentrated on the issue of VC usage and its minimization. While VC usage is an important aspect of scalability the issues of routing and delay performance are equally significant. This paper considers in detail the routing and delay performance of various schemes. It is shown that the performance of control driven approaches such as tag switching depends upon the level of IP route aggregation in the network. Results also indicate that at high levels of aggregation, destination based approaches suffer delay and delay variance penalties over source/destination approaches such as IP switching.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114340359","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":"Congestion control in DQDB/ATM interworking using PWM","authors":"R. de Silva, W. Dewar","doi":"10.1109/GLOCOM.1998.776648","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776648","url":null,"abstract":"Congestion control is an important issue in ATM networks and in ATM/LAN/WAN interworking. We introduce a new congestion control method to alleviate congestion in DQDB/ATM interworking. If congestion occurs in the ATM network and the throughput of the source gateway is reduced accordingly, the buffer level in the gateway tends to rise. To prevent this, we propose a congestion control scheme based on the pulse width modulation (PWM) technique which operates between DQDB stations and the gateway. It has been shown by simulations on a simple network model that the proposed method results in smaller buffer sizes and gives better throughput.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114845403","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}