Sample Complexity of the Boolean Multireference Alignment Problem
Author(s): Abbe, Emmanuel A; Pereira, Joao M; Singer, Amit
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1qt02
Abstract: | The Boolean multireference alignment problem consists in recovering a Boolean signal from multiple shifted and noisy observations. In this paper we obtain an expression for the error exponent of the maximum A posteriori decoder. This expression is used to characterize the number of measurements needed for signal recovery in the low SNR regime, in terms of higher order autocorrelations of the signal. The characterization is explicit for various signal dimensions, such as prime and even dimensions. |
Publication Date: | 2017 |
Electronic Publication Date: | 2017 |
Citation: | Abbe, Emmanuel, Pereira, Joao M, Singer, Amit. (2017). Sample Complexity of the Boolean Multireference Alignment Problem. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 1316 - 1320 |
Pages: | 1316 - 1320 |
Type of Material: | Conference Article |
Journal/Proceeding Title: | 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.