High-resolution spatial-response measurements of optical nano-antennas in the visible

A few years ago, some of the authors of the paper demonstrated the resonance of optical antennas in the visible frequencies. The results of that paper were obtained using experimental techniques that were primarily developed for the measurement of antenna-coupled detectors in the infrared. In the present paper, we show the results of spatial-response mapping obtained by using a dedicated measurement station for the characterization of optical antennas in the visible. At the same time, the bottleneck in the spatial responsivity calculation represented by the beam characterization has been approached from a different perspective. The proposed technique uses a collection of knife edge measurements in order to avoid the use of any model of the laser beam irradiance. By taking all this into account we present the spatial responsivity of optical antennas measured with high spatial resolution in the visible.

HW implementation of an execution manager for reconfigurable systems

Reconfigurable HW can be used to build a hardware multitasking system where tasks can be assigned to the reconfigurable HW at run-time according to the requirements of the running applications. Normally the execution in this kind of systems is controlled by an embedded processor. In these systems tasks are frequently represented as subtask graphs, where a subtask is the basic scheduling unit that can be assigned to a reconfigurable HW. In order to control the execution of these tasks, the processor must manage at run-time complex data structures, like graphs or linked list, which may generate significant execution-time penalties. In addition, HW/SW communications are frequently a system bottleneck. Hence, it is very interesting to find a way to reduce the run-time SW computations and the HW/SW communications. To this end we have developed a HW execution manager that controls the execution of subtask graphs over a set of reconfigurable units. This manager receives as input a subtask graph coupled to a subtask schedule, and guarantees its proper execution. In addition it includes support to reduce the execution-time overhead due to reconfigurations. With this HW support the execution of task graphs can be managed efficiently generating only very small run-time penalties.