scispace - formally typeset
K

Kasho Yamamoto

Researcher at Hitachi

Publications -  8
Citations -  179

Kasho Yamamoto is an academic researcher from Hitachi. The author has contributed to research in topics: Simulated annealing & Backplane. The author has an hindex of 5, co-authored 8 publications receiving 72 citations. Previous affiliations of Kasho Yamamoto include Hokkaido University.

Papers
More filters
Journal ArticleDOI

STATICA: A 512-Spin 0.25M-Weight Annealing Processor With an All-Spin-Updates-at-Once Architecture for Combinatorial Optimization With Complete Spin–Spin Interactions

TL;DR: A high-performance annealing processor named STochAsTIc Cellular automata Annealer (STATICA) for solving combinatorial optimization problems represented by fully connected graphs and can update multiple states of fully connected spins simultaneously by introducing different dynamics called stochastic cellular automata annealer.
Proceedings ArticleDOI

7.3 STATICA: A 512-Spin 0.25M-Weight Full-Digital Annealing Processor with a Near-Memory All-Spin-Updates-at-Once Architecture for Combinatorial Optimization with Complete Spin-Spin Interactions

TL;DR: Annealers exploit the fact that combinatorial optimization problems can be mapped to the ground state search of an Ising model, where the combination of N spins with lowest Ising energy represents the optimal solution to the problem.
Proceedings ArticleDOI

An 8Gb/s Transceiver with 3×-Oversampling 2-Threshold Eye-Tracking CDR Circuit for -36.8dB-loss Backplane

TL;DR: A 90nm CMOS 8Gb/s transceiver is developed that achieves a BER of less than 10-12 through a 160cm backplane board with -36.8dB loss at 4GHz and a transceiver power consumption of 232mW.
Proceedings ArticleDOI

4.6 A 144Kb Annealing System Composed of 9× 16Kb Annealing Processor Chips with Scalable Chip-to-Chip Connections for Large-Scale Combinatorial Optimization Problems

TL;DR: A flip-flop-based spin circuit allowing expandable bitwidth by reproducing the Metropolis algorithm, which is SA with a fixed temperature, and an inter-chip interface (I/F) with a data-compression method utilizing annealing characteristics to obtain multi-chip operation as discussed by the authors.
Proceedings ArticleDOI

A Time-Division Multiplexing Ising Machine on FPGAs

TL;DR: The time-division multiplexing Ising machine architecture is proposed that efficiently utilizes on-chip memory resources in an FPGA, in order to address large scale combinatorial optimization problems.