A Hardware Implementation of a Unit for Geometric Algebra Operations With Parallel Memory Arrays (Abstract Only)

Gerardo Soria García, Adrian Pedroza de la Cruz, S. Ortega Cisneros, J. J. Raygoza Panduro, Eduardo Bayro Corrochano
{"title":"A Hardware Implementation of a Unit for Geometric Algebra Operations With Parallel Memory Arrays (Abstract Only)","authors":"Gerardo Soria García, Adrian Pedroza de la Cruz, S. Ortega Cisneros, J. J. Raygoza Panduro, Eduardo Bayro Corrochano","doi":"10.1145/2684746.2689132","DOIUrl":null,"url":null,"abstract":"Geometric algebra (GA) is a powerful and versatile mathematical tool which helps to intuitively express and manipulate complex geometric relationships. It has recently been used in engineering problems such computer graphics, machine vision, robotics, among others. The problem with GA in its numeric version is that it requires many arithmetic operations, and the length of the input vectors is unknown until runtime in a generic architecture operating over homogeneous elements. Few works in hardware architectures for GA were developed to improve the performance in GA applications. In this work, a hardware architecture of a unit for GA operations (geometric product) for FPGA is presented. The main contribution of this work is the use of parallel memory arrays with access conflict avoidance for dealing with the issue of unknown length of input/output vectors, the intention is to reduce memory wasted when storing the input and output vectors. In this first stage of the project, we have implemented only a single access function (fixed-length) in the memory array in order to test the core of geometric product. In future works we will implement a full set of access functions with different lengths and shapes. In this work, only the simulations are presented; in the future, we will also present the experimental results","PeriodicalId":388546,"journal":{"name":"Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2684746.2689132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Geometric algebra (GA) is a powerful and versatile mathematical tool which helps to intuitively express and manipulate complex geometric relationships. It has recently been used in engineering problems such computer graphics, machine vision, robotics, among others. The problem with GA in its numeric version is that it requires many arithmetic operations, and the length of the input vectors is unknown until runtime in a generic architecture operating over homogeneous elements. Few works in hardware architectures for GA were developed to improve the performance in GA applications. In this work, a hardware architecture of a unit for GA operations (geometric product) for FPGA is presented. The main contribution of this work is the use of parallel memory arrays with access conflict avoidance for dealing with the issue of unknown length of input/output vectors, the intention is to reduce memory wasted when storing the input and output vectors. In this first stage of the project, we have implemented only a single access function (fixed-length) in the memory array in order to test the core of geometric product. In future works we will implement a full set of access functions with different lengths and shapes. In this work, only the simulations are presented; in the future, we will also present the experimental results
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于并行存储阵列的几何代数运算单元的硬件实现(仅摘要)
几何代数是一种功能强大、用途广泛的数学工具,可以直观地表达和处理复杂的几何关系。它最近被用于工程问题,如计算机图形学、机器视觉、机器人等。数字版本的遗传算法的问题在于,它需要许多算术运算,并且输入向量的长度直到运行时在操作同质元素的通用架构中是未知的。在遗传算法的硬件体系结构方面,很少有人研究如何提高遗传算法的性能。本文提出了一种用于FPGA的遗传运算(几何积)单元的硬件结构。这项工作的主要贡献是使用具有访问冲突避免的并行存储器阵列来处理未知长度的输入/输出向量的问题,其目的是减少存储输入和输出向量时浪费的内存。在项目的第一阶段,为了测试几何产品的核心,我们只在存储器阵列中实现了一个单一的访问函数(固定长度)。在未来的作品中,我们将实现一套不同长度和形状的完整访问函数。在这项工作中,只给出了模拟;在未来,我们还将介绍实验结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
REPROC: A Dynamically Reconfigurable Architecture for Symmetric Cryptography (Abstract Only) Session details: Technical Session 1: Computer-aided Design Energy-Efficient Discrete Signal Processing with Field Programmable Analog Arrays (FPAAs) Energy and Memory Efficient Mapping of Bitonic Sorting on FPGA Impact of Memory Architecture on FPGA Energy Consumption
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1