Abstract
A pattern synthesis method for arbitrary arrays based on the linearly constrained minimum variance (LCMV) criterion is presented. Given mainlobe regions and an arbitrary sidelobe envelope, this algorithm searches the pattern with the lowest sidelobe levels. Its iteration coefficient is robust to synthesis conditions, and patterns with a flat top mainlobe can be obtained using phase-independent derivative constraints.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
