首页> 外文期刊>電子情報通信学会技術研究報告. 衛星通信. Satellite Telecommunications >Memory allocation method for indirect addressing with ±2{sup}n auto-modification; Access graph; Address allocation; Indirect memory addressing; DSP compiler
【24h】

Memory allocation method for indirect addressing with ±2{sup}n auto-modification; Access graph; Address allocation; Indirect memory addressing; DSP compiler

机译:具有±2 {sup} n自动修改的间接寻址的内存分配方法;访问图;地址分配;间接内存寻址; DSP编译器

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

摘要

Indirect addressing with ±2{sup}n auto-modification is assumed, and a memory allocation method based on graph representation is proposed. Although such an indirect addressing can be easily implemented on hardware, careful allocation of program variables is required in order to reduce overhead codes. For such indirect addressing, besides its simple hardware implementation, careful allocation of program variables is required in order to avoid overhead codes. In this article, the method removes unrealizable constraints over memory allocation from a given graph representation. The proposed method in this article, first, examines memory allocation constraints, and removes constraints unrealizable by ±2{sup}n auto-modification, so that less overhead codes are required at these unrealizable constraints. Finally according to the derived overhead-free constraint graph, the method assigns a memory address to every program variables. The proposed method is applied to a DSP compiler, and its effectiveness is shown by codes generated for several examples.
机译:假定采用±2 {sup} n自动修改的间接寻址,并提出了一种基于图形表示的内存分配方法。尽管可以在硬件上轻松实现这种间接寻址,但是需要仔细分配程序变量,以减少开销代码。对于这种间接寻址,除了其简单的硬件实现之外,还需要仔细分配程序变量,以避免产生开销代码。在本文中,该方法从给定的图形表示中消除了对内存分配的无法实现的约束。本文中提出的方法首先检查内存分配约束,并删除±2 {sup} n自动修改无法实现的约束,以便在这些无法实现的约束下需要更少的开销代码。最后,根据导出的免开销约束图,该方法为每个程序变量分配一个内存地址。将该方法应用于DSP编译器,并通过为几个示例生成的代码来证明其有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号