Abstract
We present a holography based optical architecture that computes Kronecker product of two given binary matrices in a single (configuration) step. We demonstrate the use of the holography capability to enlarge the input of size \(n\) into the size \(n^2\) in one step, in contrast to the traditional optical copying techniques that duplicate the input by a fixed constant factor in a single step.
Similar content being viewed by others
References
Anter A, Dolev S (2010) Optical solution for hard on average \(\sharp \)P-complete instances (using exponential space for solving instances of the permanent). Nat Comput 9(4):891–902
Ballani J, Grasedyck L (2013) A projection method to solve linear systems in tensor format. Numer Linear Algebra Appl 20:27–43
Davis DS (1995) Multiplexed imaging by means of optically generated Kronecker products: the basic concept. Appl Opt 34:1170–1176
Dolev S, Fitoussi H (2010) Masking traveling beams: optical solutions for NP-complete problems, trading space for time. Theor Comput Sci 411:837–853
Graham A (1981) Kronecker products and matrix calculus: with applications. Ellis Horwood Limited, Chichester
Hariharan P (1996) Optical holography: principles, techniques, and applications, 2nd edn, chap 7. Cambridge University Press, New York, p 116.
Tadonki C (2011) Large scale Kronecker product on supercomputers. In: Proceedings of the second workshop on architecture and multi-core applications. IEEE Computer Society, Washington DC, USA.
Van Loan CF (2000) The ubiquitous Kronecker product. J Comput Appl Math 123:85–100
Yariv A (1991) Optical electronics, 4th edn, chap 17. Saunders College Publishing, p. 611
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dolev, S., Fandina, N. & Rosen, J. Holographic parallel processor for calculating Kronecker product . Nat Comput 14, 433–436 (2015). https://doi.org/10.1007/s11047-014-9442-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-014-9442-9