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

筛选
英文 中文
Cyclic-prefix based noise variance and power delay profile estimation for OFDM systems 基于循环前缀的OFDM系统噪声方差和功率延迟轮廓估计
T. Cui, C. Tellambura
{"title":"Cyclic-prefix based noise variance and power delay profile estimation for OFDM systems","authors":"T. Cui, C. Tellambura","doi":"10.1109/PACRIM.2005.1517340","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517340","url":null,"abstract":"In this paper, we derive cyclic-prefix (CP) based parameter estimators for orthogonal frequency division multiplexing (OFDM) systems. Signal correlation due to the use of the CP is exploited without requiring additional pilot symbols. Noise variance, power delay profile, the number of paths and the signal to noise ratio are estimated. The proposed algorithms can be readily used for applications such as minimum mean-square error (MMSE) equalization.","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":"128476455","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
DS-PPM ultra-wideband communications with BCH Coding 基于BCH编码的DS-PPM超宽带通信
Hanfeng Chen, Wei Li, T. Gulliver, Hao Zhang
{"title":"DS-PPM ultra-wideband communications with BCH Coding","authors":"Hanfeng Chen, Wei Li, T. Gulliver, Hao Zhang","doi":"10.1109/PACRIM.2005.1517214","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517214","url":null,"abstract":"Ultra-wideband (UWB) transmission for short-range wireless communications has recently drawn great attention. This is due to advantages such as high speed, immunity to multipath fading, low cost, and the ability to coexist with narrowband wireless systems. In this paper, we improve the performance of a direct sequence spread spectrum pulse position modulation (DS-PPM) UWB system via the addition of a Bose-Chaudhuri-Hocquenghem (BCH) code. Both single user and multiple-access performance over an additive white Gaussian noise channel is considered.","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":"117312716","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
Simultaneous fractal image denoising and interpolation 同时分形图像去噪与插值
M. Ghazel, R. Ward, R. Abugharbieh, E. Vrscay, G. H. Freeman
{"title":"Simultaneous fractal image denoising and interpolation","authors":"M. Ghazel, R. Ward, R. Abugharbieh, E. Vrscay, G. H. Freeman","doi":"10.1109/PACRIM.2005.1517350","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517350","url":null,"abstract":"In this paper, a simple and effective fractal-based simultaneous image denoising and interpolation scheme is proposed and implemented. The denoising is performed during the fractal encoding process while the interpolation is performed during the decoding process. The fractal-based image denoising involves predicting the fractal code of the original noiseless image from the statistics of the noisy observation. This fractal code can then be used to generate a fractally denoised estimate of the original image. The fractal interpolation can be easily achieved during the decoding process by iterating the predicted fractal code on a suitably sized blank initial image seed. The cycle spinning algorithm can also be incorporated in the proposed fractal joint denoising and resizing scheme in order to reduce some of the artifacts and enhance the visual quality of the fractally denoised and resized estimates.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"58 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":"126090901","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
A construction method of a retrieval space by an evaluation of word distributions in documents 一种通过评估文档中的词分布来构建检索空间的方法
Hidenori Homma, T. Nakanishi, T. Kitagawa
{"title":"A construction method of a retrieval space by an evaluation of word distributions in documents","authors":"Hidenori Homma, T. Nakanishi, T. Kitagawa","doi":"10.1109/PACRIM.2005.1517262","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517262","url":null,"abstract":"This paper presents a new construction method of a retrieval space by an evaluation of word distributions in documents. In order to realize a semantic associative search, it is necessary to construct a retrieval space which enables measurement of relations between each word. A creation method of retrieval space has been proposed that creates a data matrix by using a dictionary or a term dictionary. However, it is difficult to create a retrieval space without a dictionary or a term dictionary. This method can construct a retrieval space which enables measurement of relations between each word by an evaluation of word distributions in documents. This paper shows some experimental results which applied the mathematical model of meaning to the retrieval space constructed by this method.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"58 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":"123370289","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
Wearable sensors for real-time musical signal processing 用于实时音乐信号处理的可穿戴传感器
A. Kapur, E.L. Yang, A. Tindale, P. Driessen
{"title":"Wearable sensors for real-time musical signal processing","authors":"A. Kapur, E.L. Yang, A. Tindale, P. Driessen","doi":"10.1109/PACRIM.2005.1517316","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517316","url":null,"abstract":"This paper describes the use of wearable sensor technology to control parameters of audio effects for real-time musical signal processing. Traditional instrument performance techniques are preserved while the system modifies the resulting sound based upon the movements of the performer. Gesture data from a performing artist is captured using three-axis accelerometer packages that is converted to MIDI (musical instrument digital interface) messages using microcontroller technology. ChucK, a new programming language for on-the-fly audio signal processing and sound synthesis, is used to collect and process synchronized gesture data and audio signals from the traditional instrument being performed. Case studies using the wearable sensors in a variety of locations on the body (head, hands, feet, etc.) with a number of different traditional instruments (tabla, sitar, drumset, turntables, etc.) are presented.","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":"124795828","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}
引用次数: 17
Extended-butterfly fat tree interconnection (EFTI) architecture for network on chip 片上网络的扩展蝴蝶胖树互连(EFTI)架构
H. Hossain, M. Akbar, M. Islam
{"title":"Extended-butterfly fat tree interconnection (EFTI) architecture for network on chip","authors":"H. Hossain, M. Akbar, M. Islam","doi":"10.1109/PACRIM.2005.1517364","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517364","url":null,"abstract":"System on chip (SoC) design requires efficient communication between heterogeneous resources to meet the high-speed transmission needs. Therefore one of the key factors for the success of ultra-deep submicron technologies will be the capability of integrating different resources like processor core, memory, an FPGA, a custom hardware block or any other semiconductor intellectual property (SIP) block into a single piece of silicon. Non-scalable global wire delays, global synchronization failure, loss of signal integrity issues are the main problems. To address these problems, various interconnect architectures are proposed. Butterfly fat tree (BFT) is one of those. To improve the performance of BFT we introduce extended-butterfly fat tree interconnection (EFTI). Routing algorithm is provided for EFTI and comparative analysis is performed through the simulation result.","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":"125259614","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}
引用次数: 15
Parallelizing particle swarm optimization 并行粒子群优化
B. Li, K. Wada
{"title":"Parallelizing particle swarm optimization","authors":"B. Li, K. Wada","doi":"10.1109/PACRIM.2005.1517282","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517282","url":null,"abstract":"This paper focuses on a parallel version of particle swarm optimization (PSO) algorithm which can significantly reduces execution time for solving complex large-scale optimization problems. This paper gives an overview of PSO algorithm, and then proposes a design and an implementation of parallel PSO. The proposed algorithm eliminates redundant synchronizations and optimizes message transfer to overlap communication with computation. The experimental results showed that 13.2 times speedup was obtained by the proposed parallel PSO algorithm with 14 processors.","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":"130432558","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}
引用次数: 19
Differential distributed space-time block coding 差分分布式空时分组编码
S. Yiu, R. Schober, L. Lampe
{"title":"Differential distributed space-time block coding","authors":"S. Yiu, R. Schober, L. Lampe","doi":"10.1109/PACRIM.2005.1517223","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517223","url":null,"abstract":"In this paper, differential distributed space-time block codes (DSIBCs) are introduced. These differential DSTBCs are designed for wireless networks which have a large set of nodes N but at any given time only a small, a priori unknown subset of nodes S /spl sub/ N can be active. Channel state information is not required at the cooperating nodes nor at the receiver. The signal transmitted by an active node is the product of an information-carrying code matrix and a unique node signature vector. It is shown that existing differential STBCs designed for N/sub c/ /spl ges/ 2 co-located antennas are favorable choices for the code matrix guaranteeing a diversity order of d = min{N/sub s/,N/sub c/} if ns nodes are active. Efficient methods for the optimization of the set of signature vectors are provided. Possible applications of the proposed DSTBCs include ad hoc and sensor networks employing decode-and-forward relaying.","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":"130354054","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}
引用次数: 17
Spare capacity allocation design schemes in self-healing ATM networks 自愈ATM网络备用容量分配设计方案
I. Woungang, S. Misra
{"title":"Spare capacity allocation design schemes in self-healing ATM networks","authors":"I. Woungang, S. Misra","doi":"10.1109/PACRIM.2005.1517328","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517328","url":null,"abstract":"In an ATM mesh network, the failure of a network element (e.g. fiber links or cross-connects) may lead to large data losses. Determining where to place spare capacity in the network and how much spare capacity must be allocated to guarantee seamless communications services survivable to network element failure is therefore a key concern. This problem, referred to as the spare capacity allocation (SCA) problem in mesh-type networks, has been extensively studied and the focus in almost all solution approaches has been to determine the optimal SCA assignment and backup virtual paths allocation for all traffic flows. However, there has been almost no study on the effect the choice of backup virtual paths (which determines our so called SCA design schemes) might have on the optimized SCA. This paper compares four SCA design schemes quantitatively in terms of the spare capacity requirements. The comparison is based on spare optimization, single link failure or single node failure scenarios, and 100% restoration. As expected, it is found that the \"joint selection of the working virtual paths and backup virtual paths among all possible paths\" can significantly reduce the spare capacity cost compared to other studied options.","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":"130379384","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
Eliminating barrier synchronizations in OpenMP programs for PC clusters 消除PC集群OpenMP程序中的障碍同步
N. Yonezawa, K. Wada
{"title":"Eliminating barrier synchronizations in OpenMP programs for PC clusters","authors":"N. Yonezawa, K. Wada","doi":"10.1109/PACRIM.2005.1517278","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517278","url":null,"abstract":"Barrier synchronizations are often used in shared memory program to force events to occur in correct order. However, this causes performance overhead especially on virtually shared memory realized on distributed memory environment. In this paper, we propose a new compiler technique for eliminating barrier synchronizations. In our approach, the compiler collects access information about array accesses and analyzes data dependency. If there was no dependency, barrier synchronizations can be eliminated. Additionally, even if the dependency was detected, there are cases when the barrier synchronization can be replaced with send-receive pairs of communications. A preliminary evaluation has been done using an LU program. As a result, by applying the proposed technique, we achieved 19.65% speedup with 8 processors.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"2022 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":"124690298","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学术官方微信