Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture

  title={Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture},
  author={D. Tamir and N. Shaked and W. Geerts and S. Dolev},
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… Expand
A parallel optical implementation of arithmetic operations
An optical processor for performing arithmetic operations in parallel that uses two-dimensional optoelectronic planes for both performing logic operations and storing data, which eliminates the need for transferring data from electronic devices in each step of the computation. Expand
On the computational power of the light: A plan for breaking data encryption standard
This study shows how the light-based solution can be applied to break the Data Encryption Standard (DES), and demonstrates that under chosen plain-text attack, it is possible to recover the DES key by providing all DES components in a reasonable time. Expand
The Research on SLP Optimization Technique towards DSP
Based on the specialized functions of DSP frame, the instruction analysis and optimization algorithm in SLP auto-vectorization were improved, so as to transform more high-efficiency source program. Expand


Optical solution for bounded NP-complete problems.
We present a new optical method for solving bounded (input-length-restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called theExpand
Genetic algorithms using parallelism and FPGAs: the TSP as case study
This work uses the traveling salesman problem (TSP) as case study and presents the hardware implementation of this algorithm as well as the GA used for solving it, indicating the parallelism techniques that obtain better results and stating FPGA implementation is better when the problem size increases or when better solutions must be found. Expand
Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems
An optical method for synthesizing a binary matrix representing all feasible solutions of a bounded (input length restricted) NP-complete combinatorial problem is presented and an optical matrix-vector multiplier can be used in order to multiply the synthesized binary matrix and a grayscale vector representing the weights of the problem. Expand
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Detailed designs for basic primitives of the optical processor are presented and designs for solving Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, and 3D-matching are proposed. Expand
The Traveling Salesman Problem: A Case Study in Local Optimization
This chapter discusses how various approaches to combinatorial optimization have been adapted to the TSP and evaluates their relative success in this perhaps atypical domain from both a theoretical and an experimental point of view. Expand
Caching in the TSP Search Space
It is demonstrated that record keeping in the ITHC domain can significantly speed up the I THC, with a highly significant speedup of 4x over traditional methods even with a relatively large number of cities. Expand
Efficiency of Local Genetic Algorithm in Parallel Processing
A parallel system based on previous works for running the LGA is built and the results show that LGA improve the search quality significantly and it is more efficient running LGA with parallel system than single CPU. Expand
Design of a processing element of a SIMD computer for genetic algorithms
The SIMD-GA is introduced, a cost-effective parallel processing architecture suitable for the solution of large scale problems using GAs, and its hardware design and implementation are discussed. Expand
A comparative study of five parallel genetic algorithms using the traveling salesman problem
A particular PGA that combines a new subtour technique with a known migration approach is identified to be the best for the traveling salesman problem among the five PGAs being compared. Expand
An optical solution for the traveling salesman problem.
It will turn out that this number of photons is proportional to N(N) for a traveling salesman problem with N cities and that for large numbers of cities the method in practice therefore is limited by the signal-to-noise ratio. Expand