Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications最新文献

筛选
英文 中文
On the reuse of isochronous channels in DQDB metropolitan area networks DQDB城域网中同步信道复用研究
N. Huang, Huey-Ing Liu, G. Ma
{"title":"On the reuse of isochronous channels in DQDB metropolitan area networks","authors":"N. Huang, Huey-Ing Liu, G. Ma","doi":"10.1109/ICC.1994.368958","DOIUrl":"https://doi.org/10.1109/ICC.1994.368958","url":null,"abstract":"The isochronous channel reuse problem (ICRP) on DQDB metropolitan area networks is investigated. Given a set of established isochronous connections and a set of isochronous requests, the goal is to use a minimal number of isochronous channels to service these requests. On the other hand, given a limited isochronous bandwidth, the goal is to establish a maximal number of isochronous connections. For the simplified ICRP (SICRP), in which all the established isochronous connections as well as the isochronous requests are of the same bandwidth, we suggest a tight lower bound and propose an efficient isochronous channel reuse algorithm (ICRA). Simulation results show that for the SICRP, the solutions obtained by the ICRA are very close to the lower bound which implies the proposed ICRA is very attractive. For a limited isochronous bandwidth, the number of successful established isochronous connections obtained by the ICRA is much more than that of the original DQDB isochronous channels allocation scheme.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127541111","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}
引用次数: 6
Implicit deregistration in a PCS network 在PCS网络中隐式注销
Yi-Bing Lin, A. Noerpel
{"title":"Implicit deregistration in a PCS network","authors":"Yi-Bing Lin, A. Noerpel","doi":"10.1109/ICC.1994.368998","DOIUrl":"https://doi.org/10.1109/ICC.1994.368998","url":null,"abstract":"Registration/deregistration is required in a PCS network when a portable moves between registration areas. Several schemes were proposed to deregister a portable after it moves out of a registration area. A simple scheme called implicit deregistration totally eliminates network traffic due to deregistration. However, this scheme may delete valid registration records. Thus, the size of a registration database must be sufficiently large to ensure low probability that a valid registration record is deleted. The paper describes an analytic model to determine the size k of the registration database for an RA in the implicit deregistration scheme. If the expected number of portables in an RA is N, then the study indicates that good performance can be achieved if k/spl sime/5N.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128980504","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}
引用次数: 30
Digital television: hierarchical channel coding using turbo-codes 数字电视:使用涡轮码的分层频道编码
C. Berrou, Pierre Combelles
{"title":"Digital television: hierarchical channel coding using turbo-codes","authors":"C. Berrou, Pierre Combelles","doi":"10.1109/ICC.1994.368902","DOIUrl":"https://doi.org/10.1109/ICC.1994.368902","url":null,"abstract":"Digital television terrestrial transmission has to deal with various reception conditions: a plug-free TV set receives a much lower a signal thanone with a roof-top antenna. It is hence interesting to provide a signal that conveys two types of information: a \"basic\" picture for portable receivers, this information must be transmitted most reliably; and additional information to be added to the basic picture in order to get a higher definition picture, this lesser protected information can be decoded by fixed receivers only. This implies multi-protection-or hierarchical-channel coding, including very efficient codes to protect the basic picture. This article describes a hierarchical channel coding and modulation scheme that, together with a new family of binary codes, is believed to allow the design of good hierarchical transmission systems.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130592771","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}
引用次数: 12
A distributed routing and access control scheme for ATM networks 一种ATM网络的分布式路由和访问控制方案
R. Bolla, F. Davoli, M. Marchese
{"title":"A distributed routing and access control scheme for ATM networks","authors":"R. Bolla, F. Davoli, M. Marchese","doi":"10.1109/ICC.1994.369024","DOIUrl":"https://doi.org/10.1109/ICC.1994.369024","url":null,"abstract":"A proposed model of an ATM access node is extended to describe a network featuring a node by node admission control and routing strategy. A hierarchical dynamic resource allocation scheme is periodically applied at each node to every outgoing link, in order to reassign link capacity partitions among various service classes. Local access control rules compute the maximum number of connections of each class that a link can accept, by using the assigned capacity. A call request packet is generated with every connection request, and it is sent along a path from the source to the destination node. Each node traversed checks the presence of the resources needed to accept a new connection, by using the local access control rule. A connection is accepted only if every node on the path has enough resources to support it (also maintaining the quality of service for connections in progress), and it is refused otherwise. The path of the request packet is chosen by using a distributed routing strategy. At every node traversed, an output link is chosen by minimizing a cost function composed by two terms: a \"local\" and a \"global\" one. The local term takes into account the situation of the node by using a simple calculation, whereas the global term holds the aggregate information about the situation of the network, and it is updated and passed along periodically by every node. A complete description of the global scheme and simulation results are reported and discussed.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132428824","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}
引用次数: 5
Performance of convolutionally coded CDMA/OFDM in a frequency-time selective fading channel and its near-far resistance 频率时间选择性衰落信道中卷积编码CDMA/OFDM的性能及其近远阻力
Kenneth Fazel
{"title":"Performance of convolutionally coded CDMA/OFDM in a frequency-time selective fading channel and its near-far resistance","authors":"Kenneth Fazel","doi":"10.1109/ICC.1994.368869","DOIUrl":"https://doi.org/10.1109/ICC.1994.368869","url":null,"abstract":"The OFDM technique is an interesting approach in mobile communications in order to achieve a high spectral efficiency and to combat the frequency selectivity of the channel. Another interesting technique is a CDMA system with Rake-receiver. The main advantages of CDMA are well known, but its capacity is limited by multiuser interference. The aim of this study is to analyze the performance of a convolutionally-coded CDMA system combined with OFDM in a frequency/time selective fading channel, taking into account the near-far problem. This combination allows one to perform a maximum-likelihood detection (MLD), to use the available spectrum in an efficient way, to exploit frequency diversity and time diversity (provided by channel coding), and to retain many advantages of a CDMA system with a simpler hardware realization. An example for a mobile communication system using convolutionally-coded CDMA/OFDM with Walsh-Hadamard code-spreading for the downlink (base-mobile) is studied. The performance of a MLD is examined by taking into account the near-far problem. It is shown that the MLD is very robust to the near-far problem. It is also shown that by using BPSK modulation, in a 1.28 MHz bandwidth, one can transmit 64 active users at rate of about 10.34 kbit/sec.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132057546","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}
引用次数: 33
A cell-based flow control scheme for DQDB interconnections across an ATM switch 一个基于小区的流量控制方案,用于跨ATM交换机的DQDB互连
N. Huang, Chiung-Shien Wu, G. Ma
{"title":"A cell-based flow control scheme for DQDB interconnections across an ATM switch","authors":"N. Huang, Chiung-Shien Wu, G. Ma","doi":"10.1109/ICC.1994.369023","DOIUrl":"https://doi.org/10.1109/ICC.1994.369023","url":null,"abstract":"A cell-based flow control scheme is proposed for interconnecting DQDB metropolitan area networks across an ATM switch with finite input buffer. In this scheme, a station on the DQDB subnetwork is permitted to transmit a segment to the ATM switch if and only if it receives a credit from the ATM switch. The network congestion is effectively prevented by the proposed scheme since no segment is lost in the ATM switch, and in the meantime, the transmission throughput of the interconnection system is maximized. The performance of this scheme is evaluated by simulations. The results show that the total throughput obtained by each DQDB subnetwork dynamically matches with the cell processing throughput of the ATM switch. Besides, each station on the DQDB subnetwork shares a fair bandwidth. By using this scheme, a reliable communication mechanism for directly interconnecting DQDB subnetworks to an ATM switch can be easily provided.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132185606","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}
引用次数: 2
An integrated model of the ATM switch for control and management purposes 用于控制和管理目的的ATM交换机的集成模型
S. Baldisseri, P. Coppo, R. Melen, A. Pelaggi
{"title":"An integrated model of the ATM switch for control and management purposes","authors":"S. Baldisseri, P. Coppo, R. Melen, A. Pelaggi","doi":"10.1109/ICC.1994.368877","DOIUrl":"https://doi.org/10.1109/ICC.1994.368877","url":null,"abstract":"The fast pace of technological innovation and the multiservice characteristics of the modern telecommunications scenario are bound to defeat any sectored approach to its technical problems, based on deep analyses of a partial view of a general problem. This methodology often leads to the development of different models within different environments constituting different views of the same object. An instance of this problem has been identified in the field of ATM switching, where three switch models are under consideration for the management, control and customer network management (CMN) points of view. None of the models can be considered as exhaustive nor representing the complete physical reality of the equipment. Each of them is presented in the paper with references, where applicable, to the current activity of standardisation bodies and interest groups. A more effective approach consists in facing the problem in an integrated manner, developing a model including at the same time aspects from the different views. This means the study of a single, consistent, complete model of the ATM switch at a suitable level of abstraction, and suggests an architecture where the different representations are mapped onto different views of the same data structure. A possible realization of this approach is sketched, together with an example of management, control and CNM interactions (based on CMIP, signalling and SNMP, respectively) and their impact on the common data structure.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130979311","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}
引用次数: 0
An efficient FSE/DFE-based HDSL equalizer with new adaptive algorithms 一种高效的基于FSE/ dfe的HDSL均衡器和新的自适应算法
Cheng-I Hwang, Tzu-Chiang Tang, D. Lin, Sau-Gee Chen
{"title":"An efficient FSE/DFE-based HDSL equalizer with new adaptive algorithms","authors":"Cheng-I Hwang, Tzu-Chiang Tang, D. Lin, Sau-Gee Chen","doi":"10.1109/ICC.1994.369043","DOIUrl":"https://doi.org/10.1109/ICC.1994.369043","url":null,"abstract":"We consider the design of an efficient FSE/DFE-based HDSL equalizer. For this, several variants of the conventional LMS algorithm and their delayed versions are investigated. In addition, two new adaptive algorithms are also studied which yield lower computational complexity but similar performance when compared to conventional algorithms. We also propose a way to initialize the DFE coefficients for fast convergence. Extensive simulation is conducted to evaluate various algorithms' performance and to facilitate hardware design. Due to time constraint, the present design employs a conventional algorithm. It is verified with the Verilog and Opus VLSI CAD tools. Layout design of the equalizer chip has been taped out for foundry fabrication.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251981","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}
引用次数: 8
Removal of subjective redundancy by adaptive quantization of DCT coefficients 通过自适应量化DCT系数去除主观冗余
Hao Bi, G. Bi, Y. Mao
{"title":"Removal of subjective redundancy by adaptive quantization of DCT coefficients","authors":"Hao Bi, G. Bi, Y. Mao","doi":"10.1109/ICC.1994.369056","DOIUrl":"https://doi.org/10.1109/ICC.1994.369056","url":null,"abstract":"The removal of subjective redundancy in image coding has been playing a very important role in studies of the low bit rate video communications to attain even greater levels of signal compression. This paper discusses in depth the psychovisual interactions between the basis pictures (components) of DCT in the transform domain, and based on this, suggests a coding scheme to further reduce the required bit rate by adaptively quantizing the DCT coefficients. The general goal is to maintain the perception of reconstructed images as good as possible, therefore, several human visual system's characteristics such as the responses to intensity and to spacial frequency as well as the spacial masking effect are fully exploited. Some experiments are carried out, and very encouraging results are obtained.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127983696","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}
引用次数: 0
Multiplexing generalized periodic Markovian sources with an application to the study of VBR video 广义周期马尔可夫源复用及其在VBR视频研究中的应用
R. Landry, I. Stavrakakis
{"title":"Multiplexing generalized periodic Markovian sources with an application to the study of VBR video","authors":"R. Landry, I. Stavrakakis","doi":"10.1109/ICC.1994.368948","DOIUrl":"https://doi.org/10.1109/ICC.1994.368948","url":null,"abstract":"Presents a stochastic traffic model which is capable of capturing the time-scale dynamics associated with the potentially large disparity between source and output-link speeds in packet networks such as ATM. The model is applied to the study of variable bit rate (VBR) video sources in which cells are delivered at a sub-frame level referred to as a slice. A tractable analytical technique is presented for the study of a finite-capacity multiplexer under an input process determined by the superposition of N of the proposed traffic models.<<ETX>>","PeriodicalId":112111,"journal":{"name":"Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127985842","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信