Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555707
Yuelin Du, Jiaming Liu, Mingkai Chen, Lei Wang, B. Zheng
Due to extreme confidentiality and low computational load, physical-layer key has set off a revolution in security encryption. However, existing physical layer-key key researches rarely pay attention to the potential value of speed in random source selection. In this paper, we take the mobility characteristics of D2D devices as a random source to design physical-layer key. First of all, we establish a uniform scattering environment model in the cellular network and analyze the impact of D2D device’s speed on the parameters of the wireless channel. On this basis, we propose a mobility-based physical-layer key generation scheme and use Gaussian random vector for key extraction and analysis. Then, we analyze the performance of our scheme, derive the expressions such as key capacity and average key length(ASKL), and compare them with existing solutions through simulation. Finally, the relative results confirm the theoretical derivation and the advantages of our scheme.
{"title":"Mobility-based Physical-layer Key Generation Scheme for D2D Communications Underlaying Cellular Network","authors":"Yuelin Du, Jiaming Liu, Mingkai Chen, Lei Wang, B. Zheng","doi":"10.1109/WCSP.2018.8555707","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555707","url":null,"abstract":"Due to extreme confidentiality and low computational load, physical-layer key has set off a revolution in security encryption. However, existing physical layer-key key researches rarely pay attention to the potential value of speed in random source selection. In this paper, we take the mobility characteristics of D2D devices as a random source to design physical-layer key. First of all, we establish a uniform scattering environment model in the cellular network and analyze the impact of D2D device’s speed on the parameters of the wireless channel. On this basis, we propose a mobility-based physical-layer key generation scheme and use Gaussian random vector for key extraction and analysis. Then, we analyze the performance of our scheme, derive the expressions such as key capacity and average key length(ASKL), and compare them with existing solutions through simulation. Finally, the relative results confirm the theoretical derivation and the advantages of our scheme.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131396604","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}
Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555628
Yan Zhao, Yue Xiao, Ping Yang, Binhong Dong, Xia Lei, W. Xiang
In this paper, a low-complexity vector-by-vector (VV) based minimum mean square error (MMSE) detector is proposed in the presence of carrier frequency offset (CFO) in spatial modulation orthogonal frequency division multiplexing (SM-OFDM) systems. Its main benefit lies in that the CFO matrix in the proposed detector is considered as a component of the channel transfer matrix. Furthermore, the SM symbol is treated as an entire vector when performing soft interference cancellation (SIC) in the proposed MMSE detector. Finally, the structure of the CFO matrix is exploited in order to strike a flexible trade-off between complexity and performance. Simulation results demonstrate that the proposed detector can provide considerable performance improvement compared to conventional detectors at a moderate complexity cost in both uncoded and coded SM systems.
{"title":"MMSE-based Detector for Spatial Modulation OFDM Systems with Multiple CFOs","authors":"Yan Zhao, Yue Xiao, Ping Yang, Binhong Dong, Xia Lei, W. Xiang","doi":"10.1109/WCSP.2018.8555628","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555628","url":null,"abstract":"In this paper, a low-complexity vector-by-vector (VV) based minimum mean square error (MMSE) detector is proposed in the presence of carrier frequency offset (CFO) in spatial modulation orthogonal frequency division multiplexing (SM-OFDM) systems. Its main benefit lies in that the CFO matrix in the proposed detector is considered as a component of the channel transfer matrix. Furthermore, the SM symbol is treated as an entire vector when performing soft interference cancellation (SIC) in the proposed MMSE detector. Finally, the structure of the CFO matrix is exploited in order to strike a flexible trade-off between complexity and performance. Simulation results demonstrate that the proposed detector can provide considerable performance improvement compared to conventional detectors at a moderate complexity cost in both uncoded and coded SM systems.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131494950","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}
Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555572
Xiaodong Xu, K. Dong, Junyu Yao, Jiaxi Zhou
Global navigation satellite system (GNSS) receivers are vulnerable to hostile interference threads, such as jamming and spoofing. A novel low-complexity scheme based on multistage wiener filter(MWF) based space-time adaptive processing (STAP) is proposed to suppress hybrid interference by using the cross spectral self-coherence property. An orthogonal complement space of spoofing signals is estimated to constructed auxiliary weight vector. Simultaneously, spoofing number is also estimated with minimum description length (MDL) criterion and spatial spectrum. The primary weight vector is built based on the relationship between both channels derived with minimum mean square error (MMSE) criterion. Analytical results and some numerical examples are presented to demonstrate the effectiveness of the proposed scheme in terms of beam pattern and the output signal-to-interference-plus-noise ratio (SINR).
{"title":"A Low-Complexity Hybrid Interference Suppression Scheme Using Spectral Self-Coherence Property For GNSS Receivers","authors":"Xiaodong Xu, K. Dong, Junyu Yao, Jiaxi Zhou","doi":"10.1109/WCSP.2018.8555572","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555572","url":null,"abstract":"Global navigation satellite system (GNSS) receivers are vulnerable to hostile interference threads, such as jamming and spoofing. A novel low-complexity scheme based on multistage wiener filter(MWF) based space-time adaptive processing (STAP) is proposed to suppress hybrid interference by using the cross spectral self-coherence property. An orthogonal complement space of spoofing signals is estimated to constructed auxiliary weight vector. Simultaneously, spoofing number is also estimated with minimum description length (MDL) criterion and spatial spectrum. The primary weight vector is built based on the relationship between both channels derived with minimum mean square error (MMSE) criterion. Analytical results and some numerical examples are presented to demonstrate the effectiveness of the proposed scheme in terms of beam pattern and the output signal-to-interference-plus-noise ratio (SINR).","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132221824","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}
The densification of wireless networks via small cells is an effective way to improve spectral efficiency but, on the other hand, also causes an increase of power consumption. In this paper, we consider the energy efficient beamforming design for a heterogeneous small cell network, where a number of multi-antenna small base stations (SBSs) share the spectrum resource of a macro base station (MBS). The design goal is to improve the energy efficiency of the whole network and meanwhile provide quality-of-service (QoS) protection for macro cell communications, which generally have higher priorities. We propose a novel efficient method to address the formulated non-convex energy efficient beamforming design problem. Simulation results show that the proposed beamforming design can dramatically enhance the energy efficiency of the whole network.
{"title":"Energy Efficient Beamforming in Heterogeneous Small Cell Networks","authors":"Zeli Lao, Zhaohua Lu, Jiaheng Wang, Yongming Huang, Leixin Han, Fusheng Zhu, Licheng Zhao","doi":"10.1109/WCSP.2018.8555702","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555702","url":null,"abstract":"The densification of wireless networks via small cells is an effective way to improve spectral efficiency but, on the other hand, also causes an increase of power consumption. In this paper, we consider the energy efficient beamforming design for a heterogeneous small cell network, where a number of multi-antenna small base stations (SBSs) share the spectrum resource of a macro base station (MBS). The design goal is to improve the energy efficiency of the whole network and meanwhile provide quality-of-service (QoS) protection for macro cell communications, which generally have higher priorities. We propose a novel efficient method to address the formulated non-convex energy efficient beamforming design problem. Simulation results show that the proposed beamforming design can dramatically enhance the energy efficiency of the whole network.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"332 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134429163","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}
Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555880
Zhang Tao, Hongyan Li, Shun Zhang, Peng Wang, Jiandong Li
The multi-commodity flow problem plays an important role in network optimization, routing and service scheduling. With the network partitioning and intermittent connectivity, the commodity flows in time-varying networks are different from that over the static networks. As an NP-hard problem, existing works can only obtain suboptimal results on maximizing the multi-commodity flow of dynamic networks, due to the time variant network characteristics and coupling commodity relationships. In this paper, we propose a graph-based flow algorithm to solve the maximum two-commodity flow problem over the time-varying networks. Specially, we exploit storage time aggregated graph (STAG) to model the time variant network topology, link contact and node buffer resources. And through analyzing the relationship between two different commodities, we simplify the coupling two-commodity flow problem as the two single-commodity flow ones. As such, a STAG-based dynamic combined flow algorithm is proposed to maximize the two-commodity flow. Finally, we demonstrate the performance of the proposed algorithm through simulations.
{"title":"STAG-based Dynamic Two-commodity Maximum Flow Algorithm for Time-varying Networks","authors":"Zhang Tao, Hongyan Li, Shun Zhang, Peng Wang, Jiandong Li","doi":"10.1109/WCSP.2018.8555880","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555880","url":null,"abstract":"The multi-commodity flow problem plays an important role in network optimization, routing and service scheduling. With the network partitioning and intermittent connectivity, the commodity flows in time-varying networks are different from that over the static networks. As an NP-hard problem, existing works can only obtain suboptimal results on maximizing the multi-commodity flow of dynamic networks, due to the time variant network characteristics and coupling commodity relationships. In this paper, we propose a graph-based flow algorithm to solve the maximum two-commodity flow problem over the time-varying networks. Specially, we exploit storage time aggregated graph (STAG) to model the time variant network topology, link contact and node buffer resources. And through analyzing the relationship between two different commodities, we simplify the coupling two-commodity flow problem as the two single-commodity flow ones. As such, a STAG-based dynamic combined flow algorithm is proposed to maximize the two-commodity flow. Finally, we demonstrate the performance of the proposed algorithm through simulations.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128728707","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}
Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555661
Lingling Zhang, Pengcheng Zhu, Jiamin Li
The performance of distributed antenna systems (DASs) will be severely impaired by pilot contamination unless a suitable pilot allocation scheme is utilized. In this paper, we propose an efficient algorithm based on the channel model considering both multipath arriving of angle (AoA) and distance information to mitigate pilot contamination. The normalized mean square error (NMSE) of the channel estimation and downlink ergodic rate are employed as metrics to measure the performance of the proposed scheme through simulation. Then, complexities of various algorithms are discussed as well. Under the comprehensive consideration of both simulation results and complexity analysis, the proposed strategy shows great performance with low complexity.
{"title":"Pilot Decontamination based on Pilot Allocation for Large-Scale Distributed Antenna Systems","authors":"Lingling Zhang, Pengcheng Zhu, Jiamin Li","doi":"10.1109/WCSP.2018.8555661","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555661","url":null,"abstract":"The performance of distributed antenna systems (DASs) will be severely impaired by pilot contamination unless a suitable pilot allocation scheme is utilized. In this paper, we propose an efficient algorithm based on the channel model considering both multipath arriving of angle (AoA) and distance information to mitigate pilot contamination. The normalized mean square error (NMSE) of the channel estimation and downlink ergodic rate are employed as metrics to measure the performance of the proposed scheme through simulation. Then, complexities of various algorithms are discussed as well. Under the comprehensive consideration of both simulation results and complexity analysis, the proposed strategy shows great performance with low complexity.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"397 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115917233","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}
Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555640
Xiaowei Pang, Zan Li, Xiaoming Chen, Yang Cao, Nan Zhao, Yunfei Chen, Z. Ding
The explosive data traffic and connections in 5G networks require the use of non-orthogonal multiple access (NOMA) to accommodate more users. Unmanned aerial vehicle (UAV) can be exploited with NOMA to improve the situation further. In this paper, we propose a UAV-assisted NOMA network, in which the UAV and base station (BS) cooperate with each other to serve ground users simultaneously. First, the sum rate of the UAV-served users is maximized via alternate user scheduling and UAV trajectory, with its interference to the BS-served users below a threshold. Then, the optimal NOMA precoding vectors are obtained to cancel the interference from the BS to the UAV-served user. Numerical results are provided to evaluate the effectiveness of the proposed algorithms for the hybrid NOMA and UAV network.
{"title":"UAV-Aided NOMA Networks with Optimization of Trajectory and Precoding","authors":"Xiaowei Pang, Zan Li, Xiaoming Chen, Yang Cao, Nan Zhao, Yunfei Chen, Z. Ding","doi":"10.1109/WCSP.2018.8555640","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555640","url":null,"abstract":"The explosive data traffic and connections in 5G networks require the use of non-orthogonal multiple access (NOMA) to accommodate more users. Unmanned aerial vehicle (UAV) can be exploited with NOMA to improve the situation further. In this paper, we propose a UAV-assisted NOMA network, in which the UAV and base station (BS) cooperate with each other to serve ground users simultaneously. First, the sum rate of the UAV-served users is maximized via alternate user scheduling and UAV trajectory, with its interference to the BS-served users below a threshold. Then, the optimal NOMA precoding vectors are obtained to cancel the interference from the BS to the UAV-served user. Numerical results are provided to evaluate the effectiveness of the proposed algorithms for the hybrid NOMA and UAV network.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117038775","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}
Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555923
Zhongkai Zhu, Letian Li, Wuyang Zhou
Unmanned aerial vehicle (UAV) base stations play a significant role in many scenarios like disaster relief and terrestrial traffic offloading. To put UAV base stations into operation, deployment is a key issue to be addressed. Existing works do not take into account different user Quality-of-Service (QoS) requirements in the deployment of multiple unmanned aerial vehicles (UAVs). Therefore, in this paper, we propose a 3D deployment scheme which minimizes the number of UAVs to cover all users with different QoS requirements. First, we derive the relationship between the altitude and coverage of a UAV at different user QoS requirements. Then, we formulate the deployment problem on the basis of the relationship. Next, we propose a 3D UAV deployment algorithm which considers both altitude and horizontal location. Finally, numerical results show that the proposed algorithm can deploy less UAVs to achieve full coverage of all users.
{"title":"QoS-aware 3D Deployment of UAV Base Stations","authors":"Zhongkai Zhu, Letian Li, Wuyang Zhou","doi":"10.1109/WCSP.2018.8555923","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555923","url":null,"abstract":"Unmanned aerial vehicle (UAV) base stations play a significant role in many scenarios like disaster relief and terrestrial traffic offloading. To put UAV base stations into operation, deployment is a key issue to be addressed. Existing works do not take into account different user Quality-of-Service (QoS) requirements in the deployment of multiple unmanned aerial vehicles (UAVs). Therefore, in this paper, we propose a 3D deployment scheme which minimizes the number of UAVs to cover all users with different QoS requirements. First, we derive the relationship between the altitude and coverage of a UAV at different user QoS requirements. Then, we formulate the deployment problem on the basis of the relationship. Next, we propose a 3D UAV deployment algorithm which considers both altitude and horizontal location. Finally, numerical results show that the proposed algorithm can deploy less UAVs to achieve full coverage of all users.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116120057","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}
Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555942
Ming Gan, J. Jiao, Lianqin Li, Shaohua Wu, Qinyu Zhang
Space information networks (SINs) are regarded as an effective solution to enable a broadband access capability in a global coverage and cost-effective manner for massive machine type communications (mMTC). A collision often occurs when two or more user equipments (UEs) select the same pilot in mMTCs, and the received colliding signals are treated as interference. In this paper, we first analyze the problem of pilot collision for uplink mMTCs in SIN, then we investigate the performance of an uncoordinated code domain non-orthogonal multiple access (NOMA) protocol. Moreover, to recover the information in collisions, we adopt successive interference cancellation (SIC) and successive joint decoding (SJD) under a shadowed-Rician fading and path loss satellite-ground channel model, and derive the expressions of the outage probability and maximum system throughput for SIC and SJD, respectively. Numerical and simulation results validate our analytical results and show that the maximum system throughput of SJD is almost double that of SIC.
{"title":"Performance Analysis of Uplink Uncoordinated Code-Domain NOMA for SINs","authors":"Ming Gan, J. Jiao, Lianqin Li, Shaohua Wu, Qinyu Zhang","doi":"10.1109/WCSP.2018.8555942","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555942","url":null,"abstract":"Space information networks (SINs) are regarded as an effective solution to enable a broadband access capability in a global coverage and cost-effective manner for massive machine type communications (mMTC). A collision often occurs when two or more user equipments (UEs) select the same pilot in mMTCs, and the received colliding signals are treated as interference. In this paper, we first analyze the problem of pilot collision for uplink mMTCs in SIN, then we investigate the performance of an uncoordinated code domain non-orthogonal multiple access (NOMA) protocol. Moreover, to recover the information in collisions, we adopt successive interference cancellation (SIC) and successive joint decoding (SJD) under a shadowed-Rician fading and path loss satellite-ground channel model, and derive the expressions of the outage probability and maximum system throughput for SIC and SJD, respectively. Numerical and simulation results validate our analytical results and show that the maximum system throughput of SJD is almost double that of SIC.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114209259","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}
Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555873
Zhen Qin, Jun Tao, L. An, Shuai Yao, Xiao Han
Sparse recursive least squares (RLS) algorithms designed by introducing a sparse penalty (regularization) into the standard RLS cost function, have been proposed in the literature. Compared with the standard RLS, the sparse RLS achieves faster convergence and better performance under sparse systems. Even though, it includes in the updating equation an additional sparse term, which not only incurs extra complexity but also prevents the use of existing fast implementations such as the stable fast transversal filter (SFFT) algorithm. In this paper, we aim to reduce the complexity of the sparse RLS for promoting its practicability. To achieve the goal, the sparse updating term is analyzed and then approximated. With an approximated sparse updating term, the fast implementation is enabled for the sparse RLS, achieving complexity reduction. To demonstrate the feasibility of the proposed scheme, thel0-RLS (as a typical sparse RLS algorithm) coupled with an approximated sparse updating term is proposed, leading to the selective zero-attracting SFTF(SZA-SFTF) algorithm. The SZA-SFTF has a complexity of order $O(11N)$, compared with $O(N^{2})$ for the originall0-RLS. In term of performance, simulations of sparse system identification showed the SZA-SFTF considerably outperforms the standard SFTF and achieves close performance to the exactl0-RLS.
{"title":"Fast Sparse RLS Algorithms","authors":"Zhen Qin, Jun Tao, L. An, Shuai Yao, Xiao Han","doi":"10.1109/WCSP.2018.8555873","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555873","url":null,"abstract":"Sparse recursive least squares (RLS) algorithms designed by introducing a sparse penalty (regularization) into the standard RLS cost function, have been proposed in the literature. Compared with the standard RLS, the sparse RLS achieves faster convergence and better performance under sparse systems. Even though, it includes in the updating equation an additional sparse term, which not only incurs extra complexity but also prevents the use of existing fast implementations such as the stable fast transversal filter (SFFT) algorithm. In this paper, we aim to reduce the complexity of the sparse RLS for promoting its practicability. To achieve the goal, the sparse updating term is analyzed and then approximated. With an approximated sparse updating term, the fast implementation is enabled for the sparse RLS, achieving complexity reduction. To demonstrate the feasibility of the proposed scheme, thel0-RLS (as a typical sparse RLS algorithm) coupled with an approximated sparse updating term is proposed, leading to the selective zero-attracting SFTF(SZA-SFTF) algorithm. The SZA-SFTF has a complexity of order $O(11N)$, compared with $O(N^{2})$ for the originall0-RLS. In term of performance, simulations of sparse system identification showed the SZA-SFTF considerably outperforms the standard SFTF and achieves close performance to the exactl0-RLS.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126142880","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：