Journal of China Universities of Posts and Telecommunications最新文献

筛选
英文 中文
Modular handover algorithm for 5G HetNets with comprehensive load index 具有综合负载指标的5G HetNets模块化切换算法
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60199-7
Li Danyang, Zhang Zhizhong, Gao Yiyi
{"title":"Modular handover algorithm for 5G HetNets with comprehensive load index","authors":"Li Danyang,&nbsp;Zhang Zhizhong,&nbsp;Gao Yiyi","doi":"10.1016/S1005-8885(17)60199-7","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60199-7","url":null,"abstract":"<div><p>Most existing handover decision system (HDS) designs are monolithic, resulting in high computational cost and unbalance of overall network. A novel modular handover algorithm with a comprehensive load index for the 5th generation (5G) heterogeneous networks (HetNets) is proposed. In this paper, the handover parameters, serving as the basis for handover, are classified into network's quality of service (QoS) module, user preference (UP) module and degree of satisfaction (DS) module according to the new modular HDS design. To optimize switching process, the comprehensive network load index is deduced by using triangle module fusion operator. With respect to the existing handover algorithm, the simulation results indicate that the proposed algorithm can reduce the handover frequency and maintain user satisfaction at a higher level. Meanwhile, due to its block calculation, it can bring about 1.4 s execution time improvement.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 57-65"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60199-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214249","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
Location aided probabilistic broadcast algorithm for mobile Ad-hoc network routing 移动Ad hoc网络路由的位置辅助概率广播算法
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60200-0
Bai Yuan , An jie , Zhang Huibing
{"title":"Location aided probabilistic broadcast algorithm for mobile Ad-hoc network routing","authors":"Bai Yuan ,&nbsp;An jie ,&nbsp;Zhang Huibing","doi":"10.1016/S1005-8885(17)60200-0","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60200-0","url":null,"abstract":"<div><p>On-demand routing protocols are widely used in mobile Ad-hoc network (MANET). Flooding is an important dissemination scheme in routing discovering of on-demand routing protocol. However, in high-density MANET redundancy flooding packets lead to dramatic deterioration of the performance which calls broadcast storm problem (BSP). A location-aided probabilistic broadcast (LAPB) algorithm for routing in MANET is proposed to reduce the number of routing packets produced by flooding in this paper. In order to reduce the redundancy packets, only nodes in a specific area have the probability, computed by location information and neighbor knowledge, to propagate the routing packets. Simulation results demonstrate that the LAPB algorithm can reduce the packets and discovery delay (DD) in the routing discovery phase.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 66-71"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60200-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72254024","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
Multiple CRC-aided variable successive cancellation list decoder of polar codes 极性码的多CRC辅助可变逐次消除列表解码器
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60202-4
Cao Miao , Zhao Shuang , Zhao Shengmei
{"title":"Multiple CRC-aided variable successive cancellation list decoder of polar codes","authors":"Cao Miao ,&nbsp;Zhao Shuang ,&nbsp;Zhao Shengmei","doi":"10.1016/S1005-8885(17)60202-4","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60202-4","url":null,"abstract":"<div><p>In order to change the path candidates, reduce the average list size, and make more paths pass cyclic redundancy check (CRC), multiple CRC-aided variable successive cancellation list (SCL) decoding algorithm is proposed. In the decoding algorithm, the whole unfrozen bits are divided into several parts and each part is concatenated with a corresponding CRC code, except the last part which is concatenated with a whole unfrozen CRC code. Each CRC detection is performed, and only those satisfying each part CRC become the path candidates. A variable list is setup for each part to reduce the time complexity. Variable list size is setup for each part to reduce the time complexity until one survival path in each part can pass its corresponding CRC. The results show that the proposed algorithm can reduce the average list size, and the frame error rate (FER) performance, and has a better performance with the increase of the part number.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 83-88"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60202-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214302","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
Compressed sensing method for human activity recognition using tri-axis accelerometer on mobile phone 基于手机三轴加速度计的人体活动识别压缩传感方法
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60196-1
Song Hui, Wang Zhongmin
{"title":"Compressed sensing method for human activity recognition using tri-axis accelerometer on mobile phone","authors":"Song Hui,&nbsp;Wang Zhongmin","doi":"10.1016/S1005-8885(17)60196-1","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60196-1","url":null,"abstract":"<div><p>The diversity in the phone placements of different mobile users' dailylife increases the difficulty of recognizing human activities by using mobile phone accelerometer data. To solve this problem, a compressed sensing method to recognize human activities that is based on compressed sensing theory and utilizes both raw mobile phone accelerometer data and phone placement information is proposed. First, an over-complete dictionary matrix is constructed using sufficient raw tri-axis acceleration data labeled with phone placement information. Then, the sparse coefficient is evaluated for the samples that need to be tested by resolving L1 minimization. Finally, residual values are calculated and the minimum value is selected as the indicator to obtain the recognition results. Experimental results show that this method can achieve a recognition accuracy reaching 89.86%, which is higher than that of a recognition method that does not adopt the phone placement information for the recognition process. The recognition accuracy of the proposed method is effective and satisfactory.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 31-37, 71"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60196-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214298","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
Multi-band microwave photonic satellite repeater scheme employing intensity Mach-Zehnder modulators 采用强度Mach-Zehnder调制器的多波段微波光子卫星转发器方案
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60203-6
Yin Jie , Dong Tao , Zhang Bin , Hao Yan , Cao Guixing , Cheng Zijing , Xu Kun , Zhou Yue , Dai Jian
{"title":"Multi-band microwave photonic satellite repeater scheme employing intensity Mach-Zehnder modulators","authors":"Yin Jie ,&nbsp;Dong Tao ,&nbsp;Zhang Bin ,&nbsp;Hao Yan ,&nbsp;Cao Guixing ,&nbsp;Cheng Zijing ,&nbsp;Xu Kun ,&nbsp;Zhou Yue ,&nbsp;Dai Jian","doi":"10.1016/S1005-8885(17)60203-6","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60203-6","url":null,"abstract":"<div><p>To solve the satellite repeater's flexible and wideband frequency conversion problem, we propose a novel microwave photonic repeater system, which can convert the upload signal's carrier to six different frequencies. The scheme employs one 20 GHz bandwidth dual-drive Mach-Zehnder modulator (MZM) and two 10 GHz bandwidth MZMs. The basic principle of this scheme is filtering out two optical sidebands after the optical carrier suppression (OCS) modulation and combining two sidebands modulated by the input radio frequency (RF) signal. This structure can realize simultaneous multi-band frequency conversion with only one frequency-fixed microwave source and prevent generating harmful interference sidebands by using two corresponding optical filters after optical modulation. In the simulation, one C-band signal of 6 GHz carrier can be successfully converted to 12 GHz (Ku-band), 28 GHz, 34 GHz, 40 GHz, 46 GHz (Ka-band) and 52 GHz (V-band), which can be an attractive method to realize multi-band microwave photonic satellite repeater. Alternatively, the scheme can be configured to generate multi-band local oscillators (LOs) for widely satellite onboard clock distribution when the input RF signal is replaced by the internal clock source.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 89-95"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60203-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214301","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
GrabCut image segmentation algorithm based on structure tensor 基于结构张量的GrabCut图像分割算法
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60197-3
Zhang Yong , Yuan Jiazheng , Liu Hongzhe , Li Qing
{"title":"GrabCut image segmentation algorithm based on structure tensor","authors":"Zhang Yong ,&nbsp;Yuan Jiazheng ,&nbsp;Liu Hongzhe ,&nbsp;Li Qing","doi":"10.1016/S1005-8885(17)60197-3","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60197-3","url":null,"abstract":"<div><p>This paper attempts to present an interactive color natural images segmentation method. This method extracts the feature of images by using the nonlinear compact structure tensor (NCST) and then uses GrabCut method to obtain the segmentation. This method not only realizes the non-parametric fusion of texture information and color information, but also improves the efficiency of the calculation. Then, the improved GrabCut algorithm is used to evaluate the foreground target segmentation. In order to calculate the simplicity and efficiency, this paper also extends the Gaussian mixture model (GMM) constructed base on the GrabCut to the tensor space, and uses the Kullback-Leibler (KL) divergence instead of the usual Riemannian geometry. Lastly, an iteration convergence criterion is proposed to reduce the time of the iteration of GrabCut algorithm dramatically with satisfied segmentation accuracy. After conducting a large number of experiments on synthetic texture images and natural images, the results demonstrate that this method has a more accurate segmentation effect.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 38-47"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60197-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214253","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
Distributed data storage solution under sink failures in wireless sensor networks 无线传感器网络汇聚故障下的分布式数据存储解决方案
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60201-2
Wang Jun, Yi Qiong, Wang Yue, Jia Yingying
{"title":"Distributed data storage solution under sink failures in wireless sensor networks","authors":"Wang Jun,&nbsp;Yi Qiong,&nbsp;Wang Yue,&nbsp;Jia Yingying","doi":"10.1016/S1005-8885(17)60201-2","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60201-2","url":null,"abstract":"<div><p>In challenging environment, sensory data must be stored inside the network in case of sink failures, we need to redistribute overflowing data items from the depleted storage source nodes to sensor nodes with available storage space and residual energy. We design a distributed energy efficient data storage algorithm named distributed data preservation with priority (D<sup>2</sup>P<sup>2</sup>). This algorithm takes both data redistribution costs and data retrieval costs into account and combines these two problems into a single problem. D<sup>2</sup>P<sup>2</sup> can effectively realize data redistribution by using cooperative communication among sensor nodes. In order to solve the redistribution contention problem, we introduce the concept of data priority, which can avoid contention consultations between source nodes and reduce energy consumption. Finally, we verify the performance of the proposed algorithm by both theory and simulations. We demonstrate that D<sup>2</sup>P<sup>2</sup>'s performance is close to the optimal centralized algorithm in terms of energy consumption and shows superiority in terms of data preservation time.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 72-82, 102"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60201-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214250","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
Research on formalization of efficient query application problems with compound condition in software development 软件开发中具有复合条件的高效查询应用问题的形式化研究
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60195-X
Yang Yuchen , Wang Xiaofang , Yin Guisheng
{"title":"Research on formalization of efficient query application problems with compound condition in software development","authors":"Yang Yuchen ,&nbsp;Wang Xiaofang ,&nbsp;Yin Guisheng","doi":"10.1016/S1005-8885(17)60195-X","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60195-X","url":null,"abstract":"<div><p>This paper provides a formalized definition of the application problem of compound condition query (CCQ) and a formal method of applying requirements elicitation based on trace information space derived from trace algebra. With the formalized process of solving the application problem of CCQ, formal requirements specification of application of CCQ is given, a formalized and automatic mapping of the results of requirements elicitation to the formal requirements specification is performed, the software system model and the application code are developed. Through a sample application of comprehensive query on housing information, the feasibility of formalized and automatic software development for the application problem of CCQ is proved. The result has important implications for the other problems regarding formalization and automatic software development.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 18-30"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60195-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214299","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
Noisy speech emotion recognition using sample reconstruction and multiple-kernel learning 基于样本重构和多核学习的噪声语音情感识别
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60193-6
Jiang Xiaoqing , Xia Kewen , Lin Yongliang , Bai Jianchuan
{"title":"Noisy speech emotion recognition using sample reconstruction and multiple-kernel learning","authors":"Jiang Xiaoqing ,&nbsp;Xia Kewen ,&nbsp;Lin Yongliang ,&nbsp;Bai Jianchuan","doi":"10.1016/S1005-8885(17)60193-6","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60193-6","url":null,"abstract":"<div><p>Speech emotion recognition (SER) in noisy environment is a vital issue in artificial intelligence (AI). In this paper, the reconstruction of speech samples removes the added noise. Acoustic features extracted from the reconstructed samples are selected to build an optimal feature subset with better emotional recognizability. A multiple-kernel (MK) support vector machine (SVM) classifier solved by semi-definite programming (SDP) is adopted in SER procedure. The proposed method in this paper is demonstrated on Berlin Database of Emotional Speech. Recognition accuracies of the original, noisy, and reconstructed samples classified by both single-kernel (SK) and MK classifiers are compared and analyzed. The experimental results show that the proposed method is effective and robust when noise exists.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 1-9, 17"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60193-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72254026","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}
引用次数: 12
Blind interference detection and recognition for the multi-carrier signal 多载波信号的盲干扰检测与识别
Journal of China Universities of Posts and Telecommunications Pub Date : 2017-04-01 Epub Date: 2017-07-17 DOI: 10.1016/S1005-8885(17)60198-5
Zhang Xing, Hu Jianhao
{"title":"Blind interference detection and recognition for the multi-carrier signal","authors":"Zhang Xing,&nbsp;Hu Jianhao","doi":"10.1016/S1005-8885(17)60198-5","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60198-5","url":null,"abstract":"<div><p>For the interference hidden in the expected multi-carrier signal, this paper proposes a novel detection and recognition algorithm. The algorithm cannot only detect the single-carrier interference (SCI) by the high-order cumulant, but also finds the multi-carrier signal based on spectrum character. Besides, the algorithm can distinguish the modulation types of the SCI. The algorithm does not depend on any prior knowledge and data-aided, which is propitious to practical applications. The analysis and simulation results demonstrate that the proposed algorithm is effective.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 48-56"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60198-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214254","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学术官方微信
小红书