奇周期最佳屏蔽二进序列偶

定义了一种新的最佳相关信号,即奇周期最佳屏蔽二进序列偶。用计算机搜索方法,搜索出一些奇周期最佳屏蔽二进序列偶,并给出了利用奇周期最佳屏蔽二进序列偶构造周期最佳屏蔽二进序列偶的方法,以及在序列长度为奇数时,奇周期与周期最佳屏蔽二进序列偶之间的关系。     

二维非周期低碰撞区跳频序列构造方法

在跳频系统中,跳频序列的性能是评价跳频系统的性能的重要指标。本文给出了两种二维非周期低碰撞区跳频序列的构造方法。首先,利用笛卡尔积构造二维非期低碰撞区跳频序列集。然后,利用交织法构造二维非周期低碰撞区跳频序列集。最后,分析了新的跳频序列集在二维低碰撞区内的非周期汉明相关性,并根据理论界对序列集进行了最优性分析。     

二维时频低碰撞区跳频序列集的构造

基于低碰撞区跳频序列的准同步跳频通信系统在低碰撞区内具有低的多址干扰。将已有的一维跳频序列低碰撞区扩展到时频二维,给出了两种构造二维时频低碰撞区跳频序列集的方法。构造法分别基于Welch Costas阵列和Golomb Costas阵列,通过序列循环移位的方法分别得到一类二维时频低碰撞区跳频序列集。新的序列集满足跳频序列的二维周期汉明自相关函数和互相关函数构成的理论界,同时在二维时频低碰撞区内具有最优的自相关特性和互相关特性。     

伪随机屏蔽二进序列偶

提出了一种新的具有良好周期相关特性的离散信号,即伪随机屏蔽二进序列偶,研究了其变换性质。为了缩小计算机搜索伪随机屏蔽二进序列偶的搜索范围,提高搜索效率,给出了伪随机屏蔽二进序列偶的周期长度、屏蔽个数以及序列平衡度之间的一些限定关系。在此基础上利用计算机搜索给出了一些小长度的伪随机屏蔽二进序列偶,给出了利用伪随机二进序列构造伪随机屏蔽二进序列偶的方法。     

时频二维低/无碰撞区跳频序列集构造

在通信系统中,跳频信号不仅会出现时延,还会存在频移。研究具有时频二维低/无碰撞区的跳频序列的构造。证明了Reed-Solomon(RS)码的时频二维周期汉明自相关函数的上界;提出了两种构造方法。第一种方法是基于RS码来构造时频二维周期低碰撞区跳频序列集。第二种方法利用矩阵来构造时频二维非周期无碰撞区跳频序列集。丰富了时频二维低/无碰撞区跳频序列的理论研究成果。     

两类跳频序列集时频二维汉明相关性的分析

多普勒频移对现代扩频通信系统性能有着重要影响,设计跳频序列时需考虑具有时延和多普勒频移情形下序列的相关性。研究了跳频序列集时频最大周期汉明相关值的理论界,计算了Cai跳频序列集的时频二维周期汉明相关值,用该理论界检验了这类跳频序列集的二维周期汉明相关值,并进一步得到了部分达到最优的跳频序列;最后对多项式同余跳频序列集的二维周期汉明相关值进行了分析。     

周期为偶数的三值自相关四进序列偶

提出了一种新型的离散信号形式--三值自相关四进序列偶,对周期是偶数的这种信号作了重点研究,得到了周期为偶数的三值自相关四进序列偶的自相关函数值的最大副峰模值至少是2的自相关特性,并给出了一种使得到的四进序列偶的副峰值是{0,-2},满足这种自相关特性的四进序列偶的构造方法。当构造方法中所用的伪随机二进序列偶具有好的平衡性时,构造得到的四进序列偶不仅具有很好的相关性而且具有很好的平衡性。     

二维四元零相关区周期互补阵列集构造法

基于二维二元周期互补阵列集和移位序列,利用逆Gray映射,提出了一类二维四元零相关区周期互补阵列集的构造方法。获得的阵列集由多个四元零相关区周期互补阵列子集组成,不同子集之间具有完全正交互补特性。本文的构造方法可分别对阵列的行列进行移位,能够获得具有不同参数形式的二维四元零相关区周期互补阵列集。同时行(列)方向上的零相关区长度可以灵活设置,从而能获得不同的移位序列集,构造出多个二维四元零相关区周期互补阵列集。构造结果表明,本文方法可有效地增加工程应用所需的阵列信号。     

基于二维密度加权算子的群体评价信息集结方法

群体评价中已有的信息集结算子都没有考虑到信息分布的疏密情况,且其评价信息又通常为二维数据,为此,提出了一种基于二维密度加权算子的群体评价信息集结方法.定义了二维密度加权算术平均(TDWA)算子和二维密度加权几何平均(TDWGA)算子2种新的集结算子.将新算子应用于群体评价的信息集结中,并分别给出了群体评价(二维)数据的分组与群体密度权向量的具体确定方法.最后,给出了一个具体的集结算例.     

函数型核加权估计法及其在经济学中的应用

本文基于变系数模型提出了一个新的统计推断方法:函数型核函数加权最小二乘法.该方法将变系数模型中经典的核函数加权最小二乘法和参数模型中的函数型最小二乘法巧妙结合,通过条件特征函数构造损失函数进而定义了函数型核函数最小二乘估计量.该估计量既具有函数型最小二乘法的优势——在扰动项服从厚尾分布时也能够稳健估计参数,又具有非参数核估计的特点——估计量的相合性不依赖于参数模型的正确设定.同时,本文探讨了该估计量的大样本性质,证明了其相合性和渐近正态性.进一步,本文研究了该估计量的自适应估计,即基于估计量渐近方差的相合估计量来选择最优估计.最后,本文通过数值模拟来探究函数型核函数最小二乘法的有限样本性质,并将该方法应用到我国PM_(2.5)和经济增长关系的研究中.     

Optimizing polyphase sequences for orthogonal netted radar systems

Orthogonal netted radar systems (ONRS) can fundamentally improve the radar performance by using a group of specially designed orthogonal polyphase code signals which require a very low aperiodic autocorrelation peak sidelobe level, low aperiodic cross-correlation, and a good resilience to small Doppler shifts. However, the existing numerical solutions degrade severely in the presence of small Doppler shifts. A new set of polyphase sequences is presented with good correlation properties as well as resilience to Doppler shifts. These sequences are built by using numerical optimization based on correlation properties as well as the Doppler effects on matched filter outputs, which maintains the Doppler tolerance. The statistical simulated annealing algorithm and the greedy code search method are used to optimize the sequences. Correlation and Doppler results are compared with the best-known sequences and show to be superior.     

混沌直扩序列的优选及与传统序列的性能比较

为了提高异步直扩序列码分多址 (DS/CDMA)系统的容量和保密性能 ,从整个扩频序列集合相关函数的均方值出发 ,对一类由一维混沌映射产生的混沌直扩序列与传统的伪随机序列如m序列、Gold序列和Kasami序列等 ,在异步DS/CDMA系统中作了性能比较研究。计算机仿真表明 ,其性能与传统序列相当 ,其序列数较m序列数多 ,适于作CDMA系统的扩频码 ,并由此提出了一种混沌直扩序列的优选方法。     

二元互补序列偶集理论

在非周期相关条件下提出了一种新型最佳离散信号形式--二元互补序列偶集。对其性质进行了研究,并提出多种二元互补序列偶集的构造方法,利用这些方法可以得到大量的二元互补序列偶集。与传统的序列形式相比,二元互补序列偶集既扩展了最佳离散信号的选择空间,又可作为多用户信号应用于实际工程中。     

Aggregation operators on intuitionistic trapezoidal fuzzy number and its application to multi-criteria decision making problems

Intuitionistic trapezoidal fuzzy numbers and their operational laws are defined. Based on these op-erational laws, some aggregation operators, including intuitionistic trapezoidal fuzzy weighted arithmetic averaging operator and weighted geometric averaging operator are proposed. Expected values, score function, and accuracy function of intuitionitsic trapezoidal fuzzy numbers are defined. Based on these, a kind of intuitionistic trapezoidal fuzzy multi-criteria decision making method is proposed. By using these aggregation operators, criteria values are aggregated and integrated intuitionistic trapezoidal fuzzy numbers of alternatives are attained. By comparing score function and accuracy function values of integrated fuzzy numbers, a ranking of the whole alternative set can be attained. An example is given to show the feasibility and availability of the method.     

兴奋性神经群体的非周期信息传输研究

研究了FitzHugh-Nagumo(FHN)可兴奋性神经元的小世界网络模型中非周期信息传输的问题.此小世界网络模型的每个节点都是一个FHN神经元,每个神经元的输入为具有一定相关时间的高斯非周期信号,而内部噪声为强度相同但相互独立的高斯白噪声.数值结果表明,随着噪声强度的增加,输入输出信号的相关系数出现了非周期随机共振现象.连接度对于非周期信号传输性能影响有限.对于两个不同小世界网络的互相关进行了分析以期提高信息传递率.这些研究结果对于复杂系统信号处理理论具有重要意义.     

Vector space structure of finite evolutionary games and its application to strategy profile convergence

A vector space structure is proposed for the set of finite games with fixed numbers of players and strategies for each players.Two statical equivalences are used to reduce the dimension of finite games.Under the vector space structure the subspaces of exact and weighted potential games are investigated.Formulas are provided to calculate them.Then the finite evolutionary games(EGs)are considered.Strategy profile dynamics is obtained using different strategy updating rules(SURs).Certain SURs,which assure the convergence of trajectories to pure Nash equilibriums,are investigated.Using the vector space structure,the projection of finite games to the subspace of exact(or weighted)potential games is considered,and a simple formula is given to calculate the projection.The convergence of near potential games to anε-equilibrium is studied.Further more,the Lyapunov function of EGs is defined and its application to the convergence of EGs is presented.Finally,the near potential function for an EG is defined,and it is proved that if the near potential function of an EG is a Lyapunov function,the EG will converge to a pure Nash equilibrium.Some examples are presented to illustrate the results.     

Upper and lower bounds on PMEPR in OFDM systems and application

Upper and lower bounds on peak-to-mean envelope power ratio (PMEPR) in OFDM systems are derived in this paper. The derivation results show that the upper bound on PMEPR only depends on the aperiodic autocorrelation functions of the data sequences and is quite useful for rapid elimination of sequences that have PMEPR exceeding a given threshold. According to the lower bound on PMEPR,it has a great change as N (number of subcarriers) varies only for a very small N. For a 16-subcarrier BPSK-OFDM system, a selective mapping (SLM) way to reduce PMEPR is investigated with the upper bound on PMEPR and the distribution of PMEPR for all possible message sequences is given. The analytic results show that the maximal PMEPR is about 6.5 dB which is 5.5 dB less than that in worst situation.     

Periodic performance of the chaotic spread spectrum sequence on finite precision

It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems.The chaotic binary sequence is paid more and more attention since it is one kind of applicable spread spectrum sequences.However,there are unavoidable short cyclic problems for chaotic binary sequences in finite precision.The chaotic binary sequence generating methods are studied first.Then the short cyclic behavior of the chaotic sequences is analyzed in detail,which are generated by quantification approaches with finite word-length.At the same time,a chaotic similar function is defined for presenting the cyclic characteristics of the sequences.Based on these efforts,an improved method with scrambling control for generating chaotic binary sequences is proposed.To quantitatively describe the improvement of periodic performance of the sequences,an orthogonal estimator is also defined.Some simulating results are provided.From the theoretical deduction and the experimental results,it is concluded that the proposed method can effectively increase the period and raise the complexity of the chaotic sequences to some extent.