Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Fast Fourier Transform01:10

Fast Fourier Transform

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)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

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...
Convolution Properties II01:17

Convolution Properties II

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...
Convolution Properties I01:20

Convolution Properties I

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:
Parallel Processing01:20

Parallel Processing

The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Dual regulatory roles and mechanisms of Gamma delta T cells in organ fibrosis.

Tissue & cell·2026
Same author

Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication.

G3 (Bethesda, Md.)·2026
Same author

Latent accelerated diffusion-based deformation estimation for real-time volumetric imaging.

Physics in medicine and biology·2026
Same author

A WEb-Accessible comprehensiVE platform for automatic vestibular schwannoma segmentation and longitudinal volumetric tracking.

Neuro-oncology advances·2026
Same author

The impact of intelligent manufacturing strategy on enterprise labor productivity: evidence from a quasi-natural experiment in China.

Frontiers in artificial intelligence·2026
Same author

Qilin Pills protect against diminished ovarian reserve by suppressing pathological overactivation of PINK1/Parkin-mediated mitophagy in granulosa cells.

Journal of ethnopharmacology·2026

Related Experiment Video

Updated: Jun 2, 2026

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)
07:19

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)

Published on: June 28, 2017

Ultrafast convolution/superposition using tabulated and exponential kernels on GPU.

Quan Chen1, Mingli Chen, Weiguo Lu

  • 1TomoTherapy Inc., 1240 Deming Way, Madison, Wisconsin 53717, USA.

Medical Physics
|April 28, 2011
PubMed
Summary
This summary is machine-generated.

A new graphic processing unit (GPU) algorithm dramatically accelerates collapsed-cone convolution/superposition (CCCS) dose calculation for intensity-modulated radiation therapy (IMRT). This ultrafast method achieves 1000-3000x speedup with high accuracy, enabling time-sensitive applications.

Related Experiment Videos

Last Updated: Jun 2, 2026

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)
07:19

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)

Published on: June 28, 2017

Area of Science:

  • Medical Physics
  • Radiotherapy
  • Computational Science

Background:

  • Intensity-modulated radiation therapy (IMRT) relies heavily on collapsed-cone convolution/superposition (CCCS) for dose calculation.
  • Existing CCCS algorithms can be computationally intensive, limiting their application in time-sensitive scenarios.
  • Advancements in hardware, such as graphic processing units (GPUs), offer potential for significant acceleration.

Purpose of the Study:

  • To develop and present a novel algorithm for computing CCCS dose on modern GPUs.
  • To leverage GPU architecture for enhanced computational efficiency in radiation dose calculation.

Main Methods:

  • Implemented a novel TERMA calculation with no write-conflicts and linear complexity for GPU.
  • Utilized both tabulated and exponential cumulative-cumulative kernels (CCKs) within the CCCS algorithm.
  • Optimized memory access patterns specific to GPU architecture, achieving over tenfold performance increase.

Main Results:

  • The GPU implementation with tabulated kernels is 2-3 times faster than other reported GPU methods.
  • Significant speedups observed for CCCS on GPU compared to single-core CPU implementations.
  • Speedups reached up to 70x with tabulated CCKs and 90x with exponential CCKs.

Conclusions:

  • The GPU algorithm using exponential CCKs is 1000-3000 times faster than optimized CPU implementations.
  • Achieved high accuracy with dose differences within 0.5% and 0.5 mm compared to CPU methods.
  • This ultrafast CCCS algorithm facilitates accurate dose calculation for time-sensitive radiotherapy applications.