| DC Field | Value | Language |
|---|
| dc.contributor.author | Gorodecky, D. | - |
| dc.contributor.author | Bibilo, P. | - |
| dc.date.accessioned | 2020-12-28T06:53:30Z | - |
| dc.date.available | 2020-12-28T06:53:30Z | - |
| dc.date.issued | 2020 | - |
| dc.identifier.citation | Gorodecky, D. Constant Multiplication Based on Boolean Minimization / D. Gorodecky, P. Bibilo // Boolean Problems: proceedings of the 14th International workshop, Bremen, September, 24–25, 2020 / University of Bremen. – Bremen, 2020. – 15 p. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/42162 | - |
| dc.description.abstract | This contribution studies constant multiplication X ·C and X · C (mod P), where constant C achieves 2263 bits and variable X varies up to 10 bits. We aim to develop an efficient approach to design constant multiplication for FPGA and ASIC. The proposed technique demonstrates up to 2 times advantage in performance and up to 5 times advantage in area costs under direct multiplication on FPGA, up to 7 times in performance in custom library on ASIC. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.publisher | University of Bremen | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | constant multiplication | ru_RU |
| dc.subject | boolean minimization | ru_RU |
| dc.title | Constant Multiplication Based on Boolean Minimization | ru_RU |
| dc.type | Статья | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
