2021
DOI: 10.1109/tcsii.2021.3058245
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Scheme for Real-Time Max/Min-Set-Selection Sorters on FPGA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…As the count-min does not store item keys in its table entries, it cannot be directly used to solve the top-k item query problem. An additional hardware data structure is required to maintain a record of the top key-value tuples [24][25][26]. Only a few FPGA implementations extend the basic functionality of count-min to support the top-k query.…”
Section: Fpga Implementations Of Sketch-based Algorithmsmentioning
confidence: 99%
“…As the count-min does not store item keys in its table entries, it cannot be directly used to solve the top-k item query problem. An additional hardware data structure is required to maintain a record of the top key-value tuples [24][25][26]. Only a few FPGA implementations extend the basic functionality of count-min to support the top-k query.…”
Section: Fpga Implementations Of Sketch-based Algorithmsmentioning
confidence: 99%