{"title":"Blind DCTF-based estimation of carrier frequency offset for RF fingerprint extraction","authors":"Jiabao Yu, A. Hu, Linning Peng","doi":"10.1109/WCSP.2016.7752444","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752444","url":null,"abstract":"In this paper, we propose a novel algorithm for blind estimation of carrier frequency offset (CFO) in MPSK receivers by using differential constellation trace figures (DCTFs) with application to radio frequency (RF) fingerprint extraction. Due to the quasi-symmetry property of DCTF, carrier frequency offset can be estimated from the orientation of the unique symmetric axis of DCTF through minimizing DCTF's asymmetric energy term. In contrast to known algorithms, symbol rate and matched filter are not required in this algorithm while more samples are needed to generate DCTFs. Besides, the proposed algorithm can cope with a wide CFO range as large as 1/2M (M is the modulation order) of the sampling rate. Simulation results show that this algorithm performs well at high and medium SNRs in the presence of AWGN channels or flat Ricean-fading channels.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127631992","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}
M. D. Amentie, Min Sheng, Jiongjiong Song, Junyu Liu
{"title":"Minimum delay guaranteed cooperative device-to-device caching in 5G wireless networks","authors":"M. D. Amentie, Min Sheng, Jiongjiong Song, Junyu Liu","doi":"10.1109/WCSP.2016.7752501","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752501","url":null,"abstract":"In wireless networks, the technique of caching contents cooperatively in user equipments (UEs) and base stations (BSs) enables to improve the performance of data access. In this paper, we consider cluster based cooperative device-to-device (D2D) caching enabled network and formulate the caching problem to minimize content retrieving delay. To achieve this, we develop a content caching and replacement scheme by considering the limited storage capacity of UEs, content popularity, and content access process in the network. As a result, our scheme has shown the minimal delay by caching popular contents on UEs and BS with delivering requested contents at smaller average request hops. Moreover, we evaluate our approach with other caching schemes based on parameters as the number of UEs joining the cluster, content popularity and the number of edge UE in a cluster. Simulation results show that the proposed caching scheme significantly outperforms the other schemes.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126473312","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}
{"title":"Efficient design of FIR filters using common subexpression elimination","authors":"Hui Liu, A. Jiang","doi":"10.1109/WCSP.2016.7752701","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752701","url":null,"abstract":"In this paper, a novel common sub-expression elimination (CSE) method is presented for the design of linear phase finite impulse response (FIR) filters with low hardware cost. Based on weight criteria, this method eliminates the common sub-expressions of unequal weight with a transposed direct structure. By relaxing the word length while limiting its search range, the least cost coefficient sets can be generated. In order to find the optimal common sub-expressions, a matrix search process with low complexity is introduced. Compared the V-CSE method, the proposed method saves about 11.3% to 13.2% of adders on average.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"160 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126229050","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}
{"title":"Study of connectivity probability based on cluster in vehicular Ad Hoc networks","authors":"Junhui Zhao, Yan Chen, Yi Gong","doi":"10.1109/WCSP.2016.7752611","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752611","url":null,"abstract":"To provide a more practical analysis for performance of the VANETs (vehicular ad hoc networks), we propose a novel analysis model based on clustering. Because of the low-density deployment of the vehicles which equipped with VANET, and the effect of vehicular mobility, in the real traffic scenario, moving vehicles are divided into clusters. The proposed analysis model takes full account of the vehicles mobility and the loss of channel, then, makes contract with the classical system model, i.e., unit disk model and log-normal shadowing model. The connectivity probability of the model is studied based on cluster in two process: forwarding process and catch-up process, the two process are discussed in time slots of equal length. In this paper, some factors are also considered, such as follows: vehicle density, one hop transmission range, propagation distance, distribution of vehicles, and minimum safety distance between vehicles. The simulations validate the performance of our analytical model.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126429914","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}
{"title":"Compressed uncoded screen content video transmission in bandwidth-constrained wireless networks","authors":"Zexue Li, Hanchen Lu, Yang-Jing Wu","doi":"10.1109/WCSP.2016.7752608","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752608","url":null,"abstract":"Recently, uncoded transmission schemes based on SoftCast have aroused great interest of the academia. However, the existing work mainly focuses on the natural camera-captured video. Moreover, the bandwidth compression case of these schemes has not been well studied so far, which usually occurs in bandwidth-constrained wireless environments. In this paper, we focus on these issues by proposing a Compressed Uncoded Video Transmission System (CUVTS) based on Compressed Sensing (CS) toward screen content video applications. The main work of CUVTS is leveraging CS to compress the coefficient blocks with continuous compression ratios, which is more efficient than the “block dropping” strategy in SoftCast. Motion-Compensated Temporal Filtering (MCTF) and Discrete Wavelet Transform (DWT) are firstly applied to remove the data redundancy and promote the data compressibility. Then block-based CS is applied to the coefficient blocks with diverse compression ratios determined by the bandwidth allocation component with block importance considered. Finally, optimal power allocation problem is formulated and solved to minimize the transmission distortion. In various channel SNR and bandwidth budget cases, simulation results show that CUVTS outperforms SoftCast with average of 0.79dB up to 8.33dB gain in Peak Signal-to-Noise Ratio (PSNR).","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487592","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}
{"title":"Hybrid iterative decoding for LDPC codes based on gradient descent bit-flipping algorithm","authors":"Hua Li, Hong Ding, Linhua Zheng","doi":"10.1109/WCSP.2016.7752445","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752445","url":null,"abstract":"Gradient descent bit-flipping (GDBF) decoding for low-density parity-check (LDPC) codes has gained great attentions because of low complexity and relatively good performance. However, the performance of the GDBF decoding is still much poorer than that of the MS algorithm. To further improve the performance, the iterative decoding process is introduced to GDBF decoding in this paper. At the end of each iteration, the latest information is used to update the reliability of the flipped bit, by which its reliability is greatly improved. Simulation results indicate that the proposed algorithm has about 0.4 dB performance gains compared to GDBF. Meanwhile, there is small computational complexity increased.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125654670","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}
{"title":"Propagator-based algorithm for localization of coherently distributed sources","authors":"Renzheng Cao, Xiaofei Zhang, F. Gao","doi":"10.1109/WCSP.2016.7752674","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752674","url":null,"abstract":"In this work, the direction finding of coherently distributed (CD) sources using a uniform linear array (ULA) is investigated. Conventional DSPE algorithm for localization of CD sources requires an extensive two-dimensional search of nominal DOAs and angular spreads. The proposed algorithm exploits the propagator, which is a linear operator that can be easily estimated from the received data, to identify the subspace. Then it constructs a decoupled one-dimensional spectrum estimator for nominal DOAs with the aid of the characteristic of ULA and the rank reduction criterion. The proposed algorithm can dispense the high-complexity two-dimensional search and the eigen-decomposition operation. Hence, it exhibits an advantage of low complexity. When compared to the DSPE and CD-GESPRIT algorithms, the proposed algorithm has close estimation accuracy. Numerical simulation results demonstrate the performance and improvement of the proposed algorithm.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121955277","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}
Yuan Wu, Jianchao Zheng, Kuanyang Guo, L. Qian, Xuemin Shen, Yueming Cai
{"title":"Secrecy guaranteed optimal traffic offloading via dual-connectivity in small cell networks","authors":"Yuan Wu, Jianchao Zheng, Kuanyang Guo, L. Qian, Xuemin Shen, Yueming Cai","doi":"10.1109/WCSP.2016.7752634","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752634","url":null,"abstract":"We investigate mobile user's (MU's) uplink traffic offloading based on the new paradigm of small-cell dual-connectivity (DC) that allows a MU to simultaneously offload traffic to a small-cell base station (sBS) and send data to a macro base station (mBS). In spite of the benefit of reducing the MU's power consumption, traffic offloading via DC leads to a security issue, i.e., a malicious node close to the sBS might intentionally eavesdrop the MU's offloaded data by receiving the MU's radio signal. Therefore, we formulate an optimization problem that jointly determines the MU's traffic scheduling and transmit-powers to the sBS and mBS, with the objective of minimizing the MU's total power consumption, while guaranteeing both the MU's secrecy requirement and traffic demand requirement. To solve the formulated joint optimization problem, we propose an effective layered-algorithm (which exploits the hidden convexity of the problem) to solve it and compute the MU's optimal offloading solution. Numerical results validate the efficiency of our algorithm and the significant influences of the MU's secrecy requirement.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122242422","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}
{"title":"Performance limits of passive localization with randomly distributed transmitters and receivers","authors":"Yifeng Xiong, Siqi Han, Qiongzhi Wu","doi":"10.1109/WCSP.2016.7752622","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752622","url":null,"abstract":"This paper proposes lower bounds for the error of passive localization in wireless networks, where both the transmitters and receivers are randomly distributed. By modelling the locations of nodes as instances of homogeneous Poisson point processes, performance limits under different channel conditions as well as network structures are investigated and presented in closed form. Numerical results indicate that the proposed performance limits can well reflect the actual localization accuracy, and illustrate how the performance is affected by various network parameters.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121630351","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}
Hao Wang, Tong Lin, Yumei Wang, Lin Zhang, Chunchang Tian
{"title":"EPEC: An Error Position Estimating Coding scheme in wireless networks","authors":"Hao Wang, Tong Lin, Yumei Wang, Lin Zhang, Chunchang Tian","doi":"10.1109/WCSP.2016.7752667","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752667","url":null,"abstract":"In wireless networks, determining the error bit positions within a packet at the receiver can improve the wireless retransmission efficiency in wireless communications. In this paper, we propose an Error Position Estimating Coding (EPEC) scheme based on Error Estimating Coding (EEC). Specifically, we divide data bits into several groups and indicate the group number individually to implement error position estimating at the receiver. Moreover, we encodes Cyclic Redundancy Check (CRC) with the initial EEC to reduce the leak probability of error position detection. Experimental results show that the error position estimation accuracy is nearly 100% when bit error rate (BER) is lower than 10-3. And the bandwidth for data retransmission saved by EPEC is up to 87% on average. In addition, the miss rate of EPEC is almost 0% while EEC is about 0.06%.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115854186","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}