skip to main content


Search for: All records

Creators/Authors contains: "Zhu, Zheyuan"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract Solving linear systems, often accomplished by iterative algorithms, is a ubiquitous task in science and engineering. To accommodate the dynamic range and precision requirements, these iterative solvers are carried out on floating-point processing units, which are not efficient in handling large-scale matrix multiplications and inversions. Low-precision, fixed-point digital or analog processors consume only a fraction of the energy per operation than their floating-point counterparts, yet their current usages exclude iterative solvers due to the cumulative computational errors arising from fixed-point arithmetic. In this work, we show that for a simple iterative algorithm, such as Richardson iteration, using a fixed-point processor can provide the same convergence rate and achieve solutions beyond its native precision when combined with residual iteration. These results indicate that power-efficient computing platforms consisting of analog computing devices can be used to solve a broad range of problems without compromising the speed or precision. 
    more » « less
    Free, publicly-accessible full text available December 1, 2024
  2. Photonic computing has potential advantages in speed and energy consumption yet is subject to inaccuracy due to the limited equivalent bitwidth of the analog signal. In this Letter, we demonstrate a configurable, fixed-point coherent photonic iterative solver for numerical eigenvalue problems using shifted inverse iteration. The photonic primitive can accommodate arbitrarily sized sparse matrix–vector multiplication and is deployed to solve eigenmodes in a photonic waveguide structure. The photonic iterative eigensolver does not accumulate errors from each iteration, providing a path toward implementing scientific computing applications on photonic primitives.

     
    more » « less
  3. Computational imaging systems with embedded processing have potential advantages in power consumption, computing speed, and cost. However, common processors in embedded vision systems have limited computing capacity and low level of parallelism. The widely used iterative algorithms for image reconstruction rely on floating-point processors to ensure calculation precision, which require more computing resources than fixed-point processors. Here we present a regularized Landweber fixed-point iterative solver for image reconstruction, implemented on a field programmable gated array (FPGA). Compared with floating-point embedded uniprocessors, iterative solvers implemented on the fixed-point FPGA gain 1 to 2 orders of magnitude acceleration, while achieving the same reconstruction accuracy in comparable number of effective iterations. Specifically, we have demonstrated the proposed fixed-point iterative solver in fiber borescope image reconstruction, successfully correcting the artifacts introduced by the lenses and fiber bundle.

     
    more » « less
  4. We propose a coherent multi-dimensional (wavelength, spatial mode, polarization, etc.) photonic tensor accelerator capable of matrix-vector, matrix-matrix, and batch matrix multiplications in a single clock cycle. A proof-of-concept 2x2 matrix-matrix multiplication at 25GBd with 4.67 bit precision was experimentally demonstrated. 
    more » « less
  5. Mode-group multiplexing (MGM) can increase the capacity of short-reach few-mode optical fiber communication links while avoiding complex digital signal processing. In this paper, we present the design and experimental demonstration of a novel mode-group demultiplexer (MG DeMux) using Fabry-Perot (FP) thin-film filters (TFFs). The MG DeMux supports low-crosstalk mode-group demultiplexing, with degeneracies commensurate with those of graded-index (GRIN) multimode fibers. We experimentally demonstrate this functionality by using a commercial six-cavity TFF that was intended for 100 GHz channel spaced wavelength-division multiplexing (WDM) system.

     
    more » « less
  6. Abstract

    Accurate characterization of an attosecond pulse from streaking trace is an indispensable step in studying the ultrafast electron dynamics on the attosecond scale. Conventional attosecond pulse retrieval methods face two major challenges: the ability to incorporate a complete physics model of the streaking process, and the ability to model the uncertainty of pulse reconstruction in the presence of noise. Here we propose a pulse retrieval method based on conditional variational generative network (CVGN) that can address both demands. Instead of learning the inverse mapping from a streaking trace to a pulse profile, the CVGN models the distribution of the pulse profile conditioned on a given streaking trace measurement, and is thus capable of assessing the uncertainty of the retrieved pulses. This capability is highly desirable for low-photon level measurement, which is typical in attosecond streaking experiments in the water window X-ray range. In addition, the proposed scheme incorporates a refined physics model that considers the Coulomb-laser coupling and photoelectron angular distribution in streaking trace generation. CVGN pulse retrievals under various simulated noise levels and experimental measurement have been demonstrated. The results showed high pulse reconstruction consistency for streaking traces when peak signal-to-noise ratio (SNR) exceeds 6, which could serve as a reference for future learning-based attosecond pulse retrieval.

     
    more » « less