Y. Nodera, M. Ohashi, S. Sakai, T. Suzuki, A. Yamaguchi, T. Mizuno
This paper addresses roaming technique between GSM and PDC cellular systems using the different signaling protocols. Many countries have already employed GSM specifications in their PLMNs and these systems inter-work effectively. In PDC, a similar concept of card services will be introduced in the future. The protocols for this services use a PDC (personal digital cellular) card and guarantee PM (personal mobility) and TM (terminal mobility). We introduce the service images come up with through roaming between different cellular standards and propose a system configuration that realizes relevant services. We propose a detailed system configuration which supports roaming feature provision. Then we propose an authentication technique to realize these services.
本文讨论了GSM和PDC蜂窝系统之间使用不同信令协议的漫游技术。许多国家已经在其plmn中采用了GSM规范，这些系统可以有效地相互协作。在PDC中，将来会引入类似的卡服务的概念。该业务协议采用PDC (personal digital cellular)卡，实现PM (personal mobility)和TM (terminal mobility)的保障。介绍了不同蜂窝标准间漫游产生的业务映像，并提出了实现相关业务的系统配置。我们提出了一个详细的系统配置，支持漫游功能的提供。然后，我们提出了一种身份验证技术来实现这些服务。
{"title":"Interworking between GSM and PDC through IC cards","authors":"Y. Nodera, M. Ohashi, S. Sakai, T. Suzuki, A. Yamaguchi, T. Mizuno","doi":"10.1109/ICC.1995.524206","DOIUrl":"https://doi.org/10.1109/ICC.1995.524206","url":null,"abstract":"This paper addresses roaming technique between GSM and PDC cellular systems using the different signaling protocols. Many countries have already employed GSM specifications in their PLMNs and these systems inter-work effectively. In PDC, a similar concept of card services will be introduced in the future. The protocols for this services use a PDC (personal digital cellular) card and guarantee PM (personal mobility) and TM (terminal mobility). We introduce the service images come up with through roaming between different cellular standards and propose a system configuration that realizes relevant services. We propose a detailed system configuration which supports roaming feature provision. Then we propose an authentication technique to realize these services.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124459206","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}
L. Cipriani, S. Gregori, P. Hellemans, P. McDonald
The paper gives a general description of a software simulator designed to study the impact, in terms of protocol signalling, that multimedia services will have on B-ISDN. Object oriented techniques have been adopted to build both the simulator and the protocols to be tested. The protocols developed are able to cater for the multiparty, multimedia, multiservice aspects of the B-ISDN at the user access to the network (UNI-user network interface), and at the internal network interfaces (NNI-network node interface). As the simulator implements a representation of physical network entities, such as bearer channels and combiners/converters the actions of the protocols can be visualized and tested. The simulator can also undertake performance measurements on the operation of the protocols. The work presented in this paper is based on the results of the RACE MAGIC project.
{"title":"An object oriented implementation of a software simulator for B-ISDN signalling protocols","authors":"L. Cipriani, S. Gregori, P. Hellemans, P. McDonald","doi":"10.1109/ICC.1995.525147","DOIUrl":"https://doi.org/10.1109/ICC.1995.525147","url":null,"abstract":"The paper gives a general description of a software simulator designed to study the impact, in terms of protocol signalling, that multimedia services will have on B-ISDN. Object oriented techniques have been adopted to build both the simulator and the protocols to be tested. The protocols developed are able to cater for the multiparty, multimedia, multiservice aspects of the B-ISDN at the user access to the network (UNI-user network interface), and at the internal network interfaces (NNI-network node interface). As the simulator implements a representation of physical network entities, such as bearer channels and combiners/converters the actions of the protocols can be visualized and tested. The simulator can also undertake performance measurements on the operation of the protocols. The work presented in this paper is based on the results of the RACE MAGIC project.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116758921","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}
We analyze the performance improvement of the SFH-CDMA/FSK signal with truncated type-II hybrid ARQ and MRC diversity techniques in mobile communication channel which is characterized by AWGN, MUI (multiuser interference), and Nakagami fading. Using the derived equations, the error probability and the throughput are evaluated and shown in figures. The most important results that we have obtained are that the truncated type-II hybrid ARQ scheme provides more efficient improvement over an FEC (forward error correction) scheme and the amount of improvement is increased when it is combined with MRC diversity technique. Therefore, it is proper for mobile and radio data communication systems that require high reliability and delay-limited applications.
{"title":"Performance improvement of SFH-CDMA/FSK signal with truncated type-II hybrid ARQ and MRC diversity techniques in mobile communication channels","authors":"Chang Heon Oh, E. Kim, Sung-Joon Cho","doi":"10.1109/ICC.1995.524493","DOIUrl":"https://doi.org/10.1109/ICC.1995.524493","url":null,"abstract":"We analyze the performance improvement of the SFH-CDMA/FSK signal with truncated type-II hybrid ARQ and MRC diversity techniques in mobile communication channel which is characterized by AWGN, MUI (multiuser interference), and Nakagami fading. Using the derived equations, the error probability and the throughput are evaluated and shown in figures. The most important results that we have obtained are that the truncated type-II hybrid ARQ scheme provides more efficient improvement over an FEC (forward error correction) scheme and the amount of improvement is increased when it is combined with MRC diversity technique. Therefore, it is proper for mobile and radio data communication systems that require high reliability and delay-limited applications.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121102766","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}
The paper presents ring trellis coded CPFSK in which the encoder has the same algebraic structure as the memory part of the CPM modulator. For M-ary CPFSK with a modulation index h=1/M, the authors show that this approach leads to a natural combination of the convolutional encoder with the memory part of the modulator. After a general presentation of trellis coding over the ring of integers of CPFSK, they examine quaternary and octonary modulations and compare them to previously proposed schemes. The results demonstrate the superiority of ring trellis coded CPFSK over conventional convolutionally encoded CPFSK.
本文提出了环形网格编码CPFSK，其中编码器与CPM调制器的存储部分具有相同的代数结构。对于调制指数h=1/M的M- mary CPFSK，作者证明了这种方法可以使卷积编码器与调制器的存储部分自然结合。在CPFSK整数环上的栅格编码的一般介绍之后，他们检查了四进制和八进制调制，并将它们与以前提出的方案进行了比较。结果表明，环形网格编码的CPFSK优于传统卷积编码的CPFSK。
{"title":"Trellis coded CPFSK over rings","authors":"G. Karam, Kevin Gosse, K. Maalej","doi":"10.1109/ICC.1995.524189","DOIUrl":"https://doi.org/10.1109/ICC.1995.524189","url":null,"abstract":"The paper presents ring trellis coded CPFSK in which the encoder has the same algebraic structure as the memory part of the CPM modulator. For M-ary CPFSK with a modulation index h=1/M, the authors show that this approach leads to a natural combination of the convolutional encoder with the memory part of the modulator. After a general presentation of trellis coding over the ring of integers of CPFSK, they examine quaternary and octonary modulations and compare them to previously proposed schemes. The results demonstrate the superiority of ring trellis coded CPFSK over conventional convolutionally encoded CPFSK.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121276994","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}
The channel model for indoor wireless optical communication links is unusual in that it combines the intensity-modulation constraints of the Poisson photon-counting channel with the multipath dispersion, bandwidth constraints, and additive white Gaussian noise of the conventional radio channel. In this paper we examine the performance of several modulation schemes on the indoor wireless optical channel. Modulation schemes having low duty cycle, such as pulse-position modulation (PPM), offer improved power efficiency at the expense of decreased bandwidth efficiency. We compare the power and bandwidth efficiency of several forms of PPM, including multiple PPM, overlapping PPM, convolutional coded PPM, and trellis coded OPPM. We also examine the differences between the wireless infrared communications channel and the quantum-limited photon-counting channel.
{"title":"Modulation analysis for wireless infrared communications","authors":"Hyuncheol Park, J. Barry","doi":"10.1109/ICC.1995.524287","DOIUrl":"https://doi.org/10.1109/ICC.1995.524287","url":null,"abstract":"The channel model for indoor wireless optical communication links is unusual in that it combines the intensity-modulation constraints of the Poisson photon-counting channel with the multipath dispersion, bandwidth constraints, and additive white Gaussian noise of the conventional radio channel. In this paper we examine the performance of several modulation schemes on the indoor wireless optical channel. Modulation schemes having low duty cycle, such as pulse-position modulation (PPM), offer improved power efficiency at the expense of decreased bandwidth efficiency. We compare the power and bandwidth efficiency of several forms of PPM, including multiple PPM, overlapping PPM, convolutional coded PPM, and trellis coded OPPM. We also examine the differences between the wireless infrared communications channel and the quantum-limited photon-counting channel.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127203809","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}
For mobile wireless ATM networks, error control beyond that provided by the current ATM standards is required to realize reliable communication in this high noise environment. In the proposed scheme the ATM cell header is protected by a relatively powerful FEC code to ensure correct delivery and low cell loss rate. The ATM cell payload is encoded for varying degrees of error protection depending on the type of data contained in the payload. By applying multiple shortened codes to the data field, the same hardware performs the encoding/decoding functions for the different code rates. Analysis shows that significant reductions in cell loss rate (relative to an uncoded system) and varying degrees of payload error protection are realized with a minimal increase in required bandwidth.
{"title":"Variable rate error control for wireless ATM networks","authors":"D. Moore, M. Rice","doi":"10.1109/ICC.1995.524249","DOIUrl":"https://doi.org/10.1109/ICC.1995.524249","url":null,"abstract":"For mobile wireless ATM networks, error control beyond that provided by the current ATM standards is required to realize reliable communication in this high noise environment. In the proposed scheme the ATM cell header is protected by a relatively powerful FEC code to ensure correct delivery and low cell loss rate. The ATM cell payload is encoded for varying degrees of error protection depending on the type of data contained in the payload. By applying multiple shortened codes to the data field, the same hardware performs the encoding/decoding functions for the different code rates. Analysis shows that significant reductions in cell loss rate (relative to an uncoded system) and varying degrees of payload error protection are realized with a minimal increase in required bandwidth.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125836870","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}
It is well known that ATM switches with a shared input queue perform better than switches with separated input queueing. Nevertheless, most existing ATM switches have certain forms of separated input queueing. We study a class of dynamic priority schemes which can facilitate buffer sharing and delay guarantee for input queueing switches, and can guarantee the switching delay. Buffer sharing is achieved by the queueing control priority discipline (QCPD), which assigns a higher priority to an input queue which has more queued packets. Delay guarantee is achieved by the blocking control priority discipline (BCPD), which assigns the highest priority to a HOL cell which has been blocked for more than a certain number of times. We show that a combination of the two, the hybrid control priority discipline (HCPD), can achieve both benefits.
{"title":"Dynamic priority schemes for fast packet switches","authors":"P. Wong, M. S. Yeung","doi":"10.1109/ICC.1995.525226","DOIUrl":"https://doi.org/10.1109/ICC.1995.525226","url":null,"abstract":"It is well known that ATM switches with a shared input queue perform better than switches with separated input queueing. Nevertheless, most existing ATM switches have certain forms of separated input queueing. We study a class of dynamic priority schemes which can facilitate buffer sharing and delay guarantee for input queueing switches, and can guarantee the switching delay. Buffer sharing is achieved by the queueing control priority discipline (QCPD), which assigns a higher priority to an input queue which has more queued packets. Delay guarantee is achieved by the blocking control priority discipline (BCPD), which assigns the highest priority to a HOL cell which has been blocked for more than a certain number of times. We show that a combination of the two, the hybrid control priority discipline (HCPD), can achieve both benefits.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115082477","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}
Code division multiple access (CDMA) spread spectrum systems that employ RAKE receivers for data detection require an estimate of the channel impulse response to be made prior to extracting the data. In a rapidly fading environment, such as that experienced by mobile cellular systems, the application of a prediction algorithm to the problem of estimating the channel impulse response can improve the system performance over a non-predictive one. The paper describes the application of the least squares (LS) prediction algorithm to a RAKE receiver system, and present results obtained through Monte-Carlo simulation. The LS algorithm is computed using a computationally efficient sliding FFT based approach based on radix 4 butterflies. A novel prediction feedback method, called conditional decision feedback, for reducing the effect of decision feedback errors is presented. A typical urban environment was selected to evaluate the system performance, the COST 207 channel model for this environment being used to drive the simulation system.
{"title":"The application of a generalised sliding FFT algorithm to prediction for a RAKE receiver system operating over mobile channels","authors":"D. Laurenson, G.J.R. Povey","doi":"10.1109/ICC.1995.524513","DOIUrl":"https://doi.org/10.1109/ICC.1995.524513","url":null,"abstract":"Code division multiple access (CDMA) spread spectrum systems that employ RAKE receivers for data detection require an estimate of the channel impulse response to be made prior to extracting the data. In a rapidly fading environment, such as that experienced by mobile cellular systems, the application of a prediction algorithm to the problem of estimating the channel impulse response can improve the system performance over a non-predictive one. The paper describes the application of the least squares (LS) prediction algorithm to a RAKE receiver system, and present results obtained through Monte-Carlo simulation. The LS algorithm is computed using a computationally efficient sliding FFT based approach based on radix 4 butterflies. A novel prediction feedback method, called conditional decision feedback, for reducing the effect of decision feedback errors is presented. A typical urban environment was selected to evaluate the system performance, the COST 207 channel model for this environment being used to drive the simulation system.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115101220","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}
The asymmetric digital subscriber line (ADSL) draft standard was finalized as a standard by the ANSI in 1995, and commercial products are now available. As specified in this standard, ADSL technology will provide over a single twisted-pair loop a number of simplex channels (up to 6 Mb/s total capacity) from the central office to a subscriber and a number of duplex channels (up to 640 kb/s total capacity) while leaving the POTS service unaffected. Although the intention of the downstream data rates prescribed in the standard are to provide compressed video services, we believe a compelling case may also be made for data services over ADSL. This paper provides an overview of the ADSL standard, discusses video provisioning issues and how ADSL may compare to hybrid fiber-coax in this regard, and introduces a number of concepts for offering new data services using ADSL and existing LAN and WAN technology.
{"title":"ADSL for video and data services","authors":"D. Veeneman, R. Olshansky","doi":"10.1109/ICC.1995.524220","DOIUrl":"https://doi.org/10.1109/ICC.1995.524220","url":null,"abstract":"The asymmetric digital subscriber line (ADSL) draft standard was finalized as a standard by the ANSI in 1995, and commercial products are now available. As specified in this standard, ADSL technology will provide over a single twisted-pair loop a number of simplex channels (up to 6 Mb/s total capacity) from the central office to a subscriber and a number of duplex channels (up to 640 kb/s total capacity) while leaving the POTS service unaffected. Although the intention of the downstream data rates prescribed in the standard are to provide compressed video services, we believe a compelling case may also be made for data services over ADSL. This paper provides an overview of the ADSL standard, discusses video provisioning issues and how ADSL may compare to hybrid fiber-coax in this regard, and introduces a number of concepts for offering new data services using ADSL and existing LAN and WAN technology.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122764475","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}
We study the performance of a loss priority mechanism for MPEG-coded video traffic. This mechanism, known as partial buffer sharing (PBS), is implemented at an ATM multiplexer. The input to the multiplexer consists of several MPEG streams which are derived from the frame-size trace of a full-motion movie. Each stream contains three types of frames: I, P, and B. The significance of the information carried in MPEG frames differs according to the frame type; with I frames being more important than P and B frames. Hence, PBS with two priority classes is used to reduce the cell loss rate for I frames at the expense of higher loss rates for P and B frames. It is observed that the cell loss rates for the two priority classes are greatly influenced by the level of synchronization among the video streams.
{"title":"A performance study of loss priorities for MPEG video traffic","authors":"M. Krunz, H. Hughes","doi":"10.1109/ICC.1995.524501","DOIUrl":"https://doi.org/10.1109/ICC.1995.524501","url":null,"abstract":"We study the performance of a loss priority mechanism for MPEG-coded video traffic. This mechanism, known as partial buffer sharing (PBS), is implemented at an ATM multiplexer. The input to the multiplexer consists of several MPEG streams which are derived from the frame-size trace of a full-motion movie. Each stream contains three types of frames: I, P, and B. The significance of the information carried in MPEG frames differs according to the frame type; with I frames being more important than P and B frames. Hence, PBS with two priority classes is used to reduce the cell loss rate for I frames at the expense of higher loss rates for P and B frames. It is observed that the cell loss rates for the two priority classes are greatly influenced by the level of synchronization among the video streams.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122465692","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：