首页> 美国政府科技报告 >Fast Convolution by Number Theoretic Transforms.
【24h】

Fast Convolution by Number Theoretic Transforms.

机译:数论变换的快速卷积。

获取原文

摘要

The concepts involved in the efficient computation of discrete convolution by number theoretic techniques were reviewed using key portions of the applicable technical literature. First, discrete convolution and its computation by direct and fast Fourier transform (FFT) techniques are reviewed. The discrete Fourier transform (DFT), defined in a finite field or ring, and applicable number theory concepts, are used to describe the number theoretic transform (NTT) and its circular convolution properties. The considerations in the selection of a modulus that results in efficient modular arithmetic on a binary computing device are discussed. The limitations in transform length are presented, along with means for overcoming this restriction. The complex number theoretic transform (CNT) defined in both a finite field and ring is described. Finally, the computational efficiency of NTT vs FFT convolution is discussed.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号