Efficient two stage decoding scheme to achieve content identification capacity

Farzad Farhadzadeh, Ke Sun, Sohrab Fredowsi

Abstract

We introduce a scheme to address the trade-off between the identification rate, search and memory complexities in large-scale identification systems. We use a special database organization by assigning database entries to a set of possibly overlapping clusters. The clusters are generated based on statistics of both database entries and queries. The decoding procedure is accomplished in two stages. First, a list of clusters related to the query is detected. Then, refinement checks are performed on members of the detected clusters to produce a unique index. We investigate the minimum achievable search complexity for binary symmetric sources.
BibTeX
@inproceedings{farhadzadeh2014efficient,
  author = {Farzad Farhadzadeh and Ke Sun and Sohrab Fredowsi},
  title = {{Efficient two stage decoding scheme to achieve content identification capacity}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2014},
  doi = {10.1109/icassp.2014.6854315},
}

Loading related content...

Figure