1982(4):1-8.
Abstract:The finite element method is adopted for computation of axisymmetrical conical frusta. The normal disp1acement function ω and circumferential displacement function υ are given by two cubic po1ynomials,the longitudinal displacement function u is given by linear polynomial. Nodal degrees of freedom can extract three displacements,one rotation and one shear strain on the nodal circ1e. The computed resu1ts had compared with referencies[l],[2] and [3]. This method and computer program are applicable to find vibration characteristics of conical frustum shell.
1982(4):9-37.
Abstract:This paper is a report on study of the characteristics of the ro11 resonance of an asymmetrical re-entry vehicle. The equations of motion are described in a coordinate system which does not spin with the vehic1e. The effects of the spinning of the asymmetrical vehicle on the persistent ro11 resonance has been studied with the linearzation method. Also a formula of spinning speed is derived to avoid the persistent ro11 resonace. It is show that the region in which the persistent ro11 resonance may occur will vary with the spinning speed when it is more slow.
Chang Zhaocheng , Liang Ming , Guo Zhenhua
1982(4):39-48.
Abstract:This paper describes the calculation step and formula of the random simulation of SPR test for the spread of impact point of missle.We do the random simulation of sequential truncated and untruncated testing methods for standard deviation of impact point by DJS-130 computer and analyse the results at the same tine.The analysis shows that the OC function L*(σ)obtained by random simulation has the precedence over L(σ)obtained by approximate formula.However,E* σ(n) is larger than Eσ(n).Hence when we select parameters α、βand λ,it is preferable to use L*(σ) and E* σ(n), and to consult L(σ) and Eσ(n) at the same time. This paper also discusses the scheme of sequential truncated method and presents the opinions for some problems.
1982(4):49-58.
Abstract:This paper presents the applications,the performance,the method of measurement and the functional diagram,of the DC-1 radar cross-section measuring equipment. Errors of measurement are preliminary analyzed. Some measured results are presented. It is also suggested how to improve such equipment.
1982(4):59-69.
Abstract:This paper related the design scheme of WZX-l character displayer which is designed by our university,and discussed in detail its principle,operative pattern,data and layout format.
1982(4):71-88.
Abstract:In this paper,a fast algorithm is developed to compute two-dimensional Discrete Fourier Transform (DFT) of an array of NxM complex number points using FPT,where M=2m,N=2m-r+1,1≤r≤m.As compared with the conventional radix-2 two-dimensional Fast Fourier Transforms,this new algorithm requires less number of multiplications (decrease by 30-40%) and same number of additions, so that elevates the computing accuracy. The number of multiplications and additions are respectively Mu=1/2NMlog2M-3/2NM+N2+N(1+log2M-log2N) Ad= NMlog2MN. This algorithm also has the advantage to adopt the parallel algorithm.
1982(4):89-110.
Abstract:When the vehic1e is tracked by a radar with known geometrical position,the relative bearing and elevation can be measured by angle sensor installed on the vehic1e,and the relative height data can be obtained by radio or laser altimeter. According to these data,the vehic1e position can be determined. In order to raise the accuracy of position location,Extended Kalman Filter is utilized. The obtained position parameters are transformed to the flight path plane coordìnate system,The results from computer simulation are satisfactory.
1982(4):111-128.
Abstract:After investigating the technique for amplitude ranking correlation,this paper presents an algorithm for quantizing and ranking grey levels of pixels of a sensor image. The optimum threshold for quantization has been found; after ranking a sensor image can be decomposed into several 0-1 coded images. Then the coded images will be correlated with a reference image without multiplication operations. For a give quantization function the means and variance of metrics for correlation can be calculated theoretically. Detection threshold sequences {Tk} for different signal to noise ratios can be obtained for the image of Gaussian distribution,Computer simulation shows that the detection threshold sequence can detect each match point effectively for the images of Gaussian distribution with different correlation lengths and with signal to noise ratios from 5 to 1. It is also shown that, for actual terrain maps with signal to noise ratios from 3 to 1,correct match can be reached.
1982(4):129-140.
Abstract:This paper,which is based on the Schauder fixed-point theorem,discusses the general theory of functional differential equations with delays,it inc1udes the existence,uniqueness,continuous dependence and continuation of solutions,at the same time it supplements and generalizes some theorem in the paper[l].
1982(4):141-153.
Abstract:In this paper,we put forward algorithm to compute digital cyclic convolutions using two-dimensional polynomial transforms,and indicated the number of arithmetic operations required to compute three-dimensional cyclic convolutions by two-dimensional polynomial transforms Moreover,the paper discussed in detail on the conditions of the two-dimensional polynomial transforms and spread it to multi-dimensional polynomial transforms.
1982(4):155-163.
Abstract:This paper discussed the Kaiser window function for following purposes: (1) briefly introduce the Kaiser window function and some of its fundamental properties; (2) proceeding from the spectrum characteristics of the Kaiser window obtained by calculation,carry out preliminary discussion and analysis on the spectrum characteristics of the Kaiser window. In this paper is given the derivation of Kaiser window formula and some parameter formulas,moreover,taking the different parameters of the Kaiser window are obtained the ratios of the energy of the function's spectra,the width of the main-lofe and the peak-values of the side-lofes,are traced the spectrum curves.
1982(4):165-177.
Abstract:By dissolving Discrete Fourier Transform matrix and combining with the FFT algorithm,this paper has put out a new method to compute DFT. Because of dissolving the matrix,one can change the problem of extracting DFT of N=2t points into a problem to multiply 16 square matrixes of N/16 order with the corresponding column vectors (N≥16). Thus,this method Can decrease the calculating times and has a satisfied parallel algorithm features.
All copyright © Technical Support: Beijing frequently cloud technology development co., LTD