基于结构单元组合级联的任意位置换的实现

O.K. Teslenko, M.Y. Bondarchuk
{"title":"基于结构单元组合级联的任意位置换的实现","authors":"O.K. Teslenko, M.Y. Bondarchuk","doi":"10.31649/1999-9941-2023-57-2-63-77","DOIUrl":null,"url":null,"abstract":"The most crucial aspects of permutations are their speed and ease of implementation. This article examines the implementation of arbitrary bitness permutations in computer engineering using a particular class of combination structures with linear complexity, namely, combined cascades of structural units. The reflection formed by this linear structure is identical to that of the corresponding Mealy finite state machine, which allows for the exploration of the properties of structural units and the cascade in the context of the theory of digital automata. The purpose of this permutation is to convert large volumes of data using hardware or software quickly and simply that can be used in various research fields. The paper investigates the bijectivity and equivalence of the reflection and presents an algorithm for constructing finitestate machines for both direct and inverted permutations, along with examples of state and output table construction. The article also provides examples of hardware implementation using field-programmable gate arrays and estimates the size of state and output tables for software implementation. The theoretical speed of bijective reflection transformations is calculated for both field-programmable gate arrays and software implementation, and the paper compares the speed of software implementations based on combined and one-dimensional cascades of constructive units. The practical verification of processing speed is made with software implementation. Finally, the article proposes areas of application for this arbitrary bitness permutation.","PeriodicalId":479698,"journal":{"name":"Ìnformacìjnì tehnologìï ta kompʼûterna ìnženerìâ","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"IMPLEMENTATION OF ARBITRARY BITNESS PERMUTATIONS BASED ON COMBINED CASCADES OF STRUCTURAL UNITS\",\"authors\":\"O.K. Teslenko, M.Y. Bondarchuk\",\"doi\":\"10.31649/1999-9941-2023-57-2-63-77\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The most crucial aspects of permutations are their speed and ease of implementation. This article examines the implementation of arbitrary bitness permutations in computer engineering using a particular class of combination structures with linear complexity, namely, combined cascades of structural units. The reflection formed by this linear structure is identical to that of the corresponding Mealy finite state machine, which allows for the exploration of the properties of structural units and the cascade in the context of the theory of digital automata. The purpose of this permutation is to convert large volumes of data using hardware or software quickly and simply that can be used in various research fields. The paper investigates the bijectivity and equivalence of the reflection and presents an algorithm for constructing finitestate machines for both direct and inverted permutations, along with examples of state and output table construction. The article also provides examples of hardware implementation using field-programmable gate arrays and estimates the size of state and output tables for software implementation. The theoretical speed of bijective reflection transformations is calculated for both field-programmable gate arrays and software implementation, and the paper compares the speed of software implementations based on combined and one-dimensional cascades of constructive units. The practical verification of processing speed is made with software implementation. Finally, the article proposes areas of application for this arbitrary bitness permutation.\",\"PeriodicalId\":479698,\"journal\":{\"name\":\"Ìnformacìjnì tehnologìï ta kompʼûterna ìnženerìâ\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ìnformacìjnì tehnologìï ta kompʼûterna ìnženerìâ\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31649/1999-9941-2023-57-2-63-77\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ìnformacìjnì tehnologìï ta kompʼûterna ìnženerìâ","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31649/1999-9941-2023-57-2-63-77","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

排列最关键的方面是它们的速度和易于实现。本文研究了计算机工程中任意位置换的实现,使用一类具有线性复杂性的组合结构,即结构单元的组合级联。这种线性结构形成的反射与相应的Mealy有限状态机的反射相同,允许在数字自动机理论的背景下探索结构单元和级联的性质。这种排列的目的是使用硬件或软件快速而简单地转换大量数据,可用于各种研究领域。本文研究了反射的对偶性和等价性,给出了构造正置换和倒置换有限机的算法,并给出了构造状态表和输出表的例子。本文还提供了使用现场可编程门阵列的硬件实现示例,并估计了软件实现的状态和输出表的大小。计算了现场可编程门阵列和软件实现双射反射变换的理论速度,并比较了基于构造单元组合级联和一维级联的软件实现速度。通过软件实现对处理速度进行了实际验证。最后,文章提出了这种任意位置换的应用领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
IMPLEMENTATION OF ARBITRARY BITNESS PERMUTATIONS BASED ON COMBINED CASCADES OF STRUCTURAL UNITS
The most crucial aspects of permutations are their speed and ease of implementation. This article examines the implementation of arbitrary bitness permutations in computer engineering using a particular class of combination structures with linear complexity, namely, combined cascades of structural units. The reflection formed by this linear structure is identical to that of the corresponding Mealy finite state machine, which allows for the exploration of the properties of structural units and the cascade in the context of the theory of digital automata. The purpose of this permutation is to convert large volumes of data using hardware or software quickly and simply that can be used in various research fields. The paper investigates the bijectivity and equivalence of the reflection and presents an algorithm for constructing finitestate machines for both direct and inverted permutations, along with examples of state and output table construction. The article also provides examples of hardware implementation using field-programmable gate arrays and estimates the size of state and output tables for software implementation. The theoretical speed of bijective reflection transformations is calculated for both field-programmable gate arrays and software implementation, and the paper compares the speed of software implementations based on combined and one-dimensional cascades of constructive units. The practical verification of processing speed is made with software implementation. Finally, the article proposes areas of application for this arbitrary bitness permutation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ANALYSIS OF THE ARCHITECTURE OF SUCCESSIVE APPROXIMATION REGISTER ADC AND APPROACHES TO ITS IMPROVEMENT IMPROVEMENT OF ASSIGNING TASKS METHOD FOR THE VEHICLE MAINTENANCE EMPLOYEES BASED ON GENETIC AND HUNGARIAN ALGORITHMS IMPLEMENTATION OF ARBITRARY BITNESS PERMUTATIONS BASED ON COMBINED CASCADES OF STRUCTURAL UNITS OBJECT-ORIENTED IMPLEMENTATION OF A WEB APPLICATION FOR TRAFFIC SIMULATION DECISION-MAKING SUPPORT SYSTEM FOR DETERMINING THE FITNESS OF SCIENTIFIC AND EDUCATIONAL ACTIVITY OBJECTS TO SCIENTIFIC AND EDUCATIONAL FIELDS AND SPECIALTIES
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1