{"title":"微处理器中定点乘法算法的权衡","authors":"A. Davies","doi":"10.1049/IJ-CDT.1979.0023","DOIUrl":null,"url":null,"abstract":"Multiplication algorithms which are appropriate for 8-bit microprocessors are discussed, particularly within the context of signal-processing needs, where minimisation of execution time is important. The trade-offs which exist between minimum memory, minimum execution time and minimum cost are discussed in detail, and specific examples based on the Z80 processor are included to provide a quantitative comparison of the alternatives.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Trade-offs in fixed-point multiplication algorithms for microprocesors\",\"authors\":\"A. Davies\",\"doi\":\"10.1049/IJ-CDT.1979.0023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiplication algorithms which are appropriate for 8-bit microprocessors are discussed, particularly within the context of signal-processing needs, where minimisation of execution time is important. The trade-offs which exist between minimum memory, minimum execution time and minimum cost are discussed in detail, and specific examples based on the Z80 processor are included to provide a quantitative comparison of the alternatives.\",\"PeriodicalId\":344610,\"journal\":{\"name\":\"Iee Journal on Computers and Digital Techniques\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1979-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iee Journal on Computers and Digital Techniques\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1049/IJ-CDT.1979.0023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iee Journal on Computers and Digital Techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/IJ-CDT.1979.0023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Trade-offs in fixed-point multiplication algorithms for microprocesors
Multiplication algorithms which are appropriate for 8-bit microprocessors are discussed, particularly within the context of signal-processing needs, where minimisation of execution time is important. The trade-offs which exist between minimum memory, minimum execution time and minimum cost are discussed in detail, and specific examples based on the Z80 processor are included to provide a quantitative comparison of the alternatives.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
