Related Experiment Video
Updated: Jul 3, 2025

03:31
Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
Published on: December 15, 2023
537
Parallel edge extraction operators on chip speed up photonic convolutional neural networks
Optics Letters
|February 15, 2024
Summary
This study introduces a silicon photonics chip for faster image processing in neural networks. It achieves four times the speed for edge extraction using parallel operations, boosting recognition accuracy.
Area of Science:
- Photonics
- Silicon Photonics
- Optical Computing
Background:
- Convolutional neural networks (CNNs) are crucial for image recognition.
- Efficient hardware for CNNs, especially for convolution operations, is needed.
- Photonic computing offers potential for high-speed, low-power computation.
Purpose of the Study:
- To develop a photonic multiplexing architecture for parallel edge extraction in CNNs.
- To enhance the speed and accuracy of image processing using silicon photonics.
- To demonstrate a novel approach for accelerating photonic convolution operations.
Main Methods:
- Experimental establishment of a 3x3 cross-shaped micro-ring resonator (MRR) array-based photonic multiplexing architecture.
- Implementation of parallel edge extraction operations using the MRR array.
- Evaluation of computability, energy efficiency, and accuracy on image datasets like CIFAR-10.
Main Results:
- Achieved a convolutional calculation speed up to four times faster by extracting four feature maps simultaneously.
- Demonstrated a maximum computability of 0.742 TOPS at an energy cost of 48.6 mW.
- Improved imaging recognition accuracy by 6.2% (reaching 78.7%) for the CIFAR-10 dataset using parallel edge extraction operators.
Conclusions:
- The proposed MRR array architecture enables highly scalable and efficient parallel edge extraction.
- This work presents a novel approach to significantly boost photonic computing speed for CNNs.
- The system demonstrates enhanced performance for image recognition tasks compared to universal operators.
Related Concept Videos
Convolution Properties II
199
The important convolution properties include width, area, differentiation, and integration properties.
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
199
Convolution Properties I
150
Convolution computations can be simplified by utilizing their inherent properties.
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
150
Convolution: Math, Graphics, and Discrete Signals
257
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
257
Gradient and Del Operator
2.6K
In mathematics and physics, the gradient and del operator are fundamental concepts used to describe the behavior of functions and fields in space. The gradient is a mathematical operator that gives both the magnitude and direction of the maximum spatial rate of change. Consider a person standing on a mountain. The slope of the mountain at any given point is not defined unless it is quantified in a particular direction. For this reason, a "directional derivative" is defined, which is a vector...
2.6K
Vector Operations
1.3K
Vectors are physical quantities that have both magnitude and direction. The vector operations include addition, subtraction, and scalar multiplication.
A vector multiplied by a scalar value is called scalar multiplication. The result obtained is a new vector with a different magnitude. If the scalar is positive, the direction of the vector remains the same, but if it is negative, the direction of the vector is reversed. For example, the product of the mass and velocity yields the momentum.
A vector multiplied by a scalar value is called scalar multiplication. The result obtained is a new vector with a different magnitude. If the scalar is positive, the direction of the vector remains the same, but if it is negative, the direction of the vector is reversed. For example, the product of the mass and velocity yields the momentum.
1.3K
Fast Fourier Transform
324
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
324

