Results 1 
6 of
6
Optical computing
, 2008
"... We consider optical computers that encode data using images and compute by transforming such images. We give an overview of a number of such optical computing architectures, including descriptions of the type of hardware commonly used in optical computing, as well as some of the computational effici ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We consider optical computers that encode data using images and compute by transforming such images. We give an overview of a number of such optical computing architectures, including descriptions of the type of hardware commonly used in optical computing, as well as some of the computational efficiencies of optical devices. We go on to discuss optical computing from the point of view of computational complexity theory, with the aim of putting some old, and some very recent, results in context. Finally, we focus on a particular optical model of computation called the continuous space machine. We describe some results for this model including characterisations in terms of wellknown complexity classes.
Highspeed and lowpower electrooptical DSP coprocessor
, 2009
"... A fast, powerefficient electrooptical vectorbymatrix multiplier (VMM) architecture is presented. Careful design of an electrical unit supporting highspeed data transfer enables this architecture to overcome bottlenecks encountered by previous VMM architectures. Based on the proposed architectur ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A fast, powerefficient electrooptical vectorbymatrix multiplier (VMM) architecture is presented. Careful design of an electrical unit supporting highspeed data transfer enables this architecture to overcome bottlenecks encountered by previous VMM architectures. Based on the proposed architecture, we present an electrooptical digital signal processing (DSP) coprocessor that can achieve a significant speedup of 2–3 orders of magnitude over existing DSP technologies and execute more than 16 teraflops. We show that it is feasible to implement the system using offtheshelf components, analyze the performance of the architecture with respect to primitive DSP operations, and detail the use of the new architecture for several DSP applications. © 2009 Optical
ElectroOptical DSP of Tera Operations per Second and Beyond (Extended Abstract)
"... Abstract. We present a vectorbymatrix multiplier architecture incorporating the high potential of optical computing within electronics. This architecture stems from advances in optical switching technology, optical communication, and laser on silicon, and overcomes previous bottlenecks implied by ..."
Abstract
 Add to MetaCart
Abstract. We present a vectorbymatrix multiplier architecture incorporating the high potential of optical computing within electronics. This architecture stems from advances in optical switching technology, optical communication, and laser on silicon, and overcomes previous bottlenecks implied by the speed of transferring information to the optical vectorbymatrix multiplier. Based on this architecture, we present in detail a feasible electrooptical DSP coprocessor that can obtain more than 16Tera integer operations per second. The use of the new architecture for several principal DSP applications is detailed, showing a significant improvement of at least two orders of magnitudes, over existing DSP technologies. Examples of possible applications, including motion estimation engine, string matching, and geometry engine systems, are provided. In addition, the architecture enables an improvement of previous solutions to bounded NPcomplete problems by extensively reducing the size of the solver, while preserving an efficient computation time.
OPTICAL SOLUTIONS FOR THE UNBOUNDED SUBSETSUM PROBLEM
"... Abstract. A special computational device which uses light rays in order to decide whether there is a solution for the unbounded subsetsum problem is described in this paper. The device has a multigraphlike representation and the light traverses it following the routes given by the connections betw ..."
Abstract
 Add to MetaCart
Abstract. A special computational device which uses light rays in order to decide whether there is a solution for the unbounded subsetsum problem is described in this paper. The device has a multigraphlike representation and the light traverses it following the routes given by the connections between the nodes. The graph has 3 nodes: the first one is where the light enters in the device; the second one is used for computing the solution (the computational node) and the 3 rd one is used for collecting the solution (the destination node). The computational node has a number of loops equal to the cardinal of the given set. To each loop (arc) we assign a number from the given set. The nodes are connected by an arc having been assigned a constant value. When the light passes through an arc it is delayed by the amount of time indicated by the number assigned to that arc. At the destination node we will check if there is a ray whose total delay is equal to the target value of the subset sum problem. In this way we have provided a solution to the YES/NO decision problem. Keywords: unconventional computing, optical computing, NPcomplete, unbounded subsetsum problem
Combinatorial Optimization Using ElectroOptical Vector by Matrix Multiplication Architecture
"... Abstract. A new state space representation of a class of combinatorial optimization problems is introduced. The representation enables efficient implementation of exhaustive search for an optimal solution in bounded NP complete problems such as the traveling salesman problem (TSP) with a relatively ..."
Abstract
 Add to MetaCart
Abstract. A new state space representation of a class of combinatorial optimization problems is introduced. The representation enables efficient implementation of exhaustive search for an optimal solution in bounded NP complete problems such as the traveling salesman problem (TSP) with a relatively small number of cities. Furthermore, it facilitates effective heuristic search for sub optimal solutions for problems with large number of cities. This paper surveys structures for representing solutions to the TSP and the use of these structures in iterative hill climbing (ITHC) and genetic algorithms (GA). The mapping of these structures along with respective operators to a newly proposed electrooptical vector by matrix multiplication (VMM) architecture is detailed. In addition, time space tradeoffs related to using a record keeping mechanism for storing intermediate solutions are presented and the effect of record keeping on the performance of these heuristics in the new architecture is evaluated. Results of running these algorithms on sequential architecture as well as a simulationbased estimation of the speedup obtained are supplied. The results show that the VMM architecture can speedup various variants of the TSP algorithm by a factor of 30x to 50x.