Jun Shiomi, T. Ishihara, H. Onodera, A. Shinya, M. Notomi
{"title":"一种利用近似二进制对数的集成光学并行乘法器用于光速数据处理","authors":"Jun Shiomi, T. Ishihara, H. Onodera, A. Shinya, M. Notomi","doi":"10.1109/ICRC.2018.8638614","DOIUrl":null,"url":null,"abstract":"The emergence of nanophotonic devices has enabled to design integrated optical circuits for ultra-high speed on-chip signal processing. This paper proposes an optical implementation of an approximate parallel multiplier for two n-bit integers. The key to ultra-high speed processing is to reduce the number of OptoElectric (OE) converters on a critical path since the OE converters dominantly determine the operating speed of the multiplier. For any n, the proposed approximate multiplier has only three OE converters on a critical path with a deterministic error (11% at the worst case). On the other hand, the number of the counterparts of the conventional parallel multiplier increases as $n$ increases, which implies that the proposed multiplier with large $n$ exhibits much better operating speed than the conventional optical parallel multiplier. Numerical evaluation for n = 16 shows that the proposed multiplier exhibits a 106 ps latency which is 49% less than that of the conventional optical multiplier.","PeriodicalId":169413,"journal":{"name":"2018 IEEE International Conference on Rebooting Computing (ICRC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Integrated Optical Parallel Multiplier Exploiting Approximate Binary Logarithms Towards Light Speed Data Processing\",\"authors\":\"Jun Shiomi, T. Ishihara, H. Onodera, A. Shinya, M. Notomi\",\"doi\":\"10.1109/ICRC.2018.8638614\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The emergence of nanophotonic devices has enabled to design integrated optical circuits for ultra-high speed on-chip signal processing. This paper proposes an optical implementation of an approximate parallel multiplier for two n-bit integers. The key to ultra-high speed processing is to reduce the number of OptoElectric (OE) converters on a critical path since the OE converters dominantly determine the operating speed of the multiplier. For any n, the proposed approximate multiplier has only three OE converters on a critical path with a deterministic error (11% at the worst case). On the other hand, the number of the counterparts of the conventional parallel multiplier increases as $n$ increases, which implies that the proposed multiplier with large $n$ exhibits much better operating speed than the conventional optical parallel multiplier. Numerical evaluation for n = 16 shows that the proposed multiplier exhibits a 106 ps latency which is 49% less than that of the conventional optical multiplier.\",\"PeriodicalId\":169413,\"journal\":{\"name\":\"2018 IEEE International Conference on Rebooting Computing (ICRC)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Rebooting Computing (ICRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRC.2018.8638614\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Rebooting Computing (ICRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRC.2018.8638614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Integrated Optical Parallel Multiplier Exploiting Approximate Binary Logarithms Towards Light Speed Data Processing
The emergence of nanophotonic devices has enabled to design integrated optical circuits for ultra-high speed on-chip signal processing. This paper proposes an optical implementation of an approximate parallel multiplier for two n-bit integers. The key to ultra-high speed processing is to reduce the number of OptoElectric (OE) converters on a critical path since the OE converters dominantly determine the operating speed of the multiplier. For any n, the proposed approximate multiplier has only three OE converters on a critical path with a deterministic error (11% at the worst case). On the other hand, the number of the counterparts of the conventional parallel multiplier increases as $n$ increases, which implies that the proposed multiplier with large $n$ exhibits much better operating speed than the conventional optical parallel multiplier. Numerical evaluation for n = 16 shows that the proposed multiplier exhibits a 106 ps latency which is 49% less than that of the conventional optical multiplier.