2012
DOI: 10.1145/2093339.2093343
|View full text |Cite
|
Sign up to set email alerts
|

A new architecture for FPGA based implementation of conversion of binary to double base number system (DBNS) using parallel search technique

Abstract: Compute intensive signal Processing Algorithms demand efficient execution of high performance arithmetic operations. Since, double base number system (DBNS) offers high performance arithmetic units, it is gaining attention to many researchers .However, the advantage of DBNS can not be exploited due to large conversion time from binary to DBNS. Keeping this issue in view, this paper presents a novel conversion scheme using parallel search technique.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…To implement binary to DBNS conversion different approaches are used like Binary Search Tree (BST) [14] Range Table Search (RTS) [15], Improved Range Table Search (IRTS) [13], etc. Among all these approaches the IRTS approach is more advantageous in the aspects of time and hardware complexity compared to other approaches.…”
Section: Conversion Of Binary To Dbnsmentioning
confidence: 99%
“…To implement binary to DBNS conversion different approaches are used like Binary Search Tree (BST) [14] Range Table Search (RTS) [15], Improved Range Table Search (IRTS) [13], etc. Among all these approaches the IRTS approach is more advantageous in the aspects of time and hardware complexity compared to other approaches.…”
Section: Conversion Of Binary To Dbnsmentioning
confidence: 99%
“…In [8], 10 to 72 points have to be pre-computed and stored (a better usage of silicon area should be a parallel architecture). In [12], an FPGA implementation of binary to DBNS conversion is proposed but only for very small operands (n ≤ 20 bits) in signal processing applications.…”
Section: B Scalar Multiplication Using Double-base Number Systemmentioning
confidence: 99%
“…So, instead of conventional TNS multiplier, Double Base Ternary Number System (DBTNS) multiplier can help to reduce the complexity of multiplication [8] [9]. But, major bottleneck is the extraction of indices ([i, j] pair) [10] while converting ternary number to double base number. For implementing DBTNS conversion, LUT based approach has been adopted [11].…”
Section: Introductionmentioning
confidence: 99%