I am B.usha rani. I would like to get details on robust adaptive beamforming cox download .Now i am living at iit kanpur and i last studied in the college IIIT NUZVID and now am doing m.tech.i need help on Robust adaptive beamforming project.
Posts: 14,118
Threads: 61
Joined: Oct 2014
We present a new robust algorithm of adaptive beam formation (ABF) based on own vectors for use with passive sonar arrays. Robustness refers to protection against self-canceling in the presence of signal mismatch. The algorithm is based on a decomposition of eigenvectors, similar to ABF algorithms such as dominant mode rejection (DMR) and main reverse components (PCI). For the robustness, the proposed method eliminates the own vector of the calculation of the weight ABF considered like taxpayer to the auto-annulment. This approach is in contrast to ABF's own vector vector with a white noise gain restriction which instead changes the weighting of all eigenvectors. By identifying and eliminating the offensive own vector, robustness can be restored to self-annulment. The proposed algorithm of association and excision of eigenvectors (EBAE), associates each own vector with a beam or angle and removes it only from that beam. The EBAE EVA vector ABE is compared to other robust ABF algorithms in simulation and experimental data, where it is shown to provide improved performance both in terms of interference rejection and signal separation.
Adaptive beam-forming algorithms can be extremely sensitive to small errors in the characteristics of the array. Errors that are not correlated from sensor to sensor pass through the beam former as uncorrelated or spatially white noise. Therefore, the gain against white noise is a measure of robustness. We present a new algorithm that includes a quadratic inequality constraint on array gain against uncorrelated noise, while minimizing output power subject to multiple constraints of linear equality. It is shown that a simple scaling of the projection of tentative weights, in the subspace orthogonal to the linear constraints, can be used to satisfy the constraint of quadratic inequality. In addition, this scaling is equivalent to a projection on the quadratic constraint boundary so that the usual favorable properties of the projection algorithms are applied. This leads to a simple, efficient and robust adaptive beamforming algorithm in which all constraints are satisfied exactly at each step and roundoff errors do not accumulate. The algorithm then extends to the case of a more general quadratic constraint.
