2009 WRI World Congress on Computer Science and Information Engineering 2009
DOI: 10.1109/csie.2009.223
|View full text |Cite
|
Sign up to set email alerts
|

HAMFAST: Fast Hamming Distance Computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…Our design avoids known problems of such circuits (namely, large capacitive loading at the comparator inputs and multiphase clock operation necessitating the use of DLL circuits) by using a We next report on the results of HSPICE evaluation of our design and a representative prior design [9] suitable for 0.15 lm CMOS technology. Similar comparisons based on different CMOS technologies have been reported in [9,10,13,16,17]. Our HSPICE comparison results are shown in Table 4.…”
Section: Speed and Cost Comparisonmentioning
confidence: 62%
See 3 more Smart Citations
“…Our design avoids known problems of such circuits (namely, large capacitive loading at the comparator inputs and multiphase clock operation necessitating the use of DLL circuits) by using a We next report on the results of HSPICE evaluation of our design and a representative prior design [9] suitable for 0.15 lm CMOS technology. Similar comparisons based on different CMOS technologies have been reported in [9,10,13,16,17]. Our HSPICE comparison results are shown in Table 4.…”
Section: Speed and Cost Comparisonmentioning
confidence: 62%
“…Most recent digital Hamming-based designs [9,10,13,16,17] also have cost-performance figures in the same general range. However, the uniqueness of our design and its broader functionality have the potential of leading to further application domains, as reported in [10].…”
Section: Speed and Cost Comparisonmentioning
confidence: 86%
See 2 more Smart Citations
“…The calculation of pairwise Hamming distances is one of the most common tasks in string metrics to measure the edit distance between two sequences [Pinheiro et al, 2012]. There are numerous algorithms to determine Hamming distances [Pappalardo et al, 2009;Zhang et al, 2013;Kopelowitz et al, 2018] and some of them are implemented as functions in programming languages (e.g. hamming_distance(x, y) in Python 2.3+ or hamming.distance(x, y) in R).…”
Section: Introductionmentioning
confidence: 99%