44 citations · 55 across the 9 of their papers we have counts for
10 papers
PolySim: Deterministic Polynomial Surrogates for Cross-Modal Retrieval on CiM
Xinzhao Li, Charles Power, Pengyu Ren +10
Cross-modal retrieval on edge devices benefits from probabilistic embeddings that capture semantic uncertainty, but deploying them on compute-in-memory (CiM) hardware remains an op…
CQ-CiM: Hardware-Aware Embedding Shaping for Robust CiM-Based Retrieval
Xinzhao Li, Alptekin Vardar, Franz Müller +6
Deploying Retrieval-Augmented Generation (RAG) on edge devices is in high demand, but is hindered by the latency of massive data movement and computation on traditional architectur…
BEOL Ferroelectric Compute-in-Memory Ising Machine for Simulated Bifurcation
Yu Qian, Alptekin Vardar, Konrad Seidel +7
Computationally hard combinatorial optimization problems are pervasive in science and engineering, yet their NP-hard nature renders them increasingly inefficient to solve on conven…
Probabilistic Greedy Algorithm Solver Using Magnetic Tunneling Junctions for Traveling Salesman Problem
Ran Zhang, Xiaohan Li, Caihua Wan +15
Combinatorial optimization problems are foundational challenges in fields such as artificial intelligence, logistics, and network design. Traditional algorithms, including greedy m…
Engineering-Oriented Design of Drift-Resilient MTJ Random Number Generator via Hybrid Control Strategies
Ran Zhang, Caihua Wan, Yingqian Xu +15
Magnetic Tunnel Junctions (MTJs) have shown great promise as hardware sources for true random number generation (TRNG) due to their intrinsic stochastic switching behavior. However…
A Remedy to Compute-in-Memory with Dynamic Random Access Memory: 1FeFET-1C Technology for Neuro-Symbolic AI
Xunzhao Yin, Hamza Errahmouni Barkam, Franz Müller +14
Neuro-symbolic artificial intelligence (AI) excels at learning from noisy and generalized patterns, conducting logical inferences, and providing interpretable reasoning. Comprising…
HyCiM: A Hybrid Computing-in-Memory QUBO Solver for General Combinatorial Optimization Problems with Inequality Constraints
Yu Qian, Zeyu Yang, Kai Ni +3
Computationally challenging combinatorial optimization problems (COPs) play a fundamental role in various applications. To tackle COPs, many Ising machines and Quadratic Unconstrai…
A Ferroelectric Compute-in-Memory Annealer for Combinatorial Optimization Problems
Xunzhao Yin, Yu Qian, Alptekin Vardar +11
Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications, including logistical planning, resource allocation, chip design, drug explorati…
Embedding Security into Ferroelectric FET Array via In-Situ Memory Operation
Yixin Xu, Yi Xiao, Zijian Zhao +7
Non-volatile memories (NVMs) have the potential to reshape next-generation memory systems because of their promising properties of near-zero leakage power consumption, high density…
A Homogeneous Processing Fabric for Matrix-Vector Multiplication and Associative Search Using Ferroelectric Time-Domain Compute-in-Memory
Xunzhao Yin, Qingrong Huang, Franz Müller +8
In this work, we propose a ferroelectric FET(FeFET) time-domain compute-in-memory (TD-CiM) array as a homogeneous processing fabric for binary multiplication-accumulation (MAC) and…