اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOPARC: Optimal and Precise Array Response Control Algorithm -- Part II: Multi-points and Applications
219
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, the optimal and precise array response control (OPARC) algorithm proposed in Part I of this two paper series is extended from single point to multi-points. Two computationally attractive parameter determination approaches are provided to maximize the array gain under certain constraints. In addition, the applications of the multi-point OPARC algorithm to array signal processing are studied. It is applied to realize array pattern synthesis (including the general array case and the large array case), multi-constraint adaptive beamforming and quiescent pattern control, where an innovative concept of normalized covariance matrix loading (NCL) is proposed. Finally, simulation results are presented to validate the superiority and effectiveness of the multi-point OPARC algorithm.
قيم البحث
اقرأ أيضاً
In this paper, the problem of how to optimally and precisely control array response levels is addressed. By using the concept of the optimal weight vector from the adaptive array theory and adding virtual interferences one by one, the change rule of
the optimal weight vector is found and a new formulation of the weight vector update is thus devised. Then, the issue of how to precisely control the response level of one single direction is investigated. More specifically, we assign a virtual interference to a direction such that the response level can be precisely controlled. Moreover, the parameters, such as, the interference-to-noise ratio (INR), can be figured out according to the desired level. Additionally, the parameter optimization is carried out to obtain the maximal array gain. The resulting scheme is called optimal and precise array response control (OPARC) in this paper. To understand it better, its properties are given, and its comparison with the existing accurate array response control ($ {textrm A}^2textrm{RC} $) algorithm is provided. Finally, simulation results are presented to verify the effectiveness and superiority of the proposed OPARC.
This paper presents a novel array response control algorithm and its application to array pattern synthesis. The proposed algorithm considers how to flexibly and precisely adjust the array responses at multiple points, on the basis of one given weigh
t vector. With the principle of adaptive beamforming, it is shown that the optimal weight vector for array response control can be equivalently obtained with a different manner, in which a linear transformation is conducted on the quiescent weight. This new strategy is utilized to realize multi-point precise array response control from one given weight vector, and it obtains a closed-form solution. A careful analysis shows that the response levels at given points can be independently, flexibly and accurately adjusted by simply varying the parameter vector, and that the uncontrolled region remains almost unchanged. By applying the proposed algorithm, an effective pattern synthesis approach is devised. Simulation results are provided to demonstrate the performance of the proposed algorithm.
This work introduces a tensor-based framework of graph signal processing over multilayer networks (M-GSP) to analyze high-dimensional signal interactions. Following Part Is introduction of fundamental definitions and spectrum properties of M-GSP, thi
s second Part focuses on more detailed discussions of implementation and applications of M-GSP. Specifically, we define the concepts of stationary process, convolution, bandlimited signals, and sampling theory over multilayer networks. We also develop fundamentals of filter design and derive approximated methods of spectrum estimation within the proposed framework. For practical applications, we further present several MLN-based methods for signal processing and data analysis. Our experimental results demonstrate significant performance improvement using our M-GSP framework over traditional signal processing solutions.
The first part of this work established the foundations of a radial duality between nonnegative optimization problems, inspired by the work of (Renegar, 2016). Here we utilize our radial duality theory to design and analyze projection-free optimizati
on algorithms that operate by solving a radially dual problem. In particular, we consider radial subgradient, smoothing, and accelerated methods that are capable of solving a range of constrained convex and nonconvex optimization problems and that can scale-up more efficiently than their classic counterparts. These algorithms enjoy the same benefits as their predecessors, avoiding Lipschitz continuity assumptions and costly orthogonal projections, in our newfound, broader context. Our radial duality further allows us to understand the effects and benefits of smoothness and growth conditions on the radial dual and consequently on our radial algorithms.
The design of a conical phased array antenna for air traffic control (ATC) radar systems is addressed in this work. The array, characterized by a fully digital beam-forming (DBF) architecture, is composed of equal vertical modules consisting of linea
r sparse arrays able to generate on receive multiple instantaneous beams pointing along different elevation directions. The synthesis problem is cast in the Compressive Sensing (CS) framework to achieve the best trade-off between the antenna complexity (i.e., minimum number of array elements and/or radio frequency components) and radiation performance (i.e., matching of a set of reference patterns). Towards this aim, the positions of the array elements and the set of complex element excitations of each beam are jointly defined through a customized CS-based optimization tool. Representative numerical results, concerned with ideal as well as real antenna models, are reported and discussed to validate the proposed design strategy and point out the features of the deigned modular sparse arrays also in comparison with those obtained from conventional arrays with uniformly spaced elements.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
