{"title":"基于RSD的ECC处理器的Karatsuba乘法器","authors":"Hamad Marzouqi, M. Al-Qutayri, K. Salah","doi":"10.1109/IDT.2013.6727142","DOIUrl":null,"url":null,"abstract":"This paper proposes a 256 Redundant Signed Digits hardware multiplier based on Karatsuba that is suitable for prime field ECC processors. Redundant representation is essential for prime field ECC processors as the basis for carry free arithmetic. The proposed multiplier works by applying Karatsuba method at two levels where three recursively constructed blocks are used to perform large integer multiplication iteratively. Different design alternatives are presented and implemented in Xilinx Virtex-5 FPGA. A pipelined multiplier with a recursive blocks of size 64 digits can perform one full 256 RSD digits multiplication within 1.08μs, operating at maximum frequency of 61.91 MHz.","PeriodicalId":446826,"journal":{"name":"2013 8th IEEE Design and Test Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"RSD based Karatsuba multiplier for ECC processors\",\"authors\":\"Hamad Marzouqi, M. Al-Qutayri, K. Salah\",\"doi\":\"10.1109/IDT.2013.6727142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a 256 Redundant Signed Digits hardware multiplier based on Karatsuba that is suitable for prime field ECC processors. Redundant representation is essential for prime field ECC processors as the basis for carry free arithmetic. The proposed multiplier works by applying Karatsuba method at two levels where three recursively constructed blocks are used to perform large integer multiplication iteratively. Different design alternatives are presented and implemented in Xilinx Virtex-5 FPGA. A pipelined multiplier with a recursive blocks of size 64 digits can perform one full 256 RSD digits multiplication within 1.08μs, operating at maximum frequency of 61.91 MHz.\",\"PeriodicalId\":446826,\"journal\":{\"name\":\"2013 8th IEEE Design and Test Symposium\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 8th IEEE Design and Test Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IDT.2013.6727142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th IEEE Design and Test Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDT.2013.6727142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes a 256 Redundant Signed Digits hardware multiplier based on Karatsuba that is suitable for prime field ECC processors. Redundant representation is essential for prime field ECC processors as the basis for carry free arithmetic. The proposed multiplier works by applying Karatsuba method at two levels where three recursively constructed blocks are used to perform large integer multiplication iteratively. Different design alternatives are presented and implemented in Xilinx Virtex-5 FPGA. A pipelined multiplier with a recursive blocks of size 64 digits can perform one full 256 RSD digits multiplication within 1.08μs, operating at maximum frequency of 61.91 MHz.