Efficient two stage decoding scheme to achieve content identification capacity

F. Farhadzadeh, K. Sun, S. Fredowsi

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4-9 May 2014, Florence, Italy
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages3814-3818
ISBN (Print)978-1-4799-2892-7
DOIs
Publication statusPublished - 2014

Fingerprint Dive into the research topics of 'Efficient two stage decoding scheme to achieve content identification capacity'. Together they form a unique fingerprint.

  • Cite this

    Farhadzadeh, F., Sun, K., & Fredowsi, S. (2014). Efficient two stage decoding scheme to achieve content identification capacity. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 4-9 May 2014, Florence, Italy (pp. 3814-3818). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICASSP.2014.6854315