全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 permutation matrix 在 电信技术 分类中 的翻译结果: 查询用时：0.009秒
 历史查询

 permutation matrix 置换矩阵(23)置换阵(2)置换算法(0)
 置换矩阵
 Our results are that. a classical Fourier transform(FT) operator to a permutation matrix(PM), a FRFT operator corresponds to a special general permutation matrix(GPM), the FRFT operator group correspond to a special general permutation matrix group(GPMG), and multiple transform operator equal to a matrix multiplication. 结果表明，在矩阵描述下，经典的Fourier变换相当于一个置换矩阵：一般的分数Fourier变换相当于一个广义置换矩阵； 分数Fourier变换全体构成的变换族可以用一个矩阵群来描述，多次变换运算完全转化为相应的矩阵乘法运算。 短句来源 Following the Birkhoff-von Neumann theorem, we relax the match matrix constraints from permutation matrix constraints to doubly stochastic matrix constraints. 该算法根据Birkhoff vonNeumann定理 ,首先将广义置换矩阵约束松弛为广义双随机矩阵约束 ; 短句来源 This article discusses the development of cryptography and presents the features and functions of the permutation matrix in the common algorithm. 论述了密码学的发展及一些常用算法中置换矩阵的特点及其作用。 短句来源
 置换阵
 At the same time, a novel approach to construction of LDPC codes based on the permutation matrix was proposed which got a parity check matrix with the shortest girth is 6. These codes keep the advantage of linear encoding and become more flexible. Simulations show that the performance of short length codes of this kind is as excellent as other LDPC codes. 同时提出一种基于置换阵循环移位的构造方法,得到的校验矩阵围长至少为6,且保持编码的线性复杂度,码率灵活,仿真结果验证了置换阵LDPC码码长较短时,在高斯信道下性能接近或超过现有其他构造方式的LDPC码。 短句来源
 相似匹配句对
 Matrix Revolution 矩阵革命 有关视距、视野角度和像素点 短句来源 Matrix-based substitution-permutation network against differential cryptanalysis 基于矩阵的代替置换网络抗差分密码分析 短句来源 Matrix-based substitution- permutation network against linear cryptanalysis 基于矩阵的代替置换网络抗线性密码分析 短句来源 Matrix w and FFT W矩阵与FFT 短句来源 The Research and Construction of Orthomorphic Permutation 正形置换的研究与构造 短句来源

我想查看译文中含有：的双语例句

 permutation matrix
 In particular, it is shown that the permutation matrix ? is a "rigid" solution. TwoD -net subgroups are conjugate if and only if theD -nets defining them are similar (i.e., can be transformed into each other by a permutation matrix). Recently it was shown that tWW-1 is a permutation matrix (the order of this permutation matrix is called the "index" of W), and a general form was given for spin models of index 2. Combin.10 (1999), 241-278) it was shown that tWW-1 is a permutation matrix (the order of this permutation matrix is called the "index" of W), and a general form was given for spin models of index 2. A harmonic interpolation of a polygon (for odd and even numbers of points forming the polygon) used in computer graphics is derived from the primary permutation matrix using the spectral decomposition of the matrix. 更多
 In this paper,the security problem of the encryption procedures in the public key cryptosystems ECPSZ and ECPS3 which are based on error correcting codes is discussed.It is pointed out that a permuation matrix can be found in time O(n3) from the public information of the cryptosystems,which can be used to decrypt the ciphertexts encrypted with the secret permutation matrix,where n is the mumber of rows(columns) in the secret permutaion matrix.Further,detailed procedure to attack ECPS2 is described.... In this paper,the security problem of the encryption procedures in the public key cryptosystems ECPSZ and ECPS3 which are based on error correcting codes is discussed.It is pointed out that a permuation matrix can be found in time O(n3) from the public information of the cryptosystems,which can be used to decrypt the ciphertexts encrypted with the secret permutation matrix,where n is the mumber of rows(columns) in the secret permutaion matrix.Further,detailed procedure to attack ECPS2 is described. 本文讨论了基于纠错码的公钥体制ＥＣＰＳ２和ＥＣＰＳ３中加密过程的安全性，指出可以在Ｏ（ｎ￣３）时间内由体制的公开钥信息找到一个置换矩阵，用它也可以解密由秘密置换阵加密的消息，其中ｎ为秘密置换阵的行（列）数．进而，本文给出了用所找到的置换阵破译ＥＣＰＳ２加密和ＥＣＰＳ３部分情况下加密的方法。 In this paper, by using the matrix group,we study the mathematical representation of the fractional Fourier transform (FRFT), and simulating show the two specific properties of time-frequency analysis of signal with FRFT directly. Our results are that. a classical Fourier transform(FT) operator to a permutation matrix(PM), a FRFT operator corresponds to a special general permutation matrix(GPM), the FRFT operator group correspond to a special general permutation matrix group(GPMG), and multiple... In this paper, by using the matrix group,we study the mathematical representation of the fractional Fourier transform (FRFT), and simulating show the two specific properties of time-frequency analysis of signal with FRFT directly. Our results are that. a classical Fourier transform(FT) operator to a permutation matrix(PM), a FRFT operator corresponds to a special general permutation matrix(GPM), the FRFT operator group correspond to a special general permutation matrix group(GPMG), and multiple transform operator equal to a matrix multiplication. Finally numerical simulation of FRFT of signal show that FRFT has special properties of time-frequency analysis for the signal processing 本文从矩阵群的观点出发讨论了分数Ｆｏｕｒｉｅｒ变换的数学描述并通过数字仿真直观地说明了它进行信号时－频分析的两个特点。结果表明，在矩阵描述下，经典的Ｆｏｕｒｉｅｒ变换相当于一个置换矩阵：一般的分数Ｆｏｕｒｉｅｒ变换相当于一个广义置换矩阵；分数Ｆｏｕｒｉｅｒ变换全体构成的变换族可以用一个矩阵群来描述，多次变换运算完全转化为相应的矩阵乘法运算。最后，数字信号分数Ｆｏｕｒｉｅｒ变换的仿真计算表明，分数Ｆｏｕｒｉｅｒ变换具有独特的时－频分析性质。 Automatic target recognition(ART) using Synthetic Aperture Radar(SAR) imagery is investigated in this paper. The feature extraction problem of SAR imagery is first analyzed, then a matching scheme that incorporates relative distance and magnitude between features is investigated. Following the Birkhoff-von Neumann theorem, we relax the match matrix constraints from permutation matrix constraints to doubly stochastic matrix constraints. Via Lagrange multipliers and a barrier function, the constraints... Automatic target recognition(ART) using Synthetic Aperture Radar(SAR) imagery is investigated in this paper. The feature extraction problem of SAR imagery is first analyzed, then a matching scheme that incorporates relative distance and magnitude between features is investigated. Following the Birkhoff-von Neumann theorem, we relax the match matrix constraints from permutation matrix constraints to doubly stochastic matrix constraints. Via Lagrange multipliers and a barrier function, the constraints are incorporated into the objective function, and the matching problem is posed as a nonlinear optimization problem. Using a combination of deterministic annealing and softassign, the objective function describing the matching problem is minimized. Recognition is performed by comparing the costs of the matches between the test image and deferent pattens. To account for the difference in the number of features, the computed costs are first caled by the ratio of the number of features between the two images. The test costs image belongs to the class of the pattern with the smallest acaled matching cost. Experimental results show the power of this approach in SAR target recognition. 针对合成孔径雷达 (SAR)图象自动目标识别问题 ,在对SAR图象的特征提取问题进行分析的基础上 ,提出了一种特征点匹配算法 .该算法根据Birkhoff vonNeumann定理 ,首先将广义置换矩阵约束松弛为广义双随机矩阵约束 ;然后利用拉格朗日乘子和障碍函数法 ,把约束加到目标函数中 ,从而将点集匹配问题转化为非线性最优化问题 ;最后利用确定性退火和软分配技术求解该问题 ,将得到的匹配代价用特征点数目的比值进行修正后 ,用于目标的识别 .实验结果表明 ,该算法非常有效 . << 更多相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社