Free-Space Interconnect for Optical Switch and Analogue Neural Network

In this paper, the architecture of a vector-matrix multiplier (MVM) is simulated. The optical design can be made compact by the use of GRIN lenses for the optical fan-in. The intended application area was in storage area networks (SANs) but the concept can be applied to a neural network. © 2011 Allerton Press, Inc.

20 Gb/s QPSK transmission using an electro-optically modulated vertical-cavity surface-emitting laser

20 Gb/s QPSK transmission over 100 m of OM3 fibre using an EOM VCSEL under QPSK modulation is reported. Bit-error-ratio measurements are carried out to express the quality of the transmission scheme. © 2011 Optical Society of America.

Monolithic electro-optically modulated VCSEL suitable for radio over fibre applications to 20 GHz

An integrated EOM VCSELs is shown to offer high linearity (92dB/Hz2/3 at 6GHz) and by extrapolation ~90dB/Hz2/3 up to 20GHz. Successful modulation with IEEE 802.11g signals is demonstrated at 6GHz with a 12dB dynamic range. © OSA/OFC/NFOEC 2011.

Low cost optical access networks using 20 Gchip/s electronic CMDA

This paper describes electronically processed CDMA techniques which allow Gb/s data rates for each user in passive optical networks. We will present recent progress including a 16 chip Walsh-code system operating at 18 Gchip/s supporting up to 16 users. © 2009 IEEE.

20 Gb/s mode-group-division multiplexing employing Hermite-Gaussian launches over worst-case multimode fiber links

For the first time, mode group division multiplexing is achieved in a multimode fiber link using a 2-D Hermite-Gaussian mode launch. 20 Gb/s error-free transmission is achieved over a 250 m worst-case OM1 multimode fiber link. © OSA 2014.

Nanometer scale thermal drift of 4Gbit/s uncooled laser for tight-channel-spacing low-cost WDM

A 4Gbit/s directly modulated DBR laser is demonstrated with nanometre scale thermal tuning over an extended 20-70°C temperature range. >40dB side mode suppression over the entire temperature range is achieved. © 2005 Optical Society of America.

Computer generated hologram with geometric occlusion using GPU-accelerated depth buffer rasterization for three-dimensional display

We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.

Computer generated hologram from point cloud using graphics processor

Computer generated holography is an extremely demanding and complex task when it comes to providing realistic reconstructions with full parallax, occlusion, and shadowing. We present an algorithm designed for data-parallel computing on modern graphics processing units to alleviate the computational burden. We apply Gaussian interpolation to create a continuous surface representation from discrete input object points. The algorithm maintains a potential occluder list for each individual hologram plane sample to keep the number of visibility tests to a minimum.We experimented with two approximations that simplify and accelerate occlusion computation. It is observed that letting several neighboring hologramplane samples share visibility information on object points leads to significantly faster computation without causing noticeable artifacts in the reconstructed images. Computing a reduced sample set via nonuniform sampling is also found to be an effective acceleration technique. © 2009 Optical Society of America.