复数和向量的新冗余表示

[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic Pub Date : 1991-06-26 DOI:10.1109/ARITH.1991.145526

J. Duprat, Yvan Herreros, Sylvanus Kla

{"title":"复数和向量的新冗余表示","authors":"J. Duprat, Yvan Herreros, Sylvanus Kla","doi":"10.1109/ARITH.1991.145526","DOIUrl":null,"url":null,"abstract":"A new redundant representation for complex numbers, called polygonal representation, is presented. This representation enables fast carry-free addition (in a way quite similar to the carry-free addition in signed-digits number systems), and is convenient for multiplication. In addition, the technique is extended to handle n-dimensional vectors.<<ETX>>","PeriodicalId":190650,"journal":{"name":"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"New redundant representations of complex numbers and vectors\",\"authors\":\"J. Duprat, Yvan Herreros, Sylvanus Kla\",\"doi\":\"10.1109/ARITH.1991.145526\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new redundant representation for complex numbers, called polygonal representation, is presented. This representation enables fast carry-free addition (in a way quite similar to the carry-free addition in signed-digits number systems), and is convenient for multiplication. In addition, the technique is extended to handle n-dimensional vectors.<<ETX>>\",\"PeriodicalId\":190650,\"journal\":{\"name\":\"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1991.145526\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1991.145526","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 23

摘要

提出了一种新的复数冗余表示法——多边形表示法。这种表示支持快速的无进位加法(在某种程度上与符号数字系统中的无进位加法非常相似)，并且便于乘法。此外，将该技术扩展到处理n维向量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

New redundant representations of complex numbers and vectors

A new redundant representation for complex numbers, called polygonal representation, is presented. This representation enables fast carry-free addition (in a way quite similar to the carry-free addition in signed-digits number systems), and is convenient for multiplication. In addition, the technique is extended to handle n-dimensional vectors.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic

自引率

0.00%

发文量

期刊最新文献

A redundant binary Euclidean GCD algorithm OCAPI: architecture of a VLSI coprocessor for the GCD and the extended GCD of large numbers Implementation and analysis of extended SLI operations Optimal purely systolic addition Shallow multiplication circuits