Abstract

We consider the retrieval of data from a time-domain spectral hole-burning (SHB) memory system. A new iterative log-likelihood (ILL) algorithm is used to reliably detect corrupted retrieved data signals. It is a blockwise technique that takes advantage of the known SHB system characteristics to mitigate time-varying intersymbol interference and detector shot noise. We present bit-error-rate results obtained with the ILL algorithm and five other typical methods (i.e., precompensator, simple threshold, adaptive threshold, a simple Wiener filter, and an adaptive Wiener filter). Results show that the ILL algorithm outperforms all five techniques and hence offers improved SHB storage capacity. In a SHB system with typical material parameters, we find that ILL offers a storage capacity gain of 197% as compared with simple thresholding.

© 2001 Optical Society of America

Soft-decision array decoding for volume holographic memory systems

Wu-chun Chou and Mark A. Neifeld
J. Opt. Soc. Am. A 18(1) 185-194 (2001)

Hole burning, Stark effect, and data storage: 2: holographic recording and detection of spectral holes

Cosimo De Caro, Alois Renn, and Urs P. Wild
Appl. Opt. 30(20) 2890-2898 (1991)

Parallel detection algorithm for page-oriented optical memories

Brian M. King and Mark A. Neifeld
Appl. Opt. 37(26) 6275-6298 (1998)

Demonstration of a radio-frequency spectrum analyzer based on spectral hole burning

Loïc Ménager, Ivan Lorgeré, Jean-Louis Le Gouët, Daniel Dolfi, and Jean-Pierre Huignard
Opt. Lett. 26(16) 1245-1247 (2001)

Optical implementation of quadratic associative memory by use of persistent spectral hole-burning media

Olavi Ollikainen
Appl. Opt. 32(11) 1943-1947 (1993)