Address Translation in a Compositional Microprogram Control Unit

Introduction. Digital systems consist of combinational and sequential blocks. The most important sequential blocks include control units. Control unit circuits are not typical library components of CAD systems. Due to it, the designing a control unit circuit is a more labor-intensive process than im...

Full description

Saved in:
Bibliographic Details
Published inKìbernetika ta komp'ûternì tehnologìï (Online) no. 2; pp. 88 - 100
Main Authors Barkalov, Alexandr, Titarenko, Larysa, Golovin, Oleksandr, Matvienko, Oleksandr
Format Journal Article
LanguageEnglish
Published V.M. Glushkov Institute of Cybernetics 06.06.2025
Subjects
Online AccessGet full text
ISSN2707-4501
2707-451X
2707-451X
DOI10.34229/2707-451X.25.2.8

Cover

Abstract Introduction. Digital systems consist of combinational and sequential blocks. The most important sequential blocks include control units. Control unit circuits are not typical library components of CAD systems. Due to it, the designing a control unit circuit is a more labor-intensive process than implementing systems with such common blocks as registers, counters, arithmetic and logic blocks. The purpose of the article. When implementing digital systems, problems arise in optimizing their characteristics. This paper considers the problem of reducing hardware costs in the circuits of compositional microprogram control units (CMCU). The resources of FPGA (field-programmable logic array) chips are used as an element basis. The method proposed in the article is based on the adaptation of algorithms for optimizing microprogram automata circuits to the features of CMCUs. The method is aimed at converting the addresses of some microinstructions into partial inputs. Under certain conditions, this approach can significantly simplify the block of microinstruction addressing. This approach can improve the characteristics of the CMCU circuit in comparison with other known methods. The language of graph-schemes of algorithms (GSA) is used to specify the algorithm for the CMCU operating. Results. The implementation of the CMCU circuit using such FPGA chip resources as look-up table (LUT) elements and embedded memory blocks (EMB) is considered. Optimization is achieved by using the EMB redundancy at the outputs. The proposed method allows improving such basic CMCU characteristics as the chip area occupied by the CMCU circuit, the maximum operating frequency, the total number of interconnections and the power consumption. The article presents a step-by-step algorithm for synthesizing the CMCU for a given GSA. Also, it provides an example of CMCU synthesis using the proposed method. At last, the conditions of the proposed method’s applicability are shown. Conclusions. The proposed method allows reducing the number of LUT elements in the CMCU addressing circuit. This minimization does not require any additional FPGA chip resources. Reducing the number of LUT elements is achieved by using the redundancy of the EMB block outputs. Keywords: CMCU, LUT, EMB, operator linear chains.
AbstractList Introduction. Digital systems consist of combinational and sequential blocks. The most important sequential blocks include control units. Control unit circuits are not typical library components of CAD systems. Due to it, the designing a control unit circuit is a more labor-intensive process than implementing systems with such common blocks as registers, counters, arithmetic and logic blocks. The purpose of the article. When implementing digital systems, problems arise in optimizing their characteristics. This paper considers the problem of reducing hardware costs in the circuits of compositional microprogram control units (CMCU). The resources of FPGA (field-programmable logic array) chips are used as an element basis. The method proposed in the article is based on the adaptation of algorithms for optimizing microprogram automata circuits to the features of CMCUs. The method is aimed at converting the addresses of some microinstructions into partial inputs. Under certain conditions, this approach can significantly simplify the block of microinstruction addressing. This approach can improve the characteristics of the CMCU circuit in comparison with other known methods. The language of graph-schemes of algorithms (GSA) is used to specify the algorithm for the CMCU operating. Results. The implementation of the CMCU circuit using such FPGA chip resources as look-up table (LUT) elements and embedded memory blocks (EMB) is considered. Optimization is achieved by using the EMB redundancy at the outputs. The proposed method allows improving such basic CMCU characteristics as the chip area occupied by the CMCU circuit, the maximum operating frequency, the total number of interconnections and the power consumption. The article presents a step-by-step algorithm for synthesizing the CMCU for a given GSA. Also, it provides an example of CMCU synthesis using the proposed method. At last, the conditions of the proposed method’s applicability are shown. Conclusions. The proposed method allows reducing the number of LUT elements in the CMCU addressing circuit. This minimization does not require any additional FPGA chip resources. Reducing the number of LUT elements is achieved by using the redundancy of the EMB block outputs. Keywords: CMCU, LUT, EMB, operator linear chains.
Introduction. Digital systems consist of combinational and sequential blocks. The most important sequential blocks include control units. Control unit circuits are not typical library components of CAD systems. Due to it, the designing a control unit circuit is a more labor-intensive process than implementing systems with such common blocks as registers, counters, arithmetic and logic blocks. The purpose of the article. When implementing digital systems, problems arise in optimizing their characteristics. This paper considers the problem of reducing hardware costs in the circuits of compositional microprogram control units (CMCU). The resources of FPGA (field-programmable logic array) chips are used as an element basis. The method proposed in the article is based on the adaptation of algorithms for optimizing microprogram automata circuits to the features of CMCUs. The method is aimed at converting the addresses of some microinstructions into partial inputs. Under certain conditions, this approach can significantly simplify the block of microinstruction addressing. This approach can improve the characteristics of the CMCU circuit in comparison with other known methods. The language of graph-schemes of algorithms (GSA) is used to specify the algorithm for the CMCU operating. Results. The implementation of the CMCU circuit using such FPGA chip resources as look-up table (LUT) elements and embedded memory blocks (EMB) is considered. Optimization is achieved by using the EMB redundancy at the outputs. The proposed method allows improving such basic CMCU characteristics as the chip area occupied by the CMCU circuit, the maximum operating frequency, the total number of interconnections and the power consumption. The article presents a step-by-step algorithm for synthesizing the CMCU for a given GSA. Also, it provides an example of CMCU synthesis using the proposed method. At last, the conditions of the proposed method’s applicability are shown. Conclusions. The proposed method allows reducing the number of LUT elements in the CMCU addressing circuit. This minimization does not require any additional FPGA chip resources. Reducing the number of LUT elements is achieved by using the redundancy of the EMB block outputs.
Author Matvienko, Oleksandr
Golovin, Oleksandr
Titarenko, Larysa
Barkalov, Alexandr
Author_xml – sequence: 1
  givenname: Alexandr
  orcidid: 0000-0002-4941-3979
  surname: Barkalov
  fullname: Barkalov, Alexandr
  organization: University of Zielona Gora, Poland
– sequence: 2
  givenname: Larysa
  orcidid: 0000-0001-9558-3322
  surname: Titarenko
  fullname: Titarenko, Larysa
  organization: University of Zielona Gora, Poland
– sequence: 3
  givenname: Oleksandr
  orcidid: 0000-0002-0279-812X
  surname: Golovin
  fullname: Golovin, Oleksandr
  organization: V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv
– sequence: 4
  givenname: Oleksandr
  orcidid: 0000-0003-1838-1422
  surname: Matvienko
  fullname: Matvienko, Oleksandr
  organization: V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv
BookMark eNp1kMtOAjEYRhujiYg8gLt5gRl7G9rZSYgXEowbSNg1f6ctKRmmk3aM8vYOoOxctfn-nLM4d-i6Da1F6IHggnFKq0cqsMh5STYFLQtayCs0ukzXlz8mt2iS0g5jTCuCmSxH6GlmTLQpZasIbWqg96HNfJtBNg_7LiR_HKDJ3n0dQxfDNsJ-OLV9DE22bn1_j24cNMlOft8xWr88r-Zv-fLjdTGfLfOalETmROtqKrFkTE9BMmoFGMCkBmtEKYQwoCsA0AaIYLZyWlNeU2O047SywNgYLc5eE2Cnuuj3EA8qgFenIcStgtj7urFKV4xIDbWjJeeaM-m40cJxTK0jhk4HFz27PtsODl_QNBchweqUVB2bqaHft6KlokoOEDlDQ4iUonX_M5s_5geijHu8
Cites_doi 10.1561/1000000005
10.34229/2707-451X.24.4.11
10.1007/978-3-540-69285-0
10.1007/978-3-030-60488-2
10.3390/computation7040063
10.1109/mssc.2018.2822862
10.1007/978-3-319-04708-9_6
10.2478/amcs-2018-0046
10.1007/978-1-4615-2692-6
10.1109/ACCESS.2020.2988379
10.1145/3174243.3174272
ContentType Journal Article
DBID AAYXX
CITATION
ADTOC
UNPAY
DOA
DOI 10.34229/2707-451X.25.2.8
DatabaseName CrossRef
Unpaywall for CDI: Periodical Content
Unpaywall
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Sciences (General)
EISSN 2707-451X
EndPage 100
ExternalDocumentID oai_doaj_org_article_b9318bacf2544b438f4db7f402ef1d26
10.34229/2707-451x.25.2.8
10_34229_2707_451X_25_2_8
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
ADTOC
UNPAY
ID FETCH-LOGICAL-c1518-1bb9680833b6a832e7ada01caed75777dab9aaabda173e9fbb24c2ddbf429ea33
IEDL.DBID DOA
ISSN 2707-4501
2707-451X
IngestDate Fri Oct 03 12:51:13 EDT 2025
Mon Sep 15 10:01:51 EDT 2025
Wed Oct 01 05:59:18 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License https://creativecommons.org/licenses/by-nc-sa/4.0
cc-by-nc
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1518-1bb9680833b6a832e7ada01caed75777dab9aaabda173e9fbb24c2ddbf429ea33
ORCID 0000-0002-0279-812X
0000-0003-1838-1422
0000-0001-9558-3322
0000-0002-4941-3979
OpenAccessLink https://doaj.org/article/b9318bacf2544b438f4db7f402ef1d26
PageCount 13
ParticipantIDs doaj_primary_oai_doaj_org_article_b9318bacf2544b438f4db7f402ef1d26
unpaywall_primary_10_34229_2707_451x_25_2_8
crossref_primary_10_34229_2707_451X_25_2_8
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2025-6-6
PublicationDateYYYYMMDD 2025-06-06
PublicationDate_xml – month: 06
  year: 2025
  text: 2025-6-6
  day: 06
PublicationDecade 2020
PublicationTitle Kìbernetika ta komp'ûternì tehnologìï (Online)
PublicationYear 2025
Publisher V.M. Glushkov Institute of Cybernetics
Publisher_xml – name: V.M. Glushkov Institute of Cybernetics
References ref13
ref12
ref15
ref14
ref11
ref10
ref0
ref2
ref1
ref17
ref16
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref5
  doi: 10.1561/1000000005
– ident: ref14
  doi: 10.34229/2707-451X.24.4.11
– ident: ref2
  doi: 10.1007/978-3-540-69285-0
– ident: ref3
– ident: ref11
  doi: 10.1007/978-3-030-60488-2
– ident: ref1
  doi: 10.3390/computation7040063
– ident: ref7
– ident: ref9
  doi: 10.1109/mssc.2018.2822862
– ident: ref4
  doi: 10.1007/978-3-319-04708-9_6
– ident: ref15
  doi: 10.2478/amcs-2018-0046
– ident: ref6
  doi: 10.1007/978-1-4615-2692-6
– ident: ref13
  doi: 10.1109/ACCESS.2020.2988379
– ident: ref8
– ident: ref0
– ident: ref16
– ident: ref10
– ident: ref17
– ident: ref12
  doi: 10.1145/3174243.3174272
SSID ssj0002910385
ssib044750725
Score 2.2961152
Snippet Introduction. Digital systems consist of combinational and sequential blocks. The most important sequential blocks include control units. Control unit circuits...
SourceID doaj
unpaywall
crossref
SourceType Open Website
Open Access Repository
Index Database
StartPage 88
SubjectTerms cmcu
emb
lut
operator linear chains
SummonAdditionalLinks – databaseName: Unpaywall
  dbid: UNPAY
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB7B9gAcgPJQl5d84MBDSTZOHCc3thVVhdSKAystpzB-SRVtGrG7ovDrmUm8VRHiALfIsmLFM-OZT_n8DcBL8gmdOyUTvq-clKEMiUFlE-d0qTDkLjR8d_j4pDpalB-Warntc5pl1rJ0Kf_BTzeYnZ5TTK0yd2FX2TzyxBitq6zHniC8VK1s67R34SbsVIqK8QnsLE4-zj9zSzk9Y0XvoQFyfM6X43_NopSyybaDl6lUqUzr3zLTIOB_B25tuh5_fMezs2tZ5_AefNne3RnJJl_Tzdqk9uefUo7_-0H34W6sSEWcuAs3fPcAdmPMr8SrKEz9-iG8mzvH6FwMCW4k0YnTTqDgUyWyv-hVx0zyi8QvcTBy4QUXt49gcfj-08FREjswJJYqAYKXxjTcm6MoTIUU-16jw1lu0TuttNYOTYOIxmGuC98EY2RppXMmUJrzWBSPYdJddH4PBFXx3tbG6iaQF9TYEO5SOda18rMZBj2FN9vdb_tRaKMlgDKYqmVTtWy_uENT2Gf7XE1kjexhgPa5jSHXmobOK4M2sAqbKYs6lM7oQIDZkw_Kagpvr6z79yUv45JP_mn2U7jNZh04ZdUzmKy_bfxzql7W5kX00F_7l-v_
  priority: 102
  providerName: Unpaywall
Title Address Translation in a Compositional Microprogram Control Unit
URI http://cctech.org.ua/images/docs/Articles/2025/paper_25_2_8.pdf
https://doaj.org/article/b9318bacf2544b438f4db7f402ef1d26
UnpaywallVersion publishedVersion
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2707-451X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0002910385
  issn: 2707-451X
  databaseCode: DOA
  dateStart: 20200101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2707-451X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssib044750725
  issn: 2707-4501
  databaseCode: M~E
  dateStart: 20200101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA6iB_UgPrE-Sg4efLDtbnbTbG7WYilCxYOFegqTTQJCWYu2qP_ezG4s9SBevIYlWb6ZZGZ2v3xDyJn3CZEYziK8rxxlLnORBl5ExoiMg0uMk3h3eHjfGYyyuzEfL7X6Qk5YLQ9cA9fW0nudhsKhlpbO0txlRgvnyx7rZ2KV2Hacy6ViynsSqtjFIngqnslMohA48hmZiFHoO07qX5xpxphsh8Fk3GK8xVr5jyBVaflvkvV5OYXPd5hMlgJQf5tshcyRdus33iErttwlO2FvvtHzICB9sUeuu8ZgFU2rQFST3ehzSYHi7g8sLT_VEMl4gaBFezVnnWISuk9G_dvH3iAKnRKiwkdsXwZqLbGHRprqDvg9agUYiJMCrBFcCGFASwDQBhKRWum0ZlnBjNHOhyMLaXpAVsuX0h4S6rNtW-S6ENJ5a-UgfX3EE8hzbuMYnGiQy29o1LQWxFC-kKhwVIijQhwV44qpvEFuELzFg6hlXQ14C6tgYfWXhRvkagH970t-hCWP_mPJY7LBsM8vfm3pnJDV2evcnvrkY6ablZ81ydro_qH79AXLO9O5
linkProvider Directory of Open Access Journals
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB7B9gAcgPJQl5d84MBDSTZOHCc3thVVhdSKAystpzB-SRVtGrG7ovDrmUm8VRHiALfIsmLFM-OZT_n8DcBL8gmdOyUTvq-clKEMiUFlE-d0qTDkLjR8d_j4pDpalB-Warntc5pl1rJ0Kf_BTzeYnZ5TTK0yd2FX2TzyxBitq6zHniC8VK1s67R34SbsVIqK8QnsLE4-zj9zSzk9Y0XvoQFyfM6X43_NopSyybaDl6lUqUzr3zLTIOB_B25tuh5_fMezs2tZ5_AefNne3RnJJl_Tzdqk9uefUo7_-0H34W6sSEWcuAs3fPcAdmPMr8SrKEz9-iG8mzvH6FwMCW4k0YnTTqDgUyWyv-hVx0zyi8QvcTBy4QUXt49gcfj-08FREjswJJYqAYKXxjTcm6MoTIUU-16jw1lu0TuttNYOTYOIxmGuC98EY2RppXMmUJrzWBSPYdJddH4PBFXx3tbG6iaQF9TYEO5SOda18rMZBj2FN9vdb_tRaKMlgDKYqmVTtWy_uENT2Gf7XE1kjexhgPa5jSHXmobOK4M2sAqbKYs6lM7oQIDZkw_Kagpvr6z79yUv45JP_mn2U7jNZh04ZdUzmKy_bfxzql7W5kX00F_7l-v_
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=Address+Translation+in+a+Compositional+Microprogram+Control+Unit&rft.jtitle=K%C3%ACbernetika+ta+komp%27%C3%BBtern%C3%AC+tehnolog%C3%AC%C3%AF+%28Online%29&rft.au=Alexandr+Barkalov&rft.au=Larysa+Titarenko&rft.au=Oleksandr+Golovin&rft.au=Oleksandr+Matvienko&rft.date=2025-06-06&rft.pub=V.M.+Glushkov+Institute+of+Cybernetics&rft.issn=2707-4501&rft.eissn=2707-451X&rft.issue=2&rft.spage=88&rft.epage=100&rft_id=info:doi/10.34229%2F2707-451X.25.2.8&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_b9318bacf2544b438f4db7f402ef1d26
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2707-4501&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2707-4501&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2707-4501&client=summon