Parallel and sequential optical computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5172 LNCS, Issue , 2008, Pages 70-86

  Woods, Damien ^a   Naughton, Thomas J ^b,c  

^a UNIVERSITY OF SEVILLE   (Spain)

^b NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^c UNIVERSITY OF OULU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS SPACE MACHINE; DYNAMIC RANGE; MATRIX-VECTOR MULTIPLIERS; OPTICAL ARCHITECTURES; OPTICAL COMPUTERS; OPTICAL COMPUTING; OPTICAL MODELS; POLYLOGARITHMIC TIME; POLYNOMIAL-TIME; SEQUENTIAL COMPUTATIONS; SPATIAL RESOLUTION; UNORDERED SEARCH;

COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; IMAGE RESOLUTION; OPTICAL FILTERS; PATTERN RECOGNITION; POLYNOMIAL APPROXIMATION;

OPTICAL DATA PROCESSING;

EID: 70349865312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85673-3_6     Document Type: Conference Paper

References (35)

1. Arsenault, H.H., Sheng, Y.: An Introduction to Optics in Computers. Tutorial Texts in Optical Engineering, vol.TT8. SPIE Press, Bellingham (1992)
2. Balćazar, J.L., D́iaz, J., Gabarŕo, J.: Structural complexity II. EATCS Monographs on Theoretical Computer Science, vol.22. Springer, Berlin (1988)
3. Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM Journal on Computing 26(5), 1510-1523 (1997)
4. Bertoni, A., Mauri, G., Sabadini, N.: A characterization of the class of functions computable in polynomial time on random access machines. In: STOC, Milwaukee, Wisconsin, May 1981, pp. 168-176. ACM Press, New York (1981)
5. Bracewell, R.N.: The Fourier transform and its applications, 2nd edn. Electrical and electronic engineering series. McGraw-Hill, New York (1978)
6. Caulfield, H.J.: Space-time complexity in optical computing. Multidimensional Systems and Signal Processing 2(4), 373-378 (1991); Special issue on optical signal processing
7. Chandra, A.K., Stockmeyer, L.J.: Alternation. In: 17th annual symposium on Foundations of Computer Science, Houston, Texas, October 1976, pp. 98-108. IEEE, Los Alamitos (1976)
8. Feitelson, D.G.: Optical Computing: A survey for computer scientists. MIT Press, Cambridge (1988)
9. Goldschlager, L.M.: Synchronous parallel computation. PhD thesis, University of Toronto, Computer Science Department (December 1977)
10. Goldschlager, L.M.: A universal interconnection pattern for parallel computers. Journal of the ACM 29(4), 1073-1086 (1982)
11. Goodman, J.W.: Introduction to Fourier optics, 2nd edn. McGraw-Hill, New York (1996)
12. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation: Pcompleteness theory. Oxford University Press, Oxford (1995)
13. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc. 28th Annual ACM Symposium on Theory of Computing, May 1996, pp. 212-219 (1996)
14. Karp, R.M., Ramachandran, V.: Parallel algorithms for shared memory machines. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 17, vol.A, pp. 869-941. Elsevier, Amsterdam (1990)
15. Lenslet Labs. Enlight256. White paper report, Lenslet Ltd., 6 Galgalei Haplada St, Herzelia Pituach, 46733 Israel (November 2003)
16. Naughton, T., Javadpour, Z., Keating, J., Klíma, M., Rott, J.: General-purpose acousto-optic connectionist processor. Optical Engineering 38(7), 1170-1177 (1999)
17. Naughton, T.J.: Continuous-space model of computation is Turing universal. In: Bains, S., Irakliotis, L.J. (eds.) Critical Technologies for the Future of Computing, San Diego, California, August 2000. Proceedings of SPIE, vol.4109, pp. 121-128 (2000)
18. Naughton, T.J.: A model of computation for Fourier optical processors. In: Lessard, R.A., Galstian, T. (eds.) Optics in Computing 2000, Quebec, Canada, June 2000. Proc. SPIE, vol.4089, pp. 24-34 (2000)
19. Naughton, T.J., Woods, D.: Optical computing. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and System Science. Springer, Heidelberg (to appear)
20. Naughton, T.J., Woods, D.: On the computational power of a continuous-space optical model of computation. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.2055, pp. 288-299. Springer, Heidelberg (2001)
21. Parberry, I.: Parallel complexity theory. Wiley, Chichester (1987)
22. Pratt, V.R., Stockmeyer, L.J.: A characterisation of the power of vector machines. Journal of Computer and Systems Sciences 12, 198-221 (1976)
23. Reif, J.H., Tyagi, A.: Efficient parallel algorithms for optical computing with the Discrete Fourier transform (DFT) primitive. Applied Optics 36(29), 7327-7340 (1997)
24. Scḧonhage, A.: On the power of random access machines. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol.71, pp. 520-529. Springer, Heidelberg (1979)
25. Shaked, N.T., Messika, S., Dolev, S., Rosen, J.: Optical solution for bounded NPcomplete problems. Applied Optics 46(5), 711-724 (2007)
26. Shaked, N.T., Simon, G., Tabib, T., Mesika, S., Dolev, S., Rosen, J.: Optical processor for solving the traveling salesman problem (TSP). In: Javidi, B., Psaltis, D., Caulfield, H.J. (eds.) Proc. of SPIE, Optical Information Systems IV, August 2006, vol.63110G (2006)
27. Shaked, N.T., Tabib, T., Simon, G., Messika, S., Dolev, S., Rosen, J.: Optical binary-matrix synthesis for solving bounded NP-complete combinatorical problems. Optical Engineering 46(10), 108201-1-108201-108211 (2007)
28. van Emde Boas, P.: Machine models and simulations. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 1, vol.A, Elsevier, Amsterdam (1990)
29. Van der Lugt, A.: Optical Signal Processing. Wiley, New York (1992)
30. Woods, D.: Computational complexity of an optical model of computation. PhD thesis, National University of Ireland, Maynooth (2005)
31. Woods, D.: Upper bounds on the computational power of an optical model of computation. In: Deng, X., Du, D. (eds.) ISAAC 2005. LNCS, vol.3827, pp. 777- 788. Springer, Heidelberg (2005)
32. Woods, D.: Optical computing and computational complexity. In: Calude, C.S., Dinneen, M.J., P¢aun, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol.4135, pp. 27-40. Springer, Heidelberg (2006)
33. Woods, D., Gibson, J.P.: Complexity of continuous space machine operations. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.3526, pp. 540- 551. Springer, Heidelberg (2005)
34. Woods, D., Gibson, J.P.: Lower bounds on the computational power of an optical model of computation. In: Calude, C.S., Dinneen, M.J., P¢aun, G., Ṕerez-Jímenez, M.J., Rozenberg, G. (eds.) UC 2005. LNCS, vol.3699, pp. 237-250. Springer, Heidelberg (2005) (Pubitemid 41491507)
35. Woods, D., Naughton, T.J.: An optical model of computation. Theoretical Computer Science 334(1-3), 227-258 (2005)