基于FFT的自适应频率估计算法

为了解决FFT算法中因能量泄露和栅栏效应而导致的算法估计性能下降的问题,提出了一种基于FFT的自适应频率估计算法.分析了Rife算法,指出当信号频率位于量化频率附近时,由于插值方向错误,会导致频率估计性能下降;对于分段FFT相位差频率估计算法,当2段信号最大谱线处对应的相位相差比较大时,容易产生相位模糊,从而增大估计误差.基于FFT的自适应频率估计算法将2种算法进行了综合,既保留了2种算法的优点,又对算法性能有所改进.仿真结果表明:该算法的估计精度、稳定性和抗噪能力都有显著提高.     

System comparison procedures for automatic target recognition systems

Estimating the performance of an automatic target recognition (ATR) system in terms of its probability of successfully identifying a target involves extensive image collection and processing, which can be very time‐consuming and expensive. Therefore, we investigate the Wald sequential test for the difference in two proportions as a sample size‐reducing alternative to ranking and selection procedures and confidence intervals. An analysis of the test parameters leads to a practical methodology for implementing the Wald test for fairly comparing two systems, based on specific experimental goals. The test is also extended with the modified, sequentially rejective Bonferroni procedure for the multiple pairwise comparison of more than two systems. Two sampling schemes for different experimental goals are also discussed. The test methodology is applied to actual data to compare different configurations of a specific ATR system, with the results demonstrating that the modified Wald sequential procedure is a useful alternative to comparing proportions with confidence intervals, particularly when data are expensive. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 357–371, 1999     

具有全局收敛性的盲均衡算法

为了解决传统的自适应均衡技术需发送训练序列的问题,采用盲均衡技术,利用接收信号本身的特征使均衡器收敛。提出了一种新的盲均衡算法(C&D算法),该算法将CRIMNO算法和判决引导(Decision Directed,DD)算法相结合,利用信号序列间的互不相关特性,从而使其具有全局收敛性能。实验结果表明:与CRIMNO算法相比,在相同的信噪比下,该算法具有收敛快速、运算量少和残留误差小的特点。     

Explicit steady state solutions for a particular M(x)/M/1 queueing system

An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given.     

An operator theory of parametric programming for the transportation problem-I

This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. An operator theory is developed and algorithms provided for applying rim and cost operators that effect the transformation of optimum solution associated with changes in rim conditions and unit costs. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum basis structures are preserved.     

An economic model for planning strategic mobility posture

This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed.