Sign In

Communications of the ACM

ACM TechNews

The Easy Route the Easy Way: Chip Calculates the Shortest Distance in an Instant


View as: Print Mobile App Share: Send by email Share on reddit Share on StumbleUpon Share on Hacker News Share on Tweeter Share on Facebook
A solution to the Traveling Salesman problem.

Tokyo University of Science researchers developed a chip that uses special components to address the Traveling Salesman problem.

Credit: Xypron

Researchers at the Tokyo University of Science have developed a new chip that uses special components to calculate the shortest possible distance to traverse  up to 22 cities in a short period of time.

The team observed that in an integrated circuit, the interactions between each spin cell is linear, which ensures the spin cells can only interact with cells near them, prolonging processing time.

The researchers decided to arrange the cells slightly differently to make certain all spin cells could be connected. They first arranged the circuits in a two-dimensional array, and the spin cells separately in a one-dimensional arrangement. The circuits read the data, and an aggregate of the data was used to switch the states of the spin cells.

This method resulted in a much smaller number of spin cells required, and a much shorter time needed for processing.

From Tokyo University of Science
View Full Article

 

Abstracts Copyright © 2020 SmithBucklin, Washington, DC, USA


 

No entries found