Error Detecting Dual Basis Bit Parallel Systolic Multiplication Architecture over GF(2m)
Access Status
Authors
Date
2009Type
Metadata
Show full item recordCitation
Source Title
Source Conference
ISBN
Faculty
School
Remarks
Copyright © 2009 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Collection
Abstract
This paper presents an error tolerant hardware efficient VLSI architecture for bit parallel systolic multiplication over dual base, which can be pipelined. This error tolerant architecture is well suited to VLSI implementation because of its regularity, modular structure, and unidirectional data flow. The length of the largest delay path and area of this architecture are less compared to the bit parallel systolic multiplication architectures reported earlier. The architecture is implemented using Austria Micro System's 0.35um CMOS technology. This architecture can also operate over both the dual-base and polynomial base.
Related items
Showing items related by title, author, creator and subject.
-
Singh, Ashutosh Kumar; Bera, A.; Rahaman, H.; Mathew, J.; Pradhan, D. (2009)An error tolerant hardware efficient very large scale integration (VLSI) architecture for bit parallel systolic multiplication over dual base, which can be pipelined, is presented. Since this architecture has the features ...
-
Devasahayam, Sheila (2023)This study relates to predicting hydrogen production using deep learning models. The co-gasification of biomass and plastics dataset used gasification temperature, particle size of biomass rubber seed shell (RSS) and ...
-
Wilkes, Daniel ; Duncan, Alec ; Marburg, Stephan (2020)© The Authors. The Fast Multipole Boundary Element Method (FMBEM) reduces the O(N2) computational and memory complexity of the conventional BEM discretized with N boundary unknowns, to O(NlogN) and O(N), respectively. A ...