The paper deals with adaptive blind equalization for the transmission of digital modulated signals on an unknown dispersive channel with additive white gaussian noise. The observed signal being modeled as a hidden Markov model(HMM), the expectation-maximization (EM) algorithm can be used to realize both the channel identification and the estimation of the emitted symbols. The paper proposes a new on-line algorithm with reduced complexity. This algorithm, obtained as an approximate solution of the maximum likelihood (ML) problem via the EM sequential algorithm, has strong connections with decision feedback equalizers (DFE) using the recursive least square (RLS) Algorithm.
{"title":"Reduced computation blind equalization for FIR channel input Markov models","authors":"L. White, S. Perreau, Pierre Duhamel","doi":"10.1109/ICC.1995.524250","DOIUrl":"https://doi.org/10.1109/ICC.1995.524250","url":null,"abstract":"The paper deals with adaptive blind equalization for the transmission of digital modulated signals on an unknown dispersive channel with additive white gaussian noise. The observed signal being modeled as a hidden Markov model(HMM), the expectation-maximization (EM) algorithm can be used to realize both the channel identification and the estimation of the emitted symbols. The paper proposes a new on-line algorithm with reduced complexity. This algorithm, obtained as an approximate solution of the maximum likelihood (ML) problem via the EM sequential algorithm, has strong connections with decision feedback equalizers (DFE) using the recursive least square (RLS) Algorithm.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"4 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":"122958334","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}
Kyung Su Park, T. Kim, D. Cho, Hun Lee, Chang-Soo Sone
A CDMA cellular land network (CCLN) consists of base stations connected to a selector bank subsystem. In the case of considering only the voice traffic, CCLN can be designed based on E1/T1 physical line and HDLC protocol with fixed or variable length. However, it is necessary to support not only voice but also data traffic in the CDMA cellular system. Thus, it is necessary to use physical lines efficiently to increase bandwidth efficiency and transmission speed. However, the conventional CCLN has some problems in that the bandwidth is wasted because each BTS has its own private line. In this paper, a method using DQDB MAN as a CDMA interconnect subsystem (CIS) is considered, and the performances of the conventional and proposed method are analyzed by computer simulation. According to the simulation results, if the traffic from all mobile stations is uniformly distributed among all BTS's, the performances of both the conventional and proposed methodologies turn out to be almost equal. However, the performance of the methodology using the DQDB MAN is much better than that of the conventional method, in the case that the traffic from all mobile stations is nonuniformly distributed.
{"title":"A study on the effective interconnection method between base stations and selector bank subsystem in CDMA cellular networks","authors":"Kyung Su Park, T. Kim, D. Cho, Hun Lee, Chang-Soo Sone","doi":"10.1109/ICC.1995.524268","DOIUrl":"https://doi.org/10.1109/ICC.1995.524268","url":null,"abstract":"A CDMA cellular land network (CCLN) consists of base stations connected to a selector bank subsystem. In the case of considering only the voice traffic, CCLN can be designed based on E1/T1 physical line and HDLC protocol with fixed or variable length. However, it is necessary to support not only voice but also data traffic in the CDMA cellular system. Thus, it is necessary to use physical lines efficiently to increase bandwidth efficiency and transmission speed. However, the conventional CCLN has some problems in that the bandwidth is wasted because each BTS has its own private line. In this paper, a method using DQDB MAN as a CDMA interconnect subsystem (CIS) is considered, and the performances of the conventional and proposed method are analyzed by computer simulation. According to the simulation results, if the traffic from all mobile stations is uniformly distributed among all BTS's, the performances of both the conventional and proposed methodologies turn out to be almost equal. However, the performance of the methodology using the DQDB MAN is much better than that of the conventional method, in the case that the traffic from all mobile stations is nonuniformly distributed.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":" 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114051231","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}
Effects of the data transition variation on the performance of the digital data transition tracking loop (DTTL) symbol synchronizer are addressed for symbol SNRs and window sizes of interest. The data transition variation will affect the DTTL performance by introducing an additional timing jitter which results in additional receiver loss. Numerical and simulation results for both tracking and acquisition are presented.
{"title":"Effects of symbol transition density on the performance of the data transition tracking loop at low signal-to-noise ratios","authors":"S. Million, S. Hinedi","doi":"10.1109/ICC.1995.524258","DOIUrl":"https://doi.org/10.1109/ICC.1995.524258","url":null,"abstract":"Effects of the data transition variation on the performance of the digital data transition tracking loop (DTTL) symbol synchronizer are addressed for symbol SNRs and window sizes of interest. The data transition variation will affect the DTTL performance by introducing an additional timing jitter which results in additional receiver loss. Numerical and simulation results for both tracking and acquisition are presented.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"41 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":"121873460","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}
A new approach for the architecture of an all digital wideband modem is presented. The key feature of this approach is a lower processing rate than the Nyquist rate (the input sampling rate) and even the symbol rate. Due to the freedom in choosing the processing rate, the designer is able to arbitrarily select and use digital components, independent of the speed of the integrated circuit technology. This architecture is particularly suited for high data rates with applications to giga-bit/second satellite channels, multiple access, optical links and interactive cable-TV.
{"title":"Wideband modem design based on multirate filter banks","authors":"R. Sadr, Dan Raphaeli, S. Hinedi","doi":"10.1109/ICC.1995.524230","DOIUrl":"https://doi.org/10.1109/ICC.1995.524230","url":null,"abstract":"A new approach for the architecture of an all digital wideband modem is presented. The key feature of this approach is a lower processing rate than the Nyquist rate (the input sampling rate) and even the symbol rate. Due to the freedom in choosing the processing rate, the designer is able to arbitrarily select and use digital components, independent of the speed of the integrated circuit technology. This architecture is particularly suited for high data rates with applications to giga-bit/second satellite channels, multiple access, optical links and interactive cable-TV.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"29 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":"129543330","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 virtual connection queue (VCQ) ATM switch is based on the definition of the versatile traffic descriptor (VTD) [Vishnu and Mark 1994]. Its per-VC architecture enables a per-VC flow control to provide per-VS QoS guarantees. A connectionist implementation of a system is comprised of a large number of simple processing elements interconnected to form a cooperative parallelism, and is suited for very high, speed systems. The authors propose a connectionist implementation of the VCQ ATM switch which avoids the use of any central controller such as the virtual connection unit (VGU) [Vishnu and Mark 1995]. That is, the proposed implementation performs all the functions of the VCQ ATM switch, namely, cell buffering, service scheduling, VTD reaction program execution and VC statistics collection, in, a distributed fashion. Moreover, it offers a substantial increase in the hardware utilization.
虚拟连接队列(VCQ) ATM交换机是基于多功能流量描述符(VTD)的定义[Vishnu and Mark 1994]。它的逐vc架构使逐vc流控制能够提供逐vs的QoS保证。系统的连接实现由大量相互连接的简单处理元素组成,以形成协作并行性,适合于非常高速的系统。作者提出了一种VCQ ATM交换机的连接实现,避免使用任何中央控制器,如虚拟连接单元(VGU) [Vishnu和Mark 1995]。也就是说,本文提出的实现以分布式的方式完成了VCQ ATM交换机的所有功能,即小区缓冲、服务调度、VTD反应程序执行和VC统计信息收集。此外,它还大大提高了硬件利用率。
{"title":"A connectionist implementation of the VCQ ATM switch","authors":"M. Vishnu, J. Mark","doi":"10.1109/ICC.1995.524274","DOIUrl":"https://doi.org/10.1109/ICC.1995.524274","url":null,"abstract":"The virtual connection queue (VCQ) ATM switch is based on the definition of the versatile traffic descriptor (VTD) [Vishnu and Mark 1994]. Its per-VC architecture enables a per-VC flow control to provide per-VS QoS guarantees. A connectionist implementation of a system is comprised of a large number of simple processing elements interconnected to form a cooperative parallelism, and is suited for very high, speed systems. The authors propose a connectionist implementation of the VCQ ATM switch which avoids the use of any central controller such as the virtual connection unit (VGU) [Vishnu and Mark 1995]. That is, the proposed implementation performs all the functions of the VCQ ATM switch, namely, cell buffering, service scheduling, VTD reaction program execution and VC statistics collection, in, a distributed fashion. Moreover, it offers a substantial increase in the hardware utilization.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"17 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":"129676590","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 waveform shaped multicarrier modulation (MCM) is considered for high capacity data transmission in digital microwave radios. The degradations of the MCM system performance caused by the multipath fading of the line-of-sight (LOS) radio channel are investigated. A 512-carrier system with a data rate of 155 Mb/s is described and simulated. The signal-to-interference ratio and the signature curve of the MCM system are evaluated by using Rummler's (1979) channel model. Simulations show the robustness of the system in the multipath fading channel. The simulated results for adaptive channel estimation are also given.
{"title":"Waveform shaped MCM for digital microwave radio","authors":"Renyuan Li, G. Stette","doi":"10.1109/ICC.1995.524489","DOIUrl":"https://doi.org/10.1109/ICC.1995.524489","url":null,"abstract":"The waveform shaped multicarrier modulation (MCM) is considered for high capacity data transmission in digital microwave radios. The degradations of the MCM system performance caused by the multipath fading of the line-of-sight (LOS) radio channel are investigated. A 512-carrier system with a data rate of 155 Mb/s is described and simulated. The signal-to-interference ratio and the signature curve of the MCM system are evaluated by using Rummler's (1979) channel model. Simulations show the robustness of the system in the multipath fading channel. The simulated results for adaptive channel estimation are also given.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"9 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":"124038598","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}
To evaluate analytically the performance of a discrete time single server queue where the input process has a general marginal distribution, its index of dispersion for counts (IDC) may be infinite, and where the tail of the unfinished work distribution is not necessarily dominant, we use the following two principles. Firstly, we use the observation that only a finite duration of time is required for consideration of the effect of correlation on queueing performance. Secondly, by a certain transformation, queueing performance results for a queue with correlated input having arbitrary marginal distribution can be evaluated using that of its noncorrelated counterpart. We confirm the results by simulation using real traffic measurements from a high speed data network.
{"title":"Performance of a single server queue with self similar input","authors":"R. Addie, M. Zukerman, T. Neame","doi":"10.1109/ICC.1995.525212","DOIUrl":"https://doi.org/10.1109/ICC.1995.525212","url":null,"abstract":"To evaluate analytically the performance of a discrete time single server queue where the input process has a general marginal distribution, its index of dispersion for counts (IDC) may be infinite, and where the tail of the unfinished work distribution is not necessarily dominant, we use the following two principles. Firstly, we use the observation that only a finite duration of time is required for consideration of the effect of correlation on queueing performance. Secondly, by a certain transformation, queueing performance results for a queue with correlated input having arbitrary marginal distribution can be evaluated using that of its noncorrelated counterpart. We confirm the results by simulation using real traffic measurements from a high speed data network.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"3 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":"124194535","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}
In a wireless packet (ATM) network that supports an integrated mix of multimedia traffic, the channel access protocol needs to be designed such that mobiles share the limited communications bandwidth in an efficient manner: maximizing the utilization of the frequency spectrum and minimizing the delay experienced by mobiles. In this paper, we propose and study an efficient demand assignment channel access protocol, which we call distributed-queueing request update multiple access (DQRUMA). The protocol can be used for a wide range of applications and geographic distances. Mobiles need to send requests to the base station only for packets that arrive to an empty buffer. For packets that arrive to a non-empty buffer transmission requests are placed collision-free by piggybacking the requests with packet transmissions. The simulation results show that even with the "worst possible" traffic characteristics, the delay-throughput performance of DQRUMA is close to the best possible with any access protocol. In addition, explicit slot-by-slot announcement of the "transmit permissions" gives the base station a lot of control over the order in which mobiles transmit their packets.
{"title":"Distributed-queueing request update multiple access (DQRUMA) for wireless packet (ATM) networks","authors":"M. Karol, Zhao Liu, K. Eng","doi":"10.1109/ICC.1995.524295","DOIUrl":"https://doi.org/10.1109/ICC.1995.524295","url":null,"abstract":"In a wireless packet (ATM) network that supports an integrated mix of multimedia traffic, the channel access protocol needs to be designed such that mobiles share the limited communications bandwidth in an efficient manner: maximizing the utilization of the frequency spectrum and minimizing the delay experienced by mobiles. In this paper, we propose and study an efficient demand assignment channel access protocol, which we call distributed-queueing request update multiple access (DQRUMA). The protocol can be used for a wide range of applications and geographic distances. Mobiles need to send requests to the base station only for packets that arrive to an empty buffer. For packets that arrive to a non-empty buffer transmission requests are placed collision-free by piggybacking the requests with packet transmissions. The simulation results show that even with the \"worst possible\" traffic characteristics, the delay-throughput performance of DQRUMA is close to the best possible with any access protocol. In addition, explicit slot-by-slot announcement of the \"transmit permissions\" gives the base station a lot of control over the order in which mobiles transmit their packets.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"37 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":"123719269","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}
In order to offer multimedia services to the user, a powerful signaling system for broadband networks is required. Our work aims at an overall signaling architecture with totally independent call and connection control. This paper focuses on MCMP (multicast connection management protocol), a connection control solution that can be used in this context. MCMP offers a uniform interface to the terminals and network nodes. Its distinction between signaling and transport entities allows the mapping to different broadband technologies. Multicast connections can be controlled dynamically. This includes the change of topology and QoS parameters of the connections during their lifetime. Multicast routing is done by a distributed shortest path tree based solution, which has several advantages over Steiner tree routing.
{"title":"Flexible connection control for multimedia broadband networks","authors":"Harald Müller","doi":"10.1109/ICC.1995.524221","DOIUrl":"https://doi.org/10.1109/ICC.1995.524221","url":null,"abstract":"In order to offer multimedia services to the user, a powerful signaling system for broadband networks is required. Our work aims at an overall signaling architecture with totally independent call and connection control. This paper focuses on MCMP (multicast connection management protocol), a connection control solution that can be used in this context. MCMP offers a uniform interface to the terminals and network nodes. Its distinction between signaling and transport entities allows the mapping to different broadband technologies. Multicast connections can be controlled dynamically. This includes the change of topology and QoS parameters of the connections during their lifetime. Multicast routing is done by a distributed shortest path tree based solution, which has several advantages over Steiner tree routing.","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":"114339303","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}
M. Orimo, T. Morita, T. Ebata, H. Aoe, Y. Fujino, K. Wakayama
Recently several kinds of intelligent telecommunication services such as a free phone, a virtual private network have been provided. The number of these intelligent services will increase and various types of service will be provided on the future telecommunication network. Under this situation, more refined and detailed service management is required. This means that a GW (gateway) system which realizes flexible circulation of information between NEs(network elements) and OpSs(operation systems), and among OpSs is necessary. In this paper, we propose a model and a platform for the GW system based on the autonomous decentralized system concept in order to attain the above requirement. The proposed model and platform also attain fault tolerance and on-line maintainability of the application software installed in the GW system.
{"title":"Autonomous decentralized system supporting for fault-tolerance and on-line maintenance of communication software","authors":"M. Orimo, T. Morita, T. Ebata, H. Aoe, Y. Fujino, K. Wakayama","doi":"10.1109/ICC.1995.524459","DOIUrl":"https://doi.org/10.1109/ICC.1995.524459","url":null,"abstract":"Recently several kinds of intelligent telecommunication services such as a free phone, a virtual private network have been provided. The number of these intelligent services will increase and various types of service will be provided on the future telecommunication network. Under this situation, more refined and detailed service management is required. This means that a GW (gateway) system which realizes flexible circulation of information between NEs(network elements) and OpSs(operation systems), and among OpSs is necessary. In this paper, we propose a model and a platform for the GW system based on the autonomous decentralized system concept in order to attain the above requirement. The proposed model and platform also attain fault tolerance and on-line maintainability of the application software installed in the GW system.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"84 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":"114354124","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}