{"title":"一种从多精度二进制数到任意变模残数的前向转换器的实现方法","authors":"Koki Shirakawa, Takashi Uemura, Y. Iguchi","doi":"10.1109/ISMVL.2011.48","DOIUrl":null,"url":null,"abstract":"This paper presents a realization method of forward converters from multiple-precision binary numbers to residue numbers. Single-precision forward converters use conversion tables realized with memories. However, multiple-precision, e.g. more than 1024 bits, forward converters require huge memories. This paper proposes the circuit calculating a value in the conversion table in every clock cycle. Experimental results show that the proposed method can quadruplicate the dynamic range.","PeriodicalId":234611,"journal":{"name":"2011 41st IEEE International Symposium on Multiple-Valued Logic","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Realization Method of Forward Converters from Multiple-Precision Binary Numbers to Residue Numbers with Arbitrary Mutable Modulus\",\"authors\":\"Koki Shirakawa, Takashi Uemura, Y. Iguchi\",\"doi\":\"10.1109/ISMVL.2011.48\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a realization method of forward converters from multiple-precision binary numbers to residue numbers. Single-precision forward converters use conversion tables realized with memories. However, multiple-precision, e.g. more than 1024 bits, forward converters require huge memories. This paper proposes the circuit calculating a value in the conversion table in every clock cycle. Experimental results show that the proposed method can quadruplicate the dynamic range.\",\"PeriodicalId\":234611,\"journal\":{\"name\":\"2011 41st IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 41st IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2011.48\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 41st IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2011.48","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Realization Method of Forward Converters from Multiple-Precision Binary Numbers to Residue Numbers with Arbitrary Mutable Modulus
This paper presents a realization method of forward converters from multiple-precision binary numbers to residue numbers. Single-precision forward converters use conversion tables realized with memories. However, multiple-precision, e.g. more than 1024 bits, forward converters require huge memories. This paper proposes the circuit calculating a value in the conversion table in every clock cycle. Experimental results show that the proposed method can quadruplicate the dynamic range.