Share Email Print
cover

Proceedings Paper

Computationally efficient index generation unit using a Bloom filter
Author(s): Tomasz Mazurkiewicz
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Efficient implementation of index generation functions is attracting significant interest due to the dynamic development of technologies such as Big Data and Internet of Things. These functions can be realized using a circuit called index generation unit. However, the better linear transformation of an index generation function is found, the larger auxiliary memory is used. Lately, the architecture that uses probabilistic data structure was proposed. However, it requires several independent hash functions. Selecting proper hash functions is a complex issue. Thus, in this paper we analyse a structure that uses single hash function, i.e. One-Hashing Bloom Filter. It requires additional modulo stage to compute several independent hashes. However, the obtained results prove that additional computations, can be easily implemented in FPGA devices.

Paper Details

Date Published: 6 November 2019
PDF: 12 pages
Proc. SPIE 11176, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2019, 111761L (6 November 2019);
Show Author Affiliations
Tomasz Mazurkiewicz, Military Univ. of Technology (Poland)


Published in SPIE Proceedings Vol. 11176:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2019
Ryszard S. Romaniuk; Maciej Linczuk, Editor(s)

© SPIE. Terms of Use
Back to Top
PREMIUM CONTENT
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?
close_icon_gray