Computational time is a crucial task in Computer Generated Holograms. The large amount of data which is usually computed is very difficult to be stored and managed. Today, standard workstations are unable to reach the performances needed for real time CGH (performances of advanced workstations are lower than 50 Mflops).
All numerical methods and algorithms for Computer Generated Holograms require an important amount of computational time as well as a large amount of storing capacity of computer periferical devices. This is a consequence of extensive use of numerical fast transforms (like: FFT, Walsh...) and advanced coding (like: Lohmann, Lee, Tarasov...).It has been demonstrated that for CGH, all of these algorithms are well suited to massive parallel computers since at least 1 GFlop is needed.
JRC has large experience and expertise in the areas of parallel computing applications (SUPERNODE and CONCERTO CS1 programming, ray tracing, radiosity, CGH) and in the domain of holographic synthesis (optical transforms, fast transforms including Fourier, Hadamard, Walsh-Paley, Haar, Wavelet transforms). Recent domains of applications include multi-speckle holograms of coherently illuminated objects using an iterative fast-transform phase retrieval algorithm to study spatial correlation of laser-speckle intensity measurements.
Image & Hologram. Dynamic compression
Fast Transforms librairies
For suggestions about this page, please contact: guillermo.ciscar@jrc.it