FLOATING–POINT ADDER IN DIGITAL PHOTONIC COMPUTING SYSTEMS
Abstract
Within the structural computation paradigm proposed by the authors, digital photonic computing systems are expected to employ sequential data processing, which allows for the minimization of operand duty cycle gaps when data is supplied from external memory or other electronic sources to the photonic device. This becomes feasible when the processing time per operand does not exceed the number of clock cycles corresponding to the operand’s bit width. Moreover, sequential digit–wise processing significantly reduces hardware costs associated with dataflow synchronization. The elimination of duty cycle gaps and reduction in structural overhead can substantially enhance the efficiency of digital photonic computing systems relative to their electronic counterparts. However, to enable photonic computational architectures capable of solving complex and computation–intensive problems in domains such as mathematical physics, linear algebra, neural network processing, and others, it is necessary to implement core arithmetic functions in floating–point format. Most of these functions are built around elementary integer addition. In binary systems with sequential processing in least–significant–digit–first order, integer adders are unable to begin producing results until all bits have been processed and carry propagation is complete, thereby doubling the operand duty cycle and increasing latency. To address these issues, this paper proposes the use of a quaternary signed–digit number representation with operands processed in most–significant–digit–first order. This representation enables immediate transmission of the most significant digits of the result to downstream processing units, without waiting for the completion of lower–order digit computation. This paper addresses the design of all components of the signed–digit floating–point adder: the exponent difference unit, the mantissa denormalization unit for the operand with the smaller exponent, the mantissa adder, the mantissa normalization unit for the result, and the exponent correction unit. Operational algorithms for these units are presented. The performance of the proposed signed–digit adder has been evaluated on a prototype implemented in a digital photonic logic framework on the reconfigurable “Terzius” computing platform. It is demonstrated that, due to the high clock frequency achievable by digital photonic computing devices, their performance can exceed that of microelectronic devices by nearly two orders of decimal scale.
References
1. Bérut Antoine. Information and Thermodynamics: Experimental Verification of Landauer’s Principle Linking Information and Thermodynamics. Available at: https://arxiv.org/pdf/1503.06537.pdf (accessed 28 October 2022).
2. 10 let do 10 nm: zakon Mura vse eshche rabotaet [10 years to 10 nm: Moore's Law still works], PCNews, 12.07.2008. Available at: http://pcnews.ru/news/10–channalweb–intel–pat–gelsinger–100–tsmc–45–2009–1965–33–1971–1978–1989–1997–25–2005–65–pentium–233904.html (accessed 28 October 2022).
3. Cerofolini C.F., Mascolo D. Hybrid Route From CMOS to Nano and Molecular Electronics, Nanotech-nology for electronic materials and devices. Springer Science+Business Media, LLC, 2007, pp. 1-65.
4. Stepanenko S.A. Fotonnyy komp'yuter: struktura i algoritmy, otsenki parametrov [Photonic computer: structure and algorithms, parameter estimates], Fotonika [Photonics], 2017, No. 7/67. DOI: 10.22184/1993–7296.2017.67.7.72.83.
5. Sorokin D.A., Levin I.I., Kasarkin A.V. Perspektivnaya arkhitektura tsifrovoy fotonnoy vy-chislitel'noy mashiny [Promising architecture of a digital photonic computing machine], Izvestiya YuFU. Tekhniches-kie nauki [Izvestiya SFedU. Engineering Sciences], 2022, No. 4 (2022), pp. 200-212. DOI 10.18522/2311–3103 2022.
6. Sorokin D.A., Kasarkin A.V., Podoprigora A.V. Elements of a Digital Photonic Computer, Supercompu-ting Frontiers and Innovations, 2023, Vol. 10, No. 2, pp. 62-76. DOI: https://doi.org/10.14529/jsfi230205.
7. Sorokin D.A., Levin I.I., Kasarkin A.V. Obzor modeley kommutatsionnykh podsistem tsifrovykh fotonnykh vychislitel'nykh ustroystv [Review of models of switching subsystems of digital photonic computing devices], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2024, No. 5 (2024), pp. 173-185. DOI 10.18522/2311–3103–2024–5–185–194.
8. Kalyaev A.V., Levin I.I. Modul'no-narashchivaemye mnogoprotsessornye sistemy so strukturno–protsedurnoy organizatsiey vychisleniy [Modularly scalable multiprocessor systems with structural-procedural organization of computations]. Moscow: Yanus–K, 2003, 380 p.
9. Sergeev A.M. Ob osobennostyakh predstavleniya chisel pri znakorazryadnom kodirovanii i vychislit-el'nyy eksperiment s nimi [On the features of number representation with sign-based coding and a com-putational experiment with them], Informatsionno-upravlyayushchie sistemy [Information and Control Systems], 2006, No. 3 (22), pp. 56-58.
10. Evstigneev V.G. Nedvoichnye komp'yuternye arifmetiki [Non-binary computer arithmetic], Elektronika i informatika, 2005: Mezhdunar. nauch.-tekhn. konf. [Electronics and Information Technology – 2005: International Scientific and Technical Conference]. Mscow: Angstrem, 2006, 774 p.
11. Orlov Dmitriy. Vliyanie oshibok okrugleniya na rezul'taty algoritmov vychislitel'noy geometrii [The influence of rounding errors on the results of computational geometry algorithms], Lektsiya 2 Problemy organizatsii vychisleniy. Natsional'nyy issledovatel'skiy universitet «MEI» Kafedra Vychislitel'nykh mashin, sistem i setey [Lecture 2. Problems of computing organization. National Research University "MPEI" Department of Computing Machines, Systems and Networks].
12. Kalyaev A.V. Mnogoprotsessornye sistemy s programmiruemoy arkhitekturoy [Multiprocessor systems with programmable architecture]. Moscow: Radio i svyaz', 1984, 240 p.
13. Kalyaev A.V., Levin I.I. Mnogoprotsessornye sistemy s perestraivaemoy arkhitekturoy: kontseptsii razvitiya i primeneniya [Multiprocessor systems with reconfigurable architecture: concepts of develop-ment and application], Nauka – proizvodstvu [Science – production], 1999, No. 11, pp. 11-19.
14. Amir Kaivani, Seokbum Ko. Floating–Point Butterfly Architecture Based on Binary Signed–Digit Rep-resentation, IEEE transactions on very large scale integration (VLSI) systems, March 2016, Vol. 24, No. 3.
15. Kung H.T. Harvard University. High–order–bit First Conversion for Signed–Digit Representations, Annual GOMACTech Conference. IEEE, 2021.
16. Arash Eghdamian, Azman Samsudin. An Improved Signed Digit Representation of Integers, Indian Journal of Science and Technology, October 2017, Vol 10 (39). DOI: 10.17485/ijst/2017/v10i39/119863. – ISSN (Print): 0974–684. – ISSN (Online): 0974–5645.
17. Andrew G Dempster, Malcolm David Macleod. Generation of Signed–Digit Representations for Integer Multiplication, Signal Processing Letters, IEEE September 2004. DOI: 10.1109/LSP.2004.831725.
18. UltraScale FPGA Product Tables and Product Selection Guide. Available at: https://docs.amd.com/v/u/en–US/ultrascale–fpga–product–selection–guide (accessed 18 June 2025).
19. Stepanenko S.A. Fotonnaya vychislitel'naya mashina. Printsipy realizatsii. Otsenki parametrov [Photonic computing machine. Implementation principles. Parameter estimates], Doklady Akademii nauk [Reports of the Academy of Sciences], 2017, Vol. 476, No. 4, pp. 389-394. DOI: 10.1134/S1064562417050234.
20. IEEE Standard for Floating–Point Arithmetic. Available at: https://ieeexplore.ieee.org/document/ 8766229 (accessed 18 June 2025).








