助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   复整数 的翻译结果: 查询用时:0.49秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

复整数
相关语句
  complex integer
     Annotations on Gowers Theory in Complex Integer Set Z[i]
     对复整数集Z[i]中高斯定理的注记
短句来源
  “复整数”译为未确定词的双语例句
     First, employing ordinary butterfly operations formula in FFT, lifting matrixes has been got and FFT transform that maps plural integer to plural integer has been achieved.
     首先,通过FFT中的一般蝶形运算公式,构造提升矩阵,实现FFT的复整数复整数的变换。
短句来源
  相似匹配句对
     Annotations on Gowers Theory in Complex Integer Set Z[i]
     对整数集Z[i]中高斯定理的注记
短句来源
     TALKING ABOUT THE INTEGER
     整数评述
短句来源
     Complex Numbers
    
短句来源
     Numerical Computation of Cylindrical Functions for Integer Orders and Complex Arguments
     整数宗量圆柱函数的数值计算
短句来源
     COMPLEX GENERALIZED WEIGHT
     广义权
短句来源
查询“复整数”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  complex integer
The impetus for this work is provided by the occurrence of complex integer sequences in digital signal processing and the desire to process them using exact arithmetic.
      
The emphasis is on the theory of computational algorithms for processing sequences defined in finite integer and complex integer rings.
      
The relevant results pertaining to finite integer and complex integer rings are also summarized.Note: This work is being reported in two parts.
      
On fast algorithms for one-dimensional digital signal processing in finite integer and complex integer rings
      
In this work, we present and analyze a number theoretic approach to computing one-dimensional cyclic convolution of sequences defined in finite integer and complex integer rings.
      
更多          


Sun Qi, Zheng Dexun and Shen Zhongqi discuss integer's cyclic convolutions over quadratic fields, cyclotomic fields and other algebraic mumber fields in [1], In[2] an arbitrary cyclic convolution over Z[i] is turned into two cyclic convolutions over Z.Applying its manner, we obtain some similiar results over algebraic number fields. At last we obtain a further result that an arbitrary cyclic convolution over Z[i] can be calculated by calculating one cyclic convolution over Z.

在信息的数字处理中,卷积是最常见的一种,通常又是通过循环卷积来算.随着数论变换的兴起,人们逐渐用DFT的方法计算整数、复整数甚至代数整数的循环卷积.本文推广了文[2]的方法到一般代数数域上,得出相应的结果.最后证明了进一步的结果:复整数卷积可只通过一次普通卷积算出.

Let p be a prime,q=2 p-1 be a Mersenne prime and N=2 p+1.A method is presented to compute the Mersenne transform(MT) of an N-point integers sequence and the inverse MT(IMT) of the MT of another N-point integers sequence by carrying out a single MT of an N-point complex integers sequence.This algorithm for the MT over the finite field with q~2 elements(it is abbreviated F_(q~2)) is similar to those of Moshe and Hertz's which is the discrete Fourier transform(DFT) over a complex field.Thus,the results possibly...

Let p be a prime,q=2 p-1 be a Mersenne prime and N=2 p+1.A method is presented to compute the Mersenne transform(MT) of an N-point integers sequence and the inverse MT(IMT) of the MT of another N-point integers sequence by carrying out a single MT of an N-point complex integers sequence.This algorithm for the MT over the finite field with q~2 elements(it is abbreviated F_(q~2)) is similar to those of Moshe and Hertz's which is the discrete Fourier transform(DFT) over a complex field.Thus,the results possibly take advantage of a new algorithm for computing the cyclic convolutions of integer sequences,which can be applied to some digital signal analysis to reduce the computational complexity of convolutions.

设p是素数,q=2p-1是一个M ersenne素数,N=2p+1.证明了复数域上离散傅里叶变换(DFT)的Moshe和Hertz算法对有限域Fq2上的M ersenne变换(M ersenne变换简记为MT,其逆变换记为IMT)有类似的算法,即证明可通过计算一个N点复整数序列的MT,同时得出一个N点整数序列的MT和另一个N点整数序列的MT的IMT.故得到一个计算整数序列卷积的新算法,可有效减少计算量,能用于信号分析中的某些卷积计算.

 
图标索引 相关查询

 


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

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社