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

图标索引 历史查询
 

加法时间
相关语句
  “加法时间”译为未确定词的双语例句
     The image edge extraction on the basis of sequence Sobel gradient operator must move two mask S1 and S2 on every pixel of image and add 11 times,i. e. ,the Sobel operator requires addition 11×N2 times.
     串行Sobel梯度算子边缘检测算法需要将两个掩模S1和S2分别在图像的每个像素上移动,并在每个像素上进行11次加法运算,即需要11×N2次加法,时间复杂度为O(N2);
短句来源
     The multiplier is provided employed modified Booth algorithm(MBA) and Wallace Tree to reduce the number of partial product and to save the time cost for adding reduce to O(logN),finally CLA is used to get the result at higher speed.
     也采用Wallace树型结构的加法器,完成N个部分积需要O(logN)次加法时间; 再使用超前进位加法器得到最后乘积来进一步提高电路的运算速度。
短句来源
     The image edge extraction on the basis of sequence Sobel gradient operator must move two mask S1 and S2 on every pixel of image and add 11 times, i.e., the Sobel operator requires addition 11×N2 times. The time complexity is O (N2). In this paper, a decomposing model of Sobel operator is proposed, and a parallel algorithm of image edge extraction for Sobel decomposing model based on SIMD-MPP model is designed.
     串行Sobel梯度算子边缘检测算法需要将两个掩模S1和S2分别在图像的每个像素上移动,并在每个像素上进行11次加法运算,印需要11×N2次加法,时间复杂度为O(N2);
  相似匹配句对
     Time
     时间
短句来源
     Time is...
     时间
短句来源
     A Study of the Difference in Time of Pupils' Mental Arithmetic on Addition
     小学生加法口算时间的差异性研究
短句来源
     Additional Forecasting Model Combined Linear Regression and Time Series Model
     线性回归与时间序列加法预测模型
短句来源
查询“加法时间”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  add time
Archaeological and paleontological datasets are used in conservation to add time-depth to ecology.
      
A student may add a course or change a schedule only during the designated Drop/Add time period after classes have begun.
      
Creating and applying knowledge may merely add time and cost unless it produces something of distinct value to the marketplace or to the organization.
      
Establishing leak integrity requirements at a higher level than necessary will add time and cost to the leak testing procedures.
      
For inheritance graphs and call-graphs it is straightforward to add time-slice edges.
      
更多          


A regular carry look-ahead adder is presented in this paper. It gains very short delay proportional to logarithm of the bandwidth of the adder, regular architecture, simple logic and localized in-terconnectivity. SPICE simulation results show that for a 16-bit RCLA employing 2UUUUUUUUUm CMOS technology the addition time is 5.4ns in the worst case, and doubling the bandwidth only takes 1.2ns more delay. It can conveniently be implemented by various VLSI design styles, e. g. full-custom, cell based or gate array....

A regular carry look-ahead adder is presented in this paper. It gains very short delay proportional to logarithm of the bandwidth of the adder, regular architecture, simple logic and localized in-terconnectivity. SPICE simulation results show that for a 16-bit RCLA employing 2UUUUUUUUUm CMOS technology the addition time is 5.4ns in the worst case, and doubling the bandwidth only takes 1.2ns more delay. It can conveniently be implemented by various VLSI design styles, e. g. full-custom, cell based or gate array.

本文提出一种规整结构超前进位加法器,其加法时间与位数的对数成比例;而且其结构规整、逻辑简单、互连容易。SPICE模拟表明,采用2μm CMOS工艺的16位加法器最坏情况延时为5.4ns,并具有位数加倍延时仅增加1.2ns的扩展特性。它可以方便地用全定制或半定制等VLSI设计方法实现。

The transform function for geometric transform is approximated by polynomial. As the transform act on the image plane, the computation of the polynomial can be greatly simplified. A recursive algorithm is given in the paper. When realized by systolic architecture parallely, the algorithm needs only the time of one addition for each pixel. The hardware cost is only O(N), where N is the order of polynomial. A theoretical error analysis is proposed for the whole structure The hardware system for 2 order polynomial...

The transform function for geometric transform is approximated by polynomial. As the transform act on the image plane, the computation of the polynomial can be greatly simplified. A recursive algorithm is given in the paper. When realized by systolic architecture parallely, the algorithm needs only the time of one addition for each pixel. The hardware cost is only O(N), where N is the order of polynomial. A theoretical error analysis is proposed for the whole structure The hardware system for 2 order polynomial transform has been successfully realized. The system can work at the TV rate.

本文提出了一种用Systolic结构实现图像几何校正的方法,我们采用多项式来逼近几何校正的变换函数,由于坐标变换在图像平面上进行,多项式的计算可以大幅度简化。我们给出一个叠代算法,当用systolic结构来实现这个叠代算法时,计算一个象素点的坐标只需一次加法的时间,完成全部计算的加法器数目与多项式的阶次成线性关系。对运算的精度,我们作了理论上的分析。根据这个方法,我们用硬件实现了二阶多项式函数几何校正,几何校正的计算可以以接近实时的速度运行。

Effective recusive algorithms to compute the discrete Hartley transform (DHT)(or DWT-Ⅰ)and the fourth version of the discrete W transform(DWT- Ⅳ)are presented in this paper.The computational structures are fully concurrent and allow vectorized updating of DHT and DWT-Ⅳ.The total time requried for the updating could be as low as that of only three multiplications and three addi- tions,regardless of the number of points.The proposed algorithms are especially suited for on-line computations in real-time spectral...

Effective recusive algorithms to compute the discrete Hartley transform (DHT)(or DWT-Ⅰ)and the fourth version of the discrete W transform(DWT- Ⅳ)are presented in this paper.The computational structures are fully concurrent and allow vectorized updating of DHT and DWT-Ⅳ.The total time requried for the updating could be as low as that of only three multiplications and three addi- tions,regardless of the number of points.The proposed algorithms are especially suited for on-line computations in real-time spectral analysis.In addition,it will be pointed out at the end of this paper that there exist no similar effective algorithms for the other sinusoidal orthogonal transform(e.g DCTs and DSTs).

给出了计算离散 Har(?)ley 变换(DHT 或 DWT-1)和第四类离散 W 变换(DWT-Ⅳ)的新型有效递归算法.新算法的运算结构是全并行的并可实现 DHT 和DWT-Ⅳ的矢量更新.不论变换维数是多少,矢量更新的总耗时都仅相当于作三次加法的时间.新算法特别适宜于联机实时谱分析.此外文末还指出对其它正弦型正交变换(例如:DCT 和 DST 等)不存在类似的有效算法.

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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