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

图标索引 历史查询
 

旋转序列
相关语句
  rotation sequence
     A new type VLSI transform microprocessor using the fast rotator as the arithmetic core is presented. It can very efficiently perform various orthogonal transforms by Givens rotation sequence with the best robustness.
     该文提出了一类新型的以快速旋转器为运算核的VLSI变换微处理器,它能以最佳的数值稳定性高效地完成用Givens旋转序列实现的各种正交变换。
短句来源
     After analiying the connecting characteristics of decimal image, we get a structure unite model for "hit and miss"transmission, and give the diagram of rotation sequence method based on the structure unite.
     该方法通过仔细分析数字图像的连通性,提出了一套完整的“中与丢”变换的结构基元,并给出了基于该基元的旋转序列细化法的实现流程。
短句来源
  “旋转序列”译为未确定词的双语例句
     Fastly decomposing different orthogonal transforms to Givens rotation sequences and then effectively performing the computation by using the fast rotation hardware make the number of the “shift addition” needed by the whole transform greatly decreased so that its computation complexity is lowered down and comparable with the traditional “multiplication additioan arithmetic”. It can be used in a new VLSI microprocessor to realize various orthogonal transforms with the fast rotator as the core.
     它们可以结合使用,将各种正交变换快速分解为Givens旋转序列,用快速旋转器硬件有效地进行运算,使整个变换所需“右移—加”运算次数大大减少,以至于其计算复杂度与传统的“乘加算术”可比,从而可以用在一类新型的以快速旋转器为内核实现各种正交变换的VLSI微处理器中。
短句来源
  相似匹配句对
     p sequences or R.
     p序列和R.
短句来源
     Research for Vibration Series Prediction of Rotating Machinery
     旋转机械振动序列预测
短句来源
     Rotational Sweep Rotating Zone Plate Sequence
     旋转扫频转动序列波带图
短句来源
     It generates 2~~(s·g(n,s)) M sequences of span.
     g(n,s)个n级M序列
短句来源
     ELLIPTIC REVOLUTION
     椭圆旋转
短句来源
查询“旋转序列”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  rotation sequence
This pattern commonly occurs since corn is planted following peanut in the predominant crop rotation sequence in this area.
      
Regardless of the presence of rye, significant accumulation of RSN occurred following corn in the rotation sequence, while RSN declined following soybean.
      
The first, use of long crop rotation sequence, may result in only marginal control.
      
Developing a job rotation plan requires determining the set of jobs to be included in the rotation, the rotation sequence, and the proper length of the rotation interval.
      
At each iteration, surface voxels are projected into sequential image pairs from a rotation sequence.
      
更多          


High computing complexity greatly limits application of “rotation arithmetic” in digital signal processing. The methods for the fast realization of Givens rotation are presented. Compared with the traditional Cordic algorithm, they greatly decrease the number of “shift addition” so that it makes “rotation arithmetic” realistic to replace “multiplication addition arithmetic”. The very large scale integration (VLSI) architectures of various fast rotations are also given. Based on them, a four stage pipeline...

High computing complexity greatly limits application of “rotation arithmetic” in digital signal processing. The methods for the fast realization of Givens rotation are presented. Compared with the traditional Cordic algorithm, they greatly decrease the number of “shift addition” so that it makes “rotation arithmetic” realistic to replace “multiplication addition arithmetic”. The very large scale integration (VLSI) architectures of various fast rotations are also given. Based on them, a four stage pipeline fast rotator is developed to realize the rotation of the arbitrary angle. It can be used as the core for the new VLSI DSP to perform various orthogonal transform by Givens rotation sequences. Its computing complexity can be comparable with the traditional “multipication addition arithmetic”.

计算复杂度太高极大地限制了“旋转算术”在数字信号处理领域中的应用,该文提出了快速实现Givens旋转运算的方法,与传统的Cordic算法相比较,使“移位—加”运算的次数大大减少,从而为用“旋转算术”代替传统的“乘加算术”创造了条件。进一步给出了各种快速旋转运算的超大规模集成电路(VLSI)硬件结构,在此基础上发展出一种能够实现任意角度旋转的四级流水线快速旋转器,它可以在一类新型的使用Givens旋转序列实现各种正交变换的处理器中做为核心运算单元,使得其计算复杂度与传统的“乘加算术”可比。

Orthogonal transforms are traditionally realized by “multiplication addition arithmetic” with less robustness. The fast decomposition algorithms and computation architectures for various orthogonal transforms including lapped orthogonal transform based on the new “fast rotation arithmetic” are proposed, which can be used combinationally. Fastly decomposing different orthogonal transforms to Givens rotation sequences and then effectively performing the computation by using the fast rotation hardware make the...

Orthogonal transforms are traditionally realized by “multiplication addition arithmetic” with less robustness. The fast decomposition algorithms and computation architectures for various orthogonal transforms including lapped orthogonal transform based on the new “fast rotation arithmetic” are proposed, which can be used combinationally. Fastly decomposing different orthogonal transforms to Givens rotation sequences and then effectively performing the computation by using the fast rotation hardware make the number of the “shift addition” needed by the whole transform greatly decreased so that its computation complexity is lowered down and comparable with the traditional “multiplication additioan arithmetic”. It can be used in a new VLSI microprocessor to realize various orthogonal transforms with the fast rotator as the core. A compiler coresponding to both the algorithms and the microprocessor is developed for generation of highly effective control codes.

传统上都采用“乘加算术”实现正交变换,鲁棒性差。该文基于新的快速“旋转算术”,提出了各种正交变换包括重叠正交变换快速分解算法与运算结构。它们可以结合使用,将各种正交变换快速分解为Givens旋转序列,用快速旋转器硬件有效地进行运算,使整个变换所需“右移—加”运算次数大大减少,以至于其计算复杂度与传统的“乘加算术”可比,从而可以用在一类新型的以快速旋转器为内核实现各种正交变换的VLSI微处理器中。为此还按照所提出的算法开发了一个与微处理器相应的、能够产生高效控制代码的编译器。

Current VLSI digital signal processors perform various orthogonal tramsforms using multiplier accumularor as the arithmetic unit, which often suffers from robustness problem. A new type VLSI transform microprocessor using the fast rotator as the arithmetic core is presented. It can very efficiently perform various orthogonal transforms by Givens rotation sequence with the best robustness. Based on image processing application a PTEE experimental chip is designed, which includes three parallel transform engines....

Current VLSI digital signal processors perform various orthogonal tramsforms using multiplier accumularor as the arithmetic unit, which often suffers from robustness problem. A new type VLSI transform microprocessor using the fast rotator as the arithmetic core is presented. It can very efficiently perform various orthogonal transforms by Givens rotation sequence with the best robustness. Based on image processing application a PTEE experimental chip is designed, which includes three parallel transform engines. It is fabricated by using 0.8μm double layer metal CMOS technology. The functionality of the chip tested is correct. The chip can work at the frequency of 40MHz with high throughput of 960million shift addition operations. PTEE chip is flexible, programmable and extendable. Equipped with the chip, a compiler is developed to generate the instruction sequence according to the format of PTFE control signals for the frequently used orthogonal transforms in the image processing.

当前的VLSI数字信号处理器都以乘加器为运算单元,去完成各种正交变换,常会遇到稳定性问题。该文提出了一类新型的以快速旋转器为运算核的VLSI变换微处理器,它能以最佳的数值稳定性高效地完成用Givens旋转序列实现的各种正交变换。结合图像处理应用的实际需要,设计了包含三个并行的TFE变换机的PTFE试验芯片,采用0.8μm双层金属CMOS工艺制造,测试表明,功能正确,工作频率达到40MHz,具有高达960×106s-1移加的运算吞吐率。芯片具有高度的灵活性、可编程性和可扩展性。与该芯片配合,开发了一个针对图像处理中常用变换、按照PTFE硬件控制信号格式产生指令序列的编译器。

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

 


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

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