Reducing LUT Count for Mealy FSMs With Transformation of States

Modern digital systems can be viewed as compositions of combinational and sequential blocks. In the article, we discuss a case when sequential blocks are represented using a model of Mealy finite-state machine (FSM). It is very important to improve such FSM characteristics as the number of used logi...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computer-aided design of integrated circuits and systems Vol. 41; no. 5; pp. 1400 - 1411
Main Authors Barkalov, Alexander A., Titarenko, Larysa, Mielcarek, Kamil
Format Journal Article
LanguageEnglish
Published New York IEEE 01.05.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Modern digital systems can be viewed as compositions of combinational and sequential blocks. In the article, we discuss a case when sequential blocks are represented using a model of Mealy finite-state machine (FSM). It is very important to improve such FSM characteristics as the number of used logic elements, operating frequency and power consumption. This article proposes a novel design method which allows diminishing the number of look-up table (LUTs) and increasing the operating frequency of multilevel LUT-based Mealy FSMs. The method is based on simultaneous use of such methods of structural decomposition as the transformation of states into FSM outputs and twofold state encoding. The proposed method results in three-level logic circuits of Mealy FSMs with regular systems of interconnections. Each function for any level of logic is implemented using a single LUT. An example of FSM synthesis with the proposed method is given. The experiments with standard benchmarks were conducted. The results of experiments show that the proposed approach leads to decreasing LUT counts from 11.9% to 62.6%. Also, it leads to increasing the operating frequency from 11.77% to 18.43% on average compared with other investigated approaches (Auto and One-hot of Vivado, JEDI, and replacement of FSM inputs and encoding the collections of outputs). The economy in used LUTs and gain in operating frequency grow with the growth of the FSM complexity.
AbstractList Modern digital systems can be viewed as compositions of combinational and sequential blocks. In the article, we discuss a case when sequential blocks are represented using a model of Mealy finite-state machine (FSM). It is very important to improve such FSM characteristics as the number of used logic elements, operating frequency and power consumption. This article proposes a novel design method which allows diminishing the number of look-up table (LUTs) and increasing the operating frequency of multilevel LUT-based Mealy FSMs. The method is based on simultaneous use of such methods of structural decomposition as the transformation of states into FSM outputs and twofold state encoding. The proposed method results in three-level logic circuits of Mealy FSMs with regular systems of interconnections. Each function for any level of logic is implemented using a single LUT. An example of FSM synthesis with the proposed method is given. The experiments with standard benchmarks were conducted. The results of experiments show that the proposed approach leads to decreasing LUT counts from 11.9% to 62.6%. Also, it leads to increasing the operating frequency from 11.77% to 18.43% on average compared with other investigated approaches (Auto and One-hot of Vivado, JEDI, and replacement of FSM inputs and encoding the collections of outputs). The economy in used LUTs and gain in operating frequency grow with the growth of the FSM complexity.
Author Barkalov, Alexander A.
Mielcarek, Kamil
Titarenko, Larysa
Author_xml – sequence: 1
  givenname: Alexander A.
  orcidid: 0000-0002-4941-3979
  surname: Barkalov
  fullname: Barkalov, Alexander A.
  organization: Institute of Metrology, Electronics and Computer Science, Faculty of Computer, Electrical and Control Engineering, University of Zielona Góra, Zielona Góra, Poland
– sequence: 2
  givenname: Larysa
  surname: Titarenko
  fullname: Titarenko, Larysa
  organization: Institute of Metrology, Electronics and Computer Science, Faculty of Computer, Electrical and Control Engineering, University of Zielona Góra, Zielona Góra, Poland
– sequence: 3
  givenname: Kamil
  orcidid: 0000-0003-4027-7541
  surname: Mielcarek
  fullname: Mielcarek, Kamil
  email: k.mielcarek@imei.uz.zgora.pl
  organization: Institute of Metrology, Electronics and Computer Science, Faculty of Computer, Electrical and Control Engineering, University of Zielona Góra, Zielona Góra, Poland
BookMark eNo9kMFOwkAQhjdGEwF9AONlE8_Fmd222z0ZgqImEBMp8bhZ2lktgRZ32wNvbwnE0xzm__7JfEN2WTc1MXaHMEYE_ZhPJ89jAQLHEjKEJLtgA9RSRTEmeMkGIFQWASi4ZsMQNgAYJ0IP2NMnlV1R1d98vsr5tOnqlrvG8wXZ7YHPlovAv6r2h-fe1qFf7GxbNTVvHF-2tqVww66c3Qa6Pc8RW81e8ulbNP94fZ9O5lEhtGyjzKnUKUfl2olEANi00FrL0mFGhDGm4DKHQkktSSiI15aUsE5gAYSl0nLEHk69e9_8dhRas2k6X_cnjUiTHulfF30KT6nCNyF4cmbvq531B4Ngjp7M0ZM5ejJnTz1zf2IqIvrP61iKGKT8A0CyY5U
CODEN ITCSDI
CitedBy_id crossref_primary_10_3390_app14135594
crossref_primary_10_3390_electronics12030502
Cites_doi 10.1155/2018/6831901
10.1007/978-3-319-04708-9
10.1016/b978-0-7506-8397-5.x0001-3
10.1007/978-3-642-14295-6_5
10.1109/ICECS.2012.6463760
10.1007/978-1-4757-3393-8
10.3390/app10082762
10.1007/978-1-4615-2692-6
10.1016/j.micpro.2017.06.010
10.1109/EURMIC.1997.617211
10.1109/MWSCAS.2010.5548558
10.34768/amcs-2020-0055
10.1109/TCSII.2017.2746749
10.1049/el:20046007
10.1134/s1064230717010129
10.1007/978-3-030-38295-7
10.2478/amcs-2018-0046
10.1109/TCAD.2018.2878187
10.1007/3-540-45716-X_36
10.1007/978-1-4615-2742-8
10.1142/s0218126615501017
10.1016/j.vlsi.2016.08.001
10.1007/978-1-4419-0504-8
10.1109/ACCESS.2019.2895206
10.1515/amcs-2017-0015
10.3390/computation7040063
10.1007/978-1-4615-6155-2
10.1109/ASPDAC.2017.7858306
10.1134/s106422691302006x
10.1007/978-3-319-24202-6
10.1007/978-3-319-59837-6
10.1145/2000832.2000835
10.1007/978-3-642-36166-1
10.1109/TCAD.2017.2731678
10.1007/3-540-44614-1_76
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TCAD.2021.3081058
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Xplore Digital Library
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1937-4151
EndPage 1411
ExternalDocumentID 10_1109_TCAD_2021_3081058
9432403
Genre orig-research
GroupedDBID --Z
-~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AASAJ
ABQJQ
ABVLG
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AI.
AIBXA
AKJIK
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IBMZZ
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
PZZ
RIA
RIE
RIG
RNS
TN5
VH1
VJK
XFK
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c293t-8f76f7fedbf25200a6c9993df18ee14160f8f127393e2704bae72af21c0e1d793
IEDL.DBID RIE
ISSN 0278-0070
IngestDate Thu Oct 10 15:45:39 EDT 2024
Wed Sep 04 12:36:10 EDT 2024
Wed Jun 26 19:31:32 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c293t-8f76f7fedbf25200a6c9993df18ee14160f8f127393e2704bae72af21c0e1d793
ORCID 0000-0002-4941-3979
0000-0003-4027-7541
PQID 2652700212
PQPubID 85470
PageCount 12
ParticipantIDs crossref_primary_10_1109_TCAD_2021_3081058
ieee_primary_9432403
proquest_journals_2652700212
PublicationCentury 2000
PublicationDate 2022-05-01
PublicationDateYYYYMMDD 2022-05-01
PublicationDate_xml – month: 05
  year: 2022
  text: 2022-05-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on computer-aided design of integrated circuits and systems
PublicationTitleAbbrev TCAD
PublicationYear 2022
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref35
ref12
ref34
ref15
ref14
ref36
ref31
ref11
ref10
Nowicka (ref37) 1999
ref2
ref17
ref39
ref16
ref19
ref18
De Micheli (ref30) 1994
Baranov (ref38) 2008
Barkalov (ref1) 2020; 30
Skliarova (ref33) 2012
ref45
ref26
ref25
ref20
ref42
ref41
ref21
ref43
ref28
ref27
(ref29) 1993
(ref48) 2019
ref8
ref7
Maxfield (ref24) 2008
Achasova (ref46) 1987
ref9
ref4
ref3
ref6
ref5
Sentovich (ref32) 1992
ref40
References_xml – ident: ref14
  doi: 10.1155/2018/6831901
– volume-title: FPGAs: Instant Access
  year: 2008
  ident: ref24
  contributor:
    fullname: Maxfield
– start-page: 502
  year: 1999
  ident: ref37
  article-title: FPGA-based decomposition of Boolean functions: Algorithms and implementation
  publication-title: Adv. Comput. Syst.
  contributor:
    fullname: Nowicka
– ident: ref4
  doi: 10.1007/978-3-319-04708-9
– volume-title: International Workshop on Logic Synthesis Benchmark Suite (LGSynth93)
  year: 1993
  ident: ref29
– ident: ref25
  doi: 10.1016/b978-0-7506-8397-5.x0001-3
– year: 1992
  ident: ref32
  article-title: SIS: A system for sequential circuit synthesis
  contributor:
    fullname: Sentovich
– volume-title: Synthesis Algorithms for Automata With PLAs
  year: 1987
  ident: ref46
  contributor:
    fullname: Achasova
– volume-title: Design of FPGA-Based Circuits Using Hierarchical Finite State Machines
  year: 2012
  ident: ref33
  contributor:
    fullname: Skliarova
– ident: ref31
  doi: 10.1007/978-3-642-14295-6_5
– ident: ref42
  doi: 10.1109/ICECS.2012.6463760
– ident: ref26
  doi: 10.1007/978-1-4757-3393-8
– ident: ref43
  doi: 10.3390/app10082762
– ident: ref6
  doi: 10.1007/978-1-4615-2692-6
– ident: ref15
  doi: 10.1016/j.micpro.2017.06.010
– ident: ref3
  doi: 10.1109/EURMIC.1997.617211
– ident: ref12
  doi: 10.1109/MWSCAS.2010.5548558
– volume: 30
  start-page: 745
  issue: 4
  year: 2020
  ident: ref1
  article-title: Hardware reduction for LUT-based mealy FSMs
  publication-title: Int. J. Appl. Math. Comput. Sci.
  doi: 10.34768/amcs-2020-0055
  contributor:
    fullname: Barkalov
– ident: ref10
  doi: 10.1109/TCSII.2017.2746749
– ident: ref41
  doi: 10.1049/el:20046007
– volume-title: Logic and System Design of Digital Systems
  year: 2008
  ident: ref38
  contributor:
    fullname: Baranov
– ident: ref18
  doi: 10.1134/s1064230717010129
– ident: ref20
  doi: 10.1007/978-3-030-38295-7
– ident: ref28
  doi: 10.2478/amcs-2018-0046
– ident: ref36
  doi: 10.1109/TCAD.2018.2878187
– ident: ref19
  doi: 10.1007/3-540-45716-X_36
– ident: ref35
  doi: 10.1007/978-1-4615-2742-8
– ident: ref16
  doi: 10.1142/s0218126615501017
– ident: ref21
  doi: 10.1016/j.vlsi.2016.08.001
– ident: ref2
  doi: 10.1007/978-1-4419-0504-8
– ident: ref7
  doi: 10.1109/ACCESS.2019.2895206
– ident: ref8
  doi: 10.1515/amcs-2017-0015
– ident: ref34
  doi: 10.3390/computation7040063
– volume-title: Virtex-7 family overview
  year: 2019
  ident: ref48
– ident: ref39
  doi: 10.1007/978-1-4615-6155-2
– ident: ref9
  doi: 10.1109/ASPDAC.2017.7858306
– volume-title: Synthesis and Optimization of Digital Circuits
  year: 1994
  ident: ref30
  contributor:
    fullname: De Micheli
– ident: ref17
  doi: 10.1134/s106422691302006x
– ident: ref27
  doi: 10.1007/978-3-319-24202-6
– ident: ref45
  doi: 10.1007/978-3-319-59837-6
– ident: ref13
  doi: 10.1145/2000832.2000835
– ident: ref5
  doi: 10.1007/978-3-642-36166-1
– ident: ref11
  doi: 10.1109/TCAD.2017.2731678
– ident: ref40
  doi: 10.1007/3-540-44614-1_76
SSID ssj0014529
Score 2.420646
Snippet Modern digital systems can be viewed as compositions of combinational and sequential blocks. In the article, we discuss a case when sequential blocks are...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Publisher
StartPage 1400
SubjectTerms Clocks
Digital systems
Encoding
Field programmable gate array (FPGA)
Field programmable gate arrays
Finite state machines
Integrated circuit interconnections
Logic circuits
look-up table (LUT)
Lookup tables
Mealy finite-state machine (FSM)
Measurement
Power consumption
structural decomposition
Table lookup
transformation of states
Title Reducing LUT Count for Mealy FSMs With Transformation of States
URI https://ieeexplore.ieee.org/document/9432403
https://www.proquest.com/docview/2652700212
Volume 41
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED6VTjDwKohCQR6YEElj5z0hhKgqRBggFd2i2D4LhJQimg7w67GdtKqAgc1DIjl359x3vrvvAM5lwCVlMTpURTpACWnilCKInRLTwGfcT9GO6cweovEkuJuG0w5crnphENEWn6FrljaXL2diYa7KhmlDH7cBG4nHml6tVcbAJBDtfYphjNV23GYwqZcOc_1ROhJk1PW1A_TMdPc1H2SHqvz6E1v3MtqBbLmxpqrkzV3U3BVfPzgb_7vzXdhucSa5bgxjDzpY7cPWGvtgD64eDW2rXpL7SU5Mc3pNNIQlmcaOn2T0lM3J82v9QvI1bDuryEyRBqEewGR0m9-MnXaegiO0U6-dRMWRihVKrphhWyojoeGhLxVNEKlGZp5KlFacn_rIYi_gJcasVIwKD6nUB_kQutWswiMghnePh0LJhJcBhiKNKXra3XJZmnk-vA8XSwkX7w1tRmHDDS8tjDoKo46iVUcfekZiqwdbYfVhsNRJ0R6secGi0KTKtcM9_vutE9hkpkPB1iQOoFt_LPBU44aan1mD-Qbi3r2V
link.rule.ids 315,786,790,802,27955,27956,55107
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED7xGICBV0GUpwcmRErsvCeEEFWBhgFS0S2Kk7NASA2i6QC_nrOTVhUwsHlIJOfOzvedz_cdwGnhyoKLAC2ufApQPB5aWe4GVoaR6wjpRGjadMYPfm_g3g294QKcz2phENFcPsOOHppcflHmE31UdhHV8nGLsEw4bwd1tdYsZ6BTiOZERWvG0kpucpjcji4S-iyKBQXvOASBtu7vPodCpq3Kr3-xAZjuBsTTqdX3St46k0p28q8fqo3_nfsmrDdMk13VS2MLFnC0DWtz-oMtuHzUwq00ZP1BwnR5esWIxLKY2OMn6z7FY_b8Wr2wZI7dliNWKlZz1B0YdG-S657VdFSwcoL1ygpV4KtAYSGV0HpLmZ8TQXQKxUNETtzMVqEi1zmRgyKwXZlhIDIleG4jL2gr78LSqBzhHjCtvCe9XBWhzFz08ijgaBPgyiLTHX1kG86mFk7fa-GM1AQcdpRqd6TaHWnjjja0tMVmDzbGasPh1Cdps7XGqfA9nSwnyN3_-60TWOklcT_t3z7cH8Cq0PUK5obiISxVHxM8IhZRyWOzeL4BEJTA6Q
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Reducing+LUT+Count+for+Mealy+FSMs+With+Transformation+of+States&rft.jtitle=IEEE+transactions+on+computer-aided+design+of+integrated+circuits+and+systems&rft.au=Barkalov%2C+Alexander+A.&rft.au=Titarenko%2C+Larysa&rft.au=Mielcarek%2C+Kamil&rft.date=2022-05-01&rft.pub=IEEE&rft.issn=0278-0070&rft.eissn=1937-4151&rft.volume=41&rft.issue=5&rft.spage=1400&rft.epage=1411&rft_id=info:doi/10.1109%2FTCAD.2021.3081058&rft.externalDocID=9432403
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0278-0070&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0278-0070&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0278-0070&client=summon