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

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.最新文献

筛选
英文 中文
Protocol and control mechanisms to save terminal energy in IEEE 802.16 networks IEEE 802.16网络中终端节能的协议和控制机制
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517211
S. Mukherjee, K. Leung, G. Rittenhouse
{"title":"Protocol and control mechanisms to save terminal energy in IEEE 802.16 networks","authors":"S. Mukherjee, K. Leung, G. Rittenhouse","doi":"10.1109/PACRIM.2005.1517211","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517211","url":null,"abstract":"The IEEE 802.16-2004 standard (formerly 802.16d) has been approved to provide last-mile connectivity to fixed locations by radio links. Although the IEEE committee is working on a future 802.16e standard to support terminal mobility, we believe that adding mobility support to the present standard will offer a significant business opportunity for service providers by enabling them to serve a large pool of potential users whose laptops and PDAs are 802.16-2004 enabled. In our prior work, we have shown how to reuse commands from the 802.16-2004 standard to support handoff between access points without any change to the standard. However, given that the mobile terminals will be severely constrained by battery life, it is essential that new protocols and control mechanisms be devised to save terminal energy, based on the existing 802.16-2004 standard. To achieve this objective, in the present paper we propose protocols and use existing 802.16-2004 commands to put mobile terminals to \"sleep\" (to save energy) when they are idle, and \"wake them up\" when there is traffic destined for them. We also demonstrate how this \"sleep/wakeup\" cycle can is compatible with the handoff process.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121332170","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}
引用次数: 13
New peak-to-average power-ratio reduction algorithms for OFDM systems using constellation extension 基于星座扩展的OFDM系统峰均功率比降低新算法
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517339
Y. J. Kou, Wu Lu, A. Antoniou
{"title":"New peak-to-average power-ratio reduction algorithms for OFDM systems using constellation extension","authors":"Y. J. Kou, Wu Lu, A. Antoniou","doi":"10.1109/PACRIM.2005.1517339","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517339","url":null,"abstract":"New peak-to-average power-ratio reduction (PAPR) algorithms for orthogonal frequency-division multiplexing systems are investigated in a probabilistic framework. Specifically, two de-randomization algorithms for PAPR reduction are developed by applying the so-called conditional probability method. Our simulations demonstrate that the proposed algorithms outperform several existing algorithms and the computational complexity of the proposed algorithms is found to be significantly less than that of existing algorithms.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134508392","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}
引用次数: 3
On the design of task scheduling in the heterogeneous computing environments 异构计算环境下的任务调度设计
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517309
Hsin-An Chen
{"title":"On the design of task scheduling in the heterogeneous computing environments","authors":"Hsin-An Chen","doi":"10.1109/PACRIM.2005.1517309","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517309","url":null,"abstract":"An efficient task scheduling in a heterogeneous computing (HC) system is an important issue to meet the computational requirements of a large number of parallel applications. In this paper, we have proposed a non-preemptive static scheduling algorithm for the HC systems, called the multiple strict bound constraints (MSBC) algorithm. The MSBC algorithm employs an alternative task-prioritized scheme in stead of that used by the heterogeneous earliest finish time (HEFT) algorithm. Additionally, we also exploit available idle time slots in every scheduling round of the MSBC algorithm. In order to provide an unbiased comparison with the existing algorithms, the randomly generated graphs are considered as experimental test-beds. The experimental results show the superiority of our proposed algorithm to those presented previously. Therefore, our proposed algorithm may be used to raise the performance of the parallel applications executed in the HC systems.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129419443","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
A dynamically clustered chip multiprocessor 动态集群芯片多处理器
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517238
Chao-Chin Wu, Guan-Joe Lai
{"title":"A dynamically clustered chip multiprocessor","authors":"Chao-Chin Wu, Guan-Joe Lai","doi":"10.1109/PACRIM.2005.1517238","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517238","url":null,"abstract":"Chip multiprocessors (CMPs) can outperform superscalar processors only for the application programs with full of thread-level parallelism. In this paper, we investigate how to combine both the advantages of a CMP and of a superscalar to execute an application. We aggregate multiple processing elements (PEs) in the CMP into a wide superscalar processor. The number of aggregated PEs is dynamically determined by the dependence distance of subsequent thread at the run time. According to different aggregation methods, the new CMP is capable of supporting three execution modes. To obtain the best performance, the processor keeps switching between different execution modes when executing an application, according to the characteristics of subsequent instructions.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129785472","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
On the performance of a practical OFDM adaptive modulation scheme using a feedback channel 基于反馈信道的OFDM自适应调制方案的性能研究
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517336
J. Veilleux, P. Fortier, S. Roy
{"title":"On the performance of a practical OFDM adaptive modulation scheme using a feedback channel","authors":"J. Veilleux, P. Fortier, S. Roy","doi":"10.1109/PACRIM.2005.1517336","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517336","url":null,"abstract":"In this paper, we investigate an OFDM adaptive modulation system for multipath wireless channels that is suited for practical hardware implementation. The design of the adaptive scheme takes into account the feedback delays introduced by the components of an OFDM transceiver. Performances are investigated when employing OFDM channel estimation and a non-ideal OFDM feedback channel.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132489261","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
Implementation complexity analysis of normalized threshold generalized selection combining 归一化阈值广义选择组合的实现复杂度分析
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517332
Lei Xiao, X. Dong
{"title":"Implementation complexity analysis of normalized threshold generalized selection combining","authors":"Lei Xiao, X. Dong","doi":"10.1109/PACRIM.2005.1517332","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517332","url":null,"abstract":"The implementation complexity of normalized threshold generalized threshold generalized selection combining (NT-GSC) is studied via calculating statistics of the number of combined branches. Using the probability space partition approach, the average number of combined branches and the variance on the number of combined branches are derived in compact forms. The resultant formulae is applicable to arbitrary fading channels provided that the independence of the fading is met.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132502560","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 proposal of real-time video simulator using FPGA for multimedia processing 提出了一种利用FPGA进行多媒体处理的实时视频模拟器
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517273
S. Toriiwa, Y. Morooka, K. Toraichi, Y. Miura, A. Okamoto, M. Kitamura
{"title":"A proposal of real-time video simulator using FPGA for multimedia processing","authors":"S. Toriiwa, Y. Morooka, K. Toraichi, Y. Miura, A. Okamoto, M. Kitamura","doi":"10.1109/PACRIM.2005.1517273","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517273","url":null,"abstract":"In this paper, a video signal processing simulator is introduced. Appropriate video signal processing is required to obtain high resolution in movies. So, we need to look for proper signal processing algorithms for video and movie and evaluate them quantitatively. However, a master algorithm for such evaluation is yet to be found. One way to find effective signal processing algorithms is to use a reprogrammable video simulator that can simulate video or movie signals with different algorithms defined by the user. In this paper, we propose a FPGA based video simulator system which has the advantages of both software simulation and dedicated hardware test techniques. The configuration and test performance of the proposed system is also mentioned.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116140685","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
The context-adaptable pedestrian navigation system and usability in practical settings 环境适应性行人导航系统及其在实际环境中的可用性
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517302
M. Kawabata, R. Nishide, M. Ueda, S. Ueshima
{"title":"The context-adaptable pedestrian navigation system and usability in practical settings","authors":"M. Kawabata, R. Nishide, M. Ueda, S. Ueshima","doi":"10.1109/PACRIM.2005.1517302","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517302","url":null,"abstract":"Recently, the remarkable advance on mobile terminal technologies has enabled us to develop full-scaled navigation systems for pedestrians. In most systems developed so far, research has been focused on visualization effect on maps to users to guide pedestrians to their destination smoothly. The authors here present a context-adaptable pedestrian navigation system, which provides users with the preferable route, considering the conditions of each area and the objectives of the users. A graph-based approach utilizing metadata is employed to represent logical space built over the real space, and a scoring scheme is provided by partitioning target region to its edges for approximation graph model for real space, which enables to expand target region. This scheme is dependent on context to find paths to pedestrian's destination. The usability of this system in many environments is examined by numerical simulations. The authors also discuss the possibilities of the system in practical settings in an open area, temporarily built-up sites.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131867316","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 evaluation of P2P systems with hierarchical query routing 基于分层查询路由的P2P系统性能评价
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517304
H. Kishi, H. Kawano
{"title":"Performance evaluation of P2P systems with hierarchical query routing","authors":"H. Kishi, H. Kawano","doi":"10.1109/PACRIM.2005.1517304","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517304","url":null,"abstract":"P2P information retrieval systems have been changing from filename-based queries to contents-oriented queries. However, query messages occur frequently and consume the network bandwidth of communication systems. Instead of query broadcasting retrieval systems, we extended JXTA-like query routing protocols in order to handle characteristics of resources and queries, so that we tried to deal with topic-oriented query routing mechanisms. We also introduced hierarchical routing tables in order to reduce the storage and management costs. In our previous studies, we realized that the number of routing table hierarchy affect the trade-off between the cost of query forwarding and the amount of storage for routing information. In this paper, we consider analytical model in order to evaluate the characteristics of hierarchical peer clusters. We try to apply Palm-probability to calculate distribution of information resources. Additionally, we utilize Poisson-Voronoi-clustering to evaluate our hierarchical model.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393699","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
Performance analysis in the context of selection diversity in non-identically distributed Weibull fading channels 非同分布威布尔衰落信道中选择多样性的性能分析
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517334
R. Kwan, C. Leung
{"title":"Performance analysis in the context of selection diversity in non-identically distributed Weibull fading channels","authors":"R. Kwan, C. Leung","doi":"10.1109/PACRIM.2005.1517334","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517334","url":null,"abstract":"In this paper, some analytical results for selection diversity over Weibull fading channels are presented. In particular, an analytical expression for the probability density function (pdf) of the maximum of a set of independent but not necessarily identically distributed (i.n.d.) Weibull random variables is derived. Expressions for the corresponding cumulative distribution function (cdf), moment generating function (MGF), and r-th moment are also obtained. The usefulness of the results is illustrated by application to the evaluation of outage probabilities.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133021550","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
首页 上一页 下一页 尾页
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学术官方微信