摘要
In this paper, the drawbacks of conventional target fluctuation models used in radar target modeling are set out. It is usually difficult to statistically model a real target because there are very few parameters which can be used to approximate the probability density function (PDF) of a real target's radar cross section (RCS) in conventional target models. A new method of statistical modeling is suggested, according to which the first nth central moment of real target's RCS, combined with the Legendre orthogonal polynomials, is used to reconstruct the PDF of the target's RCS. The relationship between the coefficients of the Legendre polynomials and the central moments of RCS are deduced mathematically. Through a practical computing example, the error-of-fit is shown as a function of the orders of Legendre coefficients. By comparing the errors-of-fit caused by both the new model and the conventional models, it is concluded that the new nonparametric method for statistical modeling of radar targets is superior.
In this paper, the drawbacks of conventional target fluctuation models used in radar target modeling are set out. It is usually difficult to statistically model a real target because there are very few parameters which can be used to approximate the probability density function (PDF) of a real target's radar cross section (RCS) in conventional target models. A new method of statistical modeling is suggested, according to which the first nth central moment of real target's RCS, combined with the Legendre orthogonal polynomials, is used to reconstruct the PDF of the target's RCS. The relationship between the coefficients of the Legendre polynomials and the central moments of RCS are deduced mathematically. Through a practical computing example, the error-of-fit is shown as a function of the orders of Legendre coefficients. By comparing the errors-of-fit caused by both the new model and the conventional models, it is concluded that the new nonparametric method for statistical modeling of radar targets is superior.