2013 IEEE Symposium on Computers &Amp; Informatics (ISCI) 2013
DOI: 10.1109/isci.2013.6612389
|View full text |Cite
|
Sign up to set email alerts
|

Zero-delay FPGA-based odd-even sorting network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…4) Odd-Even Sort: Odd-even sort has the potential to reduce memory accesses and improve performance for KNN [8]. This algorithm consists of two phases, an even phase and an odd phase, in which pairs of elements in a dataset are compared and swapped.…”
Section: B Sorting Algorithms Used By Knnmentioning
confidence: 99%
See 1 more Smart Citation
“…4) Odd-Even Sort: Odd-even sort has the potential to reduce memory accesses and improve performance for KNN [8]. This algorithm consists of two phases, an even phase and an odd phase, in which pairs of elements in a dataset are compared and swapped.…”
Section: B Sorting Algorithms Used By Knnmentioning
confidence: 99%
“…Odd-even sort is similar, its alternating sorting steps are suitable for parallel platforms but require lots of resources. It is possible to minimize memory use with small datasets for both algorithms, however this is not applicable to machine learning applications and algorithms like KNN, doubly so here as a result of the limited resources of the low-cost FPGA platform [6] [8]. Additionally, both do not take advantage of the k parameter to reduce sorting operations, slowing KNN significantly.…”
Section: Hls Simulationmentioning
confidence: 99%
“…The process is repeated until the array elements are sorted, with Odd and Even Phases occurring in each iteration. We execute a bubble sort on odd indexed elements in the odd phase and an even phase bubble sort on even indexed elements [37]. This process is repeated for each alternating index (odd-even pair, evenodd pair) until no swapping operations are necessary and the array is sorted.…”
Section: Introductionmentioning
confidence: 99%