Loading...
Search for: low-sidelobe-level
0.008 seconds

    Linear array thinning using iterative FFT plus soft decision

    , Article Proceedings International Radar Symposium, Dresden ; Volume 1 , June , 2013 , Pages 301-306 ; 21555753 (ISSN) ; 9783954042234 (ISBN) Tohidi, E ; Sebt, M. A ; Nayebi, M. M ; Sharif University of Technology
    2013
    Abstract
    Array Thinning is the procedure of reducing the number of elements in such a way that leads to low sidelobe level and narrow beamwidth. Main motivations of array thinning are reduction in weight and cost of antennas array. W.P.M.N. Keizer has presented a new approach for the synthesis of thinned uniformly spaced linear arrays featuring a minimum sidelobe level. The method is based on the iterative Fourier technique to derive element excitations from the prescribed array factor using successive forward and backward Fourier transforms. Array thinning is accomplished by setting the amplitudes of the largest element excitations to unity and the others to zero during each iteration cycle. In this... 

    MIMO radar beamforming using orthogonal decomposition of correlation matrix

    , Article Circuits, Systems, and Signal Processing ; Volume 32, Issue 4 , 2013 , Pages 1791-1809 ; 0278081X (ISSN) Shadi, K ; Behnia, F ; Sharif University of Technology
    2013
    Abstract
    MIMO radar is the next generation radar which transmits arbitrary waveforms at each one of its apertures. It has been shown that the design of waveforms for MIMO radars in order to synthesize a desired spatial beampattern is mapped into a waveform correlation matrix R design in the narrowband case. As of now, given a desired beampattern or estimated locations information of targets, calculating R has been modeled as an optimization problem like semi-definite programming. Also, in some special cases like rectangular beampattern, closed-form solutions for R has been proposed. In this paper, we introduce a fast algorithm which is capable of designing R in order to achieve more arbitrary... 

    A fast and novel method of pattern synthesis for non-uniform phased array antennas

    , Article Proceedings International Radar Symposium, 24 June 2015 through 26 June 2015 ; Volume 2015-August , 2015 , Pages 924-929 ; 21555753 (ISSN) ; 9783954048533 (ISBN); 9783954048533 (ISBN); 9783954048533 (ISBN) Tohidi, E ; Sebt, M. A ; Nayebi, M. M ; Behroozi, H ; Rohling, H ; Rohling, H ; Rohling, H ; Sharif University of Technology
    IEEE Computer Society  2015
    Abstract
    Weighting elements to achieve radiation patterns with desired characteristics is a classical work in phased array antennas. These characteristics can be low sidelobe level, narrow beamwidth, high directivity, pattern nulling in special angle and etc. For each of these characteristics, different methods have been introduced. Most of methods have been presented for uniform arrays, however there are lots of methods to obtain a desired pattern for antennas with non-uniform element distances. The problem with these methods is complexity or not very good results. In this paper, fast and easy methods based on Least Square Error that leads to good results are presented. In addition, weighting of... 

    Dynamic programming applied to large circular arrays thinning

    , Article IEEE Transactions on Antennas and Propagation ; Volume 66, Issue 8 , 2018 , Pages 4025-4033 ; 0018926X (ISSN) Tohidi, E ; Nayebi, M. M ; Behroozi, H ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    In conventional arrays, improving angular resolution requires larger aperture which demands more number of elements. On the other hand, array thinning is an efficient method of achieving narrow beamwidth (high angular resolution) with fewer number of elements. Reducing the number of elements results in reducing weight, cost, hardware complexity, and energy consumption. In this paper, a novel dynamic programming algorithm of array thinning with the objective of reducing sidelobe levels (SLLs), desired for large circular arrays, is proposed. The circular array is partitioned into annular rings, and the objective of the optimization problem is to determine the number of active elements in each...