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

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

筛选
英文 中文
Reduced complexity recovery architecture in QAM software receiver 降低了QAM软件接收机中恢复体系结构的复杂性
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517296
A. Enteshari, R. Pasand, J. Nielsen
{"title":"Reduced complexity recovery architecture in QAM software receiver","authors":"A. Enteshari, R. Pasand, J. Nielsen","doi":"10.1109/PACRIM.2005.1517296","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517296","url":null,"abstract":"In this paper, we present the design and implementation of a new architecture for phase and frequency synchronization in coherent QAM demodulator used in modern digital communication systems. This architecture utilizes the non data aided carrier recovery for synchronization, which is based on the DC error tracking behavior of a control loop. We exploit the hardware-software co-design in this architecture, which makes it flexible for different design parameters. The early-late gate technique as a conventional symbol timing recovery is also addressed within the proposed framework. Hardware-software implementation in field programmable gate array (FPGA) and its issues are presented for different data rates.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"44 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":"125415834","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 design concept and initial implementation of Agent Teamwork grid computing middleware Agent Teamwork网格计算中间件的设计思想和初步实现
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517266
M. Fukuda, K. Kashiwagi, S. Kobayashi
{"title":"The design concept and initial implementation of Agent Teamwork grid computing middleware","authors":"M. Fukuda, K. Kashiwagi, S. Kobayashi","doi":"10.1109/PACRIM.2005.1517266","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517266","url":null,"abstract":"AgentTeamwork is a grid-computing middleware system that dispatches a collection of mobile agents to coordinate a user job over remote computers in a decentralized manner. A parallel-computing job is check-pointed periodically, moved by a mobile agent for better performance, and resumed upon a crash. The system also restores broken communication with its error-recoverable socket and mpi-Java libraries. This paper presents AgentTeamwork's design concept, implementation, and basic performance.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"127 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":"117352298","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
Accurate BER of time-hopping and direct-sequence UWB systems in multi-user interference 多用户干扰下跳时和直接序列超宽带系统的精确误码率
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517216
Bo Hu, N. Beaulieu
{"title":"Accurate BER of time-hopping and direct-sequence UWB systems in multi-user interference","authors":"Bo Hu, N. Beaulieu","doi":"10.1109/PACRIM.2005.1517216","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517216","url":null,"abstract":"An exact analysis is derived for precisely calculating the bit error probability of time-hopping and direct-sequence ultra-wideband systems with multi-user interference. This analysis differs from past work in that it is assumed that multiple pulses in a frame from an interfering user can cause interference to the desired user. The Gaussian approximation is shown to be inaccurate for predicting the bit error rate for medium and large signal-to-noise ratio values. The performances of time-hopping and direct-sequence modulation schemes are accurately compared for different numbers of users and frame lengths.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"8 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":"116858804","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
Further discussion on the design of STBC-MLC scheme for different set partitioning 进一步讨论不同集划分的STBC-MLC方案设计
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517224
Feng Zhang, A. Sesay
{"title":"Further discussion on the design of STBC-MLC scheme for different set partitioning","authors":"Feng Zhang, A. Sesay","doi":"10.1109/PACRIM.2005.1517224","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517224","url":null,"abstract":"This paper presents the concatenation scheme of space-time block codes (STBC) and multilevel codes/multi-stage decoding (MLC/MSD). We analyze the impact of different set partitionings, namely Ungerboeck's partitioning (UP) and block partitioning (BP), on the concatenation scheme by using product distance. Based on capacity rule, performances of the concatenation schemes with 8-ASK and 8-PSK are given for analyzing.","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":"132002962","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 null space constraint based block Tomlinson-Harashima precoding technique for the multi-user MIMO downlink 基于零空间约束的多用户MIMO下行分块Tomlinson-Harashima预编码技术
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517225
Jia Liu, W.A. Krzumien
{"title":"A null space constraint based block Tomlinson-Harashima precoding technique for the multi-user MIMO downlink","authors":"Jia Liu, W.A. Krzumien","doi":"10.1109/PACRIM.2005.1517225","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517225","url":null,"abstract":"A null space constraint based block Tomlinson-Harashima preceding technique (NS-BTHP technique) is proposed for the downlink of multi-user MIMO systems. Employing non-linear pre-processing at the base station this technique pre-eliminates multi-user interference (MUI) among different mobiles. Therefore, an equivalent point-to-point MlMO channel is realized for each mobile, and the spatial interference among the multiple data streams directed to each user (self-interference) can be eliminated using signal processing algorithms developed for point-to-point MlMO systems. The proposed nonlinear preceding approach results in an improvement of the null space constraint technique (NS technique), in which linear pre-processing is used to pre-eliminate the MUI at the base station. The advantage of the NS-BTHP technique over the NS technique is explained and demonstrated by simulations.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"52 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":"133302608","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}
引用次数: 11
Multiuser detection for MC-CDMA system with M-QAM using semidefinite programming relaxation 基于半定规划松弛的M-QAM MC-CDMA系统多用户检测
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517343
X. Wang, Zhiwei Mao
{"title":"Multiuser detection for MC-CDMA system with M-QAM using semidefinite programming relaxation","authors":"X. Wang, Zhiwei Mao","doi":"10.1109/PACRIM.2005.1517343","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517343","url":null,"abstract":"A multiuser detector based on semidefinite programming (SDP) is proposed for multicarrier code-division multiple-access (MC-CDMA) systems with M-ary quadrature amplitude modulation (M-QAM). It is shown that maximum likelihood (ML) detection can be carried out by 'relaxing' the associated integer programming problem to a SDP problem, which leads to a detector of much reduced complexity. Computer simulations demonstrate that the proposed detector offers a symbol-error rate (SER) performance which outperforms existing suboptimal detectors, and the computational complexity of the proposed detector is considerably reduced compared with that of ML detector.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"32 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114034969","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
Distributed antipodal paraunitary precoders for OFDM systems OFDM系统的分布式对映准预编码器
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517258
B. Su, R. Vaidyanathan
{"title":"Distributed antipodal paraunitary precoders for OFDM systems","authors":"B. Su, R. Vaidyanathan","doi":"10.1109/PACRIM.2005.1517258","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517258","url":null,"abstract":"Antipodal paraunitary (APU) matrices have been shown to be useful with respect to bit error rate (BER) as linear precoders for OFDM systems, especially in a fast-varying channel environment. In this paper we study a broader class of paraunitary matrices, namely, the distributed antipodal paraunitary (DAPU) matrices, of which APU matrices are special cases. Systematic methods for recursively generating certain types of DAPU matrices as well as a fast algorithm to implement them in a system are presented. Simulation results show that under the same distribution length, DAPU precoded systems with longer precoders have a better BER performance than those with APU precoders, especially in mid- and high-SNR region.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"46 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":"121173418","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
Smart maximum-likelihood CDMA multiuser detection 智能最大似然CDMA多用户检测
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517341
S. Fouladi, C. Tellambura
{"title":"Smart maximum-likelihood CDMA multiuser detection","authors":"S. Fouladi, C. Tellambura","doi":"10.1109/PACRIM.2005.1517341","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517341","url":null,"abstract":"A fast-low-complexity maximum-likelihood multiuser detector for code division multiple access systems is proposed. It utilizes a best-first branch and bound approach and a constrained memory search. The memory constraint makes the proposed detector realizable, but has negligible performance loss in low signal-to-noise ratio (SNR) and virtually no performance loss in medium-to-high SNR. The results show that the proposed algorithm is much less complex, and that it executes faster than existing maximum likelihood detectors. In addition, the proposed method is suitable for parallel implementation.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"32 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":"121418994","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
Half-pixel accurate motion-estimation using a flexible triangle search 半像素精确运动估计使用灵活的三角形搜索
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517274
Mohamed Rehan, Panajotis Agathoklis
{"title":"Half-pixel accurate motion-estimation using a flexible triangle search","authors":"Mohamed Rehan, Panajotis Agathoklis","doi":"10.1109/PACRIM.2005.1517274","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517274","url":null,"abstract":"In this paper, a technique for half-pixel motion estimation using the flexible triangle search (FTS) algorithm is presented. The FTS algorithm is based on the simplex algorithm and has been presented and analyzed in previous work by authors. The approach proposed in this paper for half-pixel motion estimation is based on combining full- pixel and half-pixel searches into a single stage instead of using two separate search stages as commonly used. The resulting half-pixel FTS, HP-FTS, is implemented and analyzed as part of an H.263 encoder. Results indicate that the computational complexity of the proposed HP-FTS is lower compared to a two-stage (full-pixel first and half-pixel second) FTS algorithm. Further, the compression ratios and the quality of the reconstructed sequences using the proposed HP-FTS are similar to those of the two-stage FTS.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"5 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":"121480518","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
Robustness of heavy-tailed property for Web server performance 重尾属性对Web服务器性能的鲁棒性
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005. Pub Date : 2005-10-17 DOI: 10.1109/PACRIM.2005.1517312
T. Nakashima, M. Tsuichihara
{"title":"Robustness of heavy-tailed property for Web server performance","authors":"T. Nakashima, M. Tsuichihara","doi":"10.1109/PACRIM.2005.1517312","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517312","url":null,"abstract":"In this research, we focused on the heavy-tailed property on Web servers, and analyzed factors relating to the tail part of heavy-tailed distribution. An active measurement method was developed and was examined for Web servers. As for the analysis of factors of the tail part of heavy-tailed distribution, we have shown that the total transmission time including the TCP connection establishing time was dominated not only by the file size but also by first data transmission time just after establishing the TCP connection. We could illustrate the robustness of heavy-tailed property for Web data transmission even if each Web server has a different performance.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"21 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":"129403974","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学术官方微信