共查询到20条相似文献,搜索用时 250 毫秒
1.
2.
本文讨论利用多项式变换计算二维卷积的问题。在扼要地回顾T.K.Truong等人提出的FPT—FFT—CRT算法后,指出多项式乘积的计算是这种算法还有待改进之处。文中给出了解决这个问题的一种数学方法和计算复杂性分析。改进算法与FPT—FFT—CRT算法相比,乘法运算减少约14~19%。 相似文献
3.
{1,-1}~(?)上二次多项式的极大化是NP-难题,对研究这个问题所做的主要努力是识别出多项式时间可解的特殊情况,并给出近似方法。本文将一类系数取自{1,-1}上的{1,-1}~(?)上二次多项式极大化问题变成线性分组码的最小距离译码问题。线性分组码的最小距离译码是NP-难问题,但有些情况可解。本文研究了一类线性分组码的译码算法,这种算法可用来优化一类{1,-l}~(?)上的二次函数。 相似文献
4.
论文将Fermat素性检验的思想运用于不可约多项式的判断,给出了一个对于不可约判断问题的Monte Carlo 算法,分析了该算法的计算复杂度问题,并且给出了次数在200以内的检验结果。 相似文献
5.
本文给出了二维离散余弦变换多项式变换算法的数字表示,并给出了在FPGA中实现二维离散余弦变换处理器的系统框图和实现流程,同时比较了这种算法与分布算法的性能,指出了这种算法在音视频和图像处理领域的广泛应用。 相似文献
6.
本文提出一个数字乘法的简化算法,此法基于利用欧式多项式算法求一个乘数的公共因子。文中介绍公共因子求法的原理,并给出了实例。 相似文献
7.
8.
杨振华 《南京邮电学院学报(自然科学版)》2001,21(4):64-66
建立了一种染色问题的数学模型,利用模2意义下的矩阵表示,将原问题归结为线性方程组的求解,从而给出了一个多项式算法。 相似文献
9.
本文给出一类适合于求解多项式实零点问题的神经网络。理论分析和模拟结果都表明,这类网络可实时求解多项式实零点问题。 相似文献
10.
李超 《信息安全与通信保密》1995,(3)
本文讨论了一般有限域上置换多项式的表示形式及其判定条件,根据次数不超过3的置换多项式的特点,决定了一批n元非奇异反馈函数的具体表示形式,最后给出了一个求全体n元非奇异反馈函数的算法。 相似文献
11.
12.
13.
Anton Kummert 《Multidimensional Systems and Signal Processing》1990,1(3):327-339
This paper presents an algorithm for the so-called spectral factorization of two-variable para-Hermitian polynomial matrices which are nonnegative definite on thej
axis, arising in the synthesis of two-dimensional (2-D)passive multiports, Wiener filtering of 2-D vector signals, and 2-D control systems design. First, this problem is considered in the scalar case, that is, the spectral factorization of polynomials is treated, where the decomposition of a two-variable nonnegative definite real polynomial in a sum of squares of polynomials in one of the two variables having rational coefficients in the other variable plays an important role (cf. Section 4). Second, by using these results, the matrix case can be accomplished, where in a first step the problem is reduced to the factorization of anunimodular para-Hermitian polynomial matrix which is nonnegative definite forp=j
, and in a second step this simplified problem is solved by using so-called elementary row and column operations which are based on the Euclidian division algorithm. The matrices considered may be regular or singular and no restrictions are made concerning the coefficients of their polynomial entries; they may be either real or complex. 相似文献
14.
电子对抗正逐步由信号层向信息层发展,信道编码的识别成为信息截获领域一个重要的课题。针对(2,1,m)卷积码盲识别问题,提出了一种基于遗传算法的识别方法,该方法具有很好的容错性能和快速识别能力。最后,通过MATLAB仿真验证了该方法能够识别出卷积码的校验多项式,进而求得生成多项式。 相似文献
15.
An algorithm for interpolation by piece-wise polynomial approximation has been developed and implemented. The hypersurface approximation is carried out by a quadratic surface defined over a two dimensional space of the digital picture in the neighbourhood of the point to be interpolated using orthogonal polynomials as basis functions. The kernel for interpolation has been evaluated with the help of polynomial basis functions; this enables efficient implementation of the algorithm. 相似文献
16.
基于多项式分解理论的低时延完全重构两通道滤波器组的设计 总被引:4,自引:0,他引:4
Euclid多项式分解算法可以用于滤波器组的设计,该文首先讨论了Euclid分解算法与低时延两通道完全重构的滤波器组设计理论,推导出可实现分解的条件,并从理论上加以证明,由于Euclid分解算法具有非唯一性,该文提出了一种新的算法以确定唯一的分解,并将这种算法用于具有低时延特性的两通道全重构滤波器组的设计,最后,通过给出的基于分解方法的设计例子,说明该方法是有效的。 相似文献
17.
In this paper, we consider a practical problem, called Minimum Forwarding Set Problem (MFSP), that emerges within the context of implementing (energy efficient) communication protocols for wireless ad hoc or sensor networks. For a given node v, MFSP asks for a minimum cardinality subset of 1-hop neighbors of v to cover v’s 2-hop neighbors. MFSP problem is also known as multi-point relay (MPR) problem. It is shown to be an NP-complete problem for its general case that does not consider the coverage characteristics of wireless transmissions. In this paper, we present two polynomial time algorithms to solve the MFSP problem under disk coverage model for wireless transmissions. In our earlier work, we presented a polynomial time algorithm for this problem under unit disk coverage model. In the current work, we present several observations on the geometric characteristics of wireless transmissions under disk coverage model and build two alternative dynamic programming based solutions with different run time and space complexities to the problem. Disk coverage model is a more general model because it allows nodes to use arbitrary power levels for transmissions. As a result, the presented algorithms provide a more practical solution that can be used as a building block for energy efficient communication protocols designed for wireless ad hoc and sensor networks. 相似文献
18.
一种实时语音采样率转换的延迟线算法 总被引:1,自引:1,他引:0
提出了一种有效的FIR时变分数延迟线算法,可用于实时语音采样率转换.算法中采用离散正交多项式插值,使得在相同逼近阶下插值平方误差最小;并讨论了利用延迟线实现延迟的方法.Matalb仿真结果表明了所提算法的有效性. 相似文献
19.
用改进激活集合法优化VLSI互连线 总被引:3,自引:3,他引:0
本文介绍离散线宽的单根互连线时延优化的一种算法:改进激活集合法(MASM)。基于Elmore时延模型,单根互连线的优化问题能被表述为凸二次规划,能在多项式时间里求解,得到最优结果。它是一种非常高效的算法.计算结果证明了此算法的有效性。 相似文献