Pub Date : 2018-10-01DOI: 10.1109/WCSP.2018.8555909
Yuanfang Feng, Yunsi Ma, Zhengdai Li, Chaoxing Yan, N. Wu
Spectrally efficient frequency division multiplexing (SEFDM) is a promising technique for the next generation wireless communication due to its high spectral efficiency. Conventional SEFDM detectors suffer from the challenging tradeoff between computational complexity and bit error rate (BER) performance. In this paper, we propose a low-complexity iterative detector using Gaussian message passing (GMP) on factor graph for coded root raised cosine (RRC) shaped SEFDM signals. By ignoring the weak intersymbol interference (ISI) imposed by packing sub-carrier interval, the detection of SEFDM signals is reformulated into a linear state-space model and a corresponding Forney-style factor graph (FFG) is constructed. Then, we derive messages updating expressions based on GMP rules, which enable low-complexity parametric message passing. Since the Gaussian approximation employed on the cycle-free factor graph, the computational complexity of the proposed algorithm increases linearly with the number of sub-carriers. Simulation results show that the coded RRC-SEFDM system with the proposed factor graph-based iterative detection can improve the transmission rate up to 40% with about 0.5 dB $E_{b}/N_{0}$ loss.
频谱高效分频复用(SEFDM)因其频谱效率高而成为下一代无线通信的发展方向。传统的SEFDM检测器在计算复杂性和误码率(BER)性能之间进行了艰难的权衡。本文针对编码根提升余弦(RRC)形SEFDM信号，提出了一种基于因子图高斯消息传递(GMP)的低复杂度迭代检测器。通过忽略填充子载波间隔带来的弱码间干扰(ISI)，将SEFDM信号的检测重构为线性状态空间模型，并构造相应的forney风格因子图(FFG)。然后，我们推导了基于GMP规则的消息更新表达式，实现了低复杂度的参数消息传递。由于在无循环因子图上采用高斯近似，该算法的计算复杂度随着子载波数的增加而线性增加。仿真结果表明，基于因子图迭代检测的编码RRC-SEFDM系统的传输速率提高了40%，损耗约为0.5 dB $E_{b}/N_{0}$。
{"title":"Low-Complexity Factor Graph-Based Iterative Detection for RRC-SEFDM Signals","authors":"Yuanfang Feng, Yunsi Ma, Zhengdai Li, Chaoxing Yan, N. Wu","doi":"10.1109/WCSP.2018.8555909","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555909","url":null,"abstract":"Spectrally efficient frequency division multiplexing (SEFDM) is a promising technique for the next generation wireless communication due to its high spectral efficiency. Conventional SEFDM detectors suffer from the challenging tradeoff between computational complexity and bit error rate (BER) performance. In this paper, we propose a low-complexity iterative detector using Gaussian message passing (GMP) on factor graph for coded root raised cosine (RRC) shaped SEFDM signals. By ignoring the weak intersymbol interference (ISI) imposed by packing sub-carrier interval, the detection of SEFDM signals is reformulated into a linear state-space model and a corresponding Forney-style factor graph (FFG) is constructed. Then, we derive messages updating expressions based on GMP rules, which enable low-complexity parametric message passing. Since the Gaussian approximation employed on the cycle-free factor graph, the computational complexity of the proposed algorithm increases linearly with the number of sub-carriers. Simulation results show that the coded RRC-SEFDM system with the proposed factor graph-based iterative detection can improve the transmission rate up to 40% with about 0.5 dB $E_{b}/N_{0}$ loss.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"27 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":"124925195","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.8555652
Jianmin Zhang, Zhouyun Wu, Weiliang Xie, Fengyi Yang
Multi-access Edge Computing (MEC) can provide the intelligent platform or environment for services with the requirements of lower latency, higher bandwidth, and higher computation complexity, thereby attracting more attention in the future network. Intuitively, MEC can be applied to 4G and 5G mobile networks respectively, however the corresponding MEC architectures will be entirely different because of the difference between 4G and 5G network architectures. Therefore, this paper firstly presents the 4G MEC architecture and deeply discusses the existing problems in field trials and future deployment, e.g. charging, lawful interception, etc. Considering the above problems, the 5G MEC integrated architecture is proposed in this paper, which takes the network and service functions into account simultaneously. Meanwhile, the network function, especially for the traffic offloading mechanism, is emphatically analyzed and discussed. In addition, some suggestions are also presented for promotion of 5G MEC.
{"title":"MEC Architectures in 4G and 5G Mobile Networks","authors":"Jianmin Zhang, Zhouyun Wu, Weiliang Xie, Fengyi Yang","doi":"10.1109/WCSP.2018.8555652","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555652","url":null,"abstract":"Multi-access Edge Computing (MEC) can provide the intelligent platform or environment for services with the requirements of lower latency, higher bandwidth, and higher computation complexity, thereby attracting more attention in the future network. Intuitively, MEC can be applied to 4G and 5G mobile networks respectively, however the corresponding MEC architectures will be entirely different because of the difference between 4G and 5G network architectures. Therefore, this paper firstly presents the 4G MEC architecture and deeply discusses the existing problems in field trials and future deployment, e.g. charging, lawful interception, etc. Considering the above problems, the 5G MEC integrated architecture is proposed in this paper, which takes the network and service functions into account simultaneously. Meanwhile, the network function, especially for the traffic offloading mechanism, is emphatically analyzed and discussed. In addition, some suggestions are also presented for promotion of 5G MEC.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"43 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":"123654177","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.8555571
Donghui Liu, Ming Zhao, Wuyang Zhou
In this paper, according to the energy efficiency (EE) definition based on packet transmission, we analyze the energy efficiency in energy harvesting incremental relay system with energy harvesting constraints. Our purpose is to maximize energy efficiency of source node while making full use of relay’s harvested energy. First, we consider the energy efficiency of point-to-point link with multilevel quadrature amplitude modulation (MQAM) and derive the energy efficiency definition based on packet transmission. Next, the energy efficiency optimization problem in incremental relay system is formulated. To solve the problem, we discuss two factors that affect energy efficiency: transmission power and packet length. Furthermore, we propose a joint transmission power and packet length iterative optimization algorithm and give an intuitive analysis of convergence. Finally, simulations have been carried out to verify the benefits of the proposed algorithm, which can significantly improve energy efficiency compared with only transmission power optimized scheme or only packet length optimized scheme.
{"title":"Energy Efficiency Optimization in Energy Harvesting Incremental Relay System","authors":"Donghui Liu, Ming Zhao, Wuyang Zhou","doi":"10.1109/WCSP.2018.8555571","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555571","url":null,"abstract":"In this paper, according to the energy efficiency (EE) definition based on packet transmission, we analyze the energy efficiency in energy harvesting incremental relay system with energy harvesting constraints. Our purpose is to maximize energy efficiency of source node while making full use of relay’s harvested energy. First, we consider the energy efficiency of point-to-point link with multilevel quadrature amplitude modulation (MQAM) and derive the energy efficiency definition based on packet transmission. Next, the energy efficiency optimization problem in incremental relay system is formulated. To solve the problem, we discuss two factors that affect energy efficiency: transmission power and packet length. Furthermore, we propose a joint transmission power and packet length iterative optimization algorithm and give an intuitive analysis of convergence. Finally, simulations have been carried out to verify the benefits of the proposed algorithm, which can significantly improve energy efficiency compared with only transmission power optimized scheme or only packet length optimized scheme.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"24 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":"123717581","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.8555947
Guanchong Niu, Man-On Pun
Beam division multiple access (BDMA) has recently been proposed for massive multiple-input multiple-output (MIMO) systems by simultaneously transmitting multiple users’ data streams via different beams. Despite its many advantages, BDMA may suffer from a larger peak-to-average-power ratio (PAPR) as the number of transmit antennas increases. In this work, we propose to explicitly incorporate the PAPR constraints into the BDMA design by jointly performing hybrid analog-digital precoding and user-beam scheduling. More specifically, the proposed scheme designs the digital precoder with explicit PAPR constraints. In addition, to facilitate the hybrid precoder design, the proposed scheme opportunistically schedules users who are near orthogonal in the analog beam domain. To efficiently compute the optimal hybrid precoder and user-beam scheduling, we develop a greedy algorithm that first opportunistically selects users before their corresponding hybrid precoders are derived with explicit PAPR constraints. Simulation results confirm the effectiveness of proposed PAPR- aware BDMA scheme.
{"title":"PAPR-Aware Beam Division Multiple Access for mmWave Massive MIMO Systems","authors":"Guanchong Niu, Man-On Pun","doi":"10.1109/WCSP.2018.8555947","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555947","url":null,"abstract":"Beam division multiple access (BDMA) has recently been proposed for massive multiple-input multiple-output (MIMO) systems by simultaneously transmitting multiple users’ data streams via different beams. Despite its many advantages, BDMA may suffer from a larger peak-to-average-power ratio (PAPR) as the number of transmit antennas increases. In this work, we propose to explicitly incorporate the PAPR constraints into the BDMA design by jointly performing hybrid analog-digital precoding and user-beam scheduling. More specifically, the proposed scheme designs the digital precoder with explicit PAPR constraints. In addition, to facilitate the hybrid precoder design, the proposed scheme opportunistically schedules users who are near orthogonal in the analog beam domain. To efficiently compute the optimal hybrid precoder and user-beam scheduling, we develop a greedy algorithm that first opportunistically selects users before their corresponding hybrid precoders are derived with explicit PAPR constraints. Simulation results confirm the effectiveness of proposed PAPR- aware BDMA scheme.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"25 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":"121858192","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.8555733
Xiaosha Chen, S. Leng, Fan Wu
The automatic driving has drawn the widespread attention in both academic and industrial field. The vehicular safety message broadcast plays a significant role in the automatic driving. However, the unique features and transmission requirements of vehicular safety messages are often ignored in the design and analysis of the relevant protocols. This paper focuses on the improvement of safety message broadcasting in vehicular networks with reinforcement learning. In the scenarios with or without road side unit (RSU), we propose the distributed and centralized reinforcement learning based exponential backoff (RLEB) algorithm, respectively. Those vehicles with the dedicated short range communication (DSRC) unit can implement the proposed algorithm with little computation and communication resources. Simulation results show that the proposed algorithms decrease the delays of safety message broadcasting in different scenarios. Furthermore, the centralized proposed algorithm can provide the fairness among vehicles in terms of channel access opportunity.
{"title":"Reinforcement Learning Based Safety Message Broadcasting in Vehicular Networks","authors":"Xiaosha Chen, S. Leng, Fan Wu","doi":"10.1109/WCSP.2018.8555733","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555733","url":null,"abstract":"The automatic driving has drawn the widespread attention in both academic and industrial field. The vehicular safety message broadcast plays a significant role in the automatic driving. However, the unique features and transmission requirements of vehicular safety messages are often ignored in the design and analysis of the relevant protocols. This paper focuses on the improvement of safety message broadcasting in vehicular networks with reinforcement learning. In the scenarios with or without road side unit (RSU), we propose the distributed and centralized reinforcement learning based exponential backoff (RLEB) algorithm, respectively. Those vehicles with the dedicated short range communication (DSRC) unit can implement the proposed algorithm with little computation and communication resources. Simulation results show that the proposed algorithms decrease the delays of safety message broadcasting in different scenarios. Furthermore, the centralized proposed algorithm can provide the fairness among vehicles in terms of channel access opportunity.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"54 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":"122633659","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.8555897
Hongwei Hou, M. Tao
This paper introduces a new prefix caching strategy for video streaming in wireless device-to-device (D2D) networks. Each user caches several initial sequential segments of video files and can share their cached parts via D2D communications. Moreover, video playing and downloading happen simultaneously. We evaluate the system performance by playback delay rather than traditional download delay. Specifically, we formulate the average playback delay minimization problem in terms of cache placement. By relaxing the integer constraints of the decision variables, the original problem becomes convex and then we can find a lower bound of the optimal solution. Next we propose a greedy algorithm to solve the original minimization problem. And extensive simulation results reveal that our proposed video caching strategy has great performance in comparison with heuristic benchmark schemes.
{"title":"Prefix Caching for Video Streaming in Wireless D2D Networks","authors":"Hongwei Hou, M. Tao","doi":"10.1109/WCSP.2018.8555897","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555897","url":null,"abstract":"This paper introduces a new prefix caching strategy for video streaming in wireless device-to-device (D2D) networks. Each user caches several initial sequential segments of video files and can share their cached parts via D2D communications. Moreover, video playing and downloading happen simultaneously. We evaluate the system performance by playback delay rather than traditional download delay. Specifically, we formulate the average playback delay minimization problem in terms of cache placement. By relaxing the integer constraints of the decision variables, the original problem becomes convex and then we can find a lower bound of the optimal solution. Next we propose a greedy algorithm to solve the original minimization problem. And extensive simulation results reveal that our proposed video caching strategy has great performance in comparison with heuristic benchmark schemes.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"28 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":"121635212","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.8555594
Zheng Cai, Zhaoyang Zhang, Xiaoming Chen, Wei Wang
We study the task assignment problem of an application composed of multiple tasks in a general heterogeneous processor network or network with computing nodes, considering both the communication delay between processors and the precedence constraints between tasks. The problem of scheduling tasks over the network to minimize total application runtime is formulated, which is shown to be a NP-hard mixed integer program. To solve it, we propose a heuristic algorithm called Binary Relaxation and Discretization Heuristic (BRDH) which is conducted in two steps. First, we obtain a binary-relaxed version of the original problem, and then, we recover the discrete value of the original problem by task sorting. Through simulations, we show the impacts of task number, processor number and communication delay on the total application runtime. Furthermore, through comparison with traditional entire application offloading strategies widely used in current cloud computing and edge computing, our distributed computation offloading strategy shows significant advantage.
{"title":"Task Assignment with Precedence Constraint over Networks: A Case Study of Computation-Communication Convergence","authors":"Zheng Cai, Zhaoyang Zhang, Xiaoming Chen, Wei Wang","doi":"10.1109/WCSP.2018.8555594","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555594","url":null,"abstract":"We study the task assignment problem of an application composed of multiple tasks in a general heterogeneous processor network or network with computing nodes, considering both the communication delay between processors and the precedence constraints between tasks. The problem of scheduling tasks over the network to minimize total application runtime is formulated, which is shown to be a NP-hard mixed integer program. To solve it, we propose a heuristic algorithm called Binary Relaxation and Discretization Heuristic (BRDH) which is conducted in two steps. First, we obtain a binary-relaxed version of the original problem, and then, we recover the discrete value of the original problem by task sorting. Through simulations, we show the impacts of task number, processor number and communication delay on the total application runtime. Furthermore, through comparison with traditional entire application offloading strategies widely used in current cloud computing and edge computing, our distributed computation offloading strategy shows significant advantage.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"117 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":"123340988","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.8555939
N. Jiang, Hazem Sallouha, P. Xu, Xuzhe Wang, S. Pollin
In this paper Location Verification System based on Radio Irregularity and Sequential Evaluation (LVS-RISE) is proposed as a novel system to improve the performance of the Location Verification System based on Radio Irregularity (LVS-RI). LVS-RISE utilizes a sliding window and voting scheme to detect the attack from malicious nodes at the same distance. Hence, LVS-RISE can limit the ambiguity of malicious nodes detection when compared with LVS-RI. To assess the performance of LVS-RISE in compared with LVS-RI both simulation and experimental results are presented. Our simulation results show that, with the same threshold of detection, LVS-RISE achieves better performance when compared with LVS-RI. Moreover, the experiments in real environment indicate that an assistant node is necessary for LVS-RI and LVS-RISE if the node to be detected is moving.
{"title":"Location Verification based on Radio Irregularity: Sequential Evaluation and Performance Assessment","authors":"N. Jiang, Hazem Sallouha, P. Xu, Xuzhe Wang, S. Pollin","doi":"10.1109/WCSP.2018.8555939","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555939","url":null,"abstract":"In this paper Location Verification System based on Radio Irregularity and Sequential Evaluation (LVS-RISE) is proposed as a novel system to improve the performance of the Location Verification System based on Radio Irregularity (LVS-RI). LVS-RISE utilizes a sliding window and voting scheme to detect the attack from malicious nodes at the same distance. Hence, LVS-RISE can limit the ambiguity of malicious nodes detection when compared with LVS-RI. To assess the performance of LVS-RISE in compared with LVS-RI both simulation and experimental results are presented. Our simulation results show that, with the same threshold of detection, LVS-RISE achieves better performance when compared with LVS-RI. Moreover, the experiments in real environment indicate that an assistant node is necessary for LVS-RI and LVS-RISE if the node to be detected is moving.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"37 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":"123840186","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.8555864
Yibo Yu, Wenfeng Yin, Lei Li, Lin Zhang
Ultra-wideband (UWB) radar is an effective tool for indoor tracking. By applying multiple radars in tracking, distance observations are obtained in different positions and the surveillance area is enlarged. However, even based on multiple radars, occlusions among targets still exist and cause loss of distance observations. Besides, imprecise initial positions introduce interferences at the beginning of tracking. This paper proposes a tracking approach to solve the problems. Firstly, the proposed approach integrates vital signs for target matching and provides precise initial positions for multiple targets tracking. Secondly, the proposed approach designs a predictive K-Nearest Neighbor method in both the raging stage and the data fusion stage, so as to reduce deviations in antenna-to-target distances and supplement the lost data. Experiments validate the effectiveness of the proposed approach in tracking multiple targets with a max average deviation 0.276m.
{"title":"Vital Sign Integrated Tracking by Predictive KNN and Kalman Filter with UWB Radars","authors":"Yibo Yu, Wenfeng Yin, Lei Li, Lin Zhang","doi":"10.1109/WCSP.2018.8555864","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555864","url":null,"abstract":"Ultra-wideband (UWB) radar is an effective tool for indoor tracking. By applying multiple radars in tracking, distance observations are obtained in different positions and the surveillance area is enlarged. However, even based on multiple radars, occlusions among targets still exist and cause loss of distance observations. Besides, imprecise initial positions introduce interferences at the beginning of tracking. This paper proposes a tracking approach to solve the problems. Firstly, the proposed approach integrates vital signs for target matching and provides precise initial positions for multiple targets tracking. Secondly, the proposed approach designs a predictive K-Nearest Neighbor method in both the raging stage and the data fusion stage, so as to reduce deviations in antenna-to-target distances and supplement the lost data. Experiments validate the effectiveness of the proposed approach in tracking multiple targets with a max average deviation 0.276m.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"5 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":"131358711","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.8555906
Huan Wang, M. Diao, Lipeng Gao
Low probability of intercept (LPI) radar waveform recognition is a challenging task in modern radar and electronic warfare (EW) systems. To solve the problem of incomplete information and the need for human experience in the existing feature-based radar recognition methods, a robust and automatic LPI radar waveform recognition method based on Choi-Williams time-frequency distribution (CWD) and dictionary learning in the complex electromagnetic environment is proposed. First, the received signals are transformed to obtain the time-frequency matrix by CWD. Next, bilinear interpolation technique and row-orthogonal Cauchy random matrix are used for Iossless compression. Next, the label consistent k-singular value decomposition algorithm (LC-KSVD) is used to learn an over-complete dictionary and obtain the structure parameters of a linear classifier jointly. Finally, with the sparse code and the linear classifier, the type of test signals can be estimated. The superiority of the proposed method is universally applicable and does not need to rely on any human experience. Simulation results demonstrate that the proposed method has an excellent recognition rate at a low signal-to-noise ratio (SNR).
{"title":"Low Probability of Intercept Radar Waveform Recognition Based on Dictionary Leaming","authors":"Huan Wang, M. Diao, Lipeng Gao","doi":"10.1109/WCSP.2018.8555906","DOIUrl":"https://doi.org/10.1109/WCSP.2018.8555906","url":null,"abstract":"Low probability of intercept (LPI) radar waveform recognition is a challenging task in modern radar and electronic warfare (EW) systems. To solve the problem of incomplete information and the need for human experience in the existing feature-based radar recognition methods, a robust and automatic LPI radar waveform recognition method based on Choi-Williams time-frequency distribution (CWD) and dictionary learning in the complex electromagnetic environment is proposed. First, the received signals are transformed to obtain the time-frequency matrix by CWD. Next, bilinear interpolation technique and row-orthogonal Cauchy random matrix are used for Iossless compression. Next, the label consistent k-singular value decomposition algorithm (LC-KSVD) is used to learn an over-complete dictionary and obtain the structure parameters of a linear classifier jointly. Finally, with the sparse code and the linear classifier, the type of test signals can be estimated. The superiority of the proposed method is universally applicable and does not need to rely on any human experience. Simulation results demonstrate that the proposed method has an excellent recognition rate at a low signal-to-noise ratio (SNR).","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"52 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":"126283554","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
扫码关注我们
求助内容：
应助结果提醒方式：