Alternate memory compression schemes for modular multiplication

Parhami, Behrooz; Lai, Huibin

doi:10.1109/78.205736

Search citation statements

Order By: Relevance

Paper Sections

Select...

Division In Conventional Representation1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

2020

Publication Types

Select...

Article2

Other2

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The simplicity and speed are the advantages of RNS arithmetic and is paramount in DNA sequencing. The Fig.1 below depicts the structure of an adder, subtractor and multiplier for RNS arithmetic [14]. This representation solve the problem of carry propagation with 6-bits residues, each operation require a 4k*6, look up table can be implemented with 9kb of memory.…”

Section: Division In Conventional Representationmentioning

confidence: 99%

RNS Bases in Computer Architecture for DNA Sequence Application

Olatunbosun

Adam²,

Gbolagade

2020

int. jour. eng. com. sci

View full text Add to dashboard Cite

In this paper we present an RNS algorithm and architecture implementation of gene sequence applications based on an existing RNS arithmetic algorithm. Investigation was made on RNS application and its inherent arithmetic advantages; data conversion algorithm from Decimal/Binary to RNS; the forward conversion; Conversion from RNS to Binary/Decimal; the reverse conversion using the Chinese remainder theorem CRT, conversion from RNS to mixed radix form with capability for effective computation performance, and analysis of Smith Waterman Algorithm based on DNA sequence computing. Its limitations and open issues for future research were highlighted.

show abstract

Section: Division In Conventional Representationmentioning

confidence: 99%