Get our free extension to see links to code for papers anywhere online!

Chrome logo  Add to Chrome

Firefox logo Add to Firefox
Picture for Franz Müller

Franz Müller
Alert button

A Homogeneous Processing Fabric for Matrix-Vector Multiplication and Associative Search Using Ferroelectric Time-Domain Compute-in-Memory


Sep 24, 2022
Xunzhao Yin, Qingrong Huang, Franz Müller, Shan Deng, Alptekin Vardar, Sourav De, Zhouhang Jiang, Mohsen Imani, Cheng Zhuo, Thomas Kämpfe, Kai Ni

Add code
Alert button

Figure 1 for A Homogeneous Processing Fabric for Matrix-Vector Multiplication and Associative Search Using Ferroelectric Time-Domain Compute-in-Memory
Figure 2 for A Homogeneous Processing Fabric for Matrix-Vector Multiplication and Associative Search Using Ferroelectric Time-Domain Compute-in-Memory
Figure 3 for A Homogeneous Processing Fabric for Matrix-Vector Multiplication and Associative Search Using Ferroelectric Time-Domain Compute-in-Memory
Figure 4 for A Homogeneous Processing Fabric for Matrix-Vector Multiplication and Associative Search Using Ferroelectric Time-Domain Compute-in-Memory
* 8 pages, 8 figures 
   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

An Ultra-Compact Single FeFET Binary and Multi-Bit Associative Search Engine


Mar 15, 2022
Xunzhao Yin, Franz Müller, Qingrong Huang, Chao Li, Mohsen Imani, Zeyu Yang, Jiahao Cai, Maximilian Lederer, Ricardo Olivo, Nellie Laleni, Shan Deng, Zijian Zhao, Cheng Zhuo, Thomas Kämpfe, Kai Ni

Add code
Alert button

* 20 pages, 14 figures 
   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Deep Random Forest with Ferroelectric Analog Content Addressable Memory


Oct 06, 2021
Xunzhao Yin, Franz Müller, Ann Franchesca Laguna, Chao Li, Wenwen Ye, Qingrong Huang, Qinming Zhang, Zhiguo Shi, Maximilian Lederer, Nellie Laleni, Shan Deng, Zijian Zhao, Michael Niemier, Xiaobo Sharon Hu, Cheng Zhuo, Thomas Kämpfe, Kai Ni

Add code
Alert button

Figure 1 for Deep Random Forest with Ferroelectric Analog Content Addressable Memory
Figure 2 for Deep Random Forest with Ferroelectric Analog Content Addressable Memory
Figure 3 for Deep Random Forest with Ferroelectric Analog Content Addressable Memory
Figure 4 for Deep Random Forest with Ferroelectric Analog Content Addressable Memory
* 44 pages, 16 figures 
   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories


Nov 13, 2020
Arman Kazemi, Mohammad Mehdi Sharifi, Ann Franchesca Laguna, Franz Müller, Ramin Rajaei, Ricardo Olivo, Thomas Kämpfe, Michael Niemier, X. Sharon Hu

Add code
Alert button

Figure 1 for In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories
Figure 2 for In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories
Figure 3 for In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories
Figure 4 for In-Memory Nearest Neighbor Search with FeFET Multi-Bit Content-Addressable Memories
* To be published in DATE'21 
   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email