GPU-Friendly Parallel Genome Matching with Tiled Access and Reduced State Transition Table

2012 ◽  
Vol 41 (4) ◽  
pp. 526-551 ◽  
Author(s):  
Yunho Oh ◽  
Doohwan Oh ◽  
Won W. Ro
Keyword(s):  
State Transition ◽  
Transition Table ◽  
Reduced State

scholarly journals Encoding of Terms in EMB-Based Mealy FSMs

2020 ◽  
Vol 10 (8) ◽  
pp. 2762 ◽  
Author(s):  
Alexander Barkalov ◽  
Larysa Titarenko ◽  
Małgorzata Mazurkiewicz ◽  
Kazimierz Krzywicki
Keyword(s):  
State Transition ◽  
Logic Circuits ◽  
Sequential Algorithm ◽  
State Variables ◽  
Embedded Memory ◽  
Chip Area ◽  
Memory Block ◽  
Finite State ◽  
Transition Table ◽  
Number Of Classes

A method is proposed targeting implementation of FPGA-based Mealy finite state machines. The main goal of the method is a reduction for the number of look-up table (LUT) elements and their levels in FSM logic circuits. To do it, it is necessary to eliminate the direct dependence of input memory functions and FSM output functions on FSM inputs and state variables. The method is based on encoding of the terms corresponding to rows of direct structure tables. In such an approach, only terms depend on FSM inputs and state variables. Other functions depend on variables representing terms. The method belongs to the group of the methods of structural decomposition. The set of terms is divided by classes such that each class corresponds to a single-level LUT-based circuit. An embedded memory block (EMB) generates codes of both classes and terms as elements of these classes. The mutual using LUTs and EMB allows diminishing chip area occupied by FSM circuit (as compared to its LUT-based counterpart). The simple sequential algorithm is proposed for finding the partition of the set of terms by a determined number of classes. The method is based on representation of an FSM by a state transition table. However, it can be used for any known form of FSM specification. The example of synthesis is shown. The efficiency of the proposed method was investigated using a library of standard benchmarks. We compared the proposed with some other known design methods. The investigations show that the proposed method gives better results than other discussed methods. It allows the obtaining of FSM circuits with three levels of logic and regular interconnections.

scholarly journals System for Identifying and Correcting Invalid Words in the Devanagari Script for Text to Speech Engine

2019 ◽  
Vol 8 (6S4) ◽  
pp. 1001-1006 ◽  
Keyword(s):  
State Transition ◽  
State Machine ◽  
The State ◽  
Input Symbol ◽  
Text To Speech ◽  
Speech Output ◽  
Input Text ◽  
Transition Table ◽  
Hindi Language

The Text To Speech (TTS) system takes text as an input and generates speech as an output. If input text is incorrect then overall quality of speech output may degrade. The main aim of the proposed system is to provide correct input text to the TTS. The system takes Unicode word as an input, identifies invalid word and corrects it by inserting, deleting or updating characters of the word. In this system, the State Machine is used to identify and correct invalid word in the Devanagari script which in turn is based on rules. Rules are developed for converting character to input symbol. Actions and States are identified for State Machine. Finally, the state transition table is developed for validation and correction of word. Using this system, incorrect words of the Devanagari script can be corrected to valid words (word contains all the valid Devanagari syllables) based on Devanagari script grammar. Since, all Devanagari characters are not present in Hindi language; this system will correct these nonHindi characters to Hindi.

scholarly journals Implementasi Reduksi Keadaan Rangkaian Digital Sekuensial Metode Bagan Implikasi

Jurnal Tekno ◽  
2019 ◽  
Vol 16 (2) ◽  
pp. 23-34
Author(s):  
Theresia Prima Ari Setiyani ◽  
Yohanes Suyanto
Keyword(s):  
Programming Language ◽  
Digital Circuits ◽  
State Transition ◽  
The State ◽  
State Reduction ◽  
Python Programming Language ◽  
Transition Table ◽  
Array Structure ◽  
Python Programming

The implementation of state reduction in sequential digital circuits is made for learning the topic of state reduction. The method used for state reduction is an implication chart. This method starts with reading the transition table state and transfered into the array structure. Based on this array structure a table or chart of initial implications is arranged. The next process is to change the contents of the table if there are cells that meet the requirements to be declared as identical or not identical. This process is repeated continuously until there is no change in cell contents. The state of reduction implementation is made using the Python programming language and PHP. The results of the implementation are successful for the state transition table with 1 input and 1 output.  

scholarly journals System for Identifying and Correcting Invalid Words in the Devanagari Script for Text to Speech Engine

2019 ◽  
Vol 8 (9S2) ◽  
pp. 368-373
Keyword(s):  
State Transition ◽  
State Machine ◽  
The State ◽  
Input Symbol ◽  
Text To Speech ◽  
Speech Output ◽  
Input Text ◽  
Transition Table ◽  
Hindi Language

The Text To Speech (TTS) system takes text as an input and generates speech as an output. If input text is incorrect then overall quality of speech output may degrade. The main aim of the proposed system is to provide correct input text to the TTS. The system takes Unicode word as an input, identifies invalid word and corrects it by inserting, deleting or updating characters of the word. In this system, the State Machine is used to identify and correct invalid word in the Devanagari script which in turn is based on rules. Rules are developed for converting character to input symbol. Actions and States are identified for State Machine. Finally, the state transition table is developed for validation and correction of word. Using this system, incorrect words of the Devanagari script can be corrected to valid words (word contains all the valid Devanagari syllables) based on Devanagari script grammar. Since, all Devanagari characters are not present in Hindi language; this system will correct these nonHindi characters to Hindi

Compression algorithm of state transition table based on sparse matrix

2010 ◽  
Vol 30 (8) ◽  
pp. 2157-2160
Author(s):  
Yuan YAO ◽  
Peng LIU ◽  
Hui WANG ◽  
Cheng-cheng GOU
Keyword(s):  
State Transition ◽  
Sparse Matrix ◽  
Compression Algorithm ◽  
Transition Table

scholarly journals State Transition Table of a Finite Automata: a Science Project for High School Students

2019 ◽  
pp. 87-107
Author(s):  
Boris F. Melnikov ◽  
◽  
Mikhail E. Abramyan ◽  
Elena A. Melnikova ◽  
◽  
...  
Keyword(s):  
High School ◽  
High School Students ◽  
State Transition ◽  
Finite Automata ◽  
School Students ◽  
Science Project ◽  
Transition Table
Sign in / Sign up

Export Citation Format

Share Document