具有高斯过程输入的一类非线性系统的输出相关函数

本文研究了在数学期望为零的高斯过程输入情况下,h(lx)具有h(k+p)(lx)=lph(k)(lx)(其中:h(k)(lx)=(k)h(lx)/xk,l为某个实数)性质的输出相关函数。 文中利用上述性质,由Price定理导出一常微分方程。将求非线性系统输出相关函数的问题,变成解常微分方程的问题。 所得结果表明:这类非线性系统的输出相关函数具有相同的形式。不同的h(lx)仅影响其系数。 在此基础上,文中将一般非线性系统的特性f(x)用具有上述性质的函数族来表示,然后直接引用文中前面所得的结果,非常简便地得出了一般非线性系统的输出相关函数的计算公式。     

应用逆算子方法定量分析线性缓变p—n结

逆算子方法是一类新的求解强非线性问题的非数值方法。本文采用此类方法分析线性缓变ｐ－ｎ结。先把分析问题表述为一维非线性Ｐｏｉｓｓｏｎ方程，再应用逆算子方法求解该强非线性常微分方程，并采用Ｍａｔｈｅｍａｔｉｃａ软件推导其近似解析解，还对求得的近似解作了误差分析研究。     

孙子定理在复合伪码测距中的应用

在超远程无线电测控系统中,为了缩短捕获时间,广泛使用复合码进行测距。文章介绍了孙子定理在复合码 测距中的具体应用,以及存在测距误差的情况下如何正确地进行匹配计算。     

相位激光测距的新方法

本文提出了一种相位激光测距的新方法——“尾数求N法”。它是数论中的“孙子定理”在光学测量技术中的一个应用。其特点是由实测所得的相位尾数直接求出N值。这种方法对激光所用的调制频率既是分散的,又是集中的;具有测程范围大,精度高,便于质量自检等优点。     

基于Kernel-SOM的非线性系统辨识及模型运行收敛性分析

该文提出基于核SOM(Kernel-SOM)的非监督非线性系统辨识方法。在辨识误差和系统初始输入误差同时存在的条件下,对Kernel-SOM辨识模型独立运行的收敛性进行了理论分析,并给出了辨识模型运行收敛的定理。数字仿真表明了所述方法的有效性及收敛定理的正确性。     

基于孙子定理的口令验证方案

提出了一种基于孙子定理的口令 验证方案。介绍了它的具体实现过程，并进行了性能分析，指出了它的优点。     

模拟神经网络稳定性研究

本文提出了模拟神经网络稳定性分析的静态等效模型,通过推广特勒根定理,从等效模型导出了物理意义清晰的能量函数。由一阶微分方程组求网络能量函数的方法普适于所有的一阶连续自治系统。文章并利用能量平稳原理对点格神经网络的稳定性质进行了讨论,得到了一些对于网络的电路实现具有一定指导意义的结果。     

基于空间特征的非线性电路神经网络诊断

本文提出线性模拟电路的单、双、三故障空间特征,采用分段线性模型（PWL）将非线性电路线性化,通过遗传算法求电路的容羞范围,用神经网络对非线性嘲络进行诊断。本文的方法大火减少了模拟计算量,同时,使神经网络的训练过程加快,训练误差减少,并大大提高了诊断的正确率。     

一种脉冲多普勒雷达解模糊新算法

模糊问题是脉冲多普勒雷达的固有问题.目前常用的解模糊算法是孙子定理方法和一维集算法.本文提出了一种新的解模糊算法,即群算法.这种算法对测量误差不敏感,而且既可以解距离模糊又可以解多普勒模糊,所以它的性能优于孙子定理算法.另一方面,由于使用了查找表,群算法的计算量比一维集算法小,因而更适合实时处理.     

求符号网络函数的变形双图分解分析法

引入了互补余因式对、正规双图和可行撕裂点集的概念。应用它们导出了一阶余因式Ｃ（Ｙ）的分解定理。把它与变形双图法相结合，提出了求符号网络函数的一个新的分解分析法－变形双图分解分析法。它的优点是所得符号网络函数表达式紧凑面且不含对消项，并且它的符号计算很简单。     

脉冲多普勒雷达中的解模糊算法及实现

解距离模糊和解速度模糊是中重复频率脉冲多普勒雷达中需要解决的重要问题．其算法的依据都是中国余数定理。但是．单靠中国余数定理仍无法解决距离测量和多普勒频率测量中的误差和遮挡问题。本文讨论了在测量误差和遮挡问题存在的情况下解距离模糊所采用的建表搜索法和解速度模糊所采用的各模糊度内最小方差过门限法．并将这两种算法与其他算法进行了对比。文中所提算法具有重要的工程应用价值。     

An efficient energy saving mechanism for IEEE 802.16e wireless MANs

This paper presents an energy conservation scheme, Maximum Unavailability Interval (MUI), to improve the energy efficiency for the Power Saving Class of Type II in IEEE 802.16e. By applying the Chinese Remainder Theorem, the proposed MUI is guaranteed to find the maximum Unavailability Interval, during which the transceiver can be powered down. The proposed MUI only dynamically adjusts one parameter defined in the standard. In addition, it is fully compatible with 802.16e standard. We also propose a new technique to reduce the computational complexity when solving the Chinese Remainder Theorem problem. Simulation and analysis have been conducted to evaluate the performance.     

Maximizing Unavailability Interval for Energy Saving in IEEE 802.16e Wireless MANs

This paper presents an energy conservation scheme, Maximum Unavailability Interval (MUI), to improve the energy efficiency for the Power Saving Class of Type II in IEEE 802.16e. By applying the Chinese Remainder Theorem, the proposed MUI is guaranteed to find the maximum Unavailability Interval, during which the transceiver can be powered down. We also propose new mathematical techniques to reduce the computational complexity when solving the Chinese Remainder Theorem problem. Because the computational complexity is reduced significantly, the proposed MUI can be practically implemented in real systems. The proposed MUI is fully compatible with the 802.16e standard. It provides a systematic way to determine the start frame number, one of the important parameters defined in the standard. In addition to analyzing the computational complexity, simulations and experiments are conducted to evaluate the performance of the proposed algorithms.     

Multiple error detection and correction based on redundant residue number systems

This paper presents some results on multiple error detection and correction based on the Redundant Residue Number System (RRNS). RRNS is often used in parallel processing environments because of its ability to increase the robustness of information passing between the processors. The proposed multiple error correction scheme utilizes the Chinese Remainder Theorem(CRT) together with a novel algorithm that significantly simplifies the error correcting process for integers. An extension of the scheme further reduces the computational complexity without compromising its error correcting capability. Proofs and examples are provided for the coding technique.     

基于中国余数定理的跳频信号相时延估计方法

跳频信号每跳带宽窄且多跳间积累困难,利用传统方法对其时延估计精度都很低。针对该问题,该文充分挖掘跳频信号宽跳带的潜能,建立了多频点相时延估计模型,把时延估计问题转化为整周模糊求解问题;然后在解模糊过程中引入中国余数定理,针对非合作场景中模数无法选择的问题,提出一种基于虚拟频点的干涉相位外推方法,构造出鲁棒中国余数定理的适用条件;最后采用闭式鲁棒中国余数定理解算整周模糊,得到高精度的相时延。该方法具有精度高、运算量小、不依赖于信道衰落特性的优点。仿真结果验证了所提模型及方法的有效性和正确性。     

广义稳健的中国剩余定理及其在欠采样率下频率估计中的应用

该文针对传统中国剩余定理在余数有误差时重构整数不稳健性的缺陷,提出了采用一组非互质的模数和相应的有误差的余数估计任意正整数的广义稳健中国剩余定理,给出了详细的定理证明,得出了算法重构整数公式和误差上限表达式。将该定理用于欠采样下信号频率估计,仿真实例验证了所提算法的稳健性和实际工程应用前景。     

有限环计算的数字式神经网络方法

本文提出一种用于有限环算术的数字式神比网络方法。它采用非对称的数字式神经网络结构，在整个矢量空间上具有唯一的平衡点，因而不存在计算误差。这种方法保持了神经网络的高度并行结构，能够实时完成有限环上的模运算。它还被应用于中国余数定理的实现。     

Optimal scheduling of multiple preventive maintenance activities

This paper is concerned with scheduling multiple periodic preventive maintenance (PM) activities. This scheduling problem is formulated as partitioned integer linear programming (ILP) models based on the Chinese Remainder Theorem. Since the number of necessary variables and constraints of the proposed partitioned ILP model does not grow rapidly with the number of activities, the computation time and memory requirements are of a negligible nature. For a small problem involving a decade or so activities, the scheduling can be carried out very simply by hand. An example is given to illustrate the approach.     

频谱互质重排亚奈奎斯特率采样方法

本文提出了一种基于频谱互质重排的超低速率信号采样方法.该方法将稀疏傅里叶变换从离散时间域拓展到连续时间域,首先通过互质结构傅里叶展开采样对频域稀疏信号的频谱分量进行重排和压缩,然后通过基于中国余数定理的亚线性算法对信号进行了重构.实验结果表明,本文所提的采样方法可进一步降低频域稀疏信号的采样速率.     

An Efficient Scalable RNS Architecture for Large Dynamic Ranges

This paper proposes an efficient scalable Residue Number System (RNS) architecture supporting moduli sets with an arbitrary number of channels, allowing to achieve larger dynamic range and a higher level of parallelism. The proposed architecture allows the forward and reverse RNS conversion, by reusing the arithmetic channel units. The arithmetic operations supported at the channel level include addition, subtraction, and multiplication with accumulation capability. For the reverse conversion two algorithms are considered, one based on the Chinese Remainder Theorem and the other one on Mixed-Radix-Conversion, leading to implementations optimized for delay and required circuit area. With the proposed architecture a complete and compact RNS platform is achieved . Experimental results suggest gains of 17 % in the delay in the arithmetic operations, with an area reduction of 23 % regarding the RNS state of the art. When compared with a binary system the proposed architecture allows to perform the same computation 20 times faster alongside with only 10 % of the circuit area resources.