一类产生最小表示商的二元除法

IRE Trans. Electron. Comput. Pub Date : 1962-12-01 DOI:10.1109/TEC.1962.5219460

G. Metze

{"title":"一类产生最小表示商的二元除法","authors":"G. Metze","doi":"10.1109/TEC.1962.5219460","DOIUrl":null,"url":null,"abstract":"Binary division methods employing a redundant quotient representation in which quotient digits assume the values 0, 1, or ?1 have been analyzed previously. The method in which partial remainders are always normalized is of particular interest; it yields quotients represented with a minimal number of nonzero digits for all divisors D in the range ??|D|??. This method is extended to yield minimally represented quotients for all normalized divisors.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1962-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"A Class of Binary Divisions Yielding Minimally Represented Quotients\",\"authors\":\"G. Metze\",\"doi\":\"10.1109/TEC.1962.5219460\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binary division methods employing a redundant quotient representation in which quotient digits assume the values 0, 1, or ?1 have been analyzed previously. The method in which partial remainders are always normalized is of particular interest; it yields quotients represented with a minimal number of nonzero digits for all divisors D in the range ??|D|??. This method is extended to yield minimally represented quotients for all normalized divisors.\",\"PeriodicalId\":177496,\"journal\":{\"name\":\"IRE Trans. Electron. Comput.\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1962-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IRE Trans. Electron. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TEC.1962.5219460\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IRE Trans. Electron. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEC.1962.5219460","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

采用冗余商表示的二进制除法，其中商数字假设值为0、1或?1，前面已经分析过。部分余数总是归一化的方法是特别有趣的;它产生的商在??|D|??范围内的所有除数D用最小数目的非零数字表示。将该方法推广到所有归一化除数的最小表示商。

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

查看原文本刊更多论文

A Class of Binary Divisions Yielding Minimally Represented Quotients

Binary division methods employing a redundant quotient representation in which quotient digits assume the values 0, 1, or ?1 have been analyzed previously. The method in which partial remainders are always normalized is of particular interest; it yields quotients represented with a minimal number of nonzero digits for all divisors D in the range ??|D|??. This method is extended to yield minimally represented quotients for all normalized divisors.

求助全文

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

来源期刊

IRE Trans. Electron. Comput.

自引率

0.00%

发文量