Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Raouf Senhadji-Navarro

dblp:62/6107 · also Raouf Senhadji · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-2838-9367ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Electronic design automation · 51% Reconfigurable computing and FPGAs · 26% Integrated circuit design · 24%
Network and information security
1 paper
Hardware security and side channels · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
finite state machine synthesis
0.722021
Methodology for Distributed-ROM-Based Implementation of Finite State Machines · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2021
Finite State Machines With Input Multiplexing: A Performance Study · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2015
Electronic design automation
logic synthesis
0.722021
Methodology for Distributed-ROM-Based Implementation of Finite State Machines · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2021
Finite State Machines With Input Multiplexing: A Performance Study · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2015
Integrated circuit design › digital circuit design
finite state machine
0.312018
High-Performance Architecture for Binary-Tree-Based Finite State Machines · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2018
Reconfigurable computing and FPGAs
FPGA implementation
0.212015
Finite State Machines With Input Multiplexing: A Performance Study · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2015
Hardware security and side channels
cryptographic hardware
0.112018
High-Performance Architecture for Binary-Tree-Based Finite State Machines · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2018

Methods — techniques the papers use, named apart from their topics

finite virtual state machine model · 0.7greedy state encoding · 0.5distributed ROM · 0.5LUT optimization · 0.5state-based input selection · 0.2input multiplexing · 0.2
YearPublicationVenuePosition
2021 Methodology for Distributed-ROM-Based Implementation of Finite State Machines
abstract
This brief explores the optimization of distributed-ROM-based finite state machine (FSM) implementations as an alternative to conventional implementations based on look-up tables (LUTs). In distributed-ROM implementations, LUTs with constant output value (called constant LUTs) and LUTs with the same content (called equivalent LUTs) can be saved. We propose a methodology to implement FSMs using distributed ROM that includes: 1) a greedy state encoding algorithm; 2) an algorithm to find the way of interconnecting the address signals to the ROM that maximize the number of constant or equivalent LUTs; and 3) a set of architectures to implement the columns of the ROM. The results obtained have been compared with conventional LUT-based implementations using standard benchmarks. The proposed technique reduces the number of LUTs in a 91% of cases and increases the speed in all cases.
Raouf Senhadji-Navarro, Ignacio Garcia-Vargas
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2018 High-Performance Architecture for Binary-Tree-Based Finite State Machines
abstract
A binary-tree-based finite state machine (BT-FSM) is a state machine with a 1-bit input signal whose state transition graph is a binary tree. BT-FSMs are useful in those application areas where searching in a binary tree is required, such as computer networks, compression, automatic control, or cryptography. This paper presents a new architecture for implementing BT-FSMs which is based on the model finite virtual state machine (FVSM). The proposed architecture has been compared with the general FVSM and conventional approaches by using both synthetic test benches and very large BT-FSMs obtained from a real application. In synthetic test benches, the average speed improvement of the proposed architecture respect to the best results of the other approaches achieves 41% (there are some cases in which the speed is more than double). In the case of the real application, the average speed improvement achieves 155%.
Raouf Senhadji-Navarro, Ignacio Garcia-Vargas
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2015 Finite State Machines With Input Multiplexing: A Performance Study
abstract
Finite state machines with input multiplexing (FSMIMs) have been proposed in previous works as a technique for efficient mapping FSMs into ROM memory. In this paper, we propose a new architecture for implementing FSMIMs, called FSMIM with state-based input selection, whose goal is to achieve a further reduction in memory usage. This paper also describes in detail the algorithms for generating FSMIMs used by the tool FSMIM-Gen, which has been developed and made available on the Internet for free public use. A comparative study in terms of speed and area between FSMIM approaches and other field programmable gate array-based techniques is presented. The results show that the FSMIM approaches obtain huge reductions in the look-up table (LUT) usage by using a small number of embedded memory blocks. In addition, speed improvements over conventional LUT-based implementations have been obtained in many cases.
Ignacio Garcia-Vargas, Raouf Senhadji-Navarro
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2003 Synthetic generation of address-events for real-time image processing
abstract
Address-event-representation (AER) is a communication protocol that emulates the nervous system's neurons communication, and that is typically used for transferring images between chips. It was originally developed for bio-inspired and real-time image processing systems. Such systems may consist of a complicated hierarchical structure with many chips that transmit images among them in real time, while performing some processing. In this paper several software methods for generating AER streams from images stored in a computer's memory are presented. A hardware version that works in real-time is also being studied. All of them have been evaluated and compared.
Alejandro Linares-Barranco, Raouf Senhadji-Navarro, Ignacio Garcia-Vargas, Francisco Gomez-Rodriguez, Gabriel Jiménez-Moreno, Antonio Abad Civit Balcells
ETFA (2)2
2003 Tuning complex fuzzy systems by supervised learning algorithms
abstract
Tuning a fuzzy system to meet a given set of input/output patterns is usually a difficult task that involves many parameters. This paper presents an study of different approaches that can be applied to perform this tuning process automatically, and describes a CAD tool, named xfsl, which allows applying a wide set of these approaches: (a) a large number of supervised learning algorithms; (b) different processes to simplify the learned system; (c) tuning only specific parameters of the system; (d) the ability to tune hierarchical fuzzy systems, systems with continuous output (like fuzzy controller) as well as with categorical output (like fuzzy classifiers), and even systems that employ user-defined fuzzy functions; and, finally, (e) the ability to employ this tuning within the design flow of a fuzzy system, because xfsl is integrated into the fuzzy system development environment Xfuzzy 3.0.
Francisco Jose Moreno-Velo, Iluminada Baturone, Raouf Senhadji-Navarro, Santiago Sánchez-Solano
FUZZ-IEEE3
2002 Hardware/software codesign methodology for fuzzy controller implementation
abstract
Describes a HW/SW codesign methodology for the implementation of fuzzy controllers on a platform composed of a general-purpose microcontroller and specific processing elements implemented on FPGAs or ASICs. The different phases of the methodology, as well as the CAD tools used in each design stage, are presented, with emphasis on the fuzzy system development environment Xfuzzy. Also included is a practical application of the described methodology for the development of a fuzzy controller for a dosage system.
Alejandro Cabrera Sarmiento, Santiago Sánchez-Solano, Raouf Senhadji-Navarro, Angel Barriga, Carlos Jesús Jiménez-Fernández
FUZZ-IEEE3