In this paper, we study the problem of resource allocation in a cache-enabled software defined cellular network (SDCN) with mobile users, where the SDCN controller has global information of the network and the popular contents that the users request are stored at the content server and cache-enabled small base stations (SBSs). We propose a Markov chain based model to predict the users’ mobility patterns and then use the predicted mobility patterns to determine optimal resource allocation. The mobility prediction and resource allocation problem are jointly formulated as an optimization problem whose goal is to maximize the network throughput. Based on the predicted users’ mobility patterns, a distributed alternating direction method of multipliers (ADMM) is proposed to solve the resource allocation problem. The proposed ADMM algorithm enables the multiple SBSs implement their resource allocation simultaneously and, hence decreases the control overhead of the SDCN controller. Simulation results show that the proposed algorithm achieves up to 9.35% and 33.17% gains in terms of the average throughput compared to the random algorithm and the nearest association with equal allocated resource algorithm.
{"title":"Distributed Resource Allocation for Mobile Users in Cache-Enabled Software Defined Cellular Networks","authors":"Xiangqun Yang, Chunyu Pan, Mingzhe Chen, Changchuan Yin","doi":"10.1109/WCSP.2018.8555613","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555613","url":null,"abstract":"In this paper, we study the problem of resource allocation in a cache-enabled software defined cellular network (SDCN) with mobile users, where the SDCN controller has global information of the network and the popular contents that the users request are stored at the content server and cache-enabled small base stations (SBSs). We propose a Markov chain based model to predict the users’ mobility patterns and then use the predicted mobility patterns to determine optimal resource allocation. The mobility prediction and resource allocation problem are jointly formulated as an optimization problem whose goal is to maximize the network throughput. Based on the predicted users’ mobility patterns, a distributed alternating direction method of multipliers (ADMM) is proposed to solve the resource allocation problem. The proposed ADMM algorithm enables the multiple SBSs implement their resource allocation simultaneously and, hence decreases the control overhead of the SDCN controller. Simulation results show that the proposed algorithm achieves up to 9.35% and 33.17% gains in terms of the average throughput compared to the random algorithm and the nearest association with equal allocated resource algorithm.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"47 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":"121049657","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.8555660
Chaozhun Wen, Peng Yang, Qiong Liu, Jingjing Luo, Li Yu
In software defined networks, network states are frequently updated by controllers. Unfortunately, due to resource and time constraints, there are scenarios in which transient congestion and packet loss are inevitable. In this regard, minimizing the packet loss ratio becomes crucial. Previous efforts on congestion-free updates suggest link-based solutions, which aim at minimizing the overloaded data volume on the bottleneck links. Observing the fact that the least overloaded data volume on links still does not guarantee the least packet loss, in this paper, we propose a flow-based update solution that directly minimizes the packet loss by jointly optimizing the congestion duration and rate limitation. Specifically, congestion impairment is defined to jointly accommodate the flow's importance and packet loss. Then, we present the FBU (Flow-Based Update problem), which minimizes the congestion impairment on a flow basis. To deal with the NP-hardness of this optimization problem, we propose MIC, which is an efficient two-phase heuristic algorithm based on the relationship between rate limitation, congestion duration and packet loss. Experimental results show that MIC can reduce up to 84% of packet loss compared to previous algorithms.
{"title":"Minimizing Congestion Impairment of Network Update in SDN: A Flow-Based Solution","authors":"Chaozhun Wen, Peng Yang, Qiong Liu, Jingjing Luo, Li Yu","doi":"10.1109/WCSP.2018.8555660","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555660","url":null,"abstract":"In software defined networks, network states are frequently updated by controllers. Unfortunately, due to resource and time constraints, there are scenarios in which transient congestion and packet loss are inevitable. In this regard, minimizing the packet loss ratio becomes crucial. Previous efforts on congestion-free updates suggest link-based solutions, which aim at minimizing the overloaded data volume on the bottleneck links. Observing the fact that the least overloaded data volume on links still does not guarantee the least packet loss, in this paper, we propose a flow-based update solution that directly minimizes the packet loss by jointly optimizing the congestion duration and rate limitation. Specifically, congestion impairment is defined to jointly accommodate the flow's importance and packet loss. Then, we present the FBU (Flow-Based Update problem), which minimizes the congestion impairment on a flow basis. To deal with the NP-hardness of this optimization problem, we propose MIC, which is an efficient two-phase heuristic algorithm based on the relationship between rate limitation, congestion duration and packet loss. Experimental results show that MIC can reduce up to 84% of packet loss compared to previous algorithms.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"33 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":"130057141","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.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.8555615
Leilei Huang, Rong Chai, Qianbin Chen, Chun Jin
The integration of software-defined networking (S-DN) and network function virtualization (NFV) is expected to achieve the convenient management and flexible deployment of various sophisticated network functions, and support user applications with guaranteed quality of service (QoS). In this paper, we jointly study route selection and network function placement problem. To stress the service sensitivity on delay, we formulate an optimization problem which minimizes the total end-to-end delay subject to data transmission, service requirement and various available resource constraints. As the formulated problem is an NP-hard problem, which cannot be solved easily, we transform it into three subproblems, i.e., route selection subproblem, network function placement subproblem and resource sharing subproblem of user flows, and solve the three subproblems by applying the K-shortest paths algorithm, Kuhn-Munkres (K-M) algorithm and Lagrangian dual method, respectively. Numerical results demonstrate the effectiveness of the proposed algorithm.
{"title":"End-to-End Delay Minimization based Joint Route Selection and Network Function Placement in SDN","authors":"Leilei Huang, Rong Chai, Qianbin Chen, Chun Jin","doi":"10.1109/WCSP.2018.8555615","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555615","url":null,"abstract":"The integration of software-defined networking (S-DN) and network function virtualization (NFV) is expected to achieve the convenient management and flexible deployment of various sophisticated network functions, and support user applications with guaranteed quality of service (QoS). In this paper, we jointly study route selection and network function placement problem. To stress the service sensitivity on delay, we formulate an optimization problem which minimizes the total end-to-end delay subject to data transmission, service requirement and various available resource constraints. As the formulated problem is an NP-hard problem, which cannot be solved easily, we transform it into three subproblems, i.e., route selection subproblem, network function placement subproblem and resource sharing subproblem of user flows, and solve the three subproblems by applying the K-shortest paths algorithm, Kuhn-Munkres (K-M) algorithm and Lagrangian dual method, respectively. Numerical results demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"1 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":"131314567","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
扫码关注我们
求助内容：
应助结果提醒方式：