Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341131
Li Yang, Debin Wei, Chengsheng Pan, Kangzhen Wang
Aiming at the limited resources and the high link error rate of satellite network and the situation of that traditional TCP congestion control algorithm can't distinguish between the congestion losses and the link errors, which leads to the waste of network bandwidth, the TCP-BQC algorithm which is a kind of double models control method is presented. Based on the foundation that the root cause of congesting is the demand for network resource exceeding the supply, TCP-BQC judges the state of link congestion and distinguishes the reason of packets loss by detecting the remaining bandwidth and the number of queued packet at a source port, Then, the congestion window can be adjusted based on different causes of packets loss, which improves the bandwidth utilization fully. Simulation analysis shows that TCP-BQC algorithm can fully improves the bandwidth resource utilization and achieves better performance on throughput, fairness, and astringency.
{"title":"Congestion control algorithm based on dual model control over satellite network","authors":"Li Yang, Debin Wei, Chengsheng Pan, Kangzhen Wang","doi":"10.1109/WCSP.2015.7341131","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341131","url":null,"abstract":"Aiming at the limited resources and the high link error rate of satellite network and the situation of that traditional TCP congestion control algorithm can't distinguish between the congestion losses and the link errors, which leads to the waste of network bandwidth, the TCP-BQC algorithm which is a kind of double models control method is presented. Based on the foundation that the root cause of congesting is the demand for network resource exceeding the supply, TCP-BQC judges the state of link congestion and distinguishes the reason of packets loss by detecting the remaining bandwidth and the number of queued packet at a source port, Then, the congestion window can be adjusted based on different causes of packets loss, which improves the bandwidth utilization fully. Simulation analysis shows that TCP-BQC algorithm can fully improves the bandwidth resource utilization and achieves better performance on throughput, fairness, and astringency.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133856570","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341330
Jeong Kyun Lee, Xiaohua Li
It has been a challenge to develop efficient algorithms for relay selection and relay power optimization in arbitrarily large multi-hop wireless networks. In this paper, considering Gaussian networks with half-duplex decode-and-forward relays, we develop a practical network-wide signal processing procedure with which the relay's data rate is not degraded by mutual interference. Multi-hop relaying is thus immune to mutual interference. Then, we develop an algorithm to find approximately the optimal hop count and the optimal relays for source-destination transmission rate maximization. With a quadratic complexity O(N2), where N is the network size, this algorithm is efficient for arbitrarily large wireless networks. More interestingly, this algorithm is similar to the well-known Dijkstra's algorithm of wired networks.
{"title":"Interference immune multi-hop relaying and efficient relay selection algorithm for arbitrarily large half-duplex Gaussian wireless networks","authors":"Jeong Kyun Lee, Xiaohua Li","doi":"10.1109/WCSP.2015.7341330","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341330","url":null,"abstract":"It has been a challenge to develop efficient algorithms for relay selection and relay power optimization in arbitrarily large multi-hop wireless networks. In this paper, considering Gaussian networks with half-duplex decode-and-forward relays, we develop a practical network-wide signal processing procedure with which the relay's data rate is not degraded by mutual interference. Multi-hop relaying is thus immune to mutual interference. Then, we develop an algorithm to find approximately the optimal hop count and the optimal relays for source-destination transmission rate maximization. With a quadratic complexity O(N2), where N is the network size, this algorithm is efficient for arbitrarily large wireless networks. More interestingly, this algorithm is similar to the well-known Dijkstra's algorithm of wired networks.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115615446","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341143
Shihao Yan, Nan Yang, Jinhong Yuan
This work reveals some fundamental properties of an on-off transmission (OOT) scheme, in which a transmitter sends signals occasionally as per the capacity of the main channel in order to achieve physical layer security. To this end, we first identify the widely used hybrid secrecy outage probability as a function of the transmission probability and the conditional secrecy outage probability of the OOT scheme. This indicates, for the first time, that the hybrid secrecy outage probability can be achieved by the OOT scheme. We then derive a lower bound on the conditional secrecy outage probability of the OOT scheme in case of transmission, which is solely determined by the average signal-to-noise ratios (SNRs) of the main channel and eavesdropper's channel. Finally, we re-investigate the OOT scheme within an absolutely completely passive eavesdropping scenario, in which even the average SNR of the eavesdropper's channel is not required. Specifically, we derive an easy-evaluated expression for the average conditional secrecy outage probability of the OOT scheme by adopting an annulus threat model.
{"title":"Fundamental properties of on-off transmission scheme for wiretap channels","authors":"Shihao Yan, Nan Yang, Jinhong Yuan","doi":"10.1109/WCSP.2015.7341143","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341143","url":null,"abstract":"This work reveals some fundamental properties of an on-off transmission (OOT) scheme, in which a transmitter sends signals occasionally as per the capacity of the main channel in order to achieve physical layer security. To this end, we first identify the widely used hybrid secrecy outage probability as a function of the transmission probability and the conditional secrecy outage probability of the OOT scheme. This indicates, for the first time, that the hybrid secrecy outage probability can be achieved by the OOT scheme. We then derive a lower bound on the conditional secrecy outage probability of the OOT scheme in case of transmission, which is solely determined by the average signal-to-noise ratios (SNRs) of the main channel and eavesdropper's channel. Finally, we re-investigate the OOT scheme within an absolutely completely passive eavesdropping scenario, in which even the average SNR of the eavesdropper's channel is not required. Specifically, we derive an easy-evaluated expression for the average conditional secrecy outage probability of the OOT scheme by adopting an annulus threat model.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114442713","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341278
Yang Cui, C. Fu, Hong Hong, Yijin Zhang, F. Shu
In order to monitor the time varying heart rate (HR) of human in exercise effectively, a noncontact detection method based on video camera is realized in this paper. Based on the principle of Photoplethysmography (PPG), the camera records the regular changes of the skin surface in human face due to their blood volume pulse (BVP). After a series of preprocessing including facial recognition, band-pass filter, trend removal, and reconstruction of source signal, the BVP waveform was retrieved from the video signal. In this way, the extraction of HR could be re-formulated as the problem of extracting the frequency of the BVP signal, which is in a traditional digital signal form. In this paper, five classical frequency extraction methods are compared to find the most proper one. The simulation results show that the frequency extracted from the BVP signal could match the time varying heart rate detected by professional equipment and the approach of calculating the mean value of interbeat intervals (IBI) has the best performance in frequency extraction, especially in the stage of postexercise.
{"title":"Non-contact time varying heart rate monitoring in exercise by video camera","authors":"Yang Cui, C. Fu, Hong Hong, Yijin Zhang, F. Shu","doi":"10.1109/WCSP.2015.7341278","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341278","url":null,"abstract":"In order to monitor the time varying heart rate (HR) of human in exercise effectively, a noncontact detection method based on video camera is realized in this paper. Based on the principle of Photoplethysmography (PPG), the camera records the regular changes of the skin surface in human face due to their blood volume pulse (BVP). After a series of preprocessing including facial recognition, band-pass filter, trend removal, and reconstruction of source signal, the BVP waveform was retrieved from the video signal. In this way, the extraction of HR could be re-formulated as the problem of extracting the frequency of the BVP signal, which is in a traditional digital signal form. In this paper, five classical frequency extraction methods are compared to find the most proper one. The simulation results show that the frequency extracted from the BVP signal could match the time varying heart rate detected by professional equipment and the approach of calculating the mean value of interbeat intervals (IBI) has the best performance in frequency extraction, especially in the stage of postexercise.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124927418","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341079
Jincheng Zhao, Wenjin Wang, Xiqi Gao
One of the biggest challenges of 5G comes from sporadic traffic generated by millions of devices in highly fragmented spectrum, especially for uplink transmission. Current physical layer based on synchronism and orthogonality become low-efficient and inflexible because of the sophisticated algorithms it used to maintain synchronism. Asynchronous waveform with ultra-low side lobe seems promising, and Fast-Convolution Multicarrier (FCMC) is among the most competitive waveforms. In this paper, we investigate transceiver design for FCMC scheme in multipath fading channels. Firstly, we derive the signal model of FCMC transceiver. Based on the signal model, we develop the low-complexity one-tap minimum mean square error (MMSE) frequency-domain equalizer exploiting the asymptotic behavior of Toeplitz matrices and the nature of fast-convolution. The new proposed FCMC transceiver can be applied in single-carrier frequency-division multiple access transmission. The resulting scheme features low Peak-to-Average-Power-Ratio (PAPR), flexible user bandwidth, and allowing asynchronous transmission. Simulation results confirm the advantages of the proposed scheme.
{"title":"Transceiver design for fast-convolution multicarrier systems in multipath fading channels","authors":"Jincheng Zhao, Wenjin Wang, Xiqi Gao","doi":"10.1109/WCSP.2015.7341079","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341079","url":null,"abstract":"One of the biggest challenges of 5G comes from sporadic traffic generated by millions of devices in highly fragmented spectrum, especially for uplink transmission. Current physical layer based on synchronism and orthogonality become low-efficient and inflexible because of the sophisticated algorithms it used to maintain synchronism. Asynchronous waveform with ultra-low side lobe seems promising, and Fast-Convolution Multicarrier (FCMC) is among the most competitive waveforms. In this paper, we investigate transceiver design for FCMC scheme in multipath fading channels. Firstly, we derive the signal model of FCMC transceiver. Based on the signal model, we develop the low-complexity one-tap minimum mean square error (MMSE) frequency-domain equalizer exploiting the asymptotic behavior of Toeplitz matrices and the nature of fast-convolution. The new proposed FCMC transceiver can be applied in single-carrier frequency-division multiple access transmission. The resulting scheme features low Peak-to-Average-Power-Ratio (PAPR), flexible user bandwidth, and allowing asynchronous transmission. Simulation results confirm the advantages of the proposed scheme.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123513191","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341039
Teng Niu, Dongmei Zhang, Yu Jiang, Kui Xu
Buffer-aided network coding (NC) has been proposed as an effective method to improve retransmission efficiency. In this way, the correctly received undecodable NC combined retransmission packets are waited in the buffer for a future network decoding opportunity rather than delete. However, existing buffer-aided approaches fail to consider the buffer status and the latest feedback in the next round of network encoding and therefore are unable to achieve the optimal performance. In this paper, a buffer-aided and weight-based non-orthogonal network coding scheme for wireless broadcasting (BWNNC) has been proposed, wherein the sender makes full use of all the known information to conduct non-orthogonal network coding retransmissions. Simulation results show that our proposed algorithm indeed outperforms previous works in reducing the retransmission times.
{"title":"Buffer-aided and weight-based non-orthogonal network coding for wireless broadcasting","authors":"Teng Niu, Dongmei Zhang, Yu Jiang, Kui Xu","doi":"10.1109/WCSP.2015.7341039","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341039","url":null,"abstract":"Buffer-aided network coding (NC) has been proposed as an effective method to improve retransmission efficiency. In this way, the correctly received undecodable NC combined retransmission packets are waited in the buffer for a future network decoding opportunity rather than delete. However, existing buffer-aided approaches fail to consider the buffer status and the latest feedback in the next round of network encoding and therefore are unable to achieve the optimal performance. In this paper, a buffer-aided and weight-based non-orthogonal network coding scheme for wireless broadcasting (BWNNC) has been proposed, wherein the sender makes full use of all the known information to conduct non-orthogonal network coding retransmissions. Simulation results show that our proposed algorithm indeed outperforms previous works in reducing the retransmission times.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123945765","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341029
M Maksud Alam, Farabi Hasan Chadni, Saiful Ahmed Papon
OFDM is known to be one of the most promising technologies of present time for high performance and high speed data transmission systems. Moreover MIMO-OFDM proves to be even better in terms of better performance and a lower bit error rate (BER). In this paper, we discussed about MIMO Coded OFDM (MIMO-COFDM) where information data has been Reed-Muller coded and shown that the performance of the systems improve further. Simulation has been done for various channel constraints like additive white Gaussian noise (AWGN), AWGN with inter carrier interference (ICI) due to carrier frequency offset (CFO) and AWGN with ICI having Rayleigh fading environment.
{"title":"Performance analysis of MIMO-COFDM under Rayleigh fading channel","authors":"M Maksud Alam, Farabi Hasan Chadni, Saiful Ahmed Papon","doi":"10.1109/WCSP.2015.7341029","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341029","url":null,"abstract":"OFDM is known to be one of the most promising technologies of present time for high performance and high speed data transmission systems. Moreover MIMO-OFDM proves to be even better in terms of better performance and a lower bit error rate (BER). In this paper, we discussed about MIMO Coded OFDM (MIMO-COFDM) where information data has been Reed-Muller coded and shown that the performance of the systems improve further. Simulation has been done for various channel constraints like additive white Gaussian noise (AWGN), AWGN with inter carrier interference (ICI) due to carrier frequency offset (CFO) and AWGN with ICI having Rayleigh fading environment.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126145462","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341190
Cheng Ding, Liang Shen, Dianxiong Liu
This article investigates the issue of joint relay selection and channel allocation in LTE relay networks, where the available channels of each node are restricted and heterogeneous. We decompose the issue into two subproblems: one is the channel selection of relay to mitigate the interference among relay nodes and another is joint relay and channel selection of source node to maximize the total capacity. The first subproblem is formulated as a global interaction game and a learning algorithm is proposed to achieve the Nash equilibrium. Based on the result of the first subproblem, the second one is formulated as a congestion game with player-specific payoff function. We propose a distributed solution to maximize the total capacity. Simulation results show that our approach can obtain a large total capacity and a high fairness index.
{"title":"Joint relay selection and channel allocation in cooperative communication: A game theoretic learning solution","authors":"Cheng Ding, Liang Shen, Dianxiong Liu","doi":"10.1109/WCSP.2015.7341190","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341190","url":null,"abstract":"This article investigates the issue of joint relay selection and channel allocation in LTE relay networks, where the available channels of each node are restricted and heterogeneous. We decompose the issue into two subproblems: one is the channel selection of relay to mitigate the interference among relay nodes and another is joint relay and channel selection of source node to maximize the total capacity. The first subproblem is formulated as a global interaction game and a learning algorithm is proposed to achieve the Nash equilibrium. Based on the result of the first subproblem, the second one is formulated as a congestion game with player-specific payoff function. We propose a distributed solution to maximize the total capacity. Simulation results show that our approach can obtain a large total capacity and a high fairness index.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125823430","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341048
Hairong Wang, Lihua Yang, Hongbo Zhu, Youhua Fu
We investigate channel estimation mean square error (MSE) performance in Massive multiple-input multiple-output (MIMO) system with pilot contamination. Different from the traditional MSE expressions, the expressions that we derived have algebraic form, which no longer need hard matrix inversion as M, the number of the base station antennas, increasing. From them, we also found that the average transmitted power and length of training sequence almost does not help in enhancing the performance of MSE as M → ∞. Based on this, a scheme to reduce pilot contamination in time division duplexing (TDD) cellular networks is proposed with simple cooperation among base stations. Numerical results finally verify our derivations and the proposed scheme.
{"title":"Pilot contamination reduction based on MSE performance of channel estimation","authors":"Hairong Wang, Lihua Yang, Hongbo Zhu, Youhua Fu","doi":"10.1109/WCSP.2015.7341048","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341048","url":null,"abstract":"We investigate channel estimation mean square error (MSE) performance in Massive multiple-input multiple-output (MIMO) system with pilot contamination. Different from the traditional MSE expressions, the expressions that we derived have algebraic form, which no longer need hard matrix inversion as M, the number of the base station antennas, increasing. From them, we also found that the average transmitted power and length of training sequence almost does not help in enhancing the performance of MSE as M → ∞. Based on this, a scheme to reduce pilot contamination in time division duplexing (TDD) cellular networks is proposed with simple cooperation among base stations. Numerical results finally verify our derivations and the proposed scheme.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126031644","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341261
Fan Meng, Tinghui Yin, Xue Ni, Zhaocui Huang, Hui Chen
The accuracy of target association is important to the stability and precision of track. Traditional target association methods are based on the trace, but these usually lead to fault correlation. This paper develops a new track association approach using gridding association domain and template matching. First, the 3 by 3 gridding association domains are founded by target as the center, and the radar data in domains are mapped to image of 0 to 255 gray grades. Then, the target feature parameters are detected by the image processing algorithm, and the template is established according to the historical characteristic parameters. Finally, target association is achieved by template matching. The experiment shows that the proposed approach has improved the accuracy of target association in the actual environment.
{"title":"A new method for target association using gridding association domain and template matching","authors":"Fan Meng, Tinghui Yin, Xue Ni, Zhaocui Huang, Hui Chen","doi":"10.1109/WCSP.2015.7341261","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341261","url":null,"abstract":"The accuracy of target association is important to the stability and precision of track. Traditional target association methods are based on the trace, but these usually lead to fault correlation. This paper develops a new track association approach using gridding association domain and template matching. First, the 3 by 3 gridding association domains are founded by target as the center, and the radar data in domains are mapped to image of 0 to 255 gray grades. Then, the target feature parameters are detected by the image processing algorithm, and the template is established according to the historical characteristic parameters. Finally, target association is achieved by template matching. The experiment shows that the proposed approach has improved the accuracy of target association in the actual environment.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129856648","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
扫码关注我们
求助内容：
应助结果提醒方式：