Mutual Information Based Co-Design for Coexisting MIMO Radar and Communication Systems

Author(s):  
Yuanhao Cui ◽  
Visa Koivunen ◽  
Xiaojun Jing
2017 ◽  
Vol 825 ◽  
pp. 704-742 ◽  
Author(s):  
Jose M. Pozo ◽  
Arjan J. Geers ◽  
Maria-Cruz Villa-Uriol ◽  
Alejandro F. Frangi

Flow complexity is related to a number of phenomena in science and engineering and has been approached from the perspective of chaotic dynamical systems, ergodic processes or mixing of fluids, just to name a few. To the best of our knowledge, all existing methods to quantify flow complexity are only valid for infinite time evolution, for closed systems or for mixing of two substances. We introduce an index of flow complexity coined interlacing complexity index (ICI), valid for a single-phase flow in an open system with inlet and outlet regions, involving finite times. ICI is based on Shannon’s mutual information (MI), and inspired by an analogy between inlet–outlet open flow systems and communication systems in communication theory. The roles of transmitter, receiver and communication channel are played, respectively, by the inlet, the outlet and the flow transport between them. A perfectly laminar flow in a straight tube can be compared to an ideal communication channel where the transmitted and received messages are identical and hence the MI between input and output is maximal. For more complex flows, generated by more intricate conditions or geometries, the ability to discriminate the outlet position by knowing the inlet position is decreased, reducing the corresponding MI. The behaviour of the ICI has been tested with numerical experiments on diverse flows cases. The results indicate that the ICI provides a sensitive complexity measure with intuitive interpretation in a diversity of conditions and in agreement with other observations, such as Dean vortices and subjective visual assessments. As a crucial component of the ICI formulation, we also introduce the natural distribution of streamlines and the natural distribution of world-lines, with invariance properties with respect to the cross-section used to parameterize them, valid for any type of mass-preserving flow.


Multiple-input multiple-output (MIMO) radar is used extensively due to its application of simultaneous transmission and reception of multiple signals through multiple antennas or channels. MIMO radar receives enormous attention in communication technologies due to its better target detection, higher resolution and improved accurate target parameter estimation. The MIMO radar has several antennas for transmitting the information and also the reflected signals from the target is received by the multiple antennas and it mainly used in military and civilian fields. But sometimes the performance of the MIMO radars is degraded due to its limited power. So the optimum power allocation is required in the communication systems of MIMO radar to improve its performance. In this paper, an Energy Efficiency based Power Allocation (EEPA) is used to allocate the power to a user of the clusters and also across the clusters. Here, the MIMO radars are clustered by using a naive bayes classifier. Subsequently, an efficient target detection is achieved by using Generalized Likelihood Ratio Test (GLRT) and then the clusters are divided into primary and distributive clusters based on the distance from the target. Here, the proposed methodology is named as EEPA-GLRT and the implementation of this MIMO radar system with an effective power allocation is done by Labview. The performance of the EEPA-GLRT methodology is analyzed in terms of the power consumption of various clusters. The performance of the EEPA-GLRT methodology is compared with Generalized Nash Game (GNG) method and it shows the power consumption of EEPA-GLRT is 0.0549 for cluster 1 of scenario 1, which is less when compared to the GNG method.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 136278-136295
Author(s):  
Xiangyu Fan ◽  
Peng Bai ◽  
Hongwei Wang ◽  
Jiaqiang Zhang ◽  
Huanyu Li

2019 ◽  
Vol 26 (1) ◽  
pp. 194-198 ◽  
Author(s):  
Qian He ◽  
Zhen Wang ◽  
Jianbin Hu ◽  
Rick S. Blum

Sign in / Sign up

Export Citation Format

Share Document