Pub Date : 2018-06-01DOI: 10.1109/SPAWC.2018.8446018
Jing Zhong, R. Yates, E. Soljanin
We consider a multicast network in which real-time status updates generated by a source are replicated and sent to multiple interested receiving nodes through independent links. The receiving nodes are divided into two groups: one priority group consists of k nodes that require the reception of every update packet, the other non-priority group consists of all other nodes without the delivery requirement. Using age of information as a freshness metric, we analyze the time-averaged age at both priority and non-priority nodes. For shifted-exponential link delay distributions, the average age at a priority node is lower than that at a non-priority node due to the delivery guarantee. However, this advantage for priority nodes disappears if the link delay is exponential distributed. Both groups of nodes have the same time-averaged age, which implies that the guaranteed delivery of updates has no effect the time-averaged freshness.
{"title":"Multicast with Prioritized Delivery: How Fresh is Your Data?","authors":"Jing Zhong, R. Yates, E. Soljanin","doi":"10.1109/SPAWC.2018.8446018","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446018","url":null,"abstract":"We consider a multicast network in which real-time status updates generated by a source are replicated and sent to multiple interested receiving nodes through independent links. The receiving nodes are divided into two groups: one priority group consists of k nodes that require the reception of every update packet, the other non-priority group consists of all other nodes without the delivery requirement. Using age of information as a freshness metric, we analyze the time-averaged age at both priority and non-priority nodes. For shifted-exponential link delay distributions, the average age at a priority node is lower than that at a non-priority node due to the delivery guarantee. However, this advantage for priority nodes disappears if the link delay is exponential distributed. Both groups of nodes have the same time-averaged age, which implies that the guaranteed delivery of updates has no effect the time-averaged freshness.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126944292","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-06-01DOI: 10.1109/SPAWC.2018.8445894
K. Hu, F. Kaltenberger, A. G. Armada
The Fifth Generation of mobile communications (5G) is being standardized in order to reach higher data rates and deploy new services. In this frame, researchers are looking for possible waveforms to improve the air interface. Orthogonal Frequency Division Multiplexing (OFDM) has high Out-of-Band Emissions (OBE) which force us to leave wider guard bands, reducing so the spectral efficiency. Recently, we have proposed the Power Adapted-OFDM which is capable of fulfilling the requirements of 5G and avoids the main issues of other proposed candidates. OpenAir Interface (OAI) is a powerful and flexible wireless technology platform based on the Long-Term Evolution (LTE) ecosystem, which offers the possibility of evaluating the effects of introducing a new technology on the entire mobile communication system. In this paper, we will evaluate and show the performance of the proposed technique using the OAI.
{"title":"Implementation and Measurement of Power Adapted-OFDM Using OpenAirInterface","authors":"K. Hu, F. Kaltenberger, A. G. Armada","doi":"10.1109/SPAWC.2018.8445894","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445894","url":null,"abstract":"The Fifth Generation of mobile communications (5G) is being standardized in order to reach higher data rates and deploy new services. In this frame, researchers are looking for possible waveforms to improve the air interface. Orthogonal Frequency Division Multiplexing (OFDM) has high Out-of-Band Emissions (OBE) which force us to leave wider guard bands, reducing so the spectral efficiency. Recently, we have proposed the Power Adapted-OFDM which is capable of fulfilling the requirements of 5G and avoids the main issues of other proposed candidates. OpenAir Interface (OAI) is a powerful and flexible wireless technology platform based on the Long-Term Evolution (LTE) ecosystem, which offers the possibility of evaluating the effects of introducing a new technology on the entire mobile communication system. In this paper, we will evaluate and show the performance of the proposed technique using the OAI.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"230 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114589180","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-06-01DOI: 10.1109/SPAWC.2018.8445941
Georgios Lourakis, A. Liavas
We consider the problem of nonnegative tensor completion. Our aim is to derive an efficient algorithm that is also suitable for parallel implementation. We adopt the alternating optimization framework and solve each nonnegative matrix completion problem via a Nesterov-type algorithm for smooth convex problems. We describe a parallel implementation of the algorithm and measure the attained speedup in a multi-core computing environment. It turns out that the derived algorithm is an efficient candidate for the solution of very large-scale sparse nonnegative tensor completion problems.
{"title":"Nesterov-Based Alternating Optimization for Nonnegative Tensor Completion: Algorithm and Parallel Implementation","authors":"Georgios Lourakis, A. Liavas","doi":"10.1109/SPAWC.2018.8445941","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445941","url":null,"abstract":"We consider the problem of nonnegative tensor completion. Our aim is to derive an efficient algorithm that is also suitable for parallel implementation. We adopt the alternating optimization framework and solve each nonnegative matrix completion problem via a Nesterov-type algorithm for smooth convex problems. We describe a parallel implementation of the algorithm and measure the attained speedup in a multi-core computing environment. It turns out that the derived algorithm is an efficient candidate for the solution of very large-scale sparse nonnegative tensor completion problems.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115887665","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-06-01DOI: 10.1109/SPAWC.2018.8446001
P. Song, M. Rodrigues
In real-world scenarios, many data processing problems often involve heterogeneous images associated with different imaging modalities. Since these multimodal images originate from the same phenomenon, it is realistic to assume that they share common attributes or characteristics. In this paper, we propose a multi-modal image processing framework based on coupled dictionary learning to capture similaries and disparities between different image modalities. In particular, our framework can capture favorable structure similarities across different image modalities such as edges, corners, and other elementary primitives in a learned sparse transform domain, instead of the original pixel domain, that can be used to improve a number of image processing tasks such as denoising, inpainting, or super-resolution. Practical experiments demonstrate that incorporating multimodal information using our framework brings notable benefits.
{"title":"Multi-Modal Image Processing Based on Coupled Dictionary Learning","authors":"P. Song, M. Rodrigues","doi":"10.1109/SPAWC.2018.8446001","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446001","url":null,"abstract":"In real-world scenarios, many data processing problems often involve heterogeneous images associated with different imaging modalities. Since these multimodal images originate from the same phenomenon, it is realistic to assume that they share common attributes or characteristics. In this paper, we propose a multi-modal image processing framework based on coupled dictionary learning to capture similaries and disparities between different image modalities. In particular, our framework can capture favorable structure similarities across different image modalities such as edges, corners, and other elementary primitives in a learned sparse transform domain, instead of the original pixel domain, that can be used to improve a number of image processing tasks such as denoising, inpainting, or super-resolution. Practical experiments demonstrate that incorporating multimodal information using our framework brings notable benefits.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124014970","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-06-01DOI: 10.1109/SPAWC.2018.8445998
H. Tataria, M. Matthaiou, Peter J. Smith, G. Alexandropoulos, V. Fusco
Lens-based massive multiple-input multiple-output (MIMO) systems have considerable potential to reduce signal processing cost at millimeter-wave frequencies. As a result, they are able to lower the effective channel dimension via beam selection, realized with a network of radio-frequency (RF) switches. However, lens arrays suffer from the inherent quantization of the beamspace, as well as errors due to imperfections in the lens construction itself. Unlike prior works, we model the above effects in the context of a Rotman lens-enabled massive MIMO system. Assuming line-of-sight propagation, we derive analytical approximations of the expected (average) signal-to-interference-plus-noise-ratio (SINR) of a terminal and ergodic sum spectral efficiency of the system. Our analysis caters for spillover losses in the Rotman lens and imperfections in the RF switching matrix, caused by impedance mismatches, as well as poor port isolation. The presented numerical results show large degradation in the expected SINR and ergodic spectral efficiency when considering the above imperfections, yielding more accurate performance assessment of lens-based massive MIMO systems.
{"title":"Impact of RF Processing and Switching Errors in Lens-Based Massive MIMO Systems","authors":"H. Tataria, M. Matthaiou, Peter J. Smith, G. Alexandropoulos, V. Fusco","doi":"10.1109/SPAWC.2018.8445998","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445998","url":null,"abstract":"Lens-based massive multiple-input multiple-output (MIMO) systems have considerable potential to reduce signal processing cost at millimeter-wave frequencies. As a result, they are able to lower the effective channel dimension via beam selection, realized with a network of radio-frequency (RF) switches. However, lens arrays suffer from the inherent quantization of the beamspace, as well as errors due to imperfections in the lens construction itself. Unlike prior works, we model the above effects in the context of a Rotman lens-enabled massive MIMO system. Assuming line-of-sight propagation, we derive analytical approximations of the expected (average) signal-to-interference-plus-noise-ratio (SINR) of a terminal and ergodic sum spectral efficiency of the system. Our analysis caters for spillover losses in the Rotman lens and imperfections in the RF switching matrix, caused by impedance mismatches, as well as poor port isolation. The presented numerical results show large degradation in the expected SINR and ergodic spectral efficiency when considering the above imperfections, yielding more accurate performance assessment of lens-based massive MIMO systems.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122166823","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-06-01DOI: 10.1109/SPAWC.2018.8445961
Anna Guerra, Nicola Spamacci, D. Dardari, P. Djurić
In this paper, we study the capacity of UAV networks for high-accuracy localization of targets. We address the problem of designing a distributed control scheme for UAV navigation and formation based on an information-seeking criterion maximizing the target localization accuracy. Each UAV is assumed to be able to communicate and collaborate with other UAVs that are within a neighboring region, allowing for a feasible distributed solution which takes into account a trade-off between localization accuracy and speed of convergence to a suitable localization of the target. Such an investigation also considers communication latency constraints as well as safety requirements such as inter-UAV and obstacle collision avoidance.
{"title":"Collaborative Target-Localization and Information-Based Control in Networks of UAVs","authors":"Anna Guerra, Nicola Spamacci, D. Dardari, P. Djurić","doi":"10.1109/SPAWC.2018.8445961","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445961","url":null,"abstract":"In this paper, we study the capacity of UAV networks for high-accuracy localization of targets. We address the problem of designing a distributed control scheme for UAV navigation and formation based on an information-seeking criterion maximizing the target localization accuracy. Each UAV is assumed to be able to communicate and collaborate with other UAVs that are within a neighboring region, allowing for a feasible distributed solution which takes into account a trade-off between localization accuracy and speed of convergence to a suitable localization of the target. Such an investigation also considers communication latency constraints as well as safety requirements such as inter-UAV and obstacle collision avoidance.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117189363","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-06-01DOI: 10.1109/SPAWC.2018.8445916
Jong Jin Park, J. Moon, Kangyoon Lee, Dong In Kim
In this paper, we design a self-powering dual mode simultaneous wireless information and power transfer (SWIPT) system in which a sensor node adaptively controls single tone or multi-tone communication mode. To this end, we introduce duty cycle operation for the dual mode SWIPT with self-powering, which considers nonlinear energy harvesting (EH) model for both single tone and multi-tone waveforms. We formulate an adaptive mode switching (MS) problem which maximizes the achievable rate under the energy causality condition. On top of this, a novel iterative inner/outer loop algorithm is implemented to solve the adaptive MS problem. Our newly designed dual mode SWIPT can be applied to low-power Internet-of-Things (IoT) network with wireless EH capability for self-powering, thereby realizing battery-free IoT network. From the results presented, we provide interesting insights that can be applied to design the dual mode SWIPT system over existing SWIPT.
{"title":"Adaptive Mode Switching Algorithm for Dual Mode SWIPT with Duty Cycle Operation","authors":"Jong Jin Park, J. Moon, Kangyoon Lee, Dong In Kim","doi":"10.1109/SPAWC.2018.8445916","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445916","url":null,"abstract":"In this paper, we design a self-powering dual mode simultaneous wireless information and power transfer (SWIPT) system in which a sensor node adaptively controls single tone or multi-tone communication mode. To this end, we introduce duty cycle operation for the dual mode SWIPT with self-powering, which considers nonlinear energy harvesting (EH) model for both single tone and multi-tone waveforms. We formulate an adaptive mode switching (MS) problem which maximizes the achievable rate under the energy causality condition. On top of this, a novel iterative inner/outer loop algorithm is implemented to solve the adaptive MS problem. Our newly designed dual mode SWIPT can be applied to low-power Internet-of-Things (IoT) network with wireless EH capability for self-powering, thereby realizing battery-free IoT network. From the results presented, we provide interesting insights that can be applied to design the dual mode SWIPT system over existing SWIPT.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128612740","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-06-01DOI: 10.1109/SPAWC.2018.8446045
S. Ni, A. M. So
We consider the joint admission control and multicast downlink beamforming (JABF) problem, which is a fundamental problem in signal processing and admits a natural mixed-integer quadratically constrained quadratic program (MIQCQP) formulation. One popular approach to tackling such MIQCQP formulation is to develop convex relaxations of both the binary and continuous variables. However, most existing convex relaxations impose rather weak relationships between the binary and continuous variables and thus do not yield high-performance solutions. To overcome this weakness, we propose to keep the binary constraints intact and apply the semidefinite relaxation (SDR) technique to continuous variables. Although the resulting relaxation takes the form of a mixed-integer semidefinite program (MISDP) and is theoretically intractable in general, by exploiting the fact that such MISDP arises as a mixed-integer SDR of an MIQCQP and harnessing recent computational advances in solving large-scale mixed-integer second-order cone programming (MISOCP) problems, we develop a novel, practically efficient algorithm that provably converges to an optimal solution to the MISDP in a finite number of steps. The key idea of our algorithm is to construct successively tighter second-order cone (SOC) outer approximations of the constraints in the MISDP and solve a sequence of MISOCPs to obtain an optimal solution to the MISDP. Our work also provides, to the best of our knowledge, the first general framework for solving MISDPs that arise as mixed-integer SDRs of MIQCQPs. Next, we show that by applying a Gaussian randomization procedure to the optimal solution to the MISDP, we obtain a feasible solution to the JABF problem whose approximation accuracy is on the order of M, the number of users in the network. This improves upon the approximation accuracy guarantee of an existing convex relaxation method. Lastly, we present numerical results to demonstrate the viability of our proposed approach.
{"title":"Mixed-Integer Semidefinite Relaxation of Joint Admission Control and Beamforming: An SOC-Based Outer Approximation Approach with Provable Guarantees","authors":"S. Ni, A. M. So","doi":"10.1109/SPAWC.2018.8446045","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446045","url":null,"abstract":"We consider the joint admission control and multicast downlink beamforming (JABF) problem, which is a fundamental problem in signal processing and admits a natural mixed-integer quadratically constrained quadratic program (MIQCQP) formulation. One popular approach to tackling such MIQCQP formulation is to develop convex relaxations of both the binary and continuous variables. However, most existing convex relaxations impose rather weak relationships between the binary and continuous variables and thus do not yield high-performance solutions. To overcome this weakness, we propose to keep the binary constraints intact and apply the semidefinite relaxation (SDR) technique to continuous variables. Although the resulting relaxation takes the form of a mixed-integer semidefinite program (MISDP) and is theoretically intractable in general, by exploiting the fact that such MISDP arises as a mixed-integer SDR of an MIQCQP and harnessing recent computational advances in solving large-scale mixed-integer second-order cone programming (MISOCP) problems, we develop a novel, practically efficient algorithm that provably converges to an optimal solution to the MISDP in a finite number of steps. The key idea of our algorithm is to construct successively tighter second-order cone (SOC) outer approximations of the constraints in the MISDP and solve a sequence of MISOCPs to obtain an optimal solution to the MISDP. Our work also provides, to the best of our knowledge, the first general framework for solving MISDPs that arise as mixed-integer SDRs of MIQCQPs. Next, we show that by applying a Gaussian randomization procedure to the optimal solution to the MISDP, we obtain a feasible solution to the JABF problem whose approximation accuracy is on the order of M, the number of users in the network. This improves upon the approximation accuracy guarantee of an existing convex relaxation method. Lastly, we present numerical results to demonstrate the viability of our proposed approach.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121102378","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-06-01DOI: 10.1109/SPAWC.2018.8446026
Jordi Borras, G. Vázquez
The statistical side information of interference channels is exploited in this paper to derive a novel uncoordinated on-line pilot design strategy for opportunistic communications. Assuming a time division duplex (TDD), or frequency division duplex (FDD) with feedback, wireless network and reciprocity, we prove that the space-frequency pilot design technique in terms of minimum cross-interference to external-network users reduces to a classical minimum-norm problem. The advantages of this novel methodology are time-domain invariance to noise-subspace rotations, a maximally flat angle-frequency response, and robustness in front of frequency calibration errors. Simulation results are reported to assess the performance of the proposed strategy and the advantages of its low-resolution quantization in low signal-to-noise ratio (low-SNR) regimes.
{"title":"Uncoordinated Space-Frequency Pilot Design for Multi-Antenna Wideband Opportunistic Communications","authors":"Jordi Borras, G. Vázquez","doi":"10.1109/SPAWC.2018.8446026","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8446026","url":null,"abstract":"The statistical side information of interference channels is exploited in this paper to derive a novel uncoordinated on-line pilot design strategy for opportunistic communications. Assuming a time division duplex (TDD), or frequency division duplex (FDD) with feedback, wireless network and reciprocity, we prove that the space-frequency pilot design technique in terms of minimum cross-interference to external-network users reduces to a classical minimum-norm problem. The advantages of this novel methodology are time-domain invariance to noise-subspace rotations, a maximally flat angle-frequency response, and robustness in front of frequency calibration errors. Simulation results are reported to assess the performance of the proposed strategy and the advantages of its low-resolution quantization in low signal-to-noise ratio (low-SNR) regimes.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121287680","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-06-01DOI: 10.1109/SPAWC.2018.8445893
Shiqi Gong, Shaodan Ma, Xing Wei, C. Xing, Guanghua Yang
In this paper, we consider a radar system with a subarray-based frequency diverse array (FDA) as the transmitting array, which consists of two FDA subarrays with different frequency increments to achieve single maximum beam response for any target. In order to distinguish the desired signal and multiple interferences with close spatial directions in most scenarios, a novel polarization sensitive FDA (PSFDA) is proposed as the receiving array to suppress interference and further improve the signal to interference-plus-noise ratio (SINR) for accurate target detection. Joint transmit-receive beampattern optimization is particularly investigated here. Specifically, in our work, we aim at maximizing the output SINR of the proposed polarization-subarray-based FDA radar by jointly optimizing the FDA transmit beamforming, the PSFDA spatial pointings and the PSFDA receive beamforming. To tackle the nonconvexity of the formulated SINR maximization problem, an alternating optimization algorithm is proposed to decompose the original problem into three convex subproblems, which can all be efficiently solved by the interior point method. Numerical experiments verify the superior output SINR performance of the proposed iterative algorithm.
{"title":"Transmit-Receive Beampattern Optimization for Polarization-Subarray-Based Frequency Diverse Array Radar","authors":"Shiqi Gong, Shaodan Ma, Xing Wei, C. Xing, Guanghua Yang","doi":"10.1109/SPAWC.2018.8445893","DOIUrl":"https://doi.org/10.1109/SPAWC.2018.8445893","url":null,"abstract":"In this paper, we consider a radar system with a subarray-based frequency diverse array (FDA) as the transmitting array, which consists of two FDA subarrays with different frequency increments to achieve single maximum beam response for any target. In order to distinguish the desired signal and multiple interferences with close spatial directions in most scenarios, a novel polarization sensitive FDA (PSFDA) is proposed as the receiving array to suppress interference and further improve the signal to interference-plus-noise ratio (SINR) for accurate target detection. Joint transmit-receive beampattern optimization is particularly investigated here. Specifically, in our work, we aim at maximizing the output SINR of the proposed polarization-subarray-based FDA radar by jointly optimizing the FDA transmit beamforming, the PSFDA spatial pointings and the PSFDA receive beamforming. To tackle the nonconvexity of the formulated SINR maximization problem, an alternating optimization algorithm is proposed to decompose the original problem into three convex subproblems, which can all be efficiently solved by the interior point method. Numerical experiments verify the superior output SINR performance of the proposed iterative algorithm.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121541867","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
扫码关注我们
求助内容：
应助结果提醒方式：