• 沒有找到結果。

A two dimensional partial-response maximum-likelihood technique for holographic data storage systems

N/A
N/A
Protected

Academic year: 2021

Share "A two dimensional partial-response maximum-likelihood technique for holographic data storage systems"

Copied!
4
0
0

加載中.... (立即查看全文)

全文

(1)

This content has been downloaded from IOPscience. Please scroll down to see the full text.

Download details:

IP Address: 140.113.38.11

This content was downloaded on 25/04/2014 at 15:43

Please note that terms and conditions apply.

A Two Dimensional Partial-Response Maximum-Likelihood Technique for Holographic Data

Storage Systems

View the table of contents for this issue, or go to the journal homepage for more 2008 Jpn. J. Appl. Phys. 47 5997

(http://iopscience.iop.org/1347-4065/47/7S1/5997)

(2)

A Two Dimensional Partial-Response Maximum-Likelihood Technique

for Holographic Data Storage Systems

Kuo-Hsin LAI1, Chien-Fu TSENG1;2, Po-Chang CHEN1, and Jenn-Hwan TARNG2

1Electronics and Optoelectronics Research Laboratories, Industrial Technology Research Institute, Hsinchu 310, Taiwan 2Department of Communication Engineering, National Chiao Tung University, Hsinchu 300, Taiwan

(Received December 1, 2007; accepted March 3, 2008; published online July 18, 2008)

In holographic data storage systems, it is straightforward to increase the storage capacity by mean of reducing the pitches among data symbols. However, this may lead to severe inter-symbol interference (ISI) and also unacceptable data error rate. To deal with the problem, we first model the channel as a partial response (PR) and use the maximum-likelihood (ML) detection to control the ISI. The Viterbi decoder is employed to implement ML detection. [DOI:10.1143/JJAP.47.5997] KEYWORDS: optical storage, holographic recording, PRML, partial response and maximum likelihood

Holographic data storage (HDS) system is currently regarded as the optical storage systems of next generation, because of its high data transfer rate and high capacity.1,2) To increase the capacity, higher density of recorded data is required. Besides, when the number of pages multiplexed in the same volume increases, a small optical aperture is necessary. This may result in pixel blurring due to diffrac-tion. Thus, the problem of inter-symbol interference (ISI) becomes severe. To overcome ISI, some methods are proposed. Kumar3) used digital equalization and low-pass

encoding to deal with ISI. Hesselink4) proposed several

detection methods, such as threshold detection and Viterbi detection, to relieve the effects of ISI. Though partial response (PR) equalization with ML detection has been widely used in many data storage systems, little is developed for HDS systems. In this paper, we would like to propose a two-dimension partial response and maximum-likelihood (2D-PRML) technique for a class of HDS channel to control the ISI and then apply to two PR models as examples.

A typical channel of the HDS system is shown in Fig. 1, where f is an N-by-M array to represent the spatial light modulator (SLM) image, g is the charge-coupled device (CCD) output image of the same dimension as f , w is the point spread function (PSF), and n denotes the noise disturbance. The CCD pixel output g½m; n is given by

g½m; n ¼ w  f þ n½m; n: ð1Þ

Here we assume that the PSF w can be decomposed as w ¼ wvwTh with vectors wv of dimension P and whof dimension

Q. Vectors wv and wh can be regarded as the channel

responses along column direction (vertical) and row direc-tion (horizontal), respectively. With the assumpdirec-tion, eq. (1) can be further derived as

g½m; n ¼ X  P P p¼ PP XQQ q¼ QQ w½p; q f ½m þ p; n þ q þ n½m; n ¼ X  P P p¼ PP XQQ q¼ QQ wv½pwh½q f ½m þ p; n þ q þ n½m; n ¼ X  P P p¼ PP wv½p XQQ q¼ QQ wh½q f ½m þ p; n þ q þ n½m; n; ð2Þ

where PP ¼ ðP  1Þ=2 and QQ ¼ ðQ  1Þ=2. If we define gp½m þ p; n ¼

XQQ q¼ QQ

wh½q f ½m þ p; n þ q: ð3Þ

Then eq. (2) becomes

g½m; n ¼ X  P P p¼ PP wv½pgp½m þ p; n þ n½m; n: ð4Þ

The pixel output is calculated in two stages. First, in eq. (3), we convolve f with wh to obtain response gp½m þ p; n

contributed by the (m þ p)th row of f . Then, eq. (4) computes the convolution of gp and wv along the column

direction for the pixel output. The HDS channel represented by eqs. (3) and (4) is plotted in Fig. 2. Decoupling of matrix w brings us an advantage to transform the 2D data detection problem into a one-dimensional (1D) case. In the following, we give two models as examples, and these models are also employed to be the PR models in numerical simulations. Then the Trellis diagrams according to the models are derived for implementing the maximum-likelihood (ML) detection.

PR Model 1: w ¼ 1 1

1 1

 

It is straightforward to know that wv ¼ ½1 1T and wh¼

½1 1T decompose w. Suppose that the data bits in f are

binary (0 or 1), and then the output levels of wh, i.e., the

levels of gp, can be calculated as 0, 1, and 2 according to

eq. (3). Since gp is just the input of block wv, we can

compute the CCD pixel output g to be either 0, 1, 2, 3, or 4 with eq. (4). If we define Si as the Trellis state for i to be the previous input, the Trellis diagram of wh can be plotted

as Fig. 3(a). In the figure, a=b denotes the information of the state transition with a 2 f0; 1g, the current input and b 2 f0; 1; 2g, the output level. Likewise, block wvwith input

w (PSF) g (CCD) n (noise) f (SLM)

Fig. 1. (Color online) Block diagram of HDS channel.



E-mail address: khlai@itri.org.tw Japanese Journal of Applied Physics Vol. 47, No. 7, 2008, pp. 5997–5999 #2008 The Japan Society of Applied Physics

5997

(3)

gp2 f0; 1; 2g and output g 2 f0; 1; 2; 3; 4g can be also

represented as the Trellis diagram in Fig. 3(b).

PR Model 2: w ¼ 1 2 1 2 4 2 1 2 1 2 6 4 3 7 5

In this case, we have wv ¼wh¼ ½1 2 1T. Now, let the

Trellis state be Sij for i the previous input and j the input before i. Along the same way as in the last case, the Trellis diagrams can be shown as Figs. 4(a) and 4(b). In Fig. 4(b), the total number of states is 25 and the pixel output levels are 0; 1; . . . ; 16. Such Trellis diagram may not be a good candidate for the design of ML Detector due to its com-plexity. To deal with this problem, we utilize the modulation code (1/3 code) proposed by Tarng et al.5)Since the input

sequence to the PR model is modulated by the encoder, the number of states and the transitions among them can be effectively reduced. This can be observed from the Trellis diagrams in Figs. 5(a) and 5(b).

In the case studies above, we decomposed the PR models into row response wh and column response wv. The new

representation transforms the channel into two 1D sub-channels connected in series. Since we have derived the Trellis diagrams, the ML detection can now be achieved by using Viterbi algorithm. First, we apply the algorithm with the Trellis diagrams of wh to the detection of the corrupted

data along row direction, and we call this process as row detector. The row detector can eliminate the ISI among pixels in the same row. The output of the row detector is then fed to the so-called column detector, which is used to tackle the ISI along column detection. The column detector is implemented with the Trellis diagram of wv, and the

Viterbi algorithm is still employed for ML detection. Since the 2D ISI is coped with for both directions, the data can be recovered successfully.

To verify the effectiveness of the proposed method, we perform computer simulations by using additive white Gaussian noise (AWGN) channel model. The results are compared with those of conventional equalization detectors — minimum mean square error (MMSE)

equal-S0 S1 1/1 0/0 0/1 1/2 S0 S1 S0 S1 S2 S0 S1 S2 0/0 1/1 2/2 0/1 1/2 2/3 0/2 1/3 2/4 (a) (b)

Fig. 3. (Color online) Trellis diagrams of PR1: (a) wv; (b) wh.

S01 S00 S10 S01 S00 S10 0/0 1/1 0/1 1/2 0/2 S11 S11 1/3 0/3 1/4 S00 S10 S01 S02 s00 s10 S01 S02 0/0 1/1 2/2 0/1 1/2 2/3 0/2 1/3 2/4 S03 S03 S04 S04 S43 s43 S44 s44 4/16 3/15 4/15 4/8 2/14 . . . . . . . . . . . . (a) (b)

Fig. 4. (Color online) Trellis diagrams of PR2: (a) wv; (b) wh.

S01 S00 S10 S01 S00 S10 0/0 1/1 0/1 1/2 0/2 S00 S10 S01 S02 S20 s00 s10 S01 S02 S20 0/0 1/1 2/2 0/1 1/2 2/3 0/2 1/3 2/4 0/1 0/2 (a) (b)

Fig. 5. (Color online) Trellis diagrams of PR2 with 1/3 modulation code: (a) wv; (b) wh. f (SLM) n (noise) wh wv

w

g (CCD) p g

Fig. 2. (Color online) Decoupled diagram of HDS channel.

Jpn. J. Appl. Phys., Vol. 47, No. 7 (2008) K.-H. LAIet al.

(4)

ization + threshold detector. The simulation results are depicted in Fig. 6. Figure 6 shows the error rate versus signal-to-noise ratio (SNR) with two methods in different PR models. In our two simulated PR channels (PR1 ¼ ½1 1T

½1 1 and PR2 ¼ ½1 2 1T ½1 2 1), the ISIs are all serious and the equalization detector is incapable of giving satis-factory result. When the 2D-ML detector is applied, it is obvious that the performance is significantly improved. Moreover, Fig. 6 shows that the 2D-ML method used in PR2 with 1/3 modulation code has the best performance among all cases.

The computation complexity of 2D-ML detection makes it inapplicable in HDS systems. To deal with such problems, this paper proposed a 2D-PRML scheme. We presented two kinds of 2D partial response models and ML detectors to control ISI completely. The simulation results also show that the 2D-PRML technique cooperated with modulation codes can offer benefits in reducing the complexity of the detector design and improving the performance of data detection.

1) L. Hesselink, S. S. Orlov, and M. C. Bashaw:Proc. IEEE 92 (2004) 1231.

2) V. Vadde and B. V. K. V. Kumar:Appl. Opt. 38 (1999) 4374. 3) V. Vadde and B. V. K. V. Kumar: Conf. Dig. Optical Data Storage,

2000, p. 113.

4) J. F. Heanue, K. Gu¨rkan, and L. Hesselink: Appl. Opt. 35 (1996) 2431. 5) J. H. Tarng, C. F. Tseng, and T. C. Chen: Optical Data Storage 2007,

OSA Tech. Dig. Ser., paper MD15.

0 5 10 15 20 25 10-4 10-3 10-2 10-1 100 SNR (dB) Error Rate Eq+Threshold Detector (PR1) 2D-ML Detector (PR1)

Eq+Threshold Detector (PR2 with 1/3 code) 2D-ML Det.(PR2 with 1/3 code)

Fig. 6. (Color online) Performance comparison.

Jpn. J. Appl. Phys., Vol. 47, No. 7 (2008) K.-H. LAIet al.

數據

Fig. 1. (Color online) Block diagram of HDS channel.
Fig. 2. (Color online) Decoupled diagram of HDS channel.
Fig. 6. (Color online) Performance comparison.

參考文獻

相關文件

In this paper, we extended the entropy-like proximal algo- rithm proposed by Eggermont [12] for convex programming subject to nonnegative constraints and proposed a class of

Using this formalism we derive an exact differential equation for the partition function of two-dimensional gravity as a function of the string coupling constant that governs the

have demonstrated using two- dimensional (2D) electronic spectroscopy that surprisingly long-lived (>660 fs) quantum coher- ences between excitonic states play an important role

Holographic dual to a chiral 2D CFT, with the same left central charge as in warped AdS/CFT, and non-vanishing left- and right-moving temperatures.. Provide another novel support to

Optim. Humes, The symmetric eigenvalue complementarity problem, Math. Rohn, An algorithm for solving the absolute value equation, Eletron. Seeger and Torki, On eigenvalues induced by

We have also discussed the quadratic Jacobi–Davidson method combined with a nonequivalence deflation technique for slightly damped gyroscopic systems based on a computation of

In the past researches, all kinds of the clustering algorithms are proposed for dealing with high dimensional data in large data sets.. Nevertheless, almost all of

Our main goal is to give a much simpler and completely self-contained proof of the decidability of satisfiability of the two-variable logic over data words.. We do it for the case