首页> 外文期刊>IEEE Transactions on Robotics and Automation >Residue arithmetic VLSI array architecture for manipulator pseudo-inverse Jacobian computation
【24h】

Residue arithmetic VLSI array architecture for manipulator pseudo-inverse Jacobian computation

机译:机械手伪逆雅可比计算的残差算术VLSI阵列架构

获取原文
获取原文并翻译 | 示例

摘要

The authors present the design of a two-level macro-pipelined VLSI array architecture for the real-time computation of the exact solution of the manipulator pseudo-inverse Jacobian using the Decell algorithm in the residue arithmetic system. The first-level arrays are asynchronous data-driven, wave-front-like arrays and perform matrix multiplication, matrix diagonal addition, and trace computations in the Decel algorithm. A pool of the first-level arrays is then configured into a second-level macro-pipeline with outputs of one array acting as inputs to another array in the pipe. The pipelined time of the proposed two-level pipelined array architecture has a computational order of 0(n+2p-1), which is the same computational complexity order as that of the evaluation of a matrix product in an ordinary wavefront array. For a 12 degree-of-freedom redundant robot, a pipelined time of 6.975 mu s is achievable with current VLSI custom design technology.
机译:作者提出了一种两级宏流水线式VLSI阵列架构,用于在残差算术系统中使用Decell算法实时计算机械手伪逆Jacobian精确解。一级数组是异步数据驱动的类似波阵面的数组,并在Decel算法中执行矩阵乘法,矩阵对角线加法和跟踪计算。然后,将第一级阵列的池配置为第二级宏管道,其中一个阵列的输出充当管道中另一个阵列的输入。所提出的两级流水线阵列体系结构的流水线时间的计算顺序为0(n + 2p-1),与普通波前阵列中矩阵乘积的计算复杂度顺序相同。对于12个自由度的冗余机器人,使用当前的VLSI定制设计技术可达到6.975μs的流水线时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号