Pub Date : 2017-10-01DOI: 10.1109/ICCT.2017.8359908
Yingjie Meng, Xiaoyu Teng, Huiran Liu, Sanshuai Cui, Zhiyuan Wang
The research of the existing screening algorithm for speech frame has a great deal of shortcomings, such as its applicability and complexity. Worse still, those frames which are screened by algorithm can't achieve the requirement of express and the screening process greatly damages the original signal. This paper presents a strategy for screening speech keyframe and designs a screening scheme for key-frames based on the strategy. This scheme refers to the speech's logarithm energy and the weighted-zero-crossing rate. The detail process of screening scheme: firstly, screening frames according to the logarithm energy of the speech signals. Meanwhile, combine the speech amplitude and zero-crossing rate for frames screening. Finally, calculate the similarity of the two screening results, and getting the key-frame set. In addition, the scheme has been analyzed and validated from those aspects like continuity, characterization and applicability, in order to verify the effectiveness and availability. The results illustrate that these frames which have been screened by this scheme have advantages of continuity, characterization etc.
{"title":"A screening scheme based on energy for speech key-frame","authors":"Yingjie Meng, Xiaoyu Teng, Huiran Liu, Sanshuai Cui, Zhiyuan Wang","doi":"10.1109/ICCT.2017.8359908","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359908","url":null,"abstract":"The research of the existing screening algorithm for speech frame has a great deal of shortcomings, such as its applicability and complexity. Worse still, those frames which are screened by algorithm can't achieve the requirement of express and the screening process greatly damages the original signal. This paper presents a strategy for screening speech keyframe and designs a screening scheme for key-frames based on the strategy. This scheme refers to the speech's logarithm energy and the weighted-zero-crossing rate. The detail process of screening scheme: firstly, screening frames according to the logarithm energy of the speech signals. Meanwhile, combine the speech amplitude and zero-crossing rate for frames screening. Finally, calculate the similarity of the two screening results, and getting the key-frame set. In addition, the scheme has been analyzed and validated from those aspects like continuity, characterization and applicability, in order to verify the effectiveness and availability. The results illustrate that these frames which have been screened by this scheme have advantages of continuity, characterization etc.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127548605","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359920
Song-nong Li, Xingzhe Hou, Guoqing Xu, Xiao Liu
In recent years, much attention has been paid to multiple-input-multiple-output (MIMO) signal processing in power line communication (PLC), to increase channel capacity and anti-interference ability. In this study, an adaptive filter was designed to reduce the influence of interference and bit error rate in MIMO-PLC random channel. This filter was set in the receiving port of a 3×4 MIMO-PLC system. The bit error rate before and after adding filter was analyzed and compared. Results show that the filter provides a remarkable performance gain on bit error rate in this 3×4 MIMO-PLC system.
{"title":"Design and simulation of an adaptive filter in MIMO-PLC system","authors":"Song-nong Li, Xingzhe Hou, Guoqing Xu, Xiao Liu","doi":"10.1109/ICCT.2017.8359920","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359920","url":null,"abstract":"In recent years, much attention has been paid to multiple-input-multiple-output (MIMO) signal processing in power line communication (PLC), to increase channel capacity and anti-interference ability. In this study, an adaptive filter was designed to reduce the influence of interference and bit error rate in MIMO-PLC random channel. This filter was set in the receiving port of a 3×4 MIMO-PLC system. The bit error rate before and after adding filter was analyzed and compared. Results show that the filter provides a remarkable performance gain on bit error rate in this 3×4 MIMO-PLC system.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130021332","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359966
Pengze Guo, Zhi Xue
Cloud computing has emerged as a powerful platform for providing computing resources in the past decade. Developing workflow scheduling algorithms can efficiently reduce the cost of executing tasks in cloud systems. The features of elasticity and heterogeneity of cloud computing bring challenges for scheduling strategies. For real-time workflows, reducing execution time and reducing execution cost are two conflicting objectives. To address this issue, we propose in this paper an improved real-time workflow scheduling algorithm based on particle swarm optimization (PSO). Different from traditional scheduling heuristics which rely on the initial resource pool, our algorithm can adaptively optimize the resource usage. Simulation experiments are conducted to evaluate our algorithm on workflows with different sizes under various deadlines. Compared with the best algorithm ever known, our algorithm shows excellent performance in both cost and makespan.
{"title":"An adaptive PSO-based real-time workflow scheduling algorithm in cloud systems","authors":"Pengze Guo, Zhi Xue","doi":"10.1109/ICCT.2017.8359966","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359966","url":null,"abstract":"Cloud computing has emerged as a powerful platform for providing computing resources in the past decade. Developing workflow scheduling algorithms can efficiently reduce the cost of executing tasks in cloud systems. The features of elasticity and heterogeneity of cloud computing bring challenges for scheduling strategies. For real-time workflows, reducing execution time and reducing execution cost are two conflicting objectives. To address this issue, we propose in this paper an improved real-time workflow scheduling algorithm based on particle swarm optimization (PSO). Different from traditional scheduling heuristics which rely on the initial resource pool, our algorithm can adaptively optimize the resource usage. Simulation experiments are conducted to evaluate our algorithm on workflows with different sizes under various deadlines. Compared with the best algorithm ever known, our algorithm shows excellent performance in both cost and makespan.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128952780","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 topology dynamic is one of the important characteristics of vehicular ad hoc network (VANET). The study of the temporal topology of VANET plays a significant role in network protocol development and management. The temporal model of VANET as temporal reachability graph model is built. This model not only describes the packet transmission time, but also can capture the store-and-forward mechanism in VANET. The relations of the packet transmission time τ and the maximum tolerated delay time δ to the density, global efficiency and link duration are analyzed. The results show that compared to the static network, the temporal network can capture the information transmission process in VANET better, and the decrease of packet transmission time τ or the increase of maximum tolerated delay time δ contributes to the improvement of transmission efficiency of VANET.
{"title":"Dynamic analysis of VANET using temporal reachability graph","authors":"Huifang Feng, Junpeng Zhang, Junxia Wang, Youji Xu","doi":"10.1109/ICCT.2017.8359744","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359744","url":null,"abstract":"The topology dynamic is one of the important characteristics of vehicular ad hoc network (VANET). The study of the temporal topology of VANET plays a significant role in network protocol development and management. The temporal model of VANET as temporal reachability graph model is built. This model not only describes the packet transmission time, but also can capture the store-and-forward mechanism in VANET. The relations of the packet transmission time τ and the maximum tolerated delay time δ to the density, global efficiency and link duration are analyzed. The results show that compared to the static network, the temporal network can capture the information transmission process in VANET better, and the decrease of packet transmission time τ or the increase of maximum tolerated delay time δ contributes to the improvement of transmission efficiency of VANET.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131070661","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359628
Lei Peng, G. Zang, Qian Zhou, Yuanyuan Gao, Chenjing Xi
In this paper, we investigate the secure transmission problem of cooperative communication systems where a potential malicious eavesdropper is existing. Based on the more general Nakagami-m fading channels, we adopt a strategy to improve the system security performance by decoding and forwarding signals at the relay as well as sending interference signals simultaneously. In this model, the outage probability and the intercept probability which represent reliability and security respectively are derived, meanwhile, the influence of the power allocation of each node on the system performance is discussed. Simulations are provided to analyze the tradeoff between reliability and security of the system, and the variation in tradeoff performance under different power allocation.
{"title":"Security performance analysis for cooperative communication system under Nakagami-m fading channel","authors":"Lei Peng, G. Zang, Qian Zhou, Yuanyuan Gao, Chenjing Xi","doi":"10.1109/ICCT.2017.8359628","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359628","url":null,"abstract":"In this paper, we investigate the secure transmission problem of cooperative communication systems where a potential malicious eavesdropper is existing. Based on the more general Nakagami-m fading channels, we adopt a strategy to improve the system security performance by decoding and forwarding signals at the relay as well as sending interference signals simultaneously. In this model, the outage probability and the intercept probability which represent reliability and security respectively are derived, meanwhile, the influence of the power allocation of each node on the system performance is discussed. Simulations are provided to analyze the tradeoff between reliability and security of the system, and the variation in tradeoff performance under different power allocation.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131845892","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 : 2017-10-01DOI: 10.1109/icct.2017.8359804
Xiang Liu, Dongsheng Li
One important issue when multiple cooperating electronic combat air vehicles (ECAVs) are used to generate phantom radar tracks in a radar network is the position inaccuracy. Under the background of radar network with the centralized fusion architecture, the same-source-testing recognition for phantom track jamming has been proposed in the presence of the difference of spatial distribution property between phantom track and target track. In order to solve this problem, a deviation compensation for phantom radar tracks is presented. Firstly, the effect of the inaccuracies of radar position and ECAVs position to the phantom track is considered. Then, a deviation compensation for the same-source-testing recognition is proposed. Finally, the simulation results show that the method can reduce the recognition rate of phantom track effectively.
{"title":"The technology of deviation compensation for radar phantom tracks","authors":"Xiang Liu, Dongsheng Li","doi":"10.1109/icct.2017.8359804","DOIUrl":"https://doi.org/10.1109/icct.2017.8359804","url":null,"abstract":"One important issue when multiple cooperating electronic combat air vehicles (ECAVs) are used to generate phantom radar tracks in a radar network is the position inaccuracy. Under the background of radar network with the centralized fusion architecture, the same-source-testing recognition for phantom track jamming has been proposed in the presence of the difference of spatial distribution property between phantom track and target track. In order to solve this problem, a deviation compensation for phantom radar tracks is presented. Firstly, the effect of the inaccuracies of radar position and ECAVs position to the phantom track is considered. Then, a deviation compensation for the same-source-testing recognition is proposed. Finally, the simulation results show that the method can reduce the recognition rate of phantom track effectively.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132093043","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359701
Chen Di, S. Xiaodong, Ge Hailong, Li Hao, Zhou Shilei
This paper presents SPOIL (Shifted POI List), a new method to achieve location privacy for map services on smartphones. Using SPOIL, users can query routes from POI (Point of Interests) A to POI B, while not revealing the locations of A and B to the map server. Different from previous works, SPOIL is transparent to existing map services, assume no trusted third party, and more efficient for smartphones. The basic idea is simple: the client (i.e., smartphone) shifts user-intended POIs to some neighboring POIs instead, and query the map server using the shifted POIs. By carefully selecting places for shifting, we ensure: (1) privacy: on observing the route query, it is difficult for an adversary to identify the user-intended endpoints. (2) usability: the returned route is very similar to the intended one, thus giving useful directions for the user; To make SPOIL efficient for smartphones, we let clients retrieve candidate places for shifting from an additional server, instead of storing all the places and computing nearest ones locally. We implement SPOIL as an Android application, and evaluate it with real query traces. Experimental results show that SPOIL strikes a good balance among privacy, usability and efficiency.
本文提出了一种实现智能手机地图服务位置隐私的新方法——shiftpoi List (SPOIL)。使用SPOIL，用户可以查询从POI(兴趣点)A到POI B的路线，而不会向地图服务器显示A和B的位置。与之前的作品不同，SPOIL对现有的地图服务是透明的，假设没有可信的第三方，对智能手机更高效。基本思想很简单:客户端(即智能手机)将用户预期的poi转移到一些邻近的poi，并使用转移的poi查询地图服务器。通过仔细选择移动的位置，我们确保:(1)隐私:在观察路由查询时，攻击者很难识别用户预期的端点。(2)可用性:返回的路径与预期的路径非常相似，从而为用户提供有用的方向;为了使智能手机的SPOIL更高效，我们让客户端检索候选位置以便从另一个服务器转移，而不是存储所有位置并在本地计算最近的位置。我们将SPOIL实现为Android应用程序，并使用真实的查询跟踪对其进行评估。实验结果表明，该算法在隐私性、可用性和效率之间取得了很好的平衡。
{"title":"SPOIL: Practical location privacy for location based services","authors":"Chen Di, S. Xiaodong, Ge Hailong, Li Hao, Zhou Shilei","doi":"10.1109/ICCT.2017.8359701","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359701","url":null,"abstract":"This paper presents SPOIL (Shifted POI List), a new method to achieve location privacy for map services on smartphones. Using SPOIL, users can query routes from POI (Point of Interests) A to POI B, while not revealing the locations of A and B to the map server. Different from previous works, SPOIL is transparent to existing map services, assume no trusted third party, and more efficient for smartphones. The basic idea is simple: the client (i.e., smartphone) shifts user-intended POIs to some neighboring POIs instead, and query the map server using the shifted POIs. By carefully selecting places for shifting, we ensure: (1) privacy: on observing the route query, it is difficult for an adversary to identify the user-intended endpoints. (2) usability: the returned route is very similar to the intended one, thus giving useful directions for the user; To make SPOIL efficient for smartphones, we let clients retrieve candidate places for shifting from an additional server, instead of storing all the places and computing nearest ones locally. We implement SPOIL as an Android application, and evaluate it with real query traces. Experimental results show that SPOIL strikes a good balance among privacy, usability and efficiency.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132203053","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359931
Shuqin Chen, Zhi Li, Xinyu Cheng, Qingxia Gao
This study proposed a video dual watermarking algorithm based on affine-scale invariant feature transform (ASIFT) and contourlet transform. First, the human visual masking model of a 3D motion in video sequence is studied in depth. The human eye visual masking threshold is obtained as the maximum embedding intensity of watermark using various motion characteristics. Second, the high- and low-frequency sub-band coefficients of the contourlet field are obtained by contourlet transform. Chaotic watermarking sequence is embedded into the high-frequency sub-band coefficient with the highest energy to increase imperceptibility. Third, when the low-frequency sub-band coefficients has the stability of its coefficient histogram against geometric attacks such as rotation and scaling, the watermark signal is embedded in a low-frequency sub-band histogram of adjacent coefficients to increase the watermark of an anti-geometric attack. Finally, ASIFT is used as a trigger to determine whether the video frame is subjected to geometric attacks or not. For geometric distortions, ASIFT is used to regulate the geometrically attacked video frame. The low-frequency sub-band coefficients of the regulated video frame are used for the watermarking extraction algorithm. The high-frequency watermarking extraction algorithm is used directly for the non-geometric distortions. Experimental results show that the proposed algorithm could guarantee watermark invisibility and favorably extract the watermark for common geometric and conventional signal attacks. The proposed algorithm is a strong video-dual watermarking algorithm.
{"title":"Video dual watermarking algorithm against geometric attack based on ASIFT and contourlet transform","authors":"Shuqin Chen, Zhi Li, Xinyu Cheng, Qingxia Gao","doi":"10.1109/ICCT.2017.8359931","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359931","url":null,"abstract":"This study proposed a video dual watermarking algorithm based on affine-scale invariant feature transform (ASIFT) and contourlet transform. First, the human visual masking model of a 3D motion in video sequence is studied in depth. The human eye visual masking threshold is obtained as the maximum embedding intensity of watermark using various motion characteristics. Second, the high- and low-frequency sub-band coefficients of the contourlet field are obtained by contourlet transform. Chaotic watermarking sequence is embedded into the high-frequency sub-band coefficient with the highest energy to increase imperceptibility. Third, when the low-frequency sub-band coefficients has the stability of its coefficient histogram against geometric attacks such as rotation and scaling, the watermark signal is embedded in a low-frequency sub-band histogram of adjacent coefficients to increase the watermark of an anti-geometric attack. Finally, ASIFT is used as a trigger to determine whether the video frame is subjected to geometric attacks or not. For geometric distortions, ASIFT is used to regulate the geometrically attacked video frame. The low-frequency sub-band coefficients of the regulated video frame are used for the watermarking extraction algorithm. The high-frequency watermarking extraction algorithm is used directly for the non-geometric distortions. Experimental results show that the proposed algorithm could guarantee watermark invisibility and favorably extract the watermark for common geometric and conventional signal attacks. The proposed algorithm is a strong video-dual watermarking algorithm.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130862855","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 : 2017-10-01DOI: 10.1109/ICCT.2017.8359626
Wuwen Lai, Ning Guan, Han Liu, Hua Wang
Throughput is a key network performance for disseminating infotainment services in Vehicular Ad Hoc Networks (VANETs). However, when throughput is analyzed by Markov chain, wireless channel conditions and vehicle speed are not taken into account in modeling Medium Access Control (MAC) operations. In this paper, we propose an improved Markov chain model combining the above two factors to calculate the transmission probability. The saturated throughput is evaluated with considering MAC operations, wireless channel conditions, and vehicle speed. Compared with the basic model, our proposed model can accurately evaluate the saturation throughput with consideration of the aforementioned three factors simultaneously.
{"title":"Saturated throughput analysis of vehicular ad hoc networks over Rayleigh-fading channels","authors":"Wuwen Lai, Ning Guan, Han Liu, Hua Wang","doi":"10.1109/ICCT.2017.8359626","DOIUrl":"https://doi.org/10.1109/ICCT.2017.8359626","url":null,"abstract":"Throughput is a key network performance for disseminating infotainment services in Vehicular Ad Hoc Networks (VANETs). However, when throughput is analyzed by Markov chain, wireless channel conditions and vehicle speed are not taken into account in modeling Medium Access Control (MAC) operations. In this paper, we propose an improved Markov chain model combining the above two factors to calculate the transmission probability. The saturated throughput is evaluated with considering MAC operations, wireless channel conditions, and vehicle speed. Compared with the basic model, our proposed model can accurately evaluate the saturation throughput with consideration of the aforementioned three factors simultaneously.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130870360","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 : 2017-10-01DOI: 10.1109/icct.2017.8359797
Ting Bai, Hanying Hu, Xiyu Song
In this paper, we presented a novel waveform design method for orthogonal frequency division multiplexing (OFDM) multiple input multiple output (MIMO) radar with low sidelobe level and high range resolution. The signal model that all OFDM subcarriers are transmitted on each antenna is established to ensure high range resolution. And code domain orthogonality is achieved through complex orthogonal design (COD). Moreover, we transform range sidelobe suppression into an unconstrained optimization problem based on the relationship between the transmitted waveform and the phase. The Integrated Sidelobe Level (ISL) is utilized as the objective function, and then solved by Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. Simulation results show that the proposed method has remarkable performance in suppressing sidelobe and high range resolution.
{"title":"OFDM MIMO radar waveform design with high range resolution and low sidelobe level","authors":"Ting Bai, Hanying Hu, Xiyu Song","doi":"10.1109/icct.2017.8359797","DOIUrl":"https://doi.org/10.1109/icct.2017.8359797","url":null,"abstract":"In this paper, we presented a novel waveform design method for orthogonal frequency division multiplexing (OFDM) multiple input multiple output (MIMO) radar with low sidelobe level and high range resolution. The signal model that all OFDM subcarriers are transmitted on each antenna is established to ensure high range resolution. And code domain orthogonality is achieved through complex orthogonal design (COD). Moreover, we transform range sidelobe suppression into an unconstrained optimization problem based on the relationship between the transmitted waveform and the phase. The Integrated Sidelobe Level (ISL) is utilized as the objective function, and then solved by Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. Simulation results show that the proposed method has remarkable performance in suppressing sidelobe and high range resolution.","PeriodicalId":199874,"journal":{"name":"2017 IEEE 17th International Conference on Communication Technology (ICCT)","volume":"08 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130939566","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
扫码关注我们
求助内容：
应助结果提醒方式：