合成孔径雷达干扰技术的研究

合成孔径雷达（Synthetic Aperture Radar）是一种新型高辨力成像雷达。其在距离上利用发射的线性调频（LFM）的脉冲压缩信号来获取距离上的高分辨力，在方位上利用接收脉冲之间的多普勒信息获得方位上的高分辨力。本文在简单分析合成孔径雷达工作原理基础上，针对合成孔径雷达的特点与弱点，讨论了几种干扰样式。     

一种用于DS扩频信号非相干检测的差分延迟SAW相关器

本文介绍了用于ＤＰＳＫ调制的ＤＳ扩频信号非相干检测的一种ＳＡＷ器件的设计方法。对所研究的差分延迟功能均集于单一器件中。因为没有采用独立的延迟线，故消除了带限影响，ＤＰＳＫ解调器延迟支路无插入损耗。     

Lowpass and bandpass transadmittance filter using operational amplifier pole

A new topology simultaneously implementing lowpass (LP) and bandpass (BP) transadmittance filtering signals using a single operational amplifier (OA), one capacitor, and two resistors is presented. The input impedance is very high which is essential for cascading without employment of buffers. The circuit uses absolute minimum number of active and passive components. The filter employs pole-model of OA and as such has acquired suitability for extended frequency operation. The circuit permits separate adjustment of natural frequency (ω₀) and quality factor (Q) in an orthogonal manner. The circuit has low sensitivity figures unlike the reported single amplifier biquads. The PSPICE simulation results are included.     

钽酸锂晶体宽带滤波器

本文简要介绍钽酸锂晶体及器件的一些特性,对用该材料制作的21.4MHz宽带滤波器的设计、制作和测试结果作了较详细的介绍,滤波器的带宽达225kHz,矩形系数(BW_(?0dB)/BW_(3dB)为2.66,带外衰减在50dB以上。该材料在做宽带滤波器和压控振荡器方面具有优越性。     

Optimal estimation of intensity of noisy peaks by matched filtering with application to chromatography : Part 1. General introduction and theoretical evaluations

The digital filter described provides optimal enhancement of the signal-to-noise ratio by using prior information about peak shape and type of noise. The filter, based onthe matched-filter principle, is applied to chromatographic data, but is also suitable for optimal processing of similar noisy signals. The current implementation of the filter permits the specific reduction of different types of noise. Several theoretical aspects concerning the interpretation and use of this advanced filter are discussed. Some calculations on peaks with Gaussian and Gamma distribution shape are given.     

Filtering germs: Groupoids associated to inverse semigroups

We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action of the inverse semigroup on the space of idempotent filters. We also investigate the restriction of this isomorphism to the groupoid of tight filters and to the groupoid of ultrafilters.     

The matched queueing network PH/M/c→oPH/PH/1

We consider a matched queueing network PH/M/coPH/PH/1, where the output of the first subsystem PH/M/c is regarded as one of the inputs of the second subsystem and matched with another input of PH-renewal process, and they are served by a single server with PH-service-distribution. The stationary state probabilities, the distribution of the virtual waiting times in the two subsystems, and the distribution of the total virtual waiting time are derived.The work was supported by the Max-Planck-Gesellschaft, Germany, and the Chinese Academy ofSciences.     

Low Pass metallic mesh interference filters for operation in the 165 GHz to 880 GHz region

Low Pass metallic mesh interference filters have been designed and constructed for operation in the region 340 m (880 GHz) to 1.8 mm (165 GHz). These filters have been shown to have excellent edge characteristics and good rejection regions. The results show that the mesh filter can be effectively used in both millimetre and submillimetre regions.Part of this work was performed while this author was at Heriot-Watt University, Edinburgh, U.K.     

基于PMF-FFT的伪码捕获算法分析

建立了PMF-FFT算法的数学模型,分析了相关器个数、相关积累长度和FFT点数对积累损失、扇贝损失和频率分辨率的影响。在此基础上,结合算法的效率和运算量,给出了PMF-FFT算法参数选择的原则和依据。     

Comparison of Multivariate Matching Methods: Structures,Distances, and Algorithms

Abstract

A comparison and evaluation is made of recent proposals for multivariate matched sampling in observational studies, where the following three questions are answered: (1) Algorithms: In current statistical practice, matched samples are formed using “nearest available” matching, a greedy algorithm. Greedy matching does not minimize the total distance within matched pairs, though good algorithms exist for optimal matching that do minimize the total distance. How much better is optimal matching than greedy matching? We find that optimal matching is sometimes noticeably better than greedy matching in the sense of producing closely matched pairs, sometimes only marginally better, but it is no better than greedy matching in the sense of producing balanced matched samples. (2) Structures: In common practice, treated units are matched to one control, called pair matching or 1–1 matching, or treated units are matched to two controls, called 1–2 matching, and so on. It is known, however, that the optimal structure is a full matching in which a treated unit may have one or more controls or a control may have one or more treated units. Optimal 1 — k matching is compared to optimal full matching, finding that optimal full matching is often much better. (3) Distances: Matching involves defining a distance between covariate vectors, and several such distances exist. Three recent proposals are compared. Practical advice is summarized in a final section.