Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
A routing architecture for fast interconnections between Look-Up Tables (LUTs) in a group of Basic Logic Elements (BLEs), whereby a size of the group ranges from 1 to k+1, where k is the number of inputs of a LUT, and LUTs in the group are indexed from 1 to k+1, and whereby (a) an output of a LUTi, 1≦̸i≦̸k, connects to one of the inputs of routing multiplexers of LUTj, i
Paolo Ienne, Andrea Guerrieri, Lana Josipovic, Axel Marmet
Mirjana Stojilovic, Hossein Asadi, Zeinab Seifoori