اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAntenna Deployment Method for MIMO Radar under the Situation of Multiple Interference Regions
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, considering multiple interference regions simultaneously, an optimal antenna deployment problem for distributed Multi-Input Multi-Output (MIMO) radar is investigated. The optimal antenna deployment problem is solved by proposing an antenna deployment method based on Multi-Objective Particle Swarm Optimization (MOPSO). Firstly, we construct a multi-objective optimization problem for MIMO radar antenna deployment by choosing the interference power densities of different regions as objective functions. Then, to obtain the optimal deployment result without wasting time and computational resources, an iteration convergence criterion based on interval distance is proposed. The iteration convergence criterion can be used to stop the MOPSO optimization process efficiently when the optimal antenna deployment algorithm reaches the desired convergence level. Finally, numerical results are provided to verify the validity of the proposed algorithm.
قيم البحث
اقرأ أيضاً
In a typical MIMO radar scenario, transmit nodes transmit orthogonal waveforms, while each receive node performs matched filtering with the known set of transmit waveforms, and forwards the results to the fusion center. Based on the data it receives
from multiple antennas, the fusion center formulates a matrix, which, in conjunction with standard array processing schemes, such as MUSIC, leads to target detection and parameter estimation. In MIMO radars with compressive sensing (MIMO-CS), the data matrix is formulated by each receive node forwarding a small number of compressively obtained samples. In this paper, it is shown that under certain conditions, in both sampling cases, the data matrix at the fusion center is low-rank, and thus can be recovered based on knowledge of a small subset of its entries via matrix completion (MC) techniques. Leveraging the low-rank property of that matrix, we propose a new MIMO radar approach, termed, MIMO-MC radar, in which each receive node either performs matched filtering with a small number of randomly selected dictionary waveforms or obtains sub-Nyquist samples of the received signal at random sampling instants, and forwards the results to a fusion center. Based on the received samples, and with knowledge of the sampling scheme, the fusion center partially fills the data matrix and subsequently applies MC techniques to estimate the full matrix. MIMO-MC radars share the advantages of the recently proposed MIMO-CS radars, i.e., high resolution with reduced amounts of data, but unlike MIMO-CS radars do not require grid discretization. The MIMO-MC radar concept is illustrated through a linear uniform array configuration, and its target estimation performance is demonstrated via simulations.
This paper presents an analytical investigation on the outage performance of dual-hop multiple antenna amplify-and-forward relaying systems in the presence of interference. For both the fixed-gain and variable-gain relaying schemes, exact analytical
expressions for the outage probability of the systems are derived. Moreover, simple outage probability approximations at the high signal to noise ratio regime are provided, and the diversity order achieved by the systems are characterized. Our results suggest that variable-gain relaying systems always outperform the corresponding fixed-gain relaying systems. In addition, the fixed-gain relaying schemes only achieve diversity order of one, while the achievable diversity order of the variable-gain relaying scheme depends on the location of the multiple antennas.
Multiple input multiple output (MIMO) radar exhibits several advantages with respect to traditional radar array systems in terms of flexibility and performance. However, MIMO radar poses new challenges for both hardware design and digital processing.
In particular, achieving high azimuth resolution requires a large number of transmit and receive antennas. In addition, the digital processing is performed on samples of the received signal, from each transmitter to each receiver, at its Nyquist rate, which can be prohibitively large when high resolution is needed. Overcoming the rate bottleneck, sub-Nyquist sampling methods have been proposed that break the link between radar signal bandwidth and sampling rate. In this work, we extend these methods to MIMO configurations and propose a sub-Nyquist MIMO radar (SUMMeR) system that performs both time and spatial compression. We present a range-azimuth-Doppler recovery algorithm from sub-Nyquist samples obtained from a reduced number of transmitters and receivers, that exploits the sparsity of the recovered targets parameters. This allows us to achieve reduction in the number of deployed antennas and the number of samples per receiver, without degrading the time and spatial resolutions. Simulations illustrate the detection performance of SUMMeR for different compression levels and shows that both time and spatial resolution are preserved, with respect to classic Nyquist MIMO configurations. We also examine the impact of design parameters, such as antennas locations and carrier frequencies, on the detection performance, and provide guidelines for their choice.
In this paper, we derive an ambiguity function (AF) for the transmit beamspace (TB)-based multipleinput multiple-output (MIMO) radar for the case of far-field targets and narrow-band waveforms. The effects of transmit coherent processing gain and wav
eform diversity are incorporated into the AF definition. To cover all the phase information conveyed by different factors, we introduce the equivalent transmit phase centers. The newly defined AF serves as a generalized AF form for which the phased-array (PA) and traditional MIMO radar AFs are important special cases. We establish relationships among the defined TB-based MIMO radar AF and the existing AF results including the Woodwards AF, the AFs defined for the traditional colocated MIMO radar, and also the PA radar AF, respectively. Moreover, we compare the TB-based MIMO radar AF with the square-summation-form AF definition and identify two limiting cases to bound its clear region in Doppler-delay domain that is free of sidelobes. Corresponding bounds for these two cases are derived, and it is shown that the bound for the worst case is inversely proportional to the number of transmitted waveforms K, whereas the bound for the best case is independent of K. The actual clear region of the TB-based MIMO radar AF depends on the array configuration and is in between of the worst- and best-case bounds. We propose a TB design strategy to reduce the levels of the AF sidelobes, and show in simulations that proper design of the TB matrix leads to reduction of the relative sidelobe levels of the TB-based MIMO radar AF.
Interference alignment (IA) is a joint-transmission technique that achieves the capacity of the interference channel for high signal-to-noise ratios (SNRs). Most prior work on IA is based on the impractical assumption that perfect and global channel-
state information(CSI) is available at all transmitters. To implement IA, each receiver has to feed back CSI to all interferers, resulting in overwhelming feedback overhead. In particular, the sum feedback rate of each receiver scales quadratically with the number of users even if the quantized CSI is fed back. To substantially suppress feedback overhead, this paper focuses on designing efficient arrangements of feedback links, called feedback topologies, under the IA constraint. For the multiple-input-multiple-output (MIMO) K-user interference channel, we propose the feedback topology that supports sequential CSI exchange (feedback and feedforward) between transmitters and receivers so as to achieve IA progressively. This feedback topology is shown to reduce the network feedback overhead from a cubic function of K to a linear one. To reduce the delay in the sequential CSI exchange, an alternative feedback topology is designed for supporting two-hop feedback via a control station, which also achieves the linear feedback scaling with K. Next, given the proposed feedback topologies, the feedback-bit allocation algorithm is designed for allocating feedback bits by each receiver to different feedback links so as to regulate the residual interference caused by the finite-rate feedback. Simulation results demonstrate that the proposed bit allocation leads to significant throughput gains especially in strong interference environments.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
