发布求助
文献互助 智能选刊 最新文献

Anais do 2002 International Telecommunications Symposium最新文献

筛选
英文 中文
An Accelerated Constant Modulus Algorithm 一种加速恒模算法
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.405
Magno T. M. Silva, M. Gerken, M. D. Miranda
{"title":"An Accelerated Constant Modulus Algorithm","authors":"Magno T. M. Silva, M. Gerken, M. D. Miranda","doi":"10.14209/its.2002.405","DOIUrl":"https://doi.org/10.14209/its.2002.405","url":null,"abstract":"— We present a novel adaptive algorithm for blind equalization. It is based on a tuner used in adaptive control that sets the second derivative of the parameter estimates and minimizes the cost function introduced by Go- dard. Based on simulation results we present a comparison with the Constant Modulus and the Shalvi-Weinstein algorithms. Both the convergence speed and the computational complexity of the proposed algorithm lie between those of the Constant Modulus and the Shalvi-Weinstein algorithms, thus present- ing a more favorable compromise between convergence speed and computational complexity. Some preliminary results also suggest that the proposed al- gorithm presents a more robust behavior with respect to convergence to global minima.","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124908018","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}
引用次数: 1
A note on alternant and BCH codes 关于备用和BCH代码的说明
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.174
A. Andrade, J. Interlando, R. Palazzo Jr.
{"title":"A note on alternant and BCH codes","authors":"A. Andrade, J. Interlando, R. Palazzo Jr.","doi":"10.14209/its.2002.174","DOIUrl":"https://doi.org/10.14209/its.2002.174","url":null,"abstract":"","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126151290","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
Network Performance Analysis of an Adaptive OSPF Routing Strategy-Effective Bandwidth Estimation 自适应OSPF路由策略的网络性能分析——有效带宽估计
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.722
T. B. Pereira, L. Ling
{"title":"Network Performance Analysis of an Adaptive OSPF Routing Strategy-Effective Bandwidth Estimation","authors":"T. B. Pereira, L. Ling","doi":"10.14209/its.2002.722","DOIUrl":"https://doi.org/10.14209/its.2002.722","url":null,"abstract":"Currently Open Shortest Path First (OSPF) is the most commonly used and promising intra-domain internet routing protocol where packets are routed along shortest paths to the destination. The shortest path computation is based on some static link costs and the change of the paths only happens when existing link components become unreachable or when new link components are added. In other words, the network congestion doesn't affect the routing decisions and, as a consequence, alternative paths, which could result in a better traffic performance, remain unused. This paper introduces and analyzes an adaptive OSPF routing strategy based on effective bandwidth estimation. Simulations carried out in the OPNET network simulator showed some preliminary, interesting results. Better network throughput (sometimes until 25,673 % better) can be reached using this adaptive routing other than the traditional OSPF, sacrificing an increase in network delay.","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130276432","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
Triangle PIFA Antenna Array Prototype for Wireless System Applications 用于无线系统应用的三角形PIFA天线阵列原型
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.122
L. Kretly, Arismar Cerqueira S. Jr., A. S.
{"title":"Triangle PIFA Antenna Array Prototype for Wireless System Applications","authors":"L. Kretly, Arismar Cerqueira S. Jr., A. S.","doi":"10.14209/its.2002.122","DOIUrl":"https://doi.org/10.14209/its.2002.122","url":null,"abstract":"","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129085824","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
A Combined Input-Output Queuing ATM Switch with m Intenal Links for Cell Transfer 一种用于小区传输的具有m条内部链路的组合输入输出排队ATM交换机
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.141
C. R. D. Santos, S. Motoyama
{"title":"A Combined Input-Output Queuing ATM Switch with m Intenal Links for Cell Transfer","authors":"C. R. D. Santos, S. Motoyama","doi":"10.14209/its.2002.141","DOIUrl":"https://doi.org/10.14209/its.2002.141","url":null,"abstract":"","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116994357","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}
引用次数: 1
Numerical Analysis of Planar Antenna Array Through the TTL Method 基于TTL法的平面天线阵列数值分析
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.50
G. Oliveira, José Elesbão C. Neto, H. Fernandes
{"title":"Numerical Analysis of Planar Antenna Array Through the TTL Method","authors":"G. Oliveira, José Elesbão C. Neto, H. Fernandes","doi":"10.14209/its.2002.50","DOIUrl":"https://doi.org/10.14209/its.2002.50","url":null,"abstract":"","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124346746","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
A Fast Algorithm for Signal Subspace Tracking Based on the Jacobi Method 基于Jacobi法的信号子空间快速跟踪算法
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.356
Bruno Cosenza de Carvalho, J. Szczupak
{"title":"A Fast Algorithm for Signal Subspace Tracking Based on the Jacobi Method","authors":"Bruno Cosenza de Carvalho, J. Szczupak","doi":"10.14209/its.2002.356","DOIUrl":"https://doi.org/10.14209/its.2002.356","url":null,"abstract":"","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121082225","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
Robust blind channel identification through regularized linear prediction 基于正则化线性预测的鲁棒盲信道识别
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.350
Claudio J. Bordin Jr., L. Baccalá
{"title":"Robust blind channel identification through regularized linear prediction","authors":"Claudio J. Bordin Jr., L. Baccalá","doi":"10.14209/its.2002.350","DOIUrl":"https://doi.org/10.14209/its.2002.350","url":null,"abstract":"","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122761507","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
Optical network analysis under non-uniform traffic distribution 非均匀流量分布下的光网络分析
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.621
L. H. Bonani, A. Sachs, M. Furtado, E. Moschim, A. Yamakami
{"title":"Optical network analysis under non-uniform traffic distribution","authors":"L. H. Bonani, A. Sachs, M. Furtado, E. Moschim, A. Yamakami","doi":"10.14209/its.2002.621","DOIUrl":"https://doi.org/10.14209/its.2002.621","url":null,"abstract":"(cid:190) Multihop regular networks are analyzed for applications under non-uniform traffic distribution, taking the conventional SPF (short path first) algorithm as the routing protocol. Simulations of Manhattan Street and Shuffle Net topologies without buffer memories, under constant bit rate and variable bit rate traffic flow distributions, are analyzed using the criterion of packet loss fraction. The results show that traffic bottlenecks are caused by packet losses produced either when full capacity of heavier loaded network links are reached or when optical packets arrive within the same time frame at optical switching nodes. The results and the methodology adopted are general with applicability not only restricted to optical networks.","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115394808","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
Adaptive Minimum BER Decision Feedback Multiuser Receivers for DS-CDMA DS-CDMA自适应最小误码率决策反馈多用户接收机
Anais do 2002 International Telecommunications Symposium Pub Date : 1900-01-01 DOI: 10.14209/its.2002.254
R. D. Lamare, R. Sampaio-Neto
{"title":"Adaptive Minimum BER Decision Feedback Multiuser Receivers for DS-CDMA","authors":"R. D. Lamare, R. Sampaio-Neto","doi":"10.14209/its.2002.254","DOIUrl":"https://doi.org/10.14209/its.2002.254","url":null,"abstract":"","PeriodicalId":310988,"journal":{"name":"Anais do 2002 International Telecommunications Symposium","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115412511","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
首页 上一页
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学术文献互助群
群 号：604180095
Book学术官方微信