基于深度卷积神经网络的变换域通信网络抗干扰优化算法

为了有效抑制变换域通信网络干扰信号,改善信噪比,研究了基于深度卷积神经网络的变换域通信网络抗干扰优化算法。应用傅里叶变换方法将信号从时域转换到频域,并以傅里叶变换通信信号获得的参数为依据构建干扰信号模型;嵌入干扰信号模型以形成接收信号,然后对接收信号进行处理并存储在干扰数据库中,利用深度卷积神经网络完成干扰信号的特征学习与干扰估计,并根据干扰估计结果,在接收信号中去除干扰信号,完成变换域通信网络抗干扰优化。实验结果表明：该算法可有效完成变换域通信网络抗干扰优化,优化后通信信号的信噪比改善性能与误码性能均较佳,输出的通信信号几乎无干扰信号存在。     

基于SFFT的宽带信号互谱法测向算法

在无线电频谱监测中,随着数据采集能力和采样频率的不断提高,对算法的时效性提出了更高要求。对于宽带信号测向系统,提出基于稀疏快速傅里叶变换的互谱法相位测量算法,该算法利用信号频域的稀疏特性,通过频谱重排、滤波、降采样和估值,能快速计算出频谱中K（信号稀疏度）个拥有最大值的傅里叶系数。利用这K个大值点计算平均时延,在保证与传统快速傅里叶变换有相同精度的同时,降低算法的时间复杂度。分析表明,该算法的时间复杂度与信号稀疏度K呈亚线性关系。该方法提高了算法效率。仿真分析对比了基于稀疏快速傅里叶变换的互谱法和基于快速傅里叶变换的互谱法的误差,表明了该算法的有效性。     

基于ARMv8处理器的实数FFT实现与性能优化研究

FFT(快速傅里叶变换)是离散傅里叶变换或其逆变换的一种常见快速算法,是高性能计算领域最重要的基础核心算法之一,在科学、工程和数学等领域的应用十分广泛.实数FFT算法,即输入或者输出为实数的FFT算法,其中包括R2C(Real-to-Complex)、C2R(Complex-to-Real)等变换类型.相比复数FFT算法,实数FFT算法在图形图像处理、数据压缩等领域有着不可替代的作用.传统实数FFT实现针对的是输入规模为偶数,一般转变为复数FFT进行运算.然而当前鲜有针对输入规模为奇数的实数FFT高效实现.对此,本文提出了一种实数FFT高效算法(DRFFT),并采用蝶形网络优化、蝶形计算优化、访存优化、SIMD优化以及数据转置等方法进行优化,大幅提升了实数FFT算法性能,最终构建了一种针对实数FFT的高性能算法库.实验结果表明,本文实现的DRFFT R2C变换在单双精度浮点数处理方面较FFTW库性能分别平均提升了37.6%和4.6%,较ARMPL库性能分别平均提升了67.6%和28.1%.DRFFT C2R变换在单双精度浮点数处理方面则较FFTW库性能分别平均提升了58.6%和10.8...     

一种稀疏度自适应的稀疏傅里叶变换算法

稀疏快速傅里叶变换需要信号以傅氏域的稀疏度为先验信息,但稀疏度通常是未知的,在一定程度上限制了算法的应用。为此,提出一种新的稀疏傅里叶变换算法。在下采样域进行能量检测,得到稀疏度的初始值,通过增大下采样维度提高稀疏度估计的准确性,从而近似估计稀疏度,设定阈值剔除冗余信息从而得到较好效果。实验结果表明,当信号长度大于219或稀疏度小于900时,该算法性能优于西方快速傅里叶变换,且具有较强的鲁棒性。     

基于小波降噪的稀疏傅里叶变换时延估计

稀疏傅里叶变换时延估计具有较低的运算时间复杂度,但在低信噪比时无法准确估计出时延.针对稀疏傅里叶变换时延估计在噪声干扰下时延估计精度下降的缺点,提出了基于小波降噪的稀疏傅里叶变换时延估计算法.算法利用小波降噪方法处理接收到的信号,再对降噪后的信号进行稀疏傅里叶变换广义相关,通过检测相关函数的谱峰得到估算的时延值.实验仿真以及对实测数据的验证均表明,在低信噪比条件下,基于小波降噪的稀疏傅里叶变换时延估计算法在保证数据高处理速度的同时,具有较好的抗噪性以及较高的时延估值精确度.     

分数傅里叶变换的快速算法及计算全息图的研究

通过分析菲涅耳衍射积分的快速算法，依据Lohmann提出的任意阶的分数傅里叶变换的单透镜光学实验装置，详细分析丁光场在此单透镜系统中的传播过程，提出了一种基于傅里叶变换的分数傅里叶变换快速算法，并对基于此快速算法的分数傅里叶变换全息图的计算机生成与数字重现进行了研究。实验结果示出了分数傅里叶变换全息图及其在重构过程中分数阶匹配与否的实验结果，验证了分数傅里叶变换分数阶的重要性质和笔者提出算法的可行性。     

一种基于单片机的模拟量采集滤波算法设计

模拟量采集是嵌入式系统的一项重要功能,模拟量信号易被嵌入式系统本身或外部的噪声源所干扰,产生失真问题。针对上述问题,本文提出了一种基于单片机的模拟量采集算法。首先采集系统空载的模拟量信号,对其进行插值、平滑滤波等预处理操作;随后对处理后的数据进行快速傅里叶变换提取频域特征;采集系统负载模拟量信号时,对其进行相同操作并由空载信号进行反向滤波,再通过逆傅里叶变换输出。实验结果表明,本文提出的算法能够较好地滤除噪声干扰,提升了模拟量采集的准确率。     

基于Hilbert-Huang变换的语音信号分离

针对短时傅里叶变换不能正确得到非平稳信号的能量频率分布问题,提出了一种基于Hilbert-Huang变换的单信道语音信号分离的算法。该算法首先对分解得到的各内蕴模式函数分量(IMF)进行Hilbert变换,得到混合信号时频面上的Hilbert谱,然后对混合信号的Hilbert谱运用独立子空间分析的方法得出代表各个独立源信号的子空间,并对其求逆变换,从而恢复出各个源信号。通过仿真实验验证了此算法的正确性和有效性,且与短时傅里叶变换时频分析法相比较,其分离性能明显得到改善,显示了Hilbert-Huang变换在处理非平稳信号的优越性。     

基于空时离散傅里叶变换投影的宽带旋转不变技术估计信号参数算法

利用采样频率和频域数据的关系,对空时离散傅里叶变换(DFT)投影方法进行改进,并且讨论分析了采样频率对其解相干性能的影响,然后将窄带旋转不变技术估计信号参数(ESPRIT)类算法应用到宽带相干源方位估计中,提出一种基于空时DFT投影的宽带ESPRIT算法。仿真结果表明,适当地增加采样频率可以改善空时DFT投影方法的方位估计性能,并且比起快速傅里叶变换(FFT)插值法,空时DFT投影方法具有更加优越的方位估计性能。     

地震波形信号小波去噪研究

从小波变换的基本原理出发,讨论了如何选择合适的小波函数及适当的阈值,以实现非线性非平稳地震信号的去噪算法。利用多尺度小波分解对地震波形数据进行了分析,在MATLAB中实现了对地震信号的去噪算法。分析比较了基于傅里叶变换和基于小波变换的两种算法对实际地震信号的去噪效果。结果表明,对于非线性非平稳地震信号的噪声消减,小波变换去噪算法显著优于傅里叶变换去噪算法。     

Analytic-numerical solutions with a priori error bounds for time-dependent mixed partial differential problems

The aim of this paper is double. First, we point out that the hypothesis D(t₁)D(t₂) = D(t₂)D(t₁) imposed in [1] can be removed. Second, a constructive method for obtaining analytic-numerical solutions with a prefixed accuracy in a bounded domain Ω(t₀,t₁) = [0,p] × [t₀,t₁], for mixed problems of the type u_t(x,t) − D(t)u_xx(x,t) = 0, 0 < x < p, t> 0, subject to u(0,t) = u(p,t) = 0 and u(x,0) = F(x) is proposed. Here, u(x,t) and F(x) are r-component vectors, D(t) is a C^{r × r} valued analytic function and there exists a positive number δ such that every eigenvalue z of (1/2) (D(t) + D(t)^H) is bigger than δ. An illustrative example is included.     

Moments of conjugacy classes of binary words

For each nonempty binary word w=c₁c₂c_q, where c_i{0,1}, the nonnegative integer ∑_i=1^q (q+1−i)c_i is called the moment of w and is denoted by M(w). Let [w] denote the conjugacy class of w. Define M([w])={M(u): u[w]}, N(w)={M(u)−M(w): u[w]} and δ(w)=max{M(u)−M(v): u,v[w]}. Using these objects, we obtain equivalent conditions for a binary word to be an -word (respectively, a power of an -word). For instance, we prove that the following statements are equivalent for any binary word w with |w|2: (a) w is an -word, (b) δ(w)=|w|−1, (c) w is a cyclic balanced primitive word, (d) M([w]) is a set of |w| consecutive positive integers, (e) N(w) is a set of |w| consecutive integers and 0N(w), (f) w is primitive and [w]St.     

Nonnegative solutions of singular boundary value problems with sign changing nonlinearities

The paper presents sufficient conditions for the existence of positive solutions of the equation x″(t) + q(t)f(t,x(t),x′(t)) = 0 with the Dirichlet conditions x(0) = 0, x(1) = 0 and of the equation (p(t)x′(t))′ + p(t)q(t)f(t,x(t),p(t)x′(t)) = 0 with the boundary conditions lim_t→o⁺ p(t)x′(t) = 0, x(1) = 0. Our nonlinearity f is allowed to change sign and f may be singular at x = 0. The proofs are based on a combination of the regularity and sequential techniques and the method of lower and upper functions.     

Constructible functions in cellular automata and their applications to hierarchy results

We investigate time-constructible functions in one-dimensional cellular automata (CA). It is shown that (i) if a function t(n) is computable by an O(t(n)−n)-time Turing machine, then t(n) is time constructible by CA and (ii) if two functions are time constructible by CA, then the sum, product, and exponential functions of them are time constructible by CA. As an application, it is shown that if t₁(n) and t₂(n) are time constructible functions such that lim_n→∞ t₁(n)/t₂(n) = 0 and t₁(n)n, then there is a language which can be recognized by a CA in t₂(n) time but not by any CA in t₁(n) time.     

初始状态为正交的二维线性正系统的渐近稳定性

本文分析了初始状态为正交的二维线性正系统的渐近稳定性. 与一维系统不同, 初始状态为正交的二维系统的稳定性严格依赖于合适的初始条件. 首先, 当初始状态 绝对收敛时, 二维正FM I 模型的渐近稳定性判据被提出. 然后, 针对二维正Rosser模型, 在初始状态 绝对收敛时, 相似的结论被给出. 最后, 两个数字实例证实了这些判据的有效性.     

Resolvability and the upper dimension of graphs

For an ordered set W = {w₁, w₂,…, w_k} of vertices and a vertex v in a connected graph G, the (metric) representation of v with respect to W is the k-vector r(v | W) = (d(v, w₁), d(v, w₂),…, d(v, w_k)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct representations. A new sharp lower bound for the dimension of a graph G in terms of its maximum degree is presented.

A resolving set of minimum cardinality is a basis for G and the number of vertices in a basis is its (metric) dimension dim(G). A resolving set S of G is a minimal resolving set if no proper subset of S is a resolving set. The maximum cardinality of a minimal resolving set is the upper dimension dim⁺(G). The resolving number res(G) of a connected graph G is the minimum k such that every k-set W of vertices of G is also a resolving set of G. Then 1 ≤ dim(G) ≤ dim⁺(G) ≤ res(G) ≤ n − 1 for every nontrivial connected graph G of order n. It is shown that dim⁺(G) = res(G) = n − 1 if and only if G = K_n, while dim⁺(G) = res(G) = 2 if and only if G is a path of order at least 4 or an odd cycle.

The resolving numbers and upper dimensions of some well-known graphs are determined. It is shown that for every pair a, b of integers with 2 ≤ a ≤ b, there exists a connected graph G with dim(G) = dim⁺(G) = a and res(G) = b. Also, for every positive integer N, there exists a connected graph G with res(G) − dim⁺(G) ≥ N and dim⁺(G) − dim(G) ≥ N.     

Vapor-Phase Self-Assembled Monolayers for Anti-Stiction Applications in MEMS

We have investigated the anti-stiction performance of self-assembled monolayers (SAMs) that were grown in vapor phase from six different organosilane precursors: CF₃(CF₂)₅(CH₂)₂SiCl₃ (FOTS), CF₃(CF₂)₅(CH₂)₂Si(OC₂H₅)₃ (FOTES), CF₃(CF₂)₅(CH₂)₂Si(CH₃)Cl₂ (FOMDS), CF₃(CF₂)₅(CH₂)₂Si(CH₃)₂Cl (FOMMS), CF₃(CF₂)₇(CH₂)₂SiCl₃ (FDTS), and CH₃(CH₂)₁₇(CH₂)₂SiCl₃ (OTS). The SAM coatings that were grown on silicon substrates were characterized with respect to static contact angle, surface energy, roughness, nanoscale adhesive force, nanoscale friction force, and thermal stability. The best overall anti-stiction performance was achieved using FDTS as precursor for the SAM growth, but all coatings show good potential for solving in-use stiction problems in microelectromechanical systems devices.     

Heaps and heapsort on secondary storage

A heap structure designed for secondary storage is suggested that tries to make the best use of the available buffer space in primary memory. The heap is a complete multi-way tree, with multi-page blocks of records as nodes, satisfying a generalized heap property. A special feature of the tree is that the nodes may be partially filled, as in B-trees. The structure is complemented with priority-queue operations insert and delete-max. When handling a sequence of S operations, the number of page transfers performed is shown to be O(∑_{i = 1}^S(1/P) log_(M/P)(N_i/P)), where P denotes the number of records fitting into a page, M the capacity of the buffer space in records, and N_i, the number of records in the heap prior to the ith operation (assuming P 1 and S> M c · P, where c is a small positive constant). The number of comparisons required when handling the sequence is O(∑_{i = 1}^S log₂ N_i). Using the suggested data structure we obtain an optimal external heapsort that performs O((N/P) log_(M/P)(N/P)) page transfers and O(N log₂ N) comparisons in the worst case when sorting N records.     

An asymptotic theory for recurrence relations based on minimization and maximization

We derive asymptotic approximations for the sequence f(n) defined recursively by f(n)=min_1j<n {f(j)+f(n−j)}+g(n), when the asymptotic behavior of g(n) is known. Our tools are general enough and applicable to another sequence F(n)=max_1j<n {F(j)+F(n−j)+min{g(j),g(n−j)}}, also frequently encountered in divide-and-conquer problems. Applications of our results to algorithms, group testing, dichotomous search, etc. are discussed.     

Parallel algorithms for planar dominance counting

Given n points in the plane the planar dominance counting problem is to determine for each point the number of points dominated by it. Point p is said to dominate point q if x(q)x(p) and y(q)y(p), when x(p) and y(p) are the x− and y-coordinate of p, respectively. We present two CREW PRAM parallel algorithms for the problem, one running in O(log n loglog n) time and and the other in O(lognloglogn/logloglogn) time both using O(n) processors. Some applicationsare also given.