您现在的位置: 首页> 研究主题> 整数运算

整数运算

整数运算的相关文献在1979年到2022年内共计73篇,主要集中在自动化技术、计算机技术、无线电电子学、电信技术、数学 等领域,其中期刊论文63篇、会议论文2篇、专利文献9191篇;相关期刊40种,包括系统工程与电子技术、沈阳工业大学学报、中国图象图形学报等; 相关会议2种,包括全国基础教育未来教育家论坛(2015)、四川省电子学会、山东电子学会第十七届电子测量与仪器学术年会等;整数运算的相关文献由120位作者贡献,包括牛连强、刘勇奎、E·奥兹图科等。

整数运算—发文量

期刊论文>

论文:63 占比:0.68%

会议论文>

论文:2 占比:0.02%

专利文献>

论文:9191 占比:99.30%

总计:9256篇

整数运算—发文趋势图

整数运算

-研究学者

  • 牛连强
  • 刘勇奎
  • E·奥兹图科
  • G·M·沃尔里齐
  • J·D·吉尔福德
  • K·S·雅普
  • M·G·迪克森
  • S·M·格尔雷
  • V·戈帕尔
  • W·K·费格哈利
  • 期刊论文
  • 会议论文
  • 专利文献

搜索

排序:

年份

    • 慕振亮
    • 摘要: 在整数运算教学中,加强计算教学的结构化和联结性,形成完整计算教学脉络,对培养学生的运算能力,形成良好的运算习惯具有重要作用。一、理解基本概念,明晰知识关联在计算教学中,基本的概念有数位、计数单位和进率。而计数单位又是整个基本概念中最基本的内容,掌握计数单位对于计数来说是非常重要的。
    • 相军
    • 摘要: 我们知道,整数运算中的运算律和运算性质在小数运算中同样适用。因此,在小数计算中要根据数字和运算符号的特点,灵活进行运算。例1:计算:(1)0.125×0.25×64×0.5;(2)3.75×4.8+62.5×0.48。思路分析:(1)中的0.125和8、0.25和4、0.5和2分别是一对好朋友,而64中就蕴含这3个数,64=8×4×2,因此运用乘法结合律就能使计算简便了。(2)题是中间加两边乘,符合乘法分配律的样式,但加号两边的公因数不同,分别是4.8和0.48,而我们可以根据积不变的规律进行适当的变形,使公因数相同,然后问题就容易解决了。
    • 摘要: 通过使用新的前端架构、改良浮点与整数运算单元以及采用7nm工艺生产,IPC提升了15%的Zen 2显然是近年来AMD最具威力的处理器架构。该架构不仅让定位主流的第三代锐龙处理器熠熠生辉,在2019年末,AMD还将它应用到了面向HEDT平台的AMD第三代锐龙Threadripper处理器上,并展示出了令对手难以企及的性能表现。32核心、64线程设计的锐龙Threadripper 3970X在SiSoftware Sandra中的算术性能达到1.1TOPS,是目前英特尔消费级处理器旗舰酷睿i9-10980XE的1.88倍;在《鲁大师》处理器性能测试中的分数突破70万分,单单一项处理器性能的分数就让很多电脑的整机测试分数望尘莫及。
    • 摘要: 经过漫长的等待,现在我们终于在AMD主流AM4平台上,迎来了其旗舰产品—AMD锐龙93950X。与今年下半年发布的第三代锐龙处理器:锐龙93900X、锐龙73700X一样,它也采用了Zen2架构,通过使用新的前端架构,改良浮点与整数运算单元,使得处理器的IPC提升了15%。同时第三代锐龙处理器还加入了新的缓存指令,使用了较前代处理器翻倍容量的三级缓存,并支持带宽较PCIe 3.0翻倍的PCIe 4.0技术。此外第三代锐龙处理器对高频内存的支持能力也大幅提升,可以轻松支持DDR43733甚至更高频率的内存。
    • 陈正康; 张会生; 李立欣; 朱梦
    • 摘要: Low-density parity-check (LDPC)codes become popular for its near Shannon limit performance and relatively simple decoding structure.The min-sum decoding algorithm of LDPC codes is studied detailedly. And the variable message and check message of each iteration become integers through a variety of methods quantifying the initial message.Then the integer arithmetic based on the min-sum decoding algorithm is real-ized.Finally,these algorithms are compared and analyzed.Simulation results show that all variables of the min-sum decoding algorithm are fixed length integers after quantification.It is easy for hardware implementation. And the decoding time is greatly shortened under the condition that the decoding performance degrades less than the sum-product (SP)decoding.The greater the average mutual information of the quantitative method is,the better the quantized level will be.The min-sum decoding algorithm of the maximum average mutual information quantization has the best performance.The maximum average mutual information quantization is the best quan-titative method to keep the source information as much as possible,and it does not increase the complexity of de-coding.%低密度奇偶校验码(low-density parity-check codes,LDPC)以其接近香农极限的性能和相对简单的译码结构得到信道编码界的广泛关注。对 LDPC 码的最小和算法进行了深入地研究,通过多种方法量化译码时的初始消息,最终使得每次迭代的校验消息与变量消息都变为整数,实现了基于整数运算的最小和译码算法,并进行了对比分析。仿真表明,量化后的最小和算法中的所有变量都用固定长度的整数表示,因而便于硬件实现,在其译码性能比和积译码(sum-product decoding,SP)性能下降不大的情况下大大提高了译码速度;平均互信息越大的量化方法,其量化分层电平也越佳;最大平均互信息量化下的最小和译码算法性能最好,最大平均互信息量化是一类能最大可能获得信源信息条件下的最佳量化方法,且不增加译码复杂度。
    • 牛连强; 陈欣; 宋超; 李兆明
    • 摘要: 为了改善椭圆基本生成算法的效率和消除算法中存在的错误边界像素问题,提出了一种浮点数消除技术和标准椭圆的生成算法.与现存算法采用中间量进行浮点数先期消除方法不同,该算法直接利用曲线上相邻两点所满足的表达式的差值构造包含残差的递推关系,再通过最近准则和1/2处的残差将其转换为整数形式的决策参数.分析和实验结果表明,该算法消除了递推关系中每步迭代时的常数项,比目前普遍采用的中点椭圆算法具有更高的效率,且有着与中点法—致的简单性.该算法不会产生特殊情况的错误边界像素,由于残差与亮度具有对应关系,可以实现整数形式的反走样绘制.
    • 牛连强; 张胜男; 钟玲
    • 摘要: In order to improve the raster conversion speed of circles, the characteristics of raster circles were analyzed, and a hybrid run-length algorithm for rapid circle drawing, mainly based on double-stepping in combination with detail mode analysis, was proposed. The double-stepping was adopted in the mode with larger horizontal run-length for raster circles. In addition, the mixed single and double stepping was adopted for the area with sharp curvature change as well as the run-length mode in the 45?direction. Furthermore, each horizontal run-length was controlled and output at one time. The characteristics of raster circles and the advantages of both multi-step algorithm and run-length algorithm were effectively included. Therefore, only about 2. 86 basic operations are needed for generating one point, and the I/O number substantially reduces. The experimental results show that the circle-drawing speed of the proposed algorithm is significantly superior to that of the existing other algorithms. The average circle-drawing speed of the proposed algorithm is twice more than that of the classical Bresenham algorithm. Moreover, the proposed algorithm can be extended to the drawing of ellipse and other conic curves.%为了提高圆弧的光栅转换速度,分析了光栅圆弧的特性,提出了一种以2点步进为主、结合细节模式分析的快速绘制圆弧的混合行程算法.该算法在光栅圆弧水平行程较长的模式采用2点步进,在曲率变化剧烈的区域和45°方向的行程模式采用单点和2点混合步进,并控制所有水平行程一次性输出,有效利用了光栅圆弧的特性和多步法及行程算法的优势,使得平均每生成一点仅消耗约2.86次基本运算,大幅度减少了I/O次数.实验和分析结果表明,新算法的圆弧速度明显优于现有其他算法,其平均圆弧绘制速度较经典Brcscnham算法提高1倍以上,且可推广到椭圆或其他二次曲线的绘制中.
    • 冯海文; 牛连强; 刘晓明; 付博文
    • 摘要: 光线跟踪算法是提高图形真实感的一种主要技术,为了提高光线跟踪算法的速度,提出了一种快速的三维直线均匀体素遍历算法.该算法借鉴光栅直线行程扫描转换的思想,依据直线斜率定义决策参数,利用迭代计算决策参数控制每一步的光线走向.与单点迭代算法不同的是,一条直线依据斜率被自适应地拆分成由多点组成的m-遍历,而决策参数仅需要针对m-遍历甚至由多个m-遍历组成的周期进行计算,从而有效地减少了运算量.理论分析和实验表明,该算法的运行速度比现存的最快单步算法提高约56%,大幅度提高了光线跟踪的效率,且仅使用简单的整数运算即可实现.%Ray tracing algorithm is a major technique for enhancing the realistic sense of graphs. In order to improve the speed of ray tracing algorithm, a fast uniform voxel traversing algorithm along 3D line was proposed. The basic idea for scanning conversion of raster line stroke was referenced in the proposed algorithm. The decision parameter was defined according to line slope, and the decision parameter obtained with iteration calculation was used to control the ray movement direction at each step. Different from the single-point iteration algorithm, a line was adaptively divided into serveral m-traversings composed of multiple points according to the slope. The decision parameter could be calculated only aiming at m-traversings and even periods composed of multiple m-traversings. And thus, the calculation amount gets effectively decreased. The theoretical and experimental results show that the running speed of the proposed algorithm increases nearly by 56% compared with the existing fastest single-point algorithm and the efficiency of ray tracing gets greatly enhanced, which can be realized only with simple integer calculation.
    • 马汇淼; 马林华; 张嵩; 刘东斌; 冯斌
    • 摘要: 对高斯信道下低密度奇偶校验码(Low-Density Parity-Check Codes)的传统译码算法进行深入研究,提出了基于整数运算的LDPC码改进最小和译码算法.相对于归一化最小和算法(Normalized Min-Sum),该算法根据每次迭代的判决情况增加了一个校正因子,使译码性能得到提高,经过整数量化后易于硬件实现.仿真结果表明,该算法在2.1 dB时性能优于LLR BP算法,且运算复杂度较低,译码速率较快.
    • 牛连强; 张胜男; 钟玲
    • 摘要: Gray-conversion is a time-consuming operation for drawing anti-aliased straight lines or curves. In order to improve the efficiency of drawing anti-aliased straight lines, we propose a new anti-aliasing algorithm based on a two-pixel model. Different from other anti-aliasing algorithms, a technique which controls iterations by grey values directly rather than distances is proposed. Calculations about distances between pixels and real line and distance-grey conversion are abandoned , but accurate grey values rather than estimated ones can be obtained. The analyses prove that for one step only 4 ~ 5 integer operations are invoked in this algorithm, and the drawing speed is faster than other methods. Furthermore, this algorithm can be constructed with the simplicity similar to basic scan conversion algorithms.%灰度转换是整数反走样直线和曲线绘制算法中较为耗时的操作.为了提高反走样直线的绘制效率,提出了一种直接利用灰度循环控制生成反走样直线的纯整数算法.该算法采用两点反走样模式,根据对灰度值的分解、每次步进时的像素及其灰度值直接利用灰度增量控制产生,从而避免了候选点与真实直线之间的距离计算,以及由距离到灰度的转换.分析表明,该算法每次步进仅需要4~5次整数基本运算,其效率较现有整数反走样直线生成算法有大幅度提高,且具有与基本直线生成算法相似的简单性.
  • 查看更多

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号