 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   givens旋转 的翻译结果: 查询用时：0.782秒 在分类学科中查询 所有学科 数学 电信技术 电力工业 计算机软件及计算机应用 无线电电子学 更多类别查询 历史查询  givens旋转  givens rotation
 Dynamical Data Error Processing Based on GIVENS Rotation Algorithm 基于GIVENS旋转算法的动态数据误差处理 短句来源 CORDIC Based Root free Givens Rotation Processing 基于CORDIC的无开方GIVENS旋转处理方法 短句来源 For nx n dense matrix inversion, the algorithm needs 4n-2 time units and n(n+l) processors when Gauss-Jordan elimination is used or n(3n+l)/2 processors when Givens rotation used. 对于n阶非奇异稠密方阵的求逆,处理时间为4n-2个单位时间; 使用Gauss-Jordan消去法时,需n(n+1)个处理单元,使用邻主元素法及Givens旋转法时,需要n(3n+1)/2个处理单元。 短句来源 1. Proposes two sorted QR decomposition detection algorithms based on Householder transform and Givens rotation transform. The results show that the proposed algorithms achieve the same performance of the sorted QR decomposition detection algorithm based on Gram-Schimidt transform proposed by D. 1．提出了基于Householder变换的排序QR分解检测和基于Givens旋转变换的排序QR分解检测算法，仿真结果表明提出的这两种排序QR分解检测算法与D. 短句来源 A typical Givens rotation has square root operation,which is one of the key factors limits the algorithm speed. 标准的Givens旋转包含开方运算，该运算是限制有关算法速度的一个重要因素。 短句来源 更多 givens rotations
 FINITE WORDLENGTH ANALYSIS FOR RLS SYSTOLIC ALGORITHM BASED ON THE SQUARE ROOT FREE SCALED GIVENS ROTATIONS 无平方根定标Givens旋转算法脉动阵实现的有限字长分析 短句来源 Many important high speed adaptive array processing algorithms include a series of Givens rotations,which transform an input data matrix into a triangnlar matrix. 许多重要的高速实时自适应阵列处理算法均需要采用一系列Givens旋转处理将输入数据矩阵变成三角阵。 短句来源 The derivation of the first algorithm is based on the QR decomposition of the input data matrix directly, and Givens rotations approach is used to compute the QR decomposition. 第一种算法的推导是直接基于对输入数据矩阵进行正交-三角分解,并利用Givens旋转方法来计算其正交-三角分解。 短句来源 The derivation of the algorithm is based solely on numerical robust Givens rotations, which have superior numerical property and better modular structure performance. 算法的导出仅利用数值稳健的Givens旋转方法，因此具有优越的数值性能和较好的模块化结构性能。 短句来源 A kind of algorithm and architecture are described which have specific application to high performance, digital, adaptive beamforming. The function of such an adaptive combiner is formulated as a recursive least squares minimization operation and the corresponding weight vector is obtained by means of the Q-R decomposition algorithm using Givens rotations. 研究了一种专门适用于高性能数字自适应波束形成的算法,其自适应合成器的功能用公式表示成为一个递归最小二乘运算,相应的权失量通过基于Givens旋转算法的Q-R分解得到。 短句来源 更多 “givens旋转”译为未确定词的双语例句
 A pair of multichannel recursive least squares (RLS) adaptive lattice algorithms based on the order recursive properties of lattice filters and the superior numerical properties of the Givens algorithms is derived. 本文基于格型滤波器的阶递归特性和Givens旋转算法的优越数值性能,推导了两种多信道递归最小二乘格型算法。 短句来源 Compared with the traditional Givens - rotation based algorithms , the author - proposed method expresses the recursive relation of the parameters to be estimated plainly and directly, and hence the algorithm convergence can be easily drawn as a conclusion . 与利用Givens旋转变换进行参数递推估计的方法相比,该方法直接表征了被辨识参数的递推计算关系,因而可直接判定递推估计算法的收敛性。 短句来源 查询“givens旋转”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  givens rotation
 We observe that the classical Givens' rotation in the real and in the complex case is itself a quaternion using an isomorphism between certain (2×2) matrices and R4 equipped with the quaternion multiplication. Comparisons to the existing known methods, such as Householder transformation and Givens rotation, are also given. Specifically, the Householder transformation outperforms the Givens rotation and the modified Gram-Schmidt methods in numerical stability under finite-precision implementations, as well as requiring fewer arithmetical operations. Actually, one additional Givens rotation for each regularization parameter is necessary for the diagonalization of the subproblem matrix. Thus, the orthonormal matrix Qk is composed of the products of the Givens rotation matrices. 更多 givens rotations
 The derivation of the first algorithm is based on QR decomposition of the input data matrix directly, and the Givens rotations approach is used to compute the QR decomposition. Finite wordlength analyzing for RLS systolic algorithm based on the square-root-free scaled givens rotations A square-root-free scaled Givens rotations algorithm and its systolic architecture for the optimal RLS residual evaluation are presented in this paper. Fast Givens rotations for orthogonal similarity transformations Fast Givens rotations with half as many multiplications are proposed for orthogonal similarity transformations and a matrix notation is introduced to describe them more easily. 更多 Systolic algorithms are given for dense matrix inversion and solution of linear systems without back substitution. Compared with the ones presented in the references listed, the present ones have the merits of uniform processors, regular data movements and lower time-space complexity. For solving linear system with n unknowns, n(n+3)/ 2 processors and 3n-1 time units are needed. For nx n dense matrix inversion, the algorithm needs 4n-2 time units and n(n+l) processors when Gauss-Jordan elimination is used or... Systolic algorithms are given for dense matrix inversion and solution of linear systems without back substitution. Compared with the ones presented in the references listed, the present ones have the merits of uniform processors, regular data movements and lower time-space complexity. For solving linear system with n unknowns, n(n+3)/ 2 processors and 3n-1 time units are needed. For nx n dense matrix inversion, the algorithm needs 4n-2 time units and n(n+l) processors when Gauss-Jordan elimination is used or n(3n+l)/2 processors when Givens rotation used. 本文给出线性方程组求解、方阵求逆的三种无回代心动算法,与文献中的算法相比,不但处理单元统一、数据流动更有规则性,而且具有更小的时空复杂度。对于n阶线性方程组的求解,阵列中有n(n+3)/2个处理单元,需3n—1个单位时间.对于n阶非奇异稠密方阵的求逆,处理时间为4n-2个单位时间;使用Gauss-Jordan消去法时,需n(n+1)个处理单元,使用邻主元素法及Givens旋转法时,需要n(3n+1)/2个处理单元。 In this paper,it is proved that the fast hyperbolic transformation in hyprtbolic Cholesky factorization is feasible. It involves half the number of multiplies as an ordinary hyperbolic transformation. Also,the zeroing is carried out without an explicit suare root. The element growth in M and D is controlled. 对于一般的Ｇｉｖｅｎｓ旋转，为了减少运算量，曾经提出了快速Ｇｉｖｅｎｓ旋转，减少了大约一半的运算量，并且避免了显式开方运算．本文论证了在并行算法的Ｃｈｏｌｅｓｋｙ分解中，快速双曲旋转的可行性，并讨论了工作量和稳定性． A receive least squares (RLS) lattice adaptive algorithm is developed for a cmsstalk-resistant adaptive noise canceller (CTRANC). The derivation of the algorithm is based solely on numerical robust Givens rotations, which have superior numerical property and better modular structure performance. Becaase square-root operations are not included, the proposed algorithm is very suitable for the implementation ed a conventiona digital signal procossor(DSP). An array implementation scheme is discussed and a high performance... A receive least squares (RLS) lattice adaptive algorithm is developed for a cmsstalk-resistant adaptive noise canceller (CTRANC). The derivation of the algorithm is based solely on numerical robust Givens rotations, which have superior numerical property and better modular structure performance. Becaase square-root operations are not included, the proposed algorithm is very suitable for the implementation ed a conventiona digital signal procossor(DSP). An array implementation scheme is discussed and a high performance ANC can be realixzed by increasing the computing tiee slightly. Simulation results show that the convergence speed is much faster than that of the ekishng least mean square (LMS) algorithm. 本文就抗串扰自适应噪声抵消器，研究了一种递归最小二乘（ＲＬＳ）格型自适应算法。算法的导出仅利用数值稳健的Ｇｉｖｅｎｓ旋转方法，因此具有优越的数值性能和较好的模块化结构性能。算法不含平方根运算，十分适合用通用数字信号处理器实现。文中还就算法的阵列实现进行了探讨，只需增加少量的时间，即可实现高性能的自适应噪声抵消器。模拟结果表明，算法的收敛速度明显优于现有的ＬＭＳ算法。 << 更多相关文摘 相关查询

 CNKI小工具 在英文学术搜索中查有关givens旋转的内容 在知识搜索中查有关givens旋转的内容 在数字搜索中查有关givens旋转的内容 在概念知识元中查有关givens旋转的内容 在学术趋势中查有关givens旋转的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社