اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Fast Method for Array Response Adjustment with Phase-Only Constraint
189
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we propose a fast method for array response adjustment with phase-only constraint. This method can precisely and rapidly adjust the array response of a given point by only varying the entry phases of a pre-assigned weight vector. We show that phase-only array response adjustment can be formulated as a polygon construction problem, which can be solved by edge rotation in complex plain. Unlike the existing approaches, the proposed algorithm provides an analytical solution and guarantees a precise phase-only adjustment without pattern distortion. Moreover, the proposed method is suitable for an arbitrarily given weight vector and has a low computational complexity. Representative examples are presented to demonstrate the effectiveness of the proposed algorithm.
قيم البحث
اقرأ أيضاً
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.
DNN/Accelerator co-design has shown great potential in improving QoR and performance. Typical approaches separate the design flow into two-stage: (1) designing an application-specific DNN model with high accuracy; (2) building an accelerator consider
ing the DNN specific characteristics. However, it may fail in promising the highest composite score which combines the goals of accuracy and other hardware-related constraints (e.g., latency, energy efficiency) when building a specific neural-network-based system. In this work, we present a single-stage automated framework, YOSO, aiming to generate the optimal solution of software-and-hardware that flexibly balances between the goal of accuracy, power, and QoS. Compared with the two-stage method on the baseline systolic array accelerator and Cifar10 dataset, we achieve 1.42x~2.29x energy or 1.79x~3.07x latency reduction at the same level of precision, for different user-specified energy and latency optimization constraints, respectively.
This letter analyzes the performances of a simple reconstruction method, namely the Projected Back-Projection (PBP), for estimating the direction of a sparse signal from its phase-only (or amplitude-less) complex Gaussian random measurements, i.e., a
n extension of one-bit compressive sensing to the complex field. To study the performances of this algorithm, we show that complex Gaussian random matrices respect, with high probability, a variant of the Restricted Isometry Property (RIP) relating to the l1 -norm of the sparse signal measurements to their l2 -norm. This property allows us to upper-bound the reconstruction error of PBP in the presence of phase noise. Monte Carlo simulations are performed to highlight the performance of our approach in this phase-only acquisition model when compared to error achieved by PBP in classical compressive sensing.
In this work we propose an effective preconditioning technique to accelerate the steady-state simulation of large-scale memristor crossbar arrays (MCAs). We exploit the structural regularity of MCAs to develop a specially-crafted preconditioner that
can be efficiently evaluated utilizing tensor products and block matrix inversion. Numerical experiments demonstrate the efficacy of the proposed technique compared to mainstream preconditioners.
Support vector machine is an important and fundamental technique in machine learning. Soft-margin SVM models have stronger generalization performance compared with the hard-margin SVM. Most existing works use the hinge-loss function which can be rega
rded as an upper bound of the 0-1 loss function. However, it can not explicitly limit the number of misclassified samples. In this paper, we use the idea of soft-margin SVM and propose a new SVM model with a sparse constraint. Our model can strictly limit the number of misclassified samples, expressing the soft-margin constraint as a sparse constraint. By constructing a majorization function, a majorization penalty method can be used to solve the sparse-constrained optimization problem. We apply Conjugate-Gradient (CG) method to solve the resulting subproblem. Extensive numerical results demonstrate the impressive performance of the proposed majorization penalty method.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
