OSA's Digital Library

Applied Optics

Applied Optics

APPLICATIONS-CENTERED RESEARCH IN OPTICS

  • Vol. 31, Iss. 14 — May. 10, 1992
  • pp: 2430–2437

Delay synchronization in time-of-flight optical systems

Jonathan P. Pratt and Vincent P. Heuring  »View Author Affiliations


Applied Optics, Vol. 31, Issue 14, pp. 2430-2437 (1992)
http://dx.doi.org/10.1364/AO.31.002430


View Full Text Article

Enhanced HTML    Acrobat PDF (1089 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Time-of-flight optical computer designs must implicitly or explicitly allow for the synchronization of all signals at all interaction points. This paper details algorithms for calculating delays required for synchronization of optical systems, as well as the sensitivity of these systems to variations in delays from their nominal values. These algorithms, which are applied to graph models of systems, form the basis for an optical systems design methodology in which the designer develops architectures with lumped delays and idealized zero-delay devices. When applied to the system designs, the algorithms provide estimates of actual delay distributions and sensitivities.

© 1992 Optical Society of America

History
Original Manuscript: August 21, 1990
Published: May 10, 1992

Citation
Jonathan P. Pratt and Vincent P. Heuring, "Delay synchronization in time-of-flight optical systems," Appl. Opt. 31, 2430-2437 (1992)
http://www.opticsinfobase.org/ao/abstract.cfm?URI=ao-31-14-2430


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. T. K. Sharpless, “Mercury delay lines as a memory unit,” in Proceedings of the International Symposium on Large-Scale Digital Calculating Machinery, 1947 [Ann. Comput. Lab. Harvard Univ. 14, 103–109 (1948)].
  2. P. D. Denyer, D. Renshaw, VLSI Signal Processing: A Bit-Serial Approach (Addison-Wesley, Reading, Mass., 1985).
  3. C. E. Leiserson, J. B. Saxe, “Optimizing synchronous systems,” J. VLSI Comput. Syst. 1, 41–67 (1983).
  4. C. E. Leiserson, J. B. Saxe, “A mixed-integer linear programming problem which is efficiently solvable,” J. Algorithms 9, 114–128 (1988). [CrossRef]
  5. A. Gibbons, Algorithmic Graph Theory (Cambridge University, New York, 1985).
  6. R. G. Busacker, T. L. Saaty, Finite Graphs and Networks (McGraw-Hill, New York, 1965).
  7. S. Danø, Linear Programming in Industry (Springer-Verlag, New York, 1974). [CrossRef]
  8. J. P. Pratt, “The Design of Bit-Serial Optical Systems,” Ph.D. dissertation (University of Colorado, Boulder, Colo., 1990; University Microfilms, Ann Arbor, Mich.).
  9. D. B. Sarrazin, H. F. Jordan, V. P. Heuring, “Fiber optic delay line memory,” Appl. Opt. 29, 627–637 (1990). [CrossRef] [PubMed]
  10. M. A. Plonus, Applied Electromagnetics (McGraw-Hill, New York, 1978).
  11. A. Papoulis, Probability, Random Variables, and Stochastic Processes (McGraw-Hill, New York, 1984).
  12. S. K. Korotky, G. Eisenstein, R. C. Alferness, L. L. Veselka, L. L. Buhl, G. T. Harvey, P. H. Read, “Fully connectorized high-speed Ti:LiNbO3 switch/modulator for time-division multiplexing and data encoding,” IEEE J. Lightwave Technol. LT-3, 1–6 (1985). [CrossRef]
  13. M. N. Islam, “Ultrafast all-optical logic gates based on soliton trapping in fibers,” Opt. Lett. 14, 1257–1259 (1989). [CrossRef] [PubMed]
  14. N. Christofides, Graph Theory (Academic, New York, 1975).

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited