This beamforming algorithm is written specifically for array radars in which the number of array elements K is very large compared with the number of jammers L the radar is designed to suppress. It uses a set of M noise vectors to construct a basis for the jammer component of the antenna output vectors. The component of the quiescent weight vector orthogonal to each basis vector is calculated, renormalized to unit length, and identified as the adapted weight vector. This algorithm is effective in the suppression of many types of jammers. The number of noise samples M required in the construction of the adapted weight vector is approximately equal to L. In the special case of L narrowband noise jammers, for example, a choice of M = L usually reduces the receiver output jammer power to a few dBs above the white noise background. It is permissible to have M


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Fast Beamforming Algorithm for Large Arrays


    Contributors:

    Published in:

    Publication date :

    1983-07-01


    Size :

    2172897 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A Fast Array Synthesis Algorithm for Adaptive Beamforming

    Nishimura, K. / Sato, T. / European Space Agency | British Library Conference Proceedings | 2006


    Robust Beamforming in GPS Arrays

    Lorenz, R. G. / Boyd, S. P. / Institute of Navigation | British Library Conference Proceedings | 2002



    Optical Beamforming for Ultrasonic Phased Arrays

    IEEE / Lasers and Electro-Optics Society | British Library Conference Proceedings | 1995