Journal of Theoretical and Applied Information Technology
Counting Bloom Filter (CBFs) is widely employed in networking applications. They support membership queries with minimal error and surmount the drawback of Bloom filters. However, they engross large amount of memory. A new Sidon sequence based CBF is introduced to improve the competency of the CBFs. Unlike CBF, the hashed Variable increment is queried for its present. This method achieves 24% of the improvement in false positive rate and a lower inundate probability bound than CBF. The paper is described in Verilog and simulated using Xilinx 12.1.