Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Keyword
Articles 1 - 4 of 4
Full-Text Articles in Systems and Communications
Volume Holographic Recording And Readout For 90-Deg Geometry, Partha P. Banerjee, Monish Ranjan Chatterjee, Nickolai Kukhtarev, Tatiana Kukhtareva
Volume Holographic Recording And Readout For 90-Deg Geometry, Partha P. Banerjee, Monish Ranjan Chatterjee, Nickolai Kukhtarev, Tatiana Kukhtareva
Electrical and Computer Engineering Faculty Publications
When a prerecorded cross-beam hologram is reconstructed (so-called edge-lit readout) with a uniform plane wave and a point source, the resulting exact solutions reveal Bessel-function-type diffracted beam profiles, which are fundamentally modified under weak propagational diffraction. The case of a profiled beam readout with propagational diffraction may be analyzed using a transfer function approach based on 2-D Laplace transforms. In a second series of investigations, dynamic readout from a cross-beam volume hologram recorded with two orthogonal uniform plane waves is considered for various dependences of the refractive index modulation with intensity. Typically, refractive index profiles that are proportional to the …
Volume Holographic Optical Elements, Ching-Cherng Sun, Partha P. Banerjee
Volume Holographic Optical Elements, Ching-Cherng Sun, Partha P. Banerjee
Electrical and Computer Engineering Faculty Publications
The final two papers are concerned with the analysis of novel holograms. Banerjee et al. investigate holographic recording and reconstruction for edge-lit holograms recorded in a 90-degree geometry. Various cases of recording and readout that incorporate propagational diffraction have been modeled. It is shown that the 90-degree geometry can result in beam shaping, as evidenced through preliminary experimental results with photorefractive lithium niobate. Nguyen et al. propose a new approach for designing computer-generated holograms. An artificial neural network is used to initiate the genetic algorithm so that the high computation cost of genetic algorithms for synthesizing holograms is significantly reduced …
A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
Electrical & Computer Engineering Faculty Research
We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.
Comparative Analysis Of Bragg Fibers, Shangping Guo, Sacharia Albin, Robert S. Rogowski
Comparative Analysis Of Bragg Fibers, Shangping Guo, Sacharia Albin, Robert S. Rogowski
Electrical & Computer Engineering Faculty Publications
In this paper, we compare three analysis methods for Bragg fibers, viz. the transfer matrix method, the asymptotic method and the Galerkin method. We also show that with minor modifications, the transfer matrix method is able to calculate exactly the leakage loss of Bragg fibers due to a finite number of H/L layers. This approach is more straightforward than the commonly used Chew’s method. It is shown that the asymptotic approximation condition should be satisfied in order to get accurate results. The TE and TM modes, and the band gap structures are analyzed using Galerkin method.