Abstract
Using a novel genetic algorithm (GA) with a Lamarckian search we optimize the polygonal layout of a new type of multiplexed computer-generated hologram (MCGH) with polygonal apertures. A period ofthe MCGH is divided into cells, and the cell is further divided into polygonal apertures according to a polygonal layout, which is to be optimized. Among an ensemble of 1.21 x 10(24) possible polygonal layouts, we take a population of 102 solutions, which are coded as chromosomes of bits, and find the optimal solution with our GA. We introduce rank-based selection with cumulative normal distribution fitness, double crossover, exponentially decreasing mutation probability and Lamarckian downhill search with a small number of offspring chromosomes into our GA, which shows a rapid convergence to the global minimum of the cost function. In a second step of optimization the phase distributions over the subholograms in the MCGH are determined with our iterative subhologram design algorithm. Our MCGH designs show large-sie reconstructed images with high diffraction efficiency and low reconstruction error.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
