The authors present a new scheme that extends the correlation based fast training of echo cancellers introduced by Long and Ling (1990) to allow for ultra-high-speed initialization of a full-duplex data transmission system over two-wire lines. A fast training procedure is derived to coestimate the near echo and the far echo with bulk delay, and the channel responses. The effects of the noise and symbol rates' offset between two ends are examined in terms of both mean square error and SNR. Both the theoretical analysis and computer simulations show that there are three degrading factors due to symbol rates' offset. The new algorithm delivers fst convergence speed with the same computational requirements as those of stochastic-gradient algorithms and reduces the tap-setting time to half of that required by the traditional half-duplex fast training scheme.<>
{"title":"A full-duplex fast training algorithm for simultaneously estimating echo and channel response","authors":"Xixian Chen, M. Suzuki, N. Miki, N. Nagai","doi":"10.1109/ICC.1992.267991","DOIUrl":"https://doi.org/10.1109/ICC.1992.267991","url":null,"abstract":"The authors present a new scheme that extends the correlation based fast training of echo cancellers introduced by Long and Ling (1990) to allow for ultra-high-speed initialization of a full-duplex data transmission system over two-wire lines. A fast training procedure is derived to coestimate the near echo and the far echo with bulk delay, and the channel responses. The effects of the noise and symbol rates' offset between two ends are examined in terms of both mean square error and SNR. Both the theoretical analysis and computer simulations show that there are three degrading factors due to symbol rates' offset. The new algorithm delivers fst convergence speed with the same computational requirements as those of stochastic-gradient algorithms and reduces the tap-setting time to half of that required by the traditional half-duplex fast training scheme.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131333263","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. Hastings, T. Macgregor, L. Steffes, R. Thompson
Six cost-effective and productivity-enhancing ISDN applications for use in office environments are presented. The applications include ISDN multipoint, ISDN host interface for terminal sessions, ISDN telephone call control via data terminal, video conferencing, and ISDN service direct to employees' homes. It is shown that ISDN provides foundations for the applications described. Several applications use off-the-shelf customer premises equipment; others use prototype equipment. Each application addresses a specific communications need.<>
{"title":"ISDN Centrex applications in a large multinational company","authors":"A. Hastings, T. Macgregor, L. Steffes, R. Thompson","doi":"10.1109/ICC.1992.267973","DOIUrl":"https://doi.org/10.1109/ICC.1992.267973","url":null,"abstract":"Six cost-effective and productivity-enhancing ISDN applications for use in office environments are presented. The applications include ISDN multipoint, ISDN host interface for terminal sessions, ISDN telephone call control via data terminal, video conferencing, and ISDN service direct to employees' homes. It is shown that ISDN provides foundations for the applications described. Several applications use off-the-shelf customer premises equipment; others use prototype equipment. Each application addresses a specific communications need.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129840036","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 authors describe a distributed architecture based upon IEEE 802.6 metropolitan area networks (MANs) that will provide interconnection over a metropolitan area for wireless personal communications. An appropriate bridge routing strategy is suggested to interconnect the several MANs needed to cover an urban metropolitan area. A novel isochronous transport mechanism is proposed to facilitate speech silence suppression over the MAN. While a queue-arbitrated connectionless service is used for signaling over MANs to enable call setup and handoff, voice circuits are provided by means of the pre-arbitrated isochronous service. Connection issues within a metropolitan area relevant to call setup and handoff are examined. To facilitate capacity savings between voice talk spurts on the MAN, a technique is described which enables the isochronous service to accommodate data rate variations.<>
{"title":"A personal communication network architecture using the IEEE 802.6 MAN","authors":"A. D. Malyan, R. Donaldson, V. Leung","doi":"10.1109/ICC.1992.268041","DOIUrl":"https://doi.org/10.1109/ICC.1992.268041","url":null,"abstract":"The authors describe a distributed architecture based upon IEEE 802.6 metropolitan area networks (MANs) that will provide interconnection over a metropolitan area for wireless personal communications. An appropriate bridge routing strategy is suggested to interconnect the several MANs needed to cover an urban metropolitan area. A novel isochronous transport mechanism is proposed to facilitate speech silence suppression over the MAN. While a queue-arbitrated connectionless service is used for signaling over MANs to enable call setup and handoff, voice circuits are provided by means of the pre-arbitrated isochronous service. Connection issues within a metropolitan area relevant to call setup and handoff are examined. To facilitate capacity savings between voice talk spurts on the MAN, a technique is described which enables the isochronous service to accommodate data rate variations.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"63 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129909799","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 loosely coupled parallel processor system, a number of concurrently executable processors communicate asynchronously via explicit messages over high-speed links. This architecture is similar to broadband ISDN networks and, thus, constitutes a realistic testbed for the modeling and distributed simulation. Every switching node of the communications network is modeled on a processor of the parallel processor and the traffic flow is represented by the communications protocols. Given that the models of the switching nodes are executed in parallel, the distributed simulation is expected to execute significantly faster than the traditional uniprocessor approach. This approach makes it possible to realistically model overloads in networks, study their impact on the network performance, and investigate new schemes to limit overloads from causing uncontrollable performance degradation. An implementation of the approach on the ARMSTRONG parallel processor at Brown University is described. Performance results, based on representative example B-ISDN networks, realistic traffic models, and network characteristics indicate that the distributed approach achieves significant speedup over the traditional approach. The utilization of the traffic capacities of the links is discussed.<>
{"title":"Modeling and distributed simulation of complex broadband ISDN networks under overload on loosely-coupled parallel processors","authors":"A. Bhimani, S. Ghosh","doi":"10.1109/ICC.1992.268034","DOIUrl":"https://doi.org/10.1109/ICC.1992.268034","url":null,"abstract":"In a loosely coupled parallel processor system, a number of concurrently executable processors communicate asynchronously via explicit messages over high-speed links. This architecture is similar to broadband ISDN networks and, thus, constitutes a realistic testbed for the modeling and distributed simulation. Every switching node of the communications network is modeled on a processor of the parallel processor and the traffic flow is represented by the communications protocols. Given that the models of the switching nodes are executed in parallel, the distributed simulation is expected to execute significantly faster than the traditional uniprocessor approach. This approach makes it possible to realistically model overloads in networks, study their impact on the network performance, and investigate new schemes to limit overloads from causing uncontrollable performance degradation. An implementation of the approach on the ARMSTRONG parallel processor at Brown University is described. Performance results, based on representative example B-ISDN networks, realistic traffic models, and network characteristics indicate that the distributed approach achieves significant speedup over the traditional approach. The utilization of the traffic capacities of the links is discussed.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128855419","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 objective of call admission control is to keep the network load moderate to achieve a performance objective associated with quality of services. In asynchronous transfer mode (ATM) networks, the cell loss rate is more sensitive to offered load than the queueing delay. Therefore, call admission control in ATM networks should be cell loss rate sensitive. The author proposes and evaluates a call admission control method which can be applied to the priority control case. The proposed method is suitable for real time operation even in a multimedia case, because the amount of calculation for call admission control is reduced considerably compared to conventional techniques and does not increase in the multimedia case. The method uses a probability density function for the number of cells transferred from multiplexed cells and uses recursive equations in estimating cell loss rate.<>
{"title":"Call admission control method in ATM networks","authors":"H. Esaki","doi":"10.1109/ICC.1992.268017","DOIUrl":"https://doi.org/10.1109/ICC.1992.268017","url":null,"abstract":"The objective of call admission control is to keep the network load moderate to achieve a performance objective associated with quality of services. In asynchronous transfer mode (ATM) networks, the cell loss rate is more sensitive to offered load than the queueing delay. Therefore, call admission control in ATM networks should be cell loss rate sensitive. The author proposes and evaluates a call admission control method which can be applied to the priority control case. The proposed method is suitable for real time operation even in a multimedia case, because the amount of calculation for call admission control is reduced considerably compared to conventional techniques and does not increase in the multimedia case. The method uses a probability density function for the number of cells transferred from multiplexed cells and uses recursive equations in estimating cell loss rate.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116002306","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}
C. Yen, R. Walker, W. McFarland, D. Cunningham, G. Kwan, T. Homak
HIPPI is an ANSI standard (X3.183-1991) for transmitting data in parallel between data processing equipment. To meet the need for transmitting HIPPI data serially on fiber or coaxial cable, serial-HIPPI was created. The authors describe the interface units required by serial-HIPPI, an extender for transmitting data serially between HIPPI nodes at 800 Mb/s or 1600 Mb/s.<>
{"title":"Serial extension for 800/1600 Mb/s computer interconnect","authors":"C. Yen, R. Walker, W. McFarland, D. Cunningham, G. Kwan, T. Homak","doi":"10.1109/ICC.1992.268066","DOIUrl":"https://doi.org/10.1109/ICC.1992.268066","url":null,"abstract":"HIPPI is an ANSI standard (X3.183-1991) for transmitting data in parallel between data processing equipment. To meet the need for transmitting HIPPI data serially on fiber or coaxial cable, serial-HIPPI was created. The authors describe the interface units required by serial-HIPPI, an extender for transmitting data serially between HIPPI nodes at 800 Mb/s or 1600 Mb/s.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122402250","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 virtual path (VP) is modeled as a tandem queuing network. The statistics of cell loss due to cell level congestion are studied. The focus is on a designated traffic stream as it passes through an asynchronous transfer mode (ATM) network along a VP. The performance of a VP with forward error recovery coding scheme and the design of suitable coding schemes utilizing cell loss statistics are discussed.<>
{"title":"Statistics of cell loss and its application for forward error recovery in ATM network","authors":"L. Zhang","doi":"10.1109/ICC.1992.268194","DOIUrl":"https://doi.org/10.1109/ICC.1992.268194","url":null,"abstract":"A virtual path (VP) is modeled as a tandem queuing network. The statistics of cell loss due to cell level congestion are studied. The focus is on a designated traffic stream as it passes through an asynchronous transfer mode (ATM) network along a VP. The performance of a VP with forward error recovery coding scheme and the design of suitable coding schemes utilizing cell loss statistics are discussed.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122439548","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}
Through examples, several techniques are explored for controlling intersymbol interference (ISI) in the linear/programming design of the finite impulse response (FIR)-filter portion of a hybrid FIR-filter/analog-filter pulse-shaping system. The most promising technique, the explicit limiting or minimization of peak ISI, obtained as the sum of absolute values of system-pulse samples, results in an unexpected result. A central set of individual system-pulse samples is effectively zeroed, and the rest seem unaffected by the optimization.<>
{"title":"Linear-programming techniques for the control of intersymbol interference with hybrid FIR/analog pulse shaping","authors":"J. O. Coleman, D. Lytle","doi":"10.1109/ICC.1992.268175","DOIUrl":"https://doi.org/10.1109/ICC.1992.268175","url":null,"abstract":"Through examples, several techniques are explored for controlling intersymbol interference (ISI) in the linear/programming design of the finite impulse response (FIR)-filter portion of a hybrid FIR-filter/analog-filter pulse-shaping system. The most promising technique, the explicit limiting or minimization of peak ISI, obtained as the sum of absolute values of system-pulse samples, results in an unexpected result. A central set of individual system-pulse samples is effectively zeroed, and the rest seem unaffected by the optimization.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122485967","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 authors study different strategies for decoding the concatenated inner code, applied in the case of multilevel coding with a multistage decoding procedure. The first strategy recapitulates the classical method of decoding the concatenated code. The second strategy is based on an erasing technique using hard detection. Maximum likelihood (ML) detection is applied in a third strategy. A fourth strategy is the combination of the second and the third strategies using an ML decoding and the erasing technique. For each decoding strategy, the overall performance of the system is derived analytically and the criterion of erasing is defined. The analytical results show that significant coding gain can be achieved by using the erasing technique with an ML Viterbi decoder.<>
{"title":"Concatenated multilevel coding","authors":"K. Fazel, A. Chouly","doi":"10.1109/ICC.1992.268238","DOIUrl":"https://doi.org/10.1109/ICC.1992.268238","url":null,"abstract":"The authors study different strategies for decoding the concatenated inner code, applied in the case of multilevel coding with a multistage decoding procedure. The first strategy recapitulates the classical method of decoding the concatenated code. The second strategy is based on an erasing technique using hard detection. Maximum likelihood (ML) detection is applied in a third strategy. A fourth strategy is the combination of the second and the third strategies using an ML decoding and the erasing technique. For each decoding strategy, the overall performance of the system is derived analytically and the criterion of erasing is defined. The analytical results show that significant coding gain can be achieved by using the erasing technique with an ML Viterbi decoder.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121108467","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 N*N switching element with output queueing, as used in a large asynchronous transfer mode (ATM) switching network, is considered. All the inlets of the switching elements are synchronized on minislots, where a minislot is the fixed-length time unit for transmission of one minicell. When entering the network, an ATM cell is converted into a minicell train, consisting of a fixed number of minicells. Using a two-state model, it is assumed that on each inlet, the number of minicell trains in an active period and the length of a silence period are both geometrically distributed, and the arriving minicell trains are uniformly distributed among all the outlets. The performance of the switching element can thus be obtained by analyzing one single output queue, which can be modeled as a discrete-time single-server queue with train arrivals. An upper bound and an approximate expression for the mean queue length are derived. An analytical method to obtain an upper bound and an approximation for the tail distribution of the queue length are presented. A comparison with simulation results shows that this upper bound is very tight.<>
{"title":"Approximate analytic performance study of an ATM switching element with train arrivals","authors":"Y. Xiong, H. Bruneel","doi":"10.1109/ICC.1992.268019","DOIUrl":"https://doi.org/10.1109/ICC.1992.268019","url":null,"abstract":"A N*N switching element with output queueing, as used in a large asynchronous transfer mode (ATM) switching network, is considered. All the inlets of the switching elements are synchronized on minislots, where a minislot is the fixed-length time unit for transmission of one minicell. When entering the network, an ATM cell is converted into a minicell train, consisting of a fixed number of minicells. Using a two-state model, it is assumed that on each inlet, the number of minicell trains in an active period and the length of a silence period are both geometrically distributed, and the arriving minicell trains are uniformly distributed among all the outlets. The performance of the switching element can thus be obtained by analyzing one single output queue, which can be modeled as a discrete-time single-server queue with train arrivals. An upper bound and an approximate expression for the mean queue length are derived. An analytical method to obtain an upper bound and an approximation for the tail distribution of the queue length are presented. A comparison with simulation results shows that this upper bound is very tight.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"636 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116480308","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
扫码关注我们
求助内容：
应助结果提醒方式：