2009 International Conference on Wireless Communications & Signal Processing最新文献

筛选
英文 中文
A new scheduling algorithm with low complexity for multiuser multiple-input multiple-output downlink system 多用户多输入多输出下行系统中一种新的低复杂度调度算法
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371492
L. Jin, Z. Hu, X. Gu
{"title":"A new scheduling algorithm with low complexity for multiuser multiple-input multiple-output downlink system","authors":"L. Jin, Z. Hu, X. Gu","doi":"10.1109/WCSP.2009.5371492","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371492","url":null,"abstract":"A new scheduling algorithm with low complexity for user selection is proposed for a multiuser multiple-input and multiple-output (MU-MIMO) downlink system based on block diagonalization (BD) precoding. The new algorithm provides equivalent system performance evaluated as sum-rate capacity in comparison with other user selection algorithms, such as semiorthogonal user selection (SUS) and capacity-based user selection algorithms. The proposed algorithm has the advantage of reduced computational complexity achieved by using a new volume-based user selection method that uses the product of the diagonal elements in the upper-triangular matrix obtained via Householder reduction procedure of QR factorization to the selected users channel matrix. The computational effort of the proposed algorithm is reduced by 1/3 compared with SUS algorithm. Compared with the capacity-based algorithm, the proposed algorithm does not need to perform the singular value decomposition (SVD) operation and water filling algorithm during each user selection step and hence significantly reduces the computational time. We provide numerical results of our new algorithm to confirm the sum-rate performance with the reduced complexity.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121114180","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
Performance of direction of arrival estimation based on support vector regression in impulsive noise environment 脉冲噪声环境下基于支持向量回归的到达方向估计性能
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371711
Xiang He, Zemin Liu, Jiang Bin
{"title":"Performance of direction of arrival estimation based on support vector regression in impulsive noise environment","authors":"Xiang He, Zemin Liu, Jiang Bin","doi":"10.1109/WCSP.2009.5371711","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371711","url":null,"abstract":"In this paper, the problem of estimating the direction of arrival (DOA) in impulsive noise environments is considered. One possible way to model the impulsive noise is to introduce symmetric α-stable (SαS) distribution. Robust co variation based MUSIC (ROC-MUSIC) and Fractional lower moment based MUSIC (FLOM-MUSIC) can be used to estimate the DOA under these conditions. But those methods require eigenvalue decomposition and involve mass computational complexity. In order to reduce the computational burden, the problem of DOA of can be approximated as a nonlinear mapping by means of support vector regression. This paper discusses the application of SVR-based DOA in presence of impulsive noise. Moreover, performance of this new algorithm is analyzed by comparison. Computer simulation results verify the correctness and effectiveness of the proposed method.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116428432","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
A fast block motion estimation algorithm with multi-directional adaptation 基于多方向自适应的快速块运动估计算法
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371510
C. Duanmu, Xing Chen
{"title":"A fast block motion estimation algorithm with multi-directional adaptation","authors":"C. Duanmu, Xing Chen","doi":"10.1109/WCSP.2009.5371510","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371510","url":null,"abstract":"Since the block motion estimation in current video compressions standards has a very high computational complexity and is not suitable for real-time applications, a new fast block motion estimation algorithm with multidirectional adaptation is proposed in this paper. This algorithm first wisely judges the motion type of current encoding block. Then, according to the motion type, different search strategies and search patterns are intelligently employed. Moreover, horizontal cross search pattern, vertical cross search pattern, diagonal cross search pattern, and anti-diagonal cross search pattern are proposed, and are intelligently selected and executed for multidirectional searching to fast track the location of the minimum rate-distortion cost, recursively. Experimental results demonstrate that the proposed algorithm has much less execution time than the existing algorithms, with about the same accuracy.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116477815","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
Nonuniform clustering routing protocol for tunnel wireless sensor network in underground mine 矿井隧道无线传感器网络的非均匀聚类路由协议
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371677
Haifeng Jiang, Jiansheng Peng, Wei Peng
{"title":"Nonuniform clustering routing protocol for tunnel wireless sensor network in underground mine","authors":"Haifeng Jiang, Jiansheng Peng, Wei Peng","doi":"10.1109/WCSP.2009.5371677","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371677","url":null,"abstract":"Wireless sensor networks(WSNs) are very important for monitoring underground mine safety. Aimed at the characteristics of structure of the tunnel in underground mine, the tunnel wireless sensor network (TWSN) is presented to monitor the tunnel. TWSN has the unbalanced communication load which leads to early invalidation of nodes close to the base station. The nonuniform clustering algorithm for TWSN can solve this problem. In our study, the method of nonuniform clustering region demarcation in tunnel is discussed theoretically and the nonuniform clustering routing protocol for TWSN is introduced. Simulation results show that the nonuniform clustering routing protocol for TWSN effectively balances the load among nodes and achieves an obvious improvement on the network lifetime compared with uniform clustering and no clustering TWSN.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126617107","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
Velocity compensation based Ultra-Wide bandwidth wireless moving target localization 基于速度补偿的超宽带无线运动目标定位
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371730
Ding Hong, Li Xin, Huangpu Xiao-tao, Li Zheng-rong
{"title":"Velocity compensation based Ultra-Wide bandwidth wireless moving target localization","authors":"Ding Hong, Li Xin, Huangpu Xiao-tao, Li Zheng-rong","doi":"10.1109/WCSP.2009.5371730","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371730","url":null,"abstract":"The extremely high resolution of Ultra-Wideband (UWB) signal in time domain and range measurement precision makes it advantageous in precise positioning. The algorithm based on averaging TOA is effective in reducing error in the precision positioning of stationary targets. But for moving targets, severe error will be introduced which makes the method unusable. This paper presents two means to improve the performance of the original algorithm in dealing with moving targets, using radial velocity compensation and triangulation velocity compensation. The precision has been improved by 40% via triangulation velocity compensation method in the bistatic 2-dimension (2D) simulation.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127962083","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 new method of detecting cycles in Tanner graph of LDPC codes 一种LDPC码Tanner图循环检测的新方法
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371660
Bo Li, G. Wang, Hongjuan Yang
{"title":"A new method of detecting cycles in Tanner graph of LDPC codes","authors":"Bo Li, G. Wang, Hongjuan Yang","doi":"10.1109/WCSP.2009.5371660","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371660","url":null,"abstract":"To improve the performance of LDPC codes, we should detect and eliminate cycles in Tanner graph of the parity-check matrix when we make LDPC codes. We improved a logic algebraic algorithm in computing entire routes between the nodes of a communication network, and found a new method of detecting cycles in Tanner graph of LDPC codes. This method applied the logic algebraic calculation rules. First transformed the parity-check matrix and then constructed the relative matrix of the Tanner graph. Through integrating and deleting rows of relative matrix and correcting some elements, this new algorithm can detect all the cycles in a Tanner graph of LDPC codes which code length is n and information bits number is k, just needing integrating and deleting n-1 times and correcting k times. The calculation steps of the algorithm is shown detailed by an (8, 4, 2) LDPC example and its correctness have been validated.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127977406","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
Reliable onset detection scheme for singing voices based on enhanced difference filtering and combined features 基于增强差分滤波和组合特征的可靠的歌唱声音起始检测方案
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371537
Bor-Shen Lin, Hsin-Jung Huang
{"title":"Reliable onset detection scheme for singing voices based on enhanced difference filtering and combined features","authors":"Bor-Shen Lin, Hsin-Jung Huang","doi":"10.1109/WCSP.2009.5371537","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371537","url":null,"abstract":"Onset detection for singing voices is an important but difficult problem for note segmentation in music search or music transcription. It is primarily because the spectral envelops as well as the shapes of vocal tracks vary frequently so as to produce fake peaks in the detection function that degrade the precision rate for onset detection. This paper proposes an onset detection scheme which utilizes the enhanced difference filter to improve the detection function by accentuating the peaks at the uprising margins of energy, and the adjustment approach for onset locations to compensate the peak shifts. A binary classifier based on GMM is further used to combine relevant features of adjacent peaks so as to make more reliable final decisions. The proposed scheme can improve the detection performance significantly, and achieve 78.9% of precision rate and 76% of recall rate at 77.5% of F-measure on the QBSH database.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129130857","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
Non-linear network coding in two-way relaying discrete channels 双向中继离散信道中的非线性网络编码
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371759
T. Koike-Akino, P. Larsson, P. Popovski, V. Tarokh
{"title":"Non-linear network coding in two-way relaying discrete channels","authors":"T. Koike-Akino, P. Larsson, P. Popovski, V. Tarokh","doi":"10.1109/WCSP.2009.5371759","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371759","url":null,"abstract":"In this paper, we present optimal network coding which can maximize achievable rate region in two-way relaying discrete channels, where there are two communicating nodes and one relaying node. We focus on a low-complexity relaying protocol termed the detect-and-forward (DtF) scheme, in which the relaying node does not require channel decoding but detection. We first analyze the achievable rate region of any digital network coding function including non-linear types. We then search for the optimal network code in favor of maximizing two kinds of performance measures: the sum rate and the product rate. For high SNR regimes, linear network codes like the exclusive-or (XOR) function can offer the maximum-achievable rate region. Whereas, for low SNR regimes, it is verified that non-linear network codes like the negate-or (NOR) function can outperform linear codes due to the effect of error occurrence at the intermediate relaying node.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130458849","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}
引用次数: 4
A probabilistic model for lifetime measurement in privacy-aware sensor networks 隐私感知传感器网络寿命测量的概率模型
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371437
Xice Sun, Zhi Wang, Honglong Chen, W. Lou
{"title":"A probabilistic model for lifetime measurement in privacy-aware sensor networks","authors":"Xice Sun, Zhi Wang, Honglong Chen, W. Lou","doi":"10.1109/WCSP.2009.5371437","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371437","url":null,"abstract":"Considering the resource-constraint metrics in sensor networks, it is necessary to develop the energy-efficient techniques to save the limited power while applying the security and privacy protection mechanisms during the data transmission. In this paper, we propose to define the probabilistic lifetime model of a single sensor node to measure the energy-efficient solutions towards the privacy-aware sensor networks. In addition, we tailor our model with three typical stochastic distributions in terms of typical application scenarios in reality. Finally, the probabilistic network lifetime model is formally defined and the experimental simulations validate our theoretical results, which shows its availability in sensor networks.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130688999","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 novel algorithm of gait recognition 一种新的步态识别算法
2009 International Conference on Wireless Communications & Signal Processing Pub Date : 2009-12-31 DOI: 10.1109/WCSP.2009.5371505
Haitao Liu, Yang Cao, Zengfu Wang
{"title":"A novel algorithm of gait recognition","authors":"Haitao Liu, Yang Cao, Zengfu Wang","doi":"10.1109/WCSP.2009.5371505","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371505","url":null,"abstract":"Rapidly development in the realm of biometrics in recent years results in the unprecedented growth with the number of researchers and interesters. As one of the biometrics, gait recognition has many advantages such as from a distance, lower quality video, hard to disguised comparing with others. However, nearly all studies on gait recognition are 2D methods based on analysis of image sequences captured by a monocular camera. This paper presents a novel 3D method for automatic gait recognition by analyzing the changes of a 1D silhouette signal. Binarized silhouette of a moving individual is firstly achieved. Secondly contour is extracted for next stereo matching. Afterward 3D contour is obtained through a step of contour based stereo matchin. Then, stereo silhouette vector (SSV) is extracted from 3D contour and transformed to a 1D silhouette signal as the stereo gait feature (SGF). K-L transform is applied for reducing the dimensionality of feature and the complexity of computing. Finally, kNN and NN are applied to gait classification and recognition. A stereo gait database named PRLAB is established for gait recognition based on stereo vision. Experimental results on PRLAB showed the efficiency and robustness of our algorithm.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116828553","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}
引用次数: 10
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学术官方微信