A Binary Stacker via Barrel Shifters

U. Kumar, A. Fam
{"title":"A Binary Stacker via Barrel Shifters","authors":"U. Kumar, A. Fam","doi":"10.1109/SCOReD50371.2020.9251027","DOIUrl":null,"url":null,"abstract":"Stacking, or grouping all set bits in a binary sequence together, is used recently to design a fast parallel (6,3) counter, and a novel approximate (4,2) compressor. These circuits use blocks of a stacking circuit, that can stack only three bits long binary sequences. This paper presents a new procedure to stack set bits in an N bits long binary sequence, for any N, in $\\mathrm{O}({log}[N])$ stages. Design of fast parallel binary counters using the proposed stacking method, is also discussed.","PeriodicalId":142867,"journal":{"name":"2020 IEEE Student Conference on Research and Development (SCOReD)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Student Conference on Research and Development (SCOReD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCOReD50371.2020.9251027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Stacking, or grouping all set bits in a binary sequence together, is used recently to design a fast parallel (6,3) counter, and a novel approximate (4,2) compressor. These circuits use blocks of a stacking circuit, that can stack only three bits long binary sequences. This paper presents a new procedure to stack set bits in an N bits long binary sequence, for any N, in $\mathrm{O}({log}[N])$ stages. Design of fast parallel binary counters using the proposed stacking method, is also discussed.
通过桶移位器的二进制堆叠器
将二进制序列中的所有集位堆叠或分组在一起,最近被用于设计快速并行(6,3)计数器和新颖的近似(4,2)压缩器。这些电路使用堆叠电路的块,只能堆叠3位长的二进制序列。在$\ mathm {O}({log}[N])$阶段中,对任意N位的N位长二进制序列中的集合位进行堆栈。本文还讨论了利用所提出的堆叠方法设计快速并行二进制计数器的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信