References. [Abbott, 1991] Abbott, W. 1. (1991). Adaptive Equalization and Coding for Magnetic Recording Channels. PhD thesis, Stanford University.

Transcription

1 References [Abbott, 1991] Abbott, W. 1. (1991). Adaptive Equalization and Coding for Magnetic Recording Channels. PhD thesis, Stanford University. [Altekar, 1997] Altekar, S. (1997). Detection and Coding Techniques for Magnetic Recording Channels. PhD thesis, UC. San Diego. [Bahl et al., 1974] Bahl, L. R., Cocke, J., Jelinek, F., and Raviv, J. (1974). Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans Inform Theory, 20: [Barbulescu and Pietrobon, 1995] Barbulescu, A. and Pietrobon, S. (1995). Terminating the trellis of turbo-codes in the same state. Electron Lett, 31(1):22-3. [Bednarz, 1997] Bednarz, P. S. (1997). Decision Feedback Detection for the Digital Magnetic Recording Channel. PhD thesis, Stanford University. [Benedetto et al., 1996a] Benedetto, S., Divsalar, D., Montorsi, G., and Pollara, F. (1996a). Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding. TDA Progress Report, :1-26. [Benedetto et al., 1996b] Benedetto, S., Divsalar, D., Montorsi, G., and Pollara, F. (1996b). A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes. TDA Progress Report, : [Benedetto et al., 1998] Benedetto, S., Garello, R., and Montorsi, G. (1998). A search for good convolutional codes to be used in the construction of turbo codes. IEEE Trans Commun, 46(9):

2 142 CODING AND ITERATIVE DETECTION FOR STORAGE [Benedetto and Montorsi, 1996a] Benedetto, S. and Montorsi, G. (1996a). Design of parallel concatenated convolutional codes. IEEE Trans Commun, 44(5): [Benedetto and Montorsi, 1996b] Benedetto, S. and Montorsi, G. (1996b). Unveiling turbo codes: Some results on paralle concatenated coding schemes. IEEE Trans Inform Theory, 42: [Bergmans, 1986a] Bergmans, J. W. M. (1986a). Density improvements in digital magnetic recording by decision feedback equalization. IEEE Trans Magn, 22(3): [Bergmans, 1986b] Bergmans, J. W. M. (1986b). Discrete-time models for digital magnetic recording. Philips J Res, 41(6): [Bergmans, 1987] Bergmans, J. W. M. (1987). Partial response equalization. Philips J Res, 42(2): [Bergmans, 1996] Bergmans, J. W. M. (1996). Digital Baseband Transmission and Recording. Kluwer Academic Publishers. [Berrou et al., 1993] Berrou, C., Glavieux, A., and Thitimajshima, P. (1993). Near shannon limit error-correcting coding and decoding: Turbo-codes. In Proc IEEE Inti Conf Commun, pages , Geneva. [Bertram, 1994] Bertram, H. N. (1994). Theory of Magnetic Recording. Cambridge University Press. [Bliss, 1997] Bliss, W. (1997). An 8/9 rate time-varying trellis code for high density magnetic recording. IEEE Trans Magn, 33(5): [Caire et al., 1995] Caire, G., Taricco, G., and Biglieri, E. (1995). On the convergence of the iterated decoding algorithm. In Proc IEEE Intl Bymp Inform Theory, page 472. [Caroselli and Wolf, 1995] Caroselli, J. and Wolf, J. K. (1995). A new model for media noise in thin film magnetic recording media. In Proc SP IE, volume 2605, pages [Cheng, 1989] Cheng, D. K. (1989). Field and Wave Electromagnetics. Addison-Wesley. [Cideciyan et al., 1992] Cideciyan, R. D., Dolivo, F., Hermann, R., Hirt, W., and Schott, W. (1992). A PRML system for digital magnetic recording. IEEE J Bel Areas Commun, 1O(1):38-56.

3 References 143 [Cioffi, 1986] Cioffi, J. M. (1986). Least-squares storage channel identification. IBM J Res Dev, 30(3):31O-20. [Cioffi, 1999a] Cioffi, J. M. (1999a). Class Notes on Digital Comminicaton (Part I). Stanford University. [Cioffi, 1999b] Cioffi, J. M. (1999b). Class Notes on Digital Comminicaton (Part II). Stanford University. [Cioffi et al., 1990] Cioffi, J. M., Abbott, W. L., Thapar, H. K., Melas, C. M., and Fisher, K. D. (1990). Adaptive equalization in magneticdisk storage channels. IEEE Commun Mag, 28(2): [Conway, 1998] Conway, T. (1998). A new target response with parity coding for high density magnetic recording channels. IEEE Trans Magn, 34(4): [Cooper, 1990] Cooper, G. (1990). The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 60: [Dae-Young Kim, 1997] Dae-Young Kim (1997). Synchronization for All Digital Receivers. PhD thesis, Stanford University. [Davey and MacKay, 1998] Davey, M. C. and MacKay, D. J. C. (1998). Low density parity check codes over GF{q). IEEE Commun Lett, 2(6): [Oberg et al., 1997] Oberg, M., Vityaev, A., and Siegel, P. H. (1997). The effect of puncturing in turbo encoders. In Proc Inti Symp Turbo Codes & Related Topics, pages [Divsalar et al., 1995] Divsalar, D., Dolinar, S., Pollara, F., and M celiece, R. J. (1995). Transfer function bounds on the performance of turbo codes. TDA Progress Report, : [Divsalar and Pollara, 1995] Divsalar, D. and Pollara, F. (1995). On the design of turbo codes. TDA Progress Report, : [Dolinar and Divsalar, 1995] Dolinar, S. and Divsalar, D. (1995). Weight distributions for turbo codes using random and nonrandom permutations. TDA Progress Report, : [Dolivo, 1989] Dolivo, F. (1989). Signal processing for high-density digital magnetic recording. In Proc IEEE VLSI and Computer Peripherals, pages

4 144 CODING AND ITERATIVE DETECTION FOR STORAGE [Dolivo et al., 1989] Dolivo, F., Schott, W., and Ungerbock, G. {1989}. Fast timing recovery for partial-response signaling systems. In Proc IEEE Intl Conf Commun, pages , Boston. [Duman and Salehi, 1997] Duman, T. M. and Salehi, M. {1997}. New performance bounds for turbo codes. In Proc IEEE GlobeCom, pages 634-8, Phoenix. [Erfanian et al., 1994] Erfanian, J. A., Pasupathy, S., and Gulak, G. {1994}. Reduced complexity symbol detectors with parallel structures for lsi channels. IEEE Trans Commun,42: [Fan, 1999] Fan, J. L. {1999}. A soft cancellation technique for detecting an undersampled binary signal. unpublished report. [Fitzpatrick, 1998] Fitzpatrick, K. K. {1998}. A reduced complexity EPR4 post-processor. IEEE Trans Magn, 34{1}: [Fitzpatrick and Modlin, 1997] Fitzpatrick, K. K. and Modlin, C. S. {1997}. Time-varing MTR codes for high density magnetic recoding. In Proc IEEE GlobeCom, pages , Phoenix. [Forney, 1972] Forney, G. D. {1972}. Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference. IEEE Trans Inform Theory, 18{3}: [Forney, 1973] Forney, G. D. {1973}. The Viterbi algorithm. Proc IEEE, 61{3}: [Forney, 1997] Forney, G. D. {1997}. On iterative decoding and the twoway algorithm. In Proc Inti Symp Turbo Codes & Related Topics, pages 12-25, Brest. [Forney and Ungerboeck, 1998] Forney, G. D. and Ungerboeck, G. {1998}. Modulation and coding for linear Gaussian channels. IEEE Trans Inform Theory, 44{6}: [Franz and Anderson, 1998] Franz, V. and Anderson, J. B. {1998}. Concatenated decoding with a reduced-search BCJR algorithm. IEEE J Sel Areas Commun, 16{2}: [Fredrickson, 1993] Fredrickson, L. {1993}. Time-varying modulo n trellis codes for input restricted partial response channels. U.S. Patent 5,257,272. [Frey and Kschischang, 1998] Frey, B. J. and Kschischang, F. R. {1998}. Early detection and trellis splicing: Reduced-complexity iterative decoding. IEEE J Sel Areas Commun, 16{2}:153-9.

5 References 145 [Gallager, 1962] Gallager, R. G. (1962). Low-density parity check codes. IRE Trans. Inform. Theory, IT-8:21-8. [Gallager, 1963] Gallager, R. G. (1963). Codes. M.I.T. Press. Low-Density Parity Check [Gardner, 1993] Gardner, F. M. (1993). Interpolation in Digital Modems - Part I: Fundamentals. IEEE Trans Commun, 41: [Gersho and Lim, 1981] Gersho, A. and Lim, T. (1981). Adaptive cancellation of intersymbol interference for data transmission. Bell Systems Tech J, 60: l. [Glavieux et al., 1997] Glavieux, A., Laot, C., and Labat, J. (1997). Turbo equalization over a frequency selective channel. In Proc Intl Symp on Turbo Codes f.1 Related Topics, pages , Brest. [Hagenauer, 1995] Hagenauer, J. (1995). Source-controlled channel decoding. IEEE Trans Commun, 43(9): [Hagenauer, 1997] Hagenauer, J. (1997). The turbo principal: Tutorial introduction and state of art. In Proc Inti Symp on Turbo Codes f.1 Related Topics, pages 1-11, Brest. [Hagenauer and Hoeher, 1989] Hagenauer, J. and Hoeher, P. (1989). A Viterbi algorithm with soft-decision outputs and its applications. In Proc IEEE GlobeCom, pages , Dallas. [Hagenauer et al., 1996] Hagenauer, J., Offer, E., and Papke, L. (1996). Iterative decoding of binary block and convolutional codes. IEEE Trans Inform Theory, 42(2): [Heckerman and Wellman, 1995] Heckerman, D. and Wellman, M. P. (1995). Bayesian's networks. Commun ACM, 38: [Immink et al., 1998] Immink, K., Siegel, P., and Wolf, J. (1998). Codes for digital recorders. IEEE Trans Inform Theory, 44: [Immink, 1991] Immink, K. A. S. (1991). Coding Techniques for Digital Recorders. Prentice-Hall. [Karabed and Siegel, 1991] Karabed, R. and Siegel, P. (1991). Matched spectral-null codes for partial response channels. IEEE Trans Inform Theory, 37(3): [Karabed and Siegel, 1995] Karabed, R. and Siegel, P. (1995). Coding for higher order partial response channels. In Proc SPIE Int

6 146 CODING AND ITERATIVE DETECTION FOR STORAGE Symp on Voice, Video and Data Communications, volume 2605, pages , Philadelphia. [Karlqvist, 1954] Karlqvist, O. (1954). Calculation of the magnetic field in the ferromagnetic layer of a magnetic drum. Trans Royal Inst Tech, 86:3-27. [Kindermann and Snell, 1980] Kindermann, R and Snell, J. L. (1980). Markov Random Field and Their Applications. American Mathematical Society. [Knudson, 1994] Knudson, K. J. (1994). Detection and Error-Correction for Partial Response Channels. PhD thesis, VC. San Diego. [Kobayashi, 1971] Kobayashi, H. (1971). Application of probabilistic decoding to digital magnetic recording systems. IBM J Res Dev, 15(1): [Kobayashi and Tang, 1970] Kobayashi, H. and Tang, D. (1970). Application of partial-response channel coding to magnetic recording systems. IBM J Res Dev, 14: [Kschischang and Frey, 1998] Kschischang, F. R and Frey, B. (1998). Iterative decoding of compound codes by probability propagation in graphical models. IEEE J Sel Areas Commun, 16(2): [L. Erup, F.M. Gardner and RA. Harris, 1993] L. Erup, F.M. Gardner and RA. Harris (1993). Interpolation in Digital Modems - Part II: Implementation and Performance. IEEE Transactions on Communications, 41: [Laakso et ai., 1996] Laakso, T. I., Valimaki, V., Karjalainen, M., and Laine, V. K. (1996). Splitting the unit delay. IEEE Signal Proc Mag, pages [Lee et ai., 1994] Lee, I., Yamauchi, T., and Cioffi, J. M. (1994). Performance comparison of receivers in a simple partial erasure model. IEEE Trans Magn, 30(4): [Leon-Garcia, 1994] Leon-Garcia, A. (1994). Probability and Random Process for Electrical Engineering. Addison-Wesley. [Lesser and Haanstra, 1957] Lesser, M. L. and Haanstra, J. W. (1957). The random-access memory accounting machine - I. System organization of the IBM 305. IBM J Res Dev, 1(1):62-71.

7 References 147 [Lind and Marcus, 1995] Lind, D. and Marcus, B. (1995). An Introduction to Symbolic Dynamics and Coding. Cambridge University Press. [Luby et al., 1998] Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., and Spielman, D. A. (1998). Improved low-density parity-check codes using irregular graphs and belief propagation. In Proc IEEE Intl Symp Inform Theory, page 117. [MacKay, 1999] MacKay, D. J. C. (1999). Good error-correcting codes based on very sparse matrices. IEEE Trans Inform Theory, 45(2): [Mackay et al., 1998] Mackay, D. J. C., McEliece, R J., and Cheng, J. (1998). Thrbo decoding as an instance of Pearl's "belief propagation" algorithm. IEEE J Sel Areas Commun, pages [MacKay and Neal, 1997] MacKay, D. J. C. and Neal, R (1997). Near shannon limit performance of low density parity check codes. Electron Lett, 33: [MacKay et al., 1998] MacKay, D. J. C., Wilson, S. T., and Davey, M. C. (1998). Comparison of constructions of irregular Gallager codes. Submitted to IEEE Trans Commun. [McEliece et al., 1995] McEliece, R J., Rodemich, E. R, and Cheng, J.-F. (1995). The turbo decision algorithm. In Proc 33rd Allerton Conference on Communication, Control, and Computing, pages [Modlin, 1996] Modlin, C. S. (1996). Modeling, Detection, and Adaptive Signal Processing for Magnetic Disk Recording. PhD thesis, Stanford University. [Moon and Brickner, 1996] Moon, J. and Brickner, B. (1996). Maximum transition run codes for data storage systems. IEEE Trans Magn, 32(5): [Mueller and Muller, 1976] Mueller, K. and Muller, M. (1976). Timing recovery in digital synchronous data receivers. IEEE Transaction on Communications, 24: [Nair et al., 1993] Nair, S., Shafiee, H., and Moon, J. (1993). Modeling and simulation of advanced read channels. IEEE Trans Magn, 29(6):

8 148 CODING AND ITERATIVE DETECTION FOR STORAGE [Nield et al., 1997] NickI, H., Hagenauer, J., and Burkert, F. (1997). Approaching shannon's capacity limit by 0.27 db using simple Hamming codes. IEEE Commun Lett, 1(5): [NiH and Sundberg, 1993] NiH, C. and Sundberg, C.-E. W. (1993). Viterbi algorithms with list and soft symbol output: Extensions and comparisons. In Proc IEEE GlobeCom, pages , Houston. [Nishiya et al., 1998] Nishiya, T., Tsukano, K., Hirai, T., Nara, T., and Mita, S. (1998). Turbo-EEPRML: An EEPR4 channel with an errorcorrecting post-processor. In Proc IEEE Globe Com, pages , Sydney. [Oppenheim and Schafer, 1989] Oppenheim, A. V. and Schafer, R. W. (1989). Discrete- Time Signal Processing. Prentice-Hall. [Pearl, 1988] Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann. [Perez et al., 1996] Perez, L. C., Seghers, J., and Costello, D. J. (1996). A distance spectrum interpretation of turbo codes. IEEE Trans Inform Theory, 42(6): [Raphaeli and Zarai, 1998] Raphaeli, D. and Zarai, Y. (1998). Combined turbo equalization and turbo decoding. Commun Lett, 2(4): [Richardson et al., 1999] Richardson, T., Shokrollahi, A., and Urbanke, R. (1999). Design of provably good low-density parity check codes. Submitted to IEEE Trans Inform Theory. Also available at [Richardson and Urbanke, 1999] Richardson, T. and Urbanke, U. (1999). The capacity oflow-density parity check codes under messagepassing decoding. Submitted to IEEE Trans Inform Theory. [Robertson et al., 1995] Robertson, P., Villebrun, E., and Hoeher, P. (1995). A comparison of optimal and sub-optimal map decoding algorithms operating in the log domain. In Proc IEEE Inti Conf Commun, pages , Seattle, USA. [Ryan, 1998] Ryan, W. (1998). Performance of high rate turbo codes on a PR4 equalized magnetic recording channel. In Proc IEEE Inti Conf Commun, pages , Atlanta.

9 References 149 [Ryan et al., 1998] Ryan, W., McPheters, L., and McLaughlin, S. {1998}. Combined turbo coding and turbo equalization for PR4- equalized lorentzian channel. In Proc Conf on Information Science and Systems, Princeton. [Sawaguchi et al., 1998] Sawaguchi, H., Kondou, M., Kobayahsi, N., and Mita, S. {1998}. Concatenated error correction coding for high-ordered PRML channels. In Proc IEEE Globe Com, pages , Sydney. [Seshadri and Sundberg, 1994] Seshadri, N. and Sundberg, C.-E. W. {1994}. List Viterbi decoding algorithms with applications. IEEE Trans Commun, 42{2-4}: [Shannon, 1948] Shannon, C. E. (1948). A mathematical theory of communication. Bell Systems Tech J, 27: [Shoemake and Heegard, 1997] Shoemake, M. B. and Heegard, C. (1997). Computationally efficient turbo decoding with the bidirectional viterbi algorithm {BIVA}. In Proc IEEE Intl Symp Inform Theory, page 228. [Siala et al., 1995] Siala, M., Papproth, E., Taieb, K. H., and Kaleh, G. K. {1995}. An iterative decoding scheme for serially concatenated convolutional codes. In Proc IEEE Intl Symp Inform Theory, page 473. [Sonntag et al., 1995] Sonntag, J., Agazzi, 0., Aziz, P., Burger, H., Comino, V., Heimann, M., Karanink, T., Khoury, J., Madine, G., Nagaraj, K., Offord, G., Peruzzi, R., Plany, J., Rao, N., Sayiner, N., Setty, P., and Threadgill, K. (1995). A high speed, low power prml read channel device. IEEE Trans Magn, 31(2): [Souviginier et al., 1999] Souviginier, T., Friedmann, A., Oberg, M., Siegel, P. H., Swanson, R. E., and Wolf, J. K. (1999). Turbo decoding for PR4: Parallel versus serial concatenation. In Proc IEEE Inti Conf Commun, pages , Vancouver. [Tanner, 1981] Tanner, R. M. (1981). A recursive approach to low complexity codes. IEEE Trans Inform Theory, 27{5}: [Thapar and Patel, 1987] Thapar, H. K. and Patel, A. M. (1987). A class of partial response systems for increasing storage density in magnetic recording. IEEE Trans Magn, 23{5}: [Viterbi, 1998] Viterbi, A. J. (1998). An intuitive justification and a simplified implementation of the map decoder for convolutional codes. IEEE J Sel Areas Commun, 16(2):260-4.

10 150 CODING AND ITERATIVE DETECTION FOR STORAGE [Wiberg, 1996] Wiberg, N. (1996). Codes and Decoding on General Graphs. PhD thesis, Linkoping University, Sweden. [Wicker, 1995] Wicker, S. B. (1995). Error Control Systems for Digital Communication and Storage. Prentice-Hall. [Widrow and Stearns, 1985] Widrow, B. and Stearns, S. D. (1985). Adaptive Signal Processing. Prentice-Hall. [Wilson, 1996] Wilson, S. G. (1996). Digital Modulation and Coding. Prentice-Hall. [Wood, 1993] Wood, R. (1993). Thrbo-PRML: a compromise EPRML detector. IEEE Trans Magn, 29(6): [Wu, 1999] Wu, Z.-N. (1999). Coding, Iterative Detection, and Timing Recovery for Magnetic Recording Channels. PhD thesis, Stanford U niversity. [Wu and Cioffi, 1999] Wu, Z.-N. and Cioffi, J. M. (1999). Thrbo decision aided equalization for magnetic recording channels. In Proc IEEE GlobeCom, Rio de Janeiro. to appear. [Wu et al., 1997] Wu, Z.-N., Fisher, K D., and Cioffi, J. M. (1997). A MMSE interpolated timing recovery scheme for magnetic recording channels. In Proc IEEE IntI Conf Commun, pages , Montreal. [Wu et al., 1998] Wu, Z.-N., Lin, S., and Cioffi, J. M. (1998). Numerical results on capacity bounds for magnetic recording channels. In Proc IEEE Globe Com, pages , Sydney. [Wu et al., 1999] Wu, Z.-N., McEwen, P. A., Fitzpatrick, K K, and Cioffi, J. M. (1999). Interleaved parity check codes and reduced complexity detection. In Proc IEEE Inti Conf Commun, pages , Vancouver. [Yamauchi and Cioffi, 1996] Yamauchi, T. and Cioffi, J. M. (1996). Nonlinear model in thin film disk recording system. IEEE Trans M agn, 29(6):

11 Index AWGN,9 Back-trace, 109 BCJR,30-37 complexity, 36 in log domain, 33 Belief-propogation, 69 Bipartite, 50 BIVA,37 Channel interleaver, see Interleaver, channel magnetic recording, see Channel, model model,5-11 pulse response, 6 step response, 5 targets, 12 Code rate loss, 13 Concatenation parallel, 22 serial, 22 simplified serial, 38 Decision Aided Equalization, applicability, 79 complexity, 81, 93 hard decision, 78 implementation, performance, 82-86, 93 soft decision, with local BCJR, EEPR4,12 EPR4,12 Error-events first-layer, 109 for E2 P R4, 105 most-likely, 108 second-layer, 110 Factor graphs, cycle, 50 edge, 50 node, 50 Information a posteriori, 30 a priori, 30 channel,30 extrinsic, 30 Interleaved Parity Check codes, decoding, encoding, 106 Interleaver, block,26 channel,37 gain, 26 modified S-random, 27 S-random, 27 Interpolated Timing Recovery, digital zero phase start, 130 FIR-ITR, 128 interpolation filter, 123 inverse ITR, 129 loop structure, 128 performance, 130 IPC, see Interleaved Parity Check codes ITR, see Interpolated Timing Recovery Log-sum, 43 approximation, 43 Lorentzian step response, 5 Low-density parity-check codes, generator matrix, 48 on recording channels, 63 parity-check matrix, 48 systematic encoder, 48 Markov

12 152 CODING AND ITERATIVE DETECTION FOR STORAGE finite input memory, 98 MEEPR4,12 MLSD,12 Non-recursive codes, 23 NRC, see Non-recursive codes Phase offset, 123 phase-error detector, 121 phase-locked loop, 121 Post-Processor error-event based, 108 path-metric based, 109 PR4,12 PRML,12 Puncture, 27 uniform, 28 PW50/T, see Recording density Q function, 26 Read channel detector, 14 Recording density, 5 Recursive systematic codes, 23 Reduced-Complexity Detection, see Interleaved Parity Check codes, decoding RSC, see Recursive systematic codes Signal-to-noise ratio, 8 SOVA,37 Spectral thinning, 26 Sum-product algorithm, complexity, 62 in log domain, 60 initialization, 56, 61 on acyclic graph, 53 stop criterion, 60 Timing recovery interpolated, see Interpolated Timing Recovery VCO-based, 121 Thrbo codes, decoder, encoder, Thrbo equalization, Voltage-controlled oscillator, 122