Herón Molina Lozano - Academia.edu (original) (raw)

Papers by Herón Molina Lozano

Journal of intelligent & fuzzy systems, Apr 2, 2024

Computación Y Sistemas, Sep 28, 2023

Mathematics, Jun 29, 2024

Nowadays, there are implemented devices whose purpose is to perform massive computations by savin... more Nowadays, there are implemented devices whose purpose is to perform massive computations by saving resources at the time they reduce the latency of arithmetic operations. These devices are usually GPUs, FPGAs and other specialised devices such as "Coral". Neural networks, digital filters and numerical simulators take advantage of the massively parallel operations of such devices. One way to reduce the amount of resources used is to limit the size of the registers that store data. This has led to the proliferation of numeric formats with a length of less than 32 bits, known as short floating point or SFP. We have developed several SFP’s for use in our neural network accelerator design, allowing for different levels of accuracy. We use a 16-bit format for data transfer and different formats can be used simultaneously for internal operations. The internal operations can be performed in 16-bit, 20-bit and 24-bit. The use of registers larger than 16-bit allows the preservation ...

iberchip.net

Abstract− Photogate-type pixels are structures widely used in the design of modern CMOS integrate... more Abstract− Photogate-type pixels are structures widely used in the design of modern CMOS integrated cameras, but also in real-time CMOS vision sensory system applications. This work introduces a PSpice macromodel for CMOS photogate-type active pixel sensors that ...

Sensors, Nov 16, 2022

This article is an open access article distributed under the terms and conditions of the Creative... more This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence), 2008

We propose to use fuzzy context-free grammars for the analysis of DNA sequences by using the Cock... more We propose to use fuzzy context-free grammars for the analysis of DNA sequences by using the Cocke-Younger-Kasami algorithm to estimate membership grades of a DNA sequence against the language of a fuzzy grammar. As a first example of the application of the proposed method we prove that is possible to determine a fuzzy grammar of a prototype DNA sequence and

2012 Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS), 2012

ABSTRACT The Tellez-Molina-Villa (TMV) algorithm is a new defuzzification method for interval typ... more ABSTRACT The Tellez-Molina-Villa (TMV) algorithm is a new defuzzification method for interval type-2 fuzzy systems. It is based on found the mean trajectory of any interval type-2 fuzzy set. With the mean trajectory we pretend to find the type-1 reduced fuzzy set of the interval type-2 fuzzy set. With this algorithm we try to find the generalized centroid of any interval type-2 fuzzy set. Also, we try to increase the type-2 fuzzy logic system accuracy. In general we found from 5 defuzzification methods that try to extract a crisp value from an interval type-2 fuzzy set as a representative value. First is necessary to obtain a type-1 fuzzy set from the type-2 fuzzy set, second from this reduced fuzzy set obtain a single crisp value. This crisp value representsa lot of information, so that is necessary to do these steps carefully because we can obtain misinformation from the type-2 fuzzy inference system. In this paper we present some result from the new algorithm, and in order to compare the TMV algorithm we present comparative results with 5 type-2 defuzzification methods. From the obtained results we demonstrated that the TMV approach performs better that the Nie-Tan method. In fact, we can say that the TMV algorithm has at least equivalent results than Karnik-Mendel algorithm that in our opinion is one of the best defuzzification methods, but with the difference that the TMV algorithm is based on the mean trajectory of an interval type-2 fuzz set.

Lecture Notes in Computer Science, 2010

In this paper we present a variation of the Cocke-Younger-Kasami algorithm (CYK algorithm for sho... more In this paper we present a variation of the Cocke-Younger-Kasami algorithm (CYK algorithm for short) for the analysis of fuzzy free context languages applied to DNA strings. We propose a variation of the original CYK algorithm where we prove that the order of the new CYK algorithm is O(n). We prove that the new algorithm only use 2n-1 memory localities. We use a variation of the CYK algorithm, where the free context language can be fuzzy. The fuzzy context-free grammar (FCFG) is obtained from DNA and RNA sequences.

2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353)

The architecture called ANFIS (Adaptive Neuro-Fuzzy Inference System) proposed by J.R. Jang (1993... more The architecture called ANFIS (Adaptive Neuro-Fuzzy Inference System) proposed by J.R. Jang (1993) is divided in five layers. Layers 1 and 2 in ANFIS were built by using a double-differential amplifier and a winner takes all circuit; to implement layers 3, 4 and 5, CMOS translinear blocks are used. The complete ANFIS architecture is implemented on a circuit board, using

CONIELECOMP 2011, 21st International Conference on Electrical Communications and Computers, 2011

ABSTRACT In this work we proposed a new method that allows the blind source separation by the ana... more ABSTRACT In this work we proposed a new method that allows the blind source separation by the analysis of independent components known as FASTICA in the domain of Wavelet to observe his behavior on signs captured in a real environment. The problem that tries to be solved in Blind Source Separation (BSS) consists of recovering signs statistically independent. Nevertheless, certain difficulties appear when this system is applied to real signs, on the one hand the effect of the reverberation does that the mixtures gathered by the microphones are convolution mix; and on the other hand, these mixtures will not be totally independent. We did two experiments. With the first experiment we separated 2 audio signals with a very low percentage of error. With the second experiment we recorded 3 different audio sources with an array of 3 microphones, and then from one audio recorded source 3 signals were separated, we appreciate that in each source one signal was amplified and the other two signals were fallen down. From the results, the method that we proposed is able to separate from one mixed audio signal 2 or even 3 independent signals.

2011 IEEE Electronics, Robotics and Automotive Mechanics Conference, 2011

In the present work, we show a way to separate noise signals recorded with microphones industrial... more In the present work, we show a way to separate noise signals recorded with microphones industrial, in order that they can be analyzed separately. Blind Source Separation is accomplished using Independent Component Analysis (ICA) technique in the wavelet domain. Also, it is necessary to identify the separate sources, taking into account that each signal separate has some components of the

2012 IEEE 3rd Latin American Symposium on Circuits and Systems (LASCAS), 2012

A power efficient implementation of a CMOS Class-AB analog median filter is presented. The median... more A power efficient implementation of a CMOS Class-AB analog median filter is presented. The median detector is based on transconductance comparators accomplished with new Differential Flipped Voltage Followers. The followers employ a current comparator to switch-on an auxiliary transistor to drive additional current whenever it is required, performing Class-AB operation. Area is saved by taking advantage of the large impedance

International Journal of Machine Learning and Cybernetics, 2011

In this paper we present a variation of the Cocke-Younger-Kasami algorithm (CYK algorithm) for th... more In this paper we present a variation of the Cocke-Younger-Kasami algorithm (CYK algorithm) for the analysis of fuzzy free context languages applied to DNA strings. We propose a variation of the original CYK algorithm where we prove that the computational order of the new CYK algorithm is O(n). We prove that the new algorithm only uses O(2n) memory locations. The fuzzy context-free grammar (FCFG) is obtained from the DNA. The algorithm can be used to find regulatory motifs among other applications. In order to demonstrate the applications of the proposed algorithm, we present two examples. In the first example, we prove that it is possible to define a fuzzy grammar for a prototype DNA sequence and then find the membership grade of any arbitrary sequence against this specific pattern. As a second example, we construct a fuzzy grammar from the alignment of promoters obtained by a logo sequence algorithm for the Escherichia coli K12 DNA string, and then show how the proposed method can be used for discovery of the regulatory motifs.

Tecnología y ciencias del agua

2 0 2 2, I nstituto M exicano de T ecnología del A gua. O pen A ccess bajo la lic encia CC BY-NC-... more 2 0 2 2, I nstituto M exicano de T ecnología del A gua. O pen A ccess bajo la lic encia CC BY-NC-SA 4 .0

Journal of Computacion y Sistemas, 2011

Journal of Computacion y Sistemas, 2012

Modern reorder buffers (ROBs) were conceived to improve processor performance by allowing instruc... more Modern reorder buffers (ROBs) were conceived to improve processor performance by allowing instruction execution out of the original program order and run ahead of sequential instruction code exploiting existing instruction level parallelism (ILP). The ROB is a functional structure of a processor execution engine that supports speculative execution, physical register recycling, and precise exception recovering. Traditionally, the ROB is considered as a monolithic circular buffer with incoming instructions at the tail pointer after the decoding stage and completing instructions at the head pointer after the commitment stage. The latter stage verifies instructions that have been dispatched, issued, executed, and are not completed speculatively. This paper presents a design of distributed reorder buffer microarchitecture by using small structures near building blocks which work together, using the same tail and head pointer values on all structures for synchronization. The reduction of area, and therefore, the reduction of power and delay make this design suitable for both embedded and high performance microprocessors.

Abstract. In this paper, a low-complexity current-mode Winner-Take-All circuit (WTA) of O(n) comp... more Abstract. In this paper, a low-complexity current-mode Winner-Take-All circuit (WTA) of O(n) complexity with logical outputs is presented. The proposed approach employs a Quasi-FG Inverter as the key element for current integration and the computing of the winning cell. The design was implemented in a double-poly, three metal layers, 0.5m CMOS technology. The circuit exhibits a good accuracy-speed tradeoff when compared to other reported WTA architectures.

Computación y Sistemas, 2012

In Wireless Sensor Networks (WSNs), each node typically transmits several control and data packet... more In Wireless Sensor Networks (WSNs), each node typically transmits several control and data packets in a contention fashion to the sink. In this work, we mathematically analyze and study three unscheduled transmission schemes for control packets in a cluster-based architecture named Fixed Scheme (FS), Adaptive by Estimation Scheme (AES) and Adaptive by Gamma Scheme (AGS), in order to offer QoS guarantees in terms of system lifetime (related to energy consumption) and reporting delay (related to cluster formation delay). In the literature, different adaptive schemes have been proposed, and also there is research about the appropriate value selection of the transmission probability for the cluster formation. However, it largely overlooked the minimum and maximum values for the transmission probability that entails the best performance. Based on the numerical results, we show that the threshold values are just as important in the system design as the actual value of the transmission pro...