1. HOME
  2. Research
  3. Faculty Profiles
  4. Paul H. Siegel

Paul H. Siegel

CMRR Endowed Chair Professor, Department of ECE

Research Interests

  • Mathematical foundations of signal processing and coding
  • Analysis and design of codes for constrained channels
  • Trellis-coded modulation techniques
  • Algebraic error-correction coding
  • Algorithms and architectures for signal processing
  • Applications to digital data storage and wireless communications

Biography

Paul H. Siegel received the S.B. and Ph.D. degrees in mathematics from the Massachusetts Institute of Technology (MIT), Cambridge, in 1975 and 1979, respectively.

He held a Chaim Weizmann Postdoctoral Fellowship at the Courant Institute, New York University. He was with the IBM Research Division in San Jose, CA, from 1980 to 1995. He joined the faculty at the University of California, San Diego in July 1995, where he is currently Distinguished Professor of Electrical and Computer Engineering in the Jacobs School of Engineering. He is affiliated with the Center for Memory and Recording Research where he holds an endowed chair and served as Director from 2000 to 2011. His primary research interests lie in the areas of information theory and communications, particularly coding and modulation techniques, with applications to digital data storage and transmission.

Prof. Siegel was a member of the Board of Governors of the IEEE Information Theory Society from 1991 to 1996 and from 2009 to 2014. He served as Co-Guest Editor of the May 1991 Special Issue on “Coding for Storage Devices” of the IEEE Transactions on Information Theory. He served the same Transactions as Associate Editor for Coding Techniques from 1992 to 1995, and as Editor-in-Chief from July 2001 to July 2004. He was also Co-Guest Editor of the May/September 2001 two-part issue on “The Turbo Principle: From Theory to Practice” and the February 2016 issue on “Recent Advances in Capacity Approaching Codes” of the IEEE Journal on Selected Areas in Communications.

Refereed Conference Publications

1988 - 1990

  1. “Matched Spectral Null Codes for Partial Response Channels, Parts I and II”, R. Karabed and P. Siegel, Abstracts 1988 IEEE Int. Symp. on Inform. Theory, Kobe, Japan, pp. 142-143, June 1988. [PDF UCSD only]
  2. “Constrained Codes for Partial Response Channels”, B. Marcus and P. Siegel, Proc. 1988 IEEE Int. Workshop Inform. Theory, Beijing, China, pp. DI1.1-DI1.4, July 1988.
  3. “Even Mark Modulation for Optical Recording”, R. Karabed and P. Siegel, Proc. 1989 IEEE Int. Conf. Commun., Boston, MA, pp. 1628-1632, June 1989. [PDF UCSD only]
  4. “Recording Results and Coding Considerations for the Resonant Bias Coil Overwrite Technique”, D. Rugar and P. Siegel, Optical Data Storage Topical Meeting, G. R. Knight, C. N. Kurtz, eds., Proc. SPIE 1078, pp. 265-270, 1989.
  5. “VLSI Architectures for Metric Normalization in the Viterbi Algorithm”, C. Shung, P. Siegel, G. Ungerboeck, and H. Thapar, Proc. 1990 IEEE Int. Conf. Commun., vol. 3, Atlanta, GA, pp. 1723-1728, April 1990
  6. “Area-Efficient Architectures for the Viterbi Algorithm”, C. Shung, H.-D. Lin, P. Siegel, and H. Thapar, Proc. 1990 IEEE Global Telecommun. Conf., vol. 3, San Diego, CA, pp. 1787-1793, December 1990. [PDF UCSD only]

1991

  1. “Exact Bounds for Viterbi Detector Path Metric Differences”, P. Siegel, C. Shung, T. Howell, and H. Thapar, Proc. 1991 IEEE Int. Conf. Acoustics, Speech and Signal Processing, Toronto, Canada, pp. 1093-1096, May 1991. [PDF UCSD only]
  2. “A 100% Efficient Sliding-Block Code for the Charge-Constrained, Runlength-Limited Channel with Parameters (d,k;c)=(1,3;3)”, R. Karabed and P. H. Siegel, Proc. 1991 IEEE Int. Symp. Inform. Theory, Budapest, Hungary, p. 229, June 1991. [PDF UCSD only]

1992

  1. “ Experimental Evaluation of a Rate 8/10 Matched Spectral Null Code for PRML”, H. Thapar, J. Rae, C. Shung, R. Karabed, and P. Siegel, Proc. 1992 IEEE Int. Symp. Sign., Syst., and Electr., Paris, France, pp. 805-808, September 1992. (INVITED)
  2. “State-Space Characterization of Viterbi Detector Path Metric Differences”, R. Calderbank, P. Fishburn, and P. Siegel, Conf. Rec. 26th Asilomar Conf. on Signals, Systems, and Computers, vol. 2, Pacific Grove, CA, pp. 940-944, October 1992.

1993

  1. “A Family of BCH Codes for the Lee Metric”, R. Roth and P. Siegel, Proc. 30th Annual Allerton Conf. on Communication, Control, and Computing Urbana-Champaign, September 1992, pp. 1-10. Also, Proc. 1993 IEEE Int. Symp. Inform. Theory, San Antonio, TX, p. 35, January 1993.

1994

  1. “Two-dimensional modulation codes for holographic storage”, A. Vardy, M. Blaum, P. H. Siegel, and G. T. Sincerbox, Proc. 32nd Annual Allerton Conf. on Communication, Control, and Computing, Urbana-Champaign, IL, pp. 200-209, September 1994. (INVITED)

1995

  1. “Coding for higher-order partial-response channels”, R. Karabed and P. Siegel, in Coding and Signal Processing for Information Storage, Mysore R. Raghuveer, Soheil A. Dianat, Steven W. McLaughlin, Martin Hassner, eds., Proc. SPIE 2605, pp. 115-126, October 1995. [PDF UCSD only]
  2. “Reduced-Complexity Viterbi Detector Architectures for Partial Response Signalling”, G. Fettweis, R. Karabed, P. H. Siegel, and H. K. Thapar,Proc. 1995 IEEE Global Telecommun. Conf., vol. 1, Singapore, December 1995, pp. 559-563. [PDF UCSD only]

1996

  1. “Improved Estimates of Viterbi Detector Path Metric Differences”, A. Vityaev and P. H. Siegel, Proc. 1996 IEEE Global Telecommun. Conf., London, November 1996, Paper 9-7.

1997

  1. “Error Event Characterization on Partial Response Channels”, S. Atlekar, M. Berggren, B. Moision, P. Siegel, and J.K. Wolf, Proc. 1997 IEEE Int. Symp. Inform. Theory, Ulm, Germany, June 1997, p. 461. [PDF UCSD only]
  2. “Lowering the Error Floor of Turbo Codes”, M. Öberg and P. Siegel, Proc. IEEE Int. Symp. Turbo Codes & Related Topics, Breste, France, September 1997, pp. 204-207, ENST de Bretagne.
  3. “The Effect of Puncturing on Turbo Code Performance”, M. Öberg, A. Vityaev, and P. Siegel, Proc. IEEE Int. Symp. Turbo Codes & Related Topics, Breste, France, September 1997, pp. 184-187, ENST de Bretagne.
  4. “Application of Distance Spectrum Analysis to the Improvement of Turbo Code Performance”, M. Öberg and P. Siegel, Proc. 35th Annual Allerton Conf. Commun., Control, and Computing, September 29-October 1, 1997, pp. 701-710, Monticello, IL. (Also, Center for Wireless Communications Report 9704, May 1997.) (INVITED)

1998

  1. “Bit-Stuffing Bounds on the Capacity of 2-Dimensional Constrained Arrays”, P. H. Siegel and J. K. Wolf, Proc. 1998 IEEE Int. Symp. Inform. Theory, Cambridge, MA, August 16-21, 1998, p. 323. [PDF UCSD only]
  2. “Error Event Characterization and Coding for the Equalized Lorentzian Channel”, B. E. Moision, P. H. Siegel, and E. Soljanin, Proc. 1998 IEEE Int. Symp. Inform. Theory, Cambridge, MA, August 16-21, 1998, p. 77.
  3. “Performance Analysis of Turbo-Equalized Dicode Partial-Response Channel”, M. Öberg and P. H. Siegel, Proc. 36th Annual Allerton Conf. Commun., Control, and Computing, Monticello, IL, September 23-25, 1998, pp. 230-239. (INVITED)
  4. “On Two-Dimensional Arrays and Crossword Puzzles”, J.K. Wolf and P.H. Siegel, Proc. 36th Annual Allerton Conf. Commun., Control, and Computing, Monticello, IL, September 23-25, 1998, pp. 366-371. (INVITED)
  5. “Reconfigurable Signal Processor for Channel Coding in Low SNR Wireless Communications”, S. Halter, M. Öberg, P.M. Chau, and P.H. Siegel, Proc. 1998 IEEE Workshop on Signal Proc. Systems, Boston, MA, October 8 - 10, 1998. [PDF UCSD only]
  6. “Distance Enhancing Constraints for Noise Predictive Maximum Likelihood Detectors”, B. Moision and P. H. Siegel, Proc. 1998 IEEE Global Telecommun. Conf. (GLOBECOM 1998) Sydney, Australia, pp. 2730–2734, November 1998.

1999

  1. “Turbo Decoding for PR4: Parallel versus Serial Concatenation, T. Souvignier, A. Friedmann, M. Öberg, P. H. Siegel, R. E. Swanson and J. K. Wolf, Proc. 1999 IEEE Int. Conf. Commun., Vancouver, Canada, June 7-11, 1999, Paper S41-4. [PDF UCSD only]
  2. “Effect of Varying Source Kurtosis on the Multimodulus Algorithm”, A.P. des Rosiers and P. H. Siegel, Proc. 1999 IEEE Int. Conf. Commun., Vancouver, Canada, June 7-11, 1999, Paper S33-4. [PDF UCSD only]
  3. “Efficient Coding for a Two-Dimensional Runlength-Limited Constraint”, R. M. Roth, P. H. Siegel, and J. K. Wolf, SPIE Int. Symp. on Optical Sciences, Engineering, and Instrumentation, Conf. on Advanced Optical Data Storage: Materials, Systems, and Interfaces to Computers, Denver, CO, July 18-23, 1999, vol. 3802, Paper 05. pp. 8-17. [PDF UCSD only]
  4. “The Serial Concatenation of Rate-1 Codes Through Uniform Random Interleavers”, H. Pfister and P. H. Siegel, Proc. 37th Annual Allerton Conf. Commun., Control, and Computing, Monticello, IL, September 22-24, 1999, pp. 260-269. (INVITED)
  5. “On the Performance of Turbo Coding for the Land Mobile Channel with Delay Constraints”, K. Tang, P. H. Siegel, and L. B. Milstein, Conf. Record 33rd Asilomar Conf. On Signals, Systems, and Computers, vol. 2, Pacific Grove, CA, Asilomar ’99, October 24-27, 1999, pp. 1659-1664. [PDF UCSD only]
  6. “Bounds on the Rates of Codes that Forbid Specified Difference Sequences”, B. E. Moision, A. Orlitsky, and P. H. Siegel, Proc. 1999 IEEE Global Telecommun. Conf. GLOBECOM’99, Rio de Janeiro, Brazil, December5-9, 1999, [PDF UCSD only]
  7. “Parity Check Codes for Partial Response Channels”, M. Öberg and P. H. Siegel, Proc. 1999 IEEE Global Telecommun. Conf. GLOBECOM’99, Rio de Janeiro, Brazil, December 5-9, 1999. [PDF UCSD only]

2000

  1. “Turbo Coding for a Coherent DS-CDMA System Employing a MMSE Receiver on a Rayleigh Fading Channel”, K. Tang, P. H. Siegel, and L. B. Milstein, Proc. 34th Annual Conf. On Information Sciences and Systems (CISS’00), Princeton, NJ, March 2000. (6 pages)
  2. “Bit-Interleaved Coded Modulation for Delay-Constrained Mobile Communication Channels”, H. Tullberg and P. H. Siegel, Proc. IEEE Annual Vehicular Technology Conf. (VTC-2000-Spring), Tokyo, Japan, May 15-18, 2000. (5 pages) [PDF UCSD only]
  3. “On Codes that Avoid Specified Differences”, B. E. Moision, A. Orlitsky, and P. H. Siegel, Proc. 2000 IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 25-30, 2000, p. 145.
  4. “Efficient Coding for a Two-Dimensional Runlength- Limited Constraint”, R.M. Roth, P.H. Siegel, J.K.Wolf, Proc. IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 25–30, 2000, p. 307.
  5. “Fast Computation of Roots of Polynomials over Function Fields and Fast List Decoding of Algebraic Geometric Codes”, X.-W. Wu and P. H. Siegel, Proc. 2000 IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 25-30, 2000, p. 478. [PDF UCSD only]
  6. “An Iterative Receiver Algorithm for Space-Time Encoded Signals”, A. Ranheim, A. P. des Rosiers, P. H. Siegel, and D. B. Rao, Conf. Record 34th Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, October 2000, [PDF UCSD only]
  7. “On Performance Bounds for Space-Time Coded Modulation on Fading Channels”, A .P. des Rosiers and P. H. Siegel, Proc. 2000 International Symposium on Information Theory and its Applications (ISITA 2000), Honolulu HI, (4 pages).
  8. “Coding Theorems for Generalized Repeat Accumulate Codes”, H. Pfister and P. H. Siegel, Proc. 2000 International Symposium on Information Theory and its Applications (ISITA 2000), Honolulu, HI, (4 pages).
  9. “Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels”, J. Hou, P.H. Siegel, and L.B. Milstein, Proc. 38th Allerton Conference on Communications, Control, and Computing, Monticello, Illinois, October 4-6, 2000.

2001

  1. “A Comparison of Long versus Short Spreading Sequences in Coded Asynchronous DS-CDMA Systems”, K.Tang, L.B. Milstein, and P.H. Siegel, Proc. 35th Annual Conference on Information Sciences and Systems (CISS), Baltimore, Maryland, March 21-23, 2001.
  2. “Performance bound for parity-check coded partial-response channels”, M. Öberg and P. H. Siegel, Proceedings IEEE International Conference on Communications, Helsinki, BC, Finland, June 2001, pp. 2701-2705. [PDF UCSD only]
  3. “Periodic-finite-type shift spaces”, B. Moision and P. H. Siegel, Proceedings of IEEE International Symposium on Information Theory, Washington, DC, USA, June 2001, p. 65. [PDF UCSD only]
  4. “Design of low-density parity-check codes for bandwidth efficient modulation”, J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, Proceedings of the IEEE Information Theory Workshop, Cairns, Australia, September 2001, pp. 24-26.
  5. “Serial Concatenated Trellis Coded Modulation with Inner Rate-1 Accumulate Code”, H.M. Tullberg and P.H. Siegel, Proc. IEEE Annual Vehicular Technology Conf. (VTC2001-Fall,) Atlantic City, New Jersey, October 8–10, 2001 , pp. 936-940 [PDF UCSD only]
  6. “Multilevel coding with low-density parity-check component codes”, J. Hou, P.H. Siegel, L.B. Milstein, and H.D. Pfister, Proceedings IEEE Global Telecommunications Conference, San Antonio, Texas, USA, November 2001, pp. 1016-1020. [PDF UCSD only]
  7. “On the achievable information rates of finite state ISI channels”, H.D. Pfister, J.B. Soriaga, and P.H. Siegel, Proceedings IEEE Global Telecommunications Conference, San Antonio, Texas, USA, November 2001, pp. 2992-2996. [PDF UCSD only]
  8. “Serial concatenated trellis coded modulation with inner rate-1 accumulate code”, H. M. Tullberg and P. H. Siegel, Proceedings IEEE Vehicular Technology Conference, Atlantic City, NJ, USA, October 2001. [PDF UCSD only]

2002

  1. “Improved Bit-Stuffing Bounds on Two-Dimensional Constraints”, S. Halevy, J. Chen, R. M. Roth, P. H. Siegel, and J. K. Wolf, Proc. 2002 IEEE Int. Symp. Inform. Theory, Lausanne, Switzerland, June 30 – July 5, 2002, p. 385. [PDF UCSD only]
  2. “Soft-decision Reed-Solomon decoding on partial response channels”, M. K. Cheng, J. Campello, and P. H. Siegel, Proceedings IEEE Global Telecommunications Conference, Taipei, Taiwan, November 2002, pp. 1026-1030. [PDF UCSD only]

2003

  1. “On the symmetric information rate of two-dimensional finite state ISI channels”, J. Chen and P. H. Siegel, Proceedings of the IEEE Information Theory Workshop, Paris, France, April 2003, pp. 320-323. [PDF UCSD only]
  2. “Space-Time Code Performance Bounds on Quasistatic Fading Channels”, A. P. des Rosiers and P. H. Siegel, IEEE International Conference on Communications (ICC 2003), Anchorage, AK, May 11-15, 2003. [PDF UCSD only]
  3. “Information Rates of Two-Dimensional Finite State ISI Channels”, J. Chen and P. H. Siegel, Proc. 2003 IEEE Int. Symp. Inform. Theory, Yokohama, Japan, June 29-July 4, 2003. pp. 118. [PDF UCSD only]
  4. “Capacity Equalities in 1-Dimensional (d,k)-Constrained Systems”, N. Kashyap and P. H. Siegel, Proc. 2003 IEEE Int. Symp. Inform. Theory, Yokohama, Japan, June 29-July 4, 2003. [PDF UCSD only]
  5. “Precoders for Message-Passing Detection of Partial-Response Channels”, B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, Proc. 2003 IEEE Int. Symp. Inform. Theory, Yokohama, Japan, June 29-July 4, 2003. [PDF UCSD only]
  6. “Joint iterative decoding of LDPC codes and channels with memory”, H. D. Pfister and P. H. Siegel, Proc. 3rd Intl. Symp. Turbo Codes and Related Topics, Brest, France, September 15, 2003, pp. 15-18.
  7. “On distribution shaping codes for partial response channels”, J. B. Soriaga and P. H. Siegel, Proc. 41st Allerton Conference on Communications, Control, and Computing, Monticello, IL, October 1-3, 2003, pp. 468-477.
  8. “Iterative soft-decision Reed-Solomon decoding on partial response channels”, M. K. Cheng and P. H. Siegel, Proc. IEEE Global Telecommunications Conference, (Vol. 3), San Francisco, CA, December 1-5, 2003, pp. 1588-1592. [PDF UCSD only]
  9. “Exact probability of erasure and a decoding algorithm for some convolutional codes on the binary erasure channel”, B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, Proc. IEEE Global Telecommunications Conference, (Vol. 3), San Francisco, CA, December 1-5, 2003, pp. 1741-1745. [PDF UCSD only]

2004

  1. “List-decoding of parity-sharing Reed-Solomon codes in magnetic recording systems”, K. Cheng and P. H. Siegel, Proc. IEEE International Conference on Communications, (Vol. 2), Paris, France, June 20-24, 2004, pp. 640-644. [PDF UCSD only]
  2. “A Ramsey theory approach to ghostbusting”, N. Kashyap, P. H. Siegel and A. Vardy, Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, IL, June 27-July 2, 2004, pp. 190-190. [PDF UCSD only]
  3. “Sliding-block decodable encoders between (d,k)-constrained systems of equal capacity”, N. Kashyap and P. H. Siegel, Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, IL, June 27-July 2, 2004, pp. 87-87.
  4. “An improvement to the bit stuffing algorithm”, S. Aviran, P. H. Siegel and J. K. Wolf, Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, IL, June 27-July 2, 2004, pp. 191-191. [PDF UCSD only]
  5. “Analysis of convolutional codes on the erasure channel”, B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, IL, June 27-July 2, 2004, pp. 460-460. [PDF UCSD only]
  6. “On near-capacity coding systems for partial-response channels”, J. B. Soriaga, P. H. Siegel, Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, IL, June 27-July 2, 2004, pp. 267-267. [PDF UCSD only]
  7. “Reducing acyclic network coding problems to single-transmitter-single-demand form”, J. Han and P. H. Siegel, Proc. 42nd Allerton Conference on Communications, Control, and Computing, Monticello, IL, September 29-October 1, 2004, pp. 316-325.
  8. “Enhanced decoding by error detection on a channel with correlated 2-dimensional noise”, P. Ellingsen, O. Ytrehus, and P. H. Siegel, Proc. IEEE Inform. Theory Workshop, San Antonio, TX, October 24-29, 2004, pp. 17-21.

2005

  1. “Lower bounds on the capacity of asymmetric two-dimensional (d,infinity)-constraints”, J. Chen and P. H. Siegel, Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 666-670. [PDF UCSD only]
  2. “Two-dimensional bit-stuffing schemes with multiple transformers”, S. Aviran, P. H. Siegel, and J. K. Wolf, Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 1478-1482. [PDF UCSD only]
  3. “On achievable rates of multistage decoding on two-dimensional ISI channels”, J. B. Soriaga, P. H. Siegel, M. N. Marrow and J. K. Wolf, Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 1348–1352. [PDF UCSD only]
  4. “On the asymptotic performance of iterative decoders for product codes”, M. Schwartz, P. H. Siegel and A. Vardy, Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 1758-1762. [PDF UCSD only]
  5. “Relaxation bounds on the minimum pseudo-weight of linear block codes”, Chaichanavong and P. H. Siegel, Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 805-809. [PDF UCSD only]
  6. “Multiuser capacity analysis of WDM in nonlinear fiber optics”, M. H. Taghavi N., G. C. Papen, and P. H. Siegel, Proc. 43rd Allerton Conference on Communications, Control, and Computing, Monticello, IL, (September 28-September 30, 2005), Paper 43-107. (10 pages).

2006

  1. “Information-theoretic limits of two-dimensional optical recording channels”, P. H. Siegel, Optical Data Storage 2006, Proceedings of SPIE, Vol. 6282, Eds. Ryuichi Katayama and Tuviah E. Schlesinger), Montreal, Quebec, Canada, (April 23-26, 2006), pp. 62820W-1– 2820W-13. invited paper. [PDF UCSD only]
  2. “Error event characterization on 2-D ISI channels”, I. Demirkan, P. H. Siegel, and J. K. Wolf, Proceedings of IEEE International Symposium on Information Theory (ISIT), Seattle, Washington, (July 2006), pp. 1095-1099. [PDF UCSD only]
  3. “Adaptive linear programming decoding”, M. H. Taghavi and P. H. Siegel, Proceedings of IEEE International Symposium on Information Theory (ISIT), Seattle, Washington, (July 2006), pp. 1374-1378. [PDF UCSD only]
  4. “Optimal parsing trees for run-length coding of biased data”, S. Aviran, P. H. Siegel, and J. K. Wolf, Proceedings of IEEE International Symposium on Information Theory (ISIT), Seattle, Washington, (July 2006), pp. 1495-1499. [PDF UCSD only]
  5. “On the stopping redundancy of MDS codes”, J. Han and P. H. Siegel, Proceedings of IEEE International Symposium on Information Theory (ISIT), Seattle, Washington, (July 2006), pp. 2491-2495. [PDF UCSD only]

2007

  1. “Bounds on single-exclusion numbers and stopping redundancy of MDS codes”, J. Han, P. H. Siegel, and R. M. Roth, Proceedings of IEEE International Symposium on Information Theory (ISIT), Nice, France, (June 2007), pp. 2941-2945.
  2. “Equalization on graphs: linear programming and message passing”, M. H. Taghavi and P. H. Siegel,Proceedings of IEEE International Symposium on Information Theory (ISIT), Nice, France, (June 2007), pp. 2551-2555.

2008

  1. “Decoding on graphs: LDPC-coded MISO systems and belief propagation”, A. H. Djahanshahi, P. H. Siegel, and L. B. Milstein, IEEE Wireless Communications and Networking Conference, Las Vegas, NV, (March-April 2008). [PDF UCSD only]
  2. “Mean-adjusted pattern-dependent noise prediction for perpendicular recording channels with nonlinear transition shift”, Z. Wu, P. H. Siegel, J. K. Wolf, H. N. Bertram, INTERMAG, (May 2008) [PDF]
  3. “Nonlinear transition shift and write precompensation in perpendicular magnetic recording”, Z. Wu, H. N. Bertram, P.. H. Siegel, and J. K. Wolf, Proceedings IEEE International Conference on Communications, Beijing, China, ( May 2008), pp. 1972-1976. [PDF UCSD only]
  4. “On ML Redundancy of Codes”, J. Han and P.H. Siegel, Proc. 2008 IEEE Int. Symp. Inform. Theory, Toronto, Canada, July 6–11, 2008.
  5. “Gaussian belief propagation solver for systems of linear equations”, O. Shental, D. Bickson, P. H. Siegel, J. K. Wolf, and D. Dolev, Proceedings of IEEE International Symposium on Information Theory (ISIT), Toronto, Canada, (July 2008), pp. 1863-1867. [PDF UCSD only]
  6. “Gaussian belief propagation based multiuser detection”, D. Bickson, O. Shental, P. H. Siegel, J. K. Wolf, and D. Dolev, Proceedings of IEEE International Symposium on Information Theory (ISIT), Toronto, Canada, (July 2008), pp. 1878-1882. [PDF UCSD only]
  7. “Multidimensional flash codes”, E. Yaakobi, A. Vardy, P. H. Siegel, and J. K.Wolf, Proceedings 46-th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, September 2008. [PDF UCSD only]
  8. “Efficient implementation of linear programming decoding”, M.H. Taghavi, A. Shokrollahi, and P.H. Siegel, 46th Annual Allerton Conference, (September 2008), pp. 402-409. [PDF UCSD only]

2009

  1. “On unequal error protection of finite-length LDPC codes over BECs: A scaling approach”, A.H. Djahanshahi, P.H. Siegel, and L.B. Milstein, ISIT 2009, Seoul, Korea, (June 2009), pp. 1824-1828. [PDF UCSD only]
  2. “Storage coding for wear leveling in flash memories”, A. Jiang, R. Mateescu, E. Yaakobi, J. Bruck, P.H. Siegel, A. Vardy, and J.K. Wolf, ISIT 2009, Seoul, Korea, (June 2009), pp. 1229-1233. [PDF UCSD only]
  3. “A nearly optimal construction of flash codes”, H. Mahdavifar, P.H. Siegel, A. Vardy, J.K. Wolf, and E. Yaakobi, ISIT 2009, Seoul, Korea, (June 2009), pp. 1239-1243. [PDF UCSD only]
  4. “LDPC codes for the cascaded BSC-BAWGN channel”, A.R. Iyengar, P.H. Siegel, and J.K. Wolf, Proceedings of the Forty-Seventh Annual Allerton Conference on Communication, Control and Computing, (September 30 - October 2 2009). [PDF]
  5. “Characterizing flash memory: Beyond the datasheet”, L. Grupp, A. Caulfield, J. Coburn, E. Yaakobi, S. Swanson, and P.H. Siegel, Flash Memory Summit 2009 Proceedings, Santa Clara, CA., ( August 2009). [PDF]

2010

  1. “Windowed erasure decoding of LDPC convolutional codes”, M. Papaleo, A.R. Iyengar, P.H. Siegel, J.K. Wolf, and G.E. Corazza, Proceedings of the Information Theory Workshop (ITW), Cairo, Egypt, pp. 78-82, (January 6-8, 2010). [PDF]
  2. “Protograph-based LDPC convolutional codes for correlated erasure channels”, A.R. Iyengar, M. Papaleo, G. Liva, P. H. Siegel, J.K. Wolf, and G.E. Corazza, Proceedings of the IEEE International Conference on Communications, Cape Town, South Africa, (May 23-27, 2010). [PDF]
  3. “Data-dependent write channel model for magnetic recording”, A. Iyengar, P.H. Siegel, and J.K. Wolf, Proceedings of the IEEE International Symposium on Information Theory, ISIT, Austin TX, (June 13-18, 2010), C-Fr-1.1 [PDF]
  4. “On distance properties of quasi-cyclic protograph-based LDPC codes”, B.K. Butler and P.H. Siegel, Proceedings of the IEEE International Symposium on Information Theory, ISIT, Austin TX, (June 13-18, 2010), C-Tu-3.1 [PDF]
  5. “Multiple error-correcting WOM-codes”, E. Yaakobi, P.H. Siegel, A. Vardy, and J.K. Wolf, Proceedings of the IEEE International Symposium on Information Theory, ISIT, Austin TX, (June 13-18, 2010), N-Th-3.4 [PDF UCSD only]
  6. “Write channel model for bit-patterned media recording”, A.R. Iyengar, P.H. Siegel, and J.K. Wolf, 21st Magnetic Recording Conference, La Jolla, CA, USA, August 16 - 18, 2010. [PDF]
  7. “On the Parallel programming of flash memory cells”, E. Yaakobi, A. Jiang, P.H. Siegel, A. Vardy, and J.K. Wolf, 2010 IEEE Information Thoeory Workshop - ITW 2010 Dublin, (August 30- Sept. 3, 2010). [PDF]
  8. “Efficient two-write WOM-codes”, E. Yaakobi, S. Kayser, P.H. Siegel, A. Vardy, and J.K. Wolf,2010 IEEE Information Thoeory Workshop - ITW 2010 Dublin, (August 30- Sept. 3, 2010). [PDF]
  9. “Latency constrained protograph-based LDPC convolutional codes”, G.E. Corazza, A.R. Iyengar, M. Papaleo, P.H. Siegel, A. Vanelli-Coralli, and J.K. Wolf, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing, Brest France, (September 6-10, 2010). [PDF]
  10. “Multiple-write WOM-codes”, S. Kayser, E. Yaakobi, P.H. Siegel, A. Vardy, and J.K. Wolf, Proc. 48th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, (September 29 - October 1, 2010). [PDF]
  11. “Error characterization and coding schemes for flash memories”, E. Yaakobi, J. Ma, L. Grupp, P.H. Siegel, S. Swanson, and J.K. Wolf, Globecom 2010, Miami, FL, (December 2010). [PDF]

2011

  1. “Modeling and Information Rates for SynchronizationError Channels”, A.R. Iyengar, P.H. Siegel, and J.K. Wolf, Proc. 2011 IEEE Int. Symp. Inform. Theory, St. Petersburg, Russia, July 31–August 5, 2011. [PDF]
  2. “Windowed Decoding of SpatiallyCoupled Codes”, A.R. Iyengar, P.H. Siegel, R.L. Urbanke, and J.K. Wolf, Proc. 2011 IEEE Int. Symp. Inform. Theory, St. Petersburg, Russia, July 31–August 5, 2011. [PDF]
  3. “On Codes that Correct Asymmetric Errors with Graded Magnitude Distribution”, E. Yaakobi, P.H. Siegel, A. Vardy, and J.K. Wolf, Proc. 2011 IEEE Int. Symp. Inform. Theory, St. Petersburg, Russia, July 31–August 5, 2011. [PDF]
  4. “Adaptive Cut Generation for Improved Linear ProgrammingDecoding of Binary Linear Codes”, X. Zhang, and P.H. Siegel, Proc. 2011 IEEE Int. Symp. Inform. Theory, St. Petersburg, Russia, July 31–August 5, 2011. [PDF]
  5. “Non-binary WOM-Codes for Multilevel Flash Memories”, R. Gabrys, E. Yaakobi, L. Dolecek, P.H. Siegel, A. Vardy, and J.K. Wolf, Proc. IEEE Inform. Theory Workshop, Paraty, Brazil, October 16–20, 2011. [PDF]
  6. “Enhancing Binary Images of Non-Binary LDPC Codes”, A. Bhatia, A. R. Iyengar and P. H. Siegel, Proc. IEEE Global Telecommun. Conf. (GLOBECOM 2011), Houston, Texas, December 5–9, 2011. [PDF]
  7. “Time-Space Constrained Codes for Phase- Change Memories”, M. Qin, E. Yaakobi, and P.H. Siegel, Proc. IEEE Global Telecommun. Conf. (GLOBECOM 2011), Houston, Texas, December 5–9, 2011. [PDF]
  8. “Efficient Algorithms to Find All Small Error-Prone Substructuresin LDPC Codes”, X. Zhang and P.H. Siegel, Proc. IEEE Global Telecommun. Conf. (GLOBECOM 2011), Houston, Texas, December 5–9, 2011. [PDF]

2012

  1. “Characterization and Error-Correcting Codes for TLC Flash Memories”, E. Yaakobi, L. Grupp, P.H. Siegel, S. Swanson, J.K. Wolf, Proc. IEEE Int. Conf. Computing, Networking, and Communications (ICNC), Maui, Hawaii, January 30–February 2, 2012. [PDF]
  2. “Decoding of Cyclic Codes over Symbol-Pair Read Channels”, E. Yaakobi, J. Bruck, P.H. Siegel, Proc. 2012 IEEE Int. Symp. Inform. Theory, Cambridge, Massachusetts, July 1–6, 2012. [PDF]
  3. “WOM with Retained Messages”, L. Wang, M. Qin, E. Yaakobi, Y.-H. Kim, P.H. Siegel, Proc. 2012 IEEE Int. Symp. Inform. Theory, Cambridge, Massachusetts, July 1–6, 2012. [PDF]
  4. “Optimized Cell Programming for Flash Memories with Quantizers”, M. Qin, E. Yaakobi, P.H. Siegel, Proc. 2012 IEEE Int. Symp. Inform. Theory, Cambridge, Massachusetts, July 1–6, 2012. [PDF]
  5. “Quantized Min-Sum Decoders with Low Error Floor for LDPC Codes”, X. Zhang and P.H. Siegel, Proc. 2012 IEEE Int. Symp. Inform. Theory, Cambridge, Massachusetts, July 1–6, 2012. [PDF]
  6. “Will the Real Error Floor Please Stand Up?”, X. Zhang and P.H. Siegel, Proc. Signal Processing and Communications (SPCOM), Bangalore, India, July 22–25, 2012. [PDF]
  7. “Multilevel 2-Cell t-Write Codes”, A Bhatia, AR Iyengar, PH Siegel, IEEE Information Theory Workshop (ITW), Lausanne, Switzerland, September 3–7, 2012. [PDF]
  8. “Numerical Issues Affecting LDPC Error Floors”, B.K. Butler and P.H. Siegel, Proc. IEEE Global Telecommun. Conf. (GLOBECOM 2012), Anaheim, California, December 3–7, 2012. [PDF]
  9. “Joint Stochastic Decoding of LDPC Codes and Partial-Response Channels”, S.S. Tehrani, P.H. Siegel, S. Mannor, W.J. Gross, 2010 IEEE Workshop on Signal Processing Systemsm, 2012. [PDF]

2013

  1. “Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes”, B.K. Butler and P.H. Siegel, IEEE Transactions on Information Theory, 2013. [PDF]
  2. "Perspectives on Balanced Sequences." J. H. Weber, K. A. S. Immink, P.H. Siegel, and T. G. Swart. arXiv preprint arXiv:1301.6484 (2013). [PDF]
  3. “On the Capacity of Channels with Synchronization Errors”, A.R. Iyengar, P.H. Siegel, J.K. Wolf, IEEE Transactions on Information Theory, February 2013. [PDF]
  4. A. R. Iyengar, P. H. Siegel, and J.K. Wolf. "On the capacity of channels with synchronization errors." arXiv preprint arXiv:1302.2702, Feb 2013. [PDF]
  5. “Efficient Iterative LP Decoding of LDPC Codes with Alternating Direction Method of Multipliers”, X. Zhang and P.H. Siegel, IEEE International Symposium on Information Theory, Istanbul, Turkey, July 2013. [PDF]
  6. “ Sharp Bounds on the Spectral Radius of Nonnegative Matrices and Digraphs”, B.K. Butler, P.H. Siegel, Linear Algebra and its Applications, April 2013. [PDF]
  7. B. K. Butler and P. H. Siegel. "Sharp bounds on the spectral radius of nonnegative matrices and digraphs." Linear Algebra and its Applications, Vol. 439, No. 5, 1468-1478. September 2013. [PDF]

2014

  1. Xiaojie Zhang and Paul H. Siegel, “Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes,” IEEE Transactions on Communications, vol. 62, no. 1, pp. 1-14, January 2014. [PDF]

  2. Eitan Yaakobi, Hessam Mahdavifar, Paul H. Siegel, Alexander Vardy, and Jack K. Wolf, " Rewriting Codes for Flash Memories,"IEEE Transactions on Information Theory, vol. 60, no. 2, pp. 964-975, February 2014.[PDF]

  3. Minghai Qin, Eitan Yaakobi, and Paul H. Siegel, “Optimized Cell Programming for Flash Memories With Quantizers,” IEEE Transactions on Information Theory, vol. 60, no. 5, pp.2780-2795, May 2014.[PDF]

  4. Minghai Qin, Eitan Yaakobi, and Paul H. Siegel, “Constrained Codes that Mitigate Inter-Cell Interference in Read/Write Cycles for Flash Memories,” IEEE Journal on Selected Areas in Communications,vol. 32, no. 5, pp. 836-846, May 2014.[PDF]

  5. Aman Bhatia, Minghai Qin, Aravind R. Iyengar, Brian M. Kurkoski and Paul H. Siegel, “Lattice-Based WOM Codes for Multilevel Flash Memories,” IEEE Journal on Selected Areas in Communications,vol. 32, no. 5, pp. 933-945, May 2014.[PDF]

Pending

  1. Aman Bhatia, Shaohua Yang, and Paul H. Siegel, “Precoding Mapping Optimization for Magnetic Recording Channels,” IEEE Transactions on Magnetics, accepted for publication.

  2. Brian K. Butler and Paul H. Siegel, “Error Floor Approximation for LDPC Codes in the AWGN Channel,” IEEE Transactions on Information Theory, accepted for publication.

Books and Book Chapters

  1. "Decoding on a Finite State Transition Diagram While Avoiding a Sub-Diagram", L. Fredrickson, R. Karabed, P. Siegel, and H. Thapar, DIMACS Series in Discrete Math. and Theoretical Comp. Science, Proc. Joint DIMACS/IEEE Workshop on Coding and Quantization, vol. 14, October 1992, pp. 149-151.
  2. "Modulation Codes for Digital Data Storage", B. Marcus, R. Roth, and P. Siegel, Proc. of Symposia Applied Mathematics, vol. 50, AMS Short Course Proceedings, Different Aspects of Coding Theory, R. Calderbank, ed., 1995, pp. 41-94.
  3. "Constrained Systems and Coding for Recording Channels", B. Marcus, R. Roth, and P. Siegel, Handbook of Coding Theory, Elsevier Scientific Publishers, 1998.(extended version of 2.)
  4. "Codes for Digital Recorders", K.A.S. Immink, P.H. Siegel, and J.K.Wolf, Information Theory: 50 Years of Discovery, S.W. McLaughlin and S. Verdu, eds., IEEE Press, 1999, pp. 216-255.
  5. "On Approaching the Capacity of Finite-State Intersymbol Interference Channels", J.B. Soriaga, H.D. Pfister, and P.H. Siegel, Information , Coding, and Mathematics, M. Blaum, P.G. Farrell, and H.C.A. van Tilborg, eds., Kluwer Academic Publishers, 2002, pp. 365-378.
  6. "Performance Bounds of MLSE of Intensity Modulated Fiber Optic Links", N. Alic, G. C. Papen, L. B. Milstein, P. H. Siegel and Y. Fainman, Optical Communication Theory Techniques, Enrico Forestieri, Ed., Springer Publishers, 2005, pp. 197-203.
  7. "Ghostbusting: Coding for Optical Communications", N. Kashyap and P.H. Siegel, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Advances in Information Recording, vol. 73, February 2008, pp. 147-164.

Other Conference Abstracts and Digests

  1. “Spectral Null Codes and Number Theory”, P. Siegel, Proc. 1990 IEEE Int. Work. on Inform. Th., Veldhoven, The Netherlands, June 1990, p. 34.(invited)
  2. “A 30 MHz Trellis Codec Chip for Partial Response Channels”, C. Shung, P. Siegel, H. Thapar, and R. Karabed, Dig. 1991 IEEE Int. Solid-state Circuits Conf., San Francisco, February 1991, pp. 132–133.
  3. “Constructions of Reduced Truncation Depth Trellis Codes for Magnetic Recording”, P.H. Siegel, Proc. Coding Theory Gathering, vol. 2, Bergen, Norway, June 1994, pp. 239–254.(invited)
  4. “High-Order Spectral-Null Codes: Constructions and Bounds”, R. Roth, P. Siegel, and A. Vardy, Proc. 1994 IEEE Int. Symp. Inform. Th., Trondheim, Norway, June 1994, p. 205.
  5. “Coded Modulation for Binary Partial Response Channels: State-of-the-Art”, P.H. Siegel, Abstracts 1996 IEEE Inform. Th. Workshop, Haifa, Israel, June 1996. (invited)
  6. “Coding for Multi-Dimensional Storage”, P. Siegel, Abstracts 1997 IEEE Inform. Theory. Workshop, Longyearbyen, Svalbard, July 1997, p. 25. (invited)
  7. “Parity-Accumulate Codes for Magnetic Recording”, M. Öberg, H.D. Pfister, and P.H. Siegel, Digest of Technical Papers, IEEE Int. Magn. Conf., Toronto, Canada, April 9–13, 2000, p. 517. (invited)
  8. “Vector Quantization of the BCJR Algorithm’s State Metrics for Partial Response Channels”, B.M. Kurkoski, P.H. Siegel, and J.K. Wolf, 4th Asia-Europe Workshop on Information Theory, Viareggio, Italy, Ocotber 68, 2004.
  9. “Noise-Predictive Turbo Equalization for Partial-Response Channels”, S. Aviran, P. H. Siegel, and J. K. Wolf, Digest of Technical Papers, IEEE Int. Magn. Conf., Nagoya, Japan, April 4–8, 2005, pp. 981-982.
  10. “Soft-Output Detector for Partial-Response Channels using Vector Quantization”, B. M. Kurkoski, P. H. Siegel, J. K. Wolf, Digest of Technical Papers, IEEE Int. Magn. Conf., Nagoya, Japan, April 4–8, 2005, pp. 1601-1602.
  11. “Information-Theoretic Limits of Two-Dimensional Optical Recording Channels”, P. H. Siegel, Abstracts of Optical Data Storage Topical Meeting 2006, Montreal, Quebec, Canada, April 23-26, 2006, pp. 165–167. (invited)
  12. “Design Parameter Optimization for Perpendicular Magnetic Recording Systems”, P. Chaichanavong, H. N. Bertram and P. H. Siegel, Digests of Technical Papers, IEEE Int. Magn. Conf., San Diego, CA, May 8–12, 2006, p. 294. (invited)
  13. “Design Curves and Information Theoretic Limits for Perpendicular Recording Systems”, Z. Wu, P.H. Siegel, H.N. Bertram, and J.K. Wolf, Digests of Technical Papers, IEEE Magn. Rec. Conf., Pittsburgh, PA, Aug. 7–9, 2006. (invited)
  14. “Graph-Based Decoding in the Presence of ISI”, M.H. Taghavi and P.H. Siegel, Abstracts of Conf. on Algorithms, Inference, and Statistical Physics, Santa Fe, NM, May 1–4, 2007.
  15. “A New Read Head Model for Patterned Media Storage”, S. Karakulak, P.H. Siegel, J.K. Wolf, and H.N. Bertram, Digests of Technical Papers, IEEE Magn. Rec. Conf., Minneapolis, MN, May 21–23, 2007. (invited)
  16. “A Message-Passing Solver for Linear Systems”, O. Shental, D. Bickson, P.H. Siegel, J.K. Wolf, D. Dolev, Information Theory and Applications Workshop, La Jolla, CA, Jan. 27–Feb. 1, 2008.
  17. “Characterizing Flash Memory: Beyond the Datasheet”, L. Grupp, A. Caulfield, J. Coburn, E. Yaakobi, S. Swanson, and P.H. Siegel, Flash Memory Summit, Santa Clara, CA, August 2009.
  18. “Error Correction Coding for Flash Memories”, E. Yaakobi, J. Ma, A. Caulfield, L. Grupp, S. Swanson, P.H. Siegel, and J.K. Wolf, Flash Memory Summit, Santa Clara, CA, August 2009.
  19. “Finding Flash Features: Bigger, Better, Faster... Stronger ECC”, L.M. Grupp, H.-W. Tseng, A.M. Caulfield, J. Coburn, E. Yaakobi, P. .H. Siegel, J.K. Wolf and S. Swanson, Flash Memory Summit, Santa Clara, CA, August 2010.
  20. “Efficient Coding Schemes for Flash Memories”, E. Yaakobi, L. Grupp, S. Swanson, P.H. Siegel, and J.K. Wolf, Flash Memory Summit 2010 Proceedings, Santa Clara, CA, August 2010.
  21. “Error-Correcting Codes for TLC Flash”, E. Yaakobi, L. Grupp, S. Swanson, P.H. Siegel, J.K. Wolf, Flash Memory Summit 2011 Proceedings, Santa Clara, CA, August 9-11, 2011.
  22. “Time-Space Constrained Codes for Phase-Change Memories”, M. Qin, E. Yaakobi, P.H. Siegel, Flash Memory Summit 2011 Proceedings, Santa Clara, CA, August 9-11, 2011.

  23. Jing Guo, Minghai Qin, Albert Guillén i Fàbregas and Paul H. Siegel, “Enhanced Belief Propagation Decoding of Polar Codes through Concatenation,” accepted for presentation at IEEE International Symposium on Information Theory, Honolulu, Hawaii, June 29-July 4, 2014.

  24. Scott Kayser and Paul H. Siegel, “Constructions for Constant-Weight ICI-Free Codes,” accepted for presentation at IEEE International Symposium on Information Theory, Honolulu, Hawaii, June 29-July 4, 2014.

  25. Veeresh Taranalli and Paul H. Siegel, “Adaptive Linear Programming Decoding of Polar Codes,” accepted for presentation at IEEE International Symposium on Information Theory, Honolulu, Hawaii, June 29-July 4, 2014.

Journal Publications

1982-1990

  1. “Applications of a peak detection channel model”, P. Siegel, IEEE Trans. Magn. Vol. MAG-18, No. 6, (November 1982), pp. 1250-1252. [PDF UCSD only]
  2. “Witt spaces: A geometric cycle theory for ko-homology at odd primes”, P. Siegel, Am. J. Math., Vol. 105, No. 5, (October 1983), pp. 1067-1105. [PDF UCSD only]
  3. “Linking pairings on singular spaces”, M. Goresky and P. Siegel, Comm. Math. Helv., Vol. 58, No. 1, (1983), pp. 96-110. [PDF UCSD only]
  4. “Worst case code patterns for magnetic buried servos”, P. Siegel and B. Marcus, IEEE Trans. Magn., Vol. MAG-20, No. 5, (September 1984), pp. 906-908. [PDF UCSD only]
  5. “Recording codes for digital magnetic storage”, P. Siegel, IEEE Trans. Magn. Vol. MAG-21, No. 5, (September 1985), pp. 1344-1349. invited paper. [PDF UCSD only]
  6. B. Marcus and P. Siegel, “On codes with spectral nulls at rational submultiples of the symbol frequency”, IEEE Trans. Inform. Theory, Vol. 33, No. 4, (July 1987), pp. 557-568. [PDF UCSD only]
  7. “A note on the Shannon capacity of run-length-limited codes”, J. Ashley and P. Siegel, IEEE Trans. Inform. Theory, Vol. 33, No. 4, (July 1987), pp. 601-605. [PDF UCSD only] (See also J. Ashley, M. Hilden, P. Perry, and P. Siegel, “Correction to a note on the Shannon capacity of run-length-limited codes”, IEEE Trans. Inform. Theory, v. 39, No. 3 (May 1993), pp. 1110-112. [PDF UCSD only]
  8. “The power spectrum of run-length-limited codes”, A. Gallopoulos, C. Heegard, and P. Siegel, IEEE Trans. Commun., Vol. 37, No. 9 (September 1989), pp. 906-917. [PDF UCSD only]

1991-2000

  1. “Introduction to the special issue (on coding for storage devices)”, A. R. Calderbank, P. Siegel, and J. K. Wolf, IEEE Trans. Inform. Theory, Vol. 37, No. 3, Pt. II, (May 1991), pp. 709-710
  2. “Variable length state splitting with applications to average runlength constrained (ARC) codes”, C. Heegard, B. H. Marcus, and P. H. Siegel, IEEE Trans. Inform. Theory, Vol. 37, No. 3, Pt. II, (May 1991), pp. 759-777. [PDF UCSD only]
  3. “Matched spectral null codes for partial response channels”, R. Karabed and P. Siegel, IEEE Trans. Info Theory, Vol. 37, No. 3, Pt. II, (May 1991), pp. 818-855. [PDF UCSD only]
  4. “Modulation and coding for information storage”, P. Siegel and J. K. Wolf, IEEE Commun. Magazine, Vol. 29, No. 12, (December 1991), pp. 68-86. invited paper. [PDF UCSD only]
  5. “A 30 MHz trellis codec chip for partial-response channels”, B. Shung, P. Siegel, H. Thapar, R. Karabed, IEEE Journal of Solid-State Circuits, Special Issue on Analog and Signal Processing Circuits, Vol. 26, No. 12, (December 1991), pp. 1981-1987. [PDF UCSD only]

1992

  1. “Finite-state modulation codes for data storage”, B. Marcus, P. Siegel, and J. K. Wolf, IEEE Journal Selec. Areas Commun., Vol. 10, No. 1, (January 1992), pp. 5-37. invited paper. [PDF UCSD only]
  2. “Review of Finite Fields for Computer Scientists and Engineers, by R. J. McEliece”, P. Siegel, IEEE Trans. Inform. Theory, Vol. 38, No. 1, (January 1992), pp. 315-316 [PDF UCSD only]
  3. “On the performance evaluation of a rate 8/10 matched spectral null code for class-4 partial response”, H. K. Thapar, J. Rae, C. B. Shung, R. Karabed, and P. H. Siegel, IEEE Trans. Magn., Vol. 28, No. 5, (September 1992), pp. 2883-2888. invited paper [PDF UCSD only]
  4. “Area-efficient architectures for the Viterbi algorithm - Part I: Theory and Part II: Applications”, C. Shung, H.-D. Lin, R. Cypher, P. Siegel, and H. Thapar, IEEE Trans. Commun., (April 1993), pp. 636-644, and (May 1993) pp. 802-807 [PDF Part I UCSD only] [PDF Part II UCSD only]
  5. “Real-time recording results for a trellis-coded partial response (TCPR) system”, H. Thapar, C. Shung, J. Rae, R. Karabed, and P. Siegel, IEEE Trans. Magn., Vol. 29, No. 6, (November 1993), pp. 4009-4011. [PDF UCSD only]
  6. “Lee-metric BCH codes and their application to constrained and partial-response channels”, R. Roth and P. Siegel, IEEE Trans. Inform. Theory, Vol. 40, No. 4, (July 1994), pp. 1083-1096. [PDF UCSD only]
  7. “High-order spectral-null codes: Constructions and bounds”, R. Roth, P. Siegel, and A. Vardy, IEEE Trans. Inform. Theory, Vol. 40, No. 6, (November 1994), pp. 1828-1840. [PDF UCSD only]

1995

  1. “Improved trellis coding for partial-response channels”, L. Fredrickson, R. Karabed, P. Siegel, H. Thapar, and R. Wood, IEEE Trans. Magn., Vol. 31, No. 2, (March 1995), pp. 1141-1148. [PDF UCSD only]
  2. “Design and performance of a VLSI 120 Mb/s trellis-coded partial-response channel”, J. Rae, G. Christiansen, S.-M. Shih, H. Thapar, R. Karabed, and P. Siegel, IEEE Trans. Magn., Vol. 31, No. 2, (March 1995), pp. 1208-1214. [PDF UCSD only]
  3. “Conservative arrays: Multi-dimensional modulation codes for holographic recording”, A. Vardy, M. Blaum, P. H. Siegel, and G. T. Sincerbox, IEEE Trans. Inform. Theory, Vol. 42, No. 1, (January 1996), pp. 227-230. [PDF UCSD only]
  4. “Complexity and sliding-block decodability”, J. J. Ashley, R. Karabed, and P. H. Siegel, IEEE Trans. Inform. Theory, Special Issue on Codes and Complexity Vol. 42, No. 6 (November 1996), pp. 1925-1947. [PDF UCSD only]
  5. “Distance-enhancing codes for digital recording”, B. Moision, P. Siegel, and E. Soljanin, IEEE Trans. Magn., Vol. 34, No. 1, (January 1998), pp. 69-74. [PDF UCSD only]
  6. “Codes for digital recorders”, K. A. Schouhamer Immink, P. H. Siegel, and J. K. Wolf, IEEE Trans. Inform. Theory, 1948-1998 Special Commemorative Issue, Vol. 44, No. 6, (October 1998), pp. 2260-2299. [PDF UCSD only]
  7. “Improve Estimates of Viterbi Detector Path Metric Differences”, A. Vityaev and P. H. Siegel, IEEE Trans. Commun., Vol. 46, No. 12, (December 1998), pp. 1549-1554. [PDF UCSD only]

1999

  1. “Error event characterization on partial response channels”, S. Atlekar, M. Berggren B. Moision, P. H. Siegel, and J. K. Wolf,IEEE Trans. Inform. Theory, Vol. 45 No. 1, (January 1999), pp. 241-247. [PDF UCSD only]
  2. “Constrained coding for binary channels with high intersymbol interference”, R. Karabed, P. Siegel, and E. Soljanin, IEEE Trans. Inform. Theory, Vol. 45, No. 6 (September 1999), pp. 1777-1797. [PDF UCSD only]
  3. “Turbo decoding for partial response channels”, T. Souvignier, M. Öberg, P. H. Siegel, R. E. Swanson, and J. K. Wolf, IEEE Trans. Commun., Vol. 48, No. 8, (August 2000) pp. 1297-1308. [PDF UCSD only]

2001-2004

  1. “Performance analysis of turbo-equalized partial response channels”, M. Öberg and P. H. Siegel, IEEE Trans. Commun., Vol. 49, No. 3, (March 2001), pp. 436-444. [PDF UCSD only]
  2. “On codes avoiding specified differences”, B. E. Moision, A. Orlitsky, and P. H. Siegel, IEEE Trans. Inform., Vol. 47, No. 1, (January 2001), pp. 433-442. [PDF UCSD only]
  3. “Efficient coding schemes for the hard-square model”, R. Roth, P. H. Siegel, and J. K. Wolf, IEEE Trans. Inform., Vol. 47, No. 3, (March 2001), pp. 1166-1176 [PDF UCSD only]
  4. “Guest editorial: The Turbo Principle: From Theory to Practice, I”, P.H. Siegel, D. Divsalar, E. Eleftheriou, J. Hagenauer, D. Rowitch, IEEE Journal Selec. Areas Commun., vol. 19, no. 5, pp. 793 –799, May 2001.
  5. “Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels”, J. Hou, L. Milstein, and P. H. Siegel, IEEE Journal on Selected Areas in Communications, Vol. 19, No. 5, (May 2001), pp. 924-934. [PDF UCSD only]
  6. “A comparison of long versus short spreading sequences in coded asynchronous DS-CDMA systems”, K. Tang, P. H. Siegel, and L. B. Milstein, IEEE Journal on Selected Areas in Communications, Vol. 19, No. 8, (August 2001), pp. 1614-1624 [PDF UCSD only]
  7. “Guest editorial: The Turbo Principle: From Theory to Practice, II”, P.H. Siegel, D. Divsalar, E. Eleftheriou, J. Hagenauer, D. Rowitch, IEEE Journal Selec. Areas Commun., vol. 19, no. 9, pp. 1659–1661, September 2001.
  8. “Combined MMSE interference suppression and turbo coding for a coherent DS-CDMA system”, K. Tang, L. Milstein, and P. H. Siegel, IEEE Journal on Selected Areas in Communications, Vol. 19, No. 9, (September 2001), pp. 1793-1803. [PDF UCSD only]
  9. “Efficient root-finding algorithm with application to list decoding of algebraic–geometric codes”, X. W. Wu and P. H. Siegel, IEEE Trans. Inform. Theory, Vol. 47, No. 9, (September 2001), pp. 2579-2587. [PDF UCSD only]
  10. “Joint message-passing decoding of LDPC codes and partial-response channels”, B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, IEEE Trans. Inform. Theory, Vol. 48, No. 6 (June 2002), pp. 1410-1422. [PDF UCSD only] (see “Correction”, IEEE Trans. Inform. Theory, Vol. 49, No. 8, (August 2003) pp. 2076-2076. [PDF UCSD only]
  11. “The serial concatenation of rate-1 codes through uniform random interleavers”, H. D. Pfister and P. H. Siegel, IEEE Trans. Inform. Theory, Vol. 49, No. 6, (June 2003), pp. 1425-1438. [PDF UCSD only]
  12. “MLSE receiver for direct-sequence spread-spectrum systems on a multipath fading channel”, K. Tang, L. B. Milstein, and P .H. Siegel, IEEE Trans. Commun., Vol. 51, No. 7 (July 2003), pp. 1173-1184. [PDF UCSD only]
  13. “Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes”, J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, IEEE Trans. Inform. Theory, Vol. 49, No. 9, (September 2003), pp. 2141-2155. [PDF UCSD only]
  14. “On the low rate Shannon limit for binary intersymbol interference channels”, J. B. Soriaga, H. D. Pfister, and P. H. Siegel, IEEE Trans. Commun., Vol. 51, No. 2, (December 2003), pp. 1962-1964. [PDF UCSD only]
  15. “Equalities among capacities of (d,k) constrained systems”, N. Kashyap and P. H. Siegel, SIAM J. Discr. Math., Vol. 17, No. 2, (2003-2004), pp. 276-297 [PDF]
  16. “Improved bit-stuffing bounds on two-dimensional constraints”, S. Halevy, C. Jiangxin, R. M. Roth, P. H. Siegel and J. K. Wolf, IEEE Trans. Inform. Theory, Vol. 50, No. 5 (May 2004), pp. 824-838. [PDF UCSD only]
  17. “Sliding-block decodable encoders between (d,k) runlength-limited constraints of equal capacity”, N. Kashyap and P. H. Siegel, IEEE Trans. Inform. Theory, Vol. 50 No. 6, (June 2004), pp. 1327-1331. [PDF UCSD only]
  18. “A fast microtrack simulator for high-density perpendicular recording”, M. N. Marrow, M. K. Cheng, P. H. Siegel, and J. K. Wolf, IEEE Trans. Magn., Vol. 40, No. 4, (July 2004), pp. 3117-3119. [PDF UCSD only]
  19. “On performance bounds for space-time codes on fading channels”, A. P. des Rosiers and P. H. Siegel, IEEE Trans. Commun., Vol. 52, No. 10, (October 2004), pp. 1688-1697 [PDF UCSD only]

2005-2007

  1. “Serial concatenated TCM with an inner accumulate code – Part I: Maximum-likelihood analysis”, H. M. Tullberg and P. H. Siegel, IEEE Trans. Commun., Vol. 53, No. 1, (January 2005), pp. 64-73. [PDF UCSD only]
  2. “Serial concatenated TCM with an inner accumulate code – Part II: Density evolution analysis”, H. M. Tullberg and P. H. Siegel, IEEE Trans. Commun., Vol. 53, No. 2 (February 2005), pp. 252-262. [PDF UCSD only]
  3. “Design of multi-input multi-output systems based on low-density parity-check codes”, J. Hou, P. H. Siegel, and L. B Milstein, IEEE Trans. Commun., Vol. 53, No. 4 (April 2005), pp. 601-611. [PDF UCSD only]
  4. “Tradeoff between diversity gain and interference suppression in a MIMO MC-CDMA system”, Y. Zhang, L. B. Milstein, and P. H. Siegel, IEEE Trans. Commun., Vol. 53, No. 4, (April 2005), pp. 623-631. [PDF UCSD only]
  5. “An improvement to the bit stuffing algorithm”, S. Aviran, P. H. Siegel, and J. K. Wolf, IEEE Trans. Inform. Theory, Vol. 51, No. 8, (August 2005), pp. 2885-2891 [PDF UCSD only]
  6. “Soft-output detector for partial-response channels using vector quantization”, B. Kurkoski, P. H. Siegel, and J. K. Wolf, IEEE Trans. Magn., Vol. 41, No. 10, (October 2005), pp. 2989-2991. [PDF UCSD only]
  7. “Noise-predictive turbo equalization for partial-response channels”, S. Aviran, P. H. Siegel, and J. K. Wolf, IEEE Trans. Magn., Vol. 41, No. 10, (October 2005) pp. 2959-2961. [PDF UCSD only]
  8. “An application of Ramsey theory to coding for the optical channel”, N. Kashyap, P. H. Siegel and A. Vardy, SIAM J. Discr. Math., Vol. 19, No. 4, (December 2005) pp. 921–937. [PDF]
  9. “Coding for the optical channel: the ghost-pulse constraint”, N. Kashyap, P. H. Siegel and A. Vardy, IEEE Trans. Inform. Theory, Vol. 52, No. 1, (January 2006) pp. 64-77. [PDF UCSD only]
  10. “A modified Viterbi decoding algorithm for high-rate convolutional codes”, G. iAmat, S. Benedetto and P. H. Siegel, European Transactions on Telecommunications, Vol. 16, No. 6, (November-December 2005), pp. 527-536.
  11. “On the symmetric information rate of two-dimensional finite state ISI channels”, J. Chen and P. H. Siegel, IEEE Trans. Inform. Theory, Vol. 52, No. 1, (January 2006) pp. 227-236) [PDF UCSD only]
  12. “Tensor-product parity codes: Combination with constrained codes and application to perpendicular recording”, P. Chaichanavong and P. H. Siegel, IEEE Trans. Magn. Vol. 42, No. 2, Pt. 1, (February 2006), pp. 214-219. [PDF UCSD only]
  13. “Tensor-product parity code for magnetic recording”, P. Chaichanavong and P. H. Siegel, IEEE Trans. Magn., Vol. 42, No. 2, Pt. 2, (February 2006), pp. 350-352. [PDF UCSD only]
  14. “On the Probability of Undetected Error for Over-Extended Reed-Solomon Codes”, J. Han, P. Lee, and P.H. Siegel, IEEE Trans. Inform. Th., Vol. 52, No. 8, (August 2006), pp. 3662-3669. [PDF UCSD only]
  15. “Design parameter optimization for perpendicular magnetic recording systems”, P. Chaichanavong, H.N. Bertram, and P.H. Siegel, IEEE Trans. Magn., Vol. 42, No. 10, (October 2006) pp. 2549-2554. [PDF UCSD only]
  16. “On the multiuser capacity of WDM in a nonlinear optical fiber: Coherent communication”, M.H. Taghavi N., G.C. Papen, and P.H. Siegel, IEEE Trans. Inform. Th., Vol. 52 No. 11, (November 2006), pp. 5008-5022. [PDF UCSD only]
  17. “Book Review: Codes for mass data storage systems (Second Edition), by K.A. Schouhamer Immink”, P.H. Siegel, IEEE Trans. Inform. Th., Vol. 52, No. 12, (December 2006), pp. 5614-5616. [PDF UCSD only]
  18. “Improved upper bounds on stopping redundancy”, J. Han and P.H. Siegel, IEEE Trans. Inform. Th., Vol. 53, No. 1, (January 2007), pp. 90-104. [PDF UCSD only]
  19. “Design curves and information theoretic limits for perpendicular recording systems”, Z. Wu, P.H. Siegel, H.N. Bertram, and J.K. Wolf, IEEE Trans. Magn., Vol. 43, No. 2, (February 2007), pp. 721-726. [PDF UCSD only]
  20. “Determining and approaching achievable rates of binary intersymbol interference channels using multistage decoding”, J.B. Soriaga, H.D. Pfister, and P.H. Siegel, IEEE Trans. Inform. Th., Vol. 53, No. 4, (April 2007), pp. 1416-1429. [PDF UCSD only]
  21. “On codes with local joint constraints”, B.E. Moision, A. Orlitsky, and P.H. Siegel, Lin. Alg. Appl., Vol. 422, No. 2-3, (April 2007), pp. 442-454.

2008

  1. “A new read channel model for patterned media storage”, S. Karakulak, P.H. Siegel, J.K. Wolf, and H.N. Bertram, IEEE Trans. Magn., Vol. 44, No. 1, pt. 2, (January 2008), pp. 193-197. [PDF UCSD only]
  2. “Joint iterative decoding of LDPC codes for channels with memory and erasure noise”, H.D. Pfister and P.H. Siegel, IEEE Journal Selec. Areas Commun., Vol. 26, No. 2, (February 2008), pp. 320-337. [PDF UCSD only]
  3. “Optimal parsing trees for run-length coding of biased data”, S. Aviran, P.H. Siegel, and J.K. Wolf, IEEE Trans. Inform. Th., Vol. 54, No. 2, (February 2008), pp. 841-849. [PDF UCSD only]
  4. “Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels”, J. Chen and P.H. Siegel, IEEE Trans. Inform. Th., Vol. 54, No. 3, (March 2008), pp. 1295-1303. [PDF UCSD only]
  5. “Improved probabilistic bounds on stopping redundancy”, J. Han, P.H. Siegel, and A. Vardy, IEEE Trans. Inform. Th., Vol. 54, No. 4, (April 2008) pp. 1749-1753. [PDF UCSD only]
  6. “Mean-adjusted pattern-dependent noise prediction for perpendicular recording channels with nonlinear transition shift”, Z. Wu, P. H. Siegel, J. K. Wolf, and H. N. Bertram, IEEE Trans. Magn., Vol. 44, No. 11, (November 2008), pp. 3761-3764. [PDF UCSD only]
  7. “Adaptive methods for linear programmin decoding”, M.H. Taghavi and P.H. Siegel, IEEE Trans. Inform. Th., Vol. 54, No. 12, (December 2008), pp. 5396-5410. [PDF UCSD only]

2009

  1. “Error event characterization on 2-D ISI channels”, I. Demirkan, P.H. Siegel, and J.K. Wolf, IEEE Trans. Inform. Th., Vol. 55, No. 3, (March 2009) pp. 1146-1152. [PDF UCSD only]
  2. “Single-exclusion number and the stopping redundancy of MDS codes”, J. Han, P.H. Siegel, and R.M. Roth, IEEE Trans. Inform. Th., Vol. 55, No. 9, (September 2009), pp. 4155-4166. [PDF UCSD only]

2010

  1. “Analysis of nonlinear transition shift and write precompensation in perpendicular recording systems”, Z. Wu, P.H. Siegel, J.K. Wolf, and H.N. Bertram, IEEE Journal Selec. Areas Commun., Vol. 28, No. 2, (February 2010), pp. 158-166. [PDF UCSD only]
  2. “A parametric study of inter-track interference in bit patterned media recording”, S. Karakulak, P.H. Siegel, and J.K. Wolf, IEEE Trans. Magn., Vol. 46, No. 3, (March 2010), pp. 819-824. [PDF UCSD only]
  3. “Joint-track equalization and detection for bit patterned media recording”, S. Karakulak, P.H. Siegel, J.K. Wolf, and H.N. Bertram, IEEE Trans. Magn., Vol. 46, No. 9, (September 2010), pp. 3639-3647. [PDF UCSD only]
  4. “Storage coding for wear leveling in flash memories”, A. Jiang, R. Mateescu, E. Yaakobi, J. Bruck, P.H. Siegel, A. Vardy, and J.K. Wolf,IEEE Trans. Inform. Th., Vol. 46, No. 10, (October 2010), pp. 5290-5299. [PDF UCSD only]

2011

  1. “Write channel model for bit-patterned media recording”, A.R. Iyengar, P.H. Siegel, and J.K. Wolf, IEEE Trans. Magn., Vol. 47, No. 1, (January 2011), pp.35-45. [PDF UCSD only]
  2. “Graph-based decoding in the presence of ISI”, M.H. Taghavi and P.H. Siegel, IEEE Trans. Inform. Th., Vol. 57, No. 4, (April 2011), pp. 2188-2202. [PDF UCSD only]
  3. “Periodic-finite-type shift spaces”, M-P. Beal, M. Crochemore, B.E. Moision and P.H. Siegel, IEEE Trans. Inform. Th., Vol. 57, No. 6, (June 2011), pp. 3677-3691. [PDF UCSD only]
  4. “Efficient implementation of linear programming decoding“, M.H. Taghavi, A. Shokrollahi and P.H. Siegel, IEEE Trans Inform. Th., Vol. 57, No. 9, (September 2011), pp. 5960-5982. [PDF UCSD only]

2012

  1. “Multiple Error-Correcting WOMCodes”, E. Yaakobi, P.H. Siegel, A. Vardy, and J.K. Wolf, IEEE Trans. Inform. Theory, vol. 58, no. 4, pp. 2220–2230, April 2012.
  2. “Windowed Decoding of Protograph-based LDPC Convolutional Codes over Erasure Channels”, A.R. Iyengar, M. Papaleo, P.H. Siegel, J.K. Wolf, A. Vanelli-Coralli, G.E. Corazza, IEEE Trans. Inform. Theory, vol. 58, no. 4, pp. 2303–2320, April 2012.
  3. “Codes for Write-Once Memories”, E. Yaakobi, S. Kayser, P.H. Siegel, A. Vardy, and J.K. Wolf, IEEE Trans. Inform. Theory, vol. 58, no. 9, pp. 5985–5999, September 2012.
  4. “Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes”, X. Zhang and P.H. Siegel, IEEE Trans. Inform. Theory, vol. 58, no. 10, pp. 6581–6594, October 2012.
  5. “Windowed Decoding of Spatially Coupled Codes”, A.R. Iyengar, P.H. Siegel, R.L. Urbanke, and J.K. Wolf, IEEE Trans. Inform. Theory, vol. 59, no. 4, pp. 2277-2292, April 2013.

Selected Invited Presentations

  1. IEEE International Magnetics Conference (Intermag’85), Invited Session on Magnetic Recording, May 1985, St. Paul, Minnesota.
  2. Workshop on Coding, Modulation and Signal Processing, May 1985 Center for Magnetic Recording Research, University of California at San Diego, La Jolla, California.
  3. Optical Society of America Annual Meeting, October 1985, Washington, DC.
  4. Short Course on Signal Processing for Digital Magnetic Recording, March 1986, Institute for Information Storage Technology, Santa Clara, California.
  5. International Symposium on Information Theory, October 1986, Ann Arbor, Michigan.
  6. Workshop on Coding, Modulation and Signal Processing, January 1987, Center for Magnetic Recording Research, University of California at San Diego, La Jolla, California.
  7. Workshop on Topological Markov Shifts and Coding, Heidelberg University, July 1987.
  8. Conference on Communications, Control, and Signal Processing, April 1988, CalTech, Pasadena, California.
  9. IEEE International Conference on Communications (ICC’89), June 1989, Boston, Massachusetts.
  10. IEEE International Workshop on Information Theory, June 1990, Veldhoven, The Netherlands.
  11. IEEE International Conference on Computer Design. September 1990, Cambridge, Massachusetts.
  12. 1990 IEEE Global Telecommunications Conference (Globecom ’90), December 1990, San Diego, California.
  13. Short Course on The Impact of DSP on Future Generation High Density Disk Drives, Institute for Information Storage Technology, December 1991, Santa Clara, California.
  14. IEEE International Magnetics Conference (Intermag ’92), St. Louis, Missouri (presented by H. Thapar).
  15. IEEE International Symposium on Signals, Systems, and Electronics (ISSSE’92), September 1992, Paris, France.
  16. Allerton Conference on Communications, Control, and Computing, October 1992, Allerton, Illinois.
  17. Asilomar Conference on Signals, Systems, and Computers, October 1992, Pacific Grove, California.
  18. University of Michigan, Winter Semester Seminar Series, Department of Electrical Engineering and Computer Science, April 15, 1993.
  19. IEEE Information Theory Society Workshop on Coding, System Theory, and Symbolic Dynamics, Mansfield, Massachusetts, October 1993.
  20. Workshop on Coding, Department of Informatics, University of Bergen, Norway, June 1994.
  21. Short Course on Sustaining a 60% CGR: The Challenges for Hard Disk Drive Heads/Media/Channels, Institute for Information Storage Technology, December 1994, Santa Clara, California.
  22. American Mathematical Society Short Course on Coding Theory, San Francisco, California, January 1995.
  23. IEEE Information Theory Workshop, Haifa, Israel, June 1996.
  24. Workshop on The Mathematics of Information Coding, Extraction, and Distribution, Institute for Mathematics and its Applications (IMA), Minneapolis, Minnesota, November 1996.
  25. IEEE Information Theory Workshop, Svalbard, Norway, July 1997.
  26. Allerton Conference on Communications, Control, and Computing, Allerton, Illinois, October 1997.
  27. Allerton Conference on Communications, Control, and Computing, Allerton, Illinois, October 1998.
  28. Conference on Advanced Optical Memories and Interfaces to Computer Systems II, SPIE International Symposium on Optical Science, Engineering, and Instrumentation, Denver, Colorado, July 1999.
  29. Workshop on Codes, Systems, and Graphical Models, Institute for Mathematics and Its Applications(IMA), Minneapolis, Minnesota, August 1999.
  30. Allerton Conference on Communications, Control, and Computing, Allerton, Illinois, September 1999.
  31. IBM Workshop on Magnetic Recording, IBM Zurich Research Laboratory, Zurich, Switzerland, November 1999.
  32. IEEE International Magnetics Conference (Intermag 2000), Session on Iterative Detection and Timing Recovery, Toronto, Ontario, Canada, April 2000.
  33. IEEE Communication Theory Workshop, Borrego Springs, California, May 2001.
  34. Workshop in Honor of Prof. Robert J. McElieces 60th Birthday, California Institute of Technology, Pasadena, California, May 2002.
  35. Summer Research Institute, Swiss Federal Polytechnic University of Lausanne (EPFL), July 2002.
  36. Hitachi Central Research Laboratory, Tokyp, Japan, July 2003.
  37. Workshop on Applications of Statistical Physics to Coding Theory, Center for Nonlinear Studies (Los Alamos National Laboratory), Santa Fe, New Mexico, January 2005.
  38. Distinguished Speaker Series, Department of Electrical and Computer Engineering, University of Arizona, February 2005.
  39. Viterbi Conference, University of Southern California, Los Angeles, California, March 2005.
  40. Toshiba Corporation, Tokyo, Japan, April 2005.
  41. Fujitsu, Limited, Tokyo, Japan, April 2005.
  42. Department of Information and Communication Engineering, University of Electro-Communications, Chofu, Tokyo, Japan, April 2005.
  43. Information Storage Industry Consortium, Extremely High Density Recording Research Review Joint Session, Monterey, California, July 2005.
  44. Department of Mathematics, Politecnico di Torino, Turin, Italy, May 2-25, 2006. (invited course on “Coding for storage systems,” 24 lecture hours)
  45. Information Engineering Department, University of Parma, Parma, Italy, May 19, 2006.
  46. Telecommunications Group, Politecnico di Torino, Turin, Italy, May 23, 2006.
  47. Tutorial on Low-Density Parity-Check Codes, Center for Wireless Communications, Research Review, May 31, 2007.
  48. Keynote Address, QTech Forum, Qualcomm Incorporated, November 6, 2007.
  49. Institut Gaspard-Monge, Laboratoire d’informatique, Universit´e Paris-Est, Marne-la-Vall´ee, June 17, 2008.
  50. Distinguished Speaker Series, Department of Electrical and Computer Engineering, Texas A&M University, College Station, Texas, April 5, 2011.
  51. Department of Electrical and Computer Engineering, Texas A&M University, College Station, Texas, April 5, 2011.
  52. Computer Science Colloquium, Technion - Israel Institute of Technology, June 21, 2011.
  53. Workshop on Emerging Data Storage Technologies, IEEE International Conference on Communications, Ottowa, Canada, June 11, 2012.
  54. Session on Coding Theory for the Next-Generation Storage Systems, Asilomar Conference on Signals, Systems & Computers, Pacific Grove, California, November 4–7, 2012.
  55. Seminaires ICI, Ecole National Superieure de l’Electronique et de ses Applications (ENSEA), University of Cergy-Pontoise, France, December 5, 2012.

Patents (inventor or co-inventor)

  1. Direction-Constrained Ternary Codes Using Peak and Polarity Detection, United States Patent No. 4,566,044, G. G. Langdon, Jr. and P. H. Siegel, (January 21, 1986).
  2. Fixed Rate Constrained Channel Code Generating and Recovery Method and Means Having Spectral Nulls for Pilot Signal Insertion, United StatesPatent No. 4,567,464, P. H. Siegel and S .J. Todd, (January 28, 1986).
  3. Method and Apparatus for Implementing a PRML Code, United StatesPatent No. 4,786,890, B. Marcus, A. Patel, and P. H. Siegel, (November 22, 1988).
  4. Even Mark Modulation Coding Method, United States Patent No. 4,870,414, R. Karabed and P. H. Siegel, (September 26, 1989).
  5. Encoding for Pit-Per-Transition Optical Data Recording, United StatesPatent No. 4,881,076, J. Ashley, M. Call, and P. H. Siegel, (November 14, 1989).
  6. Modified Sliding Block Code for Limiting Error Propagation. United StatesPatent No. 4,882,583, K. Dimitri, M. Hassner, and P. H. Siegel, (November 21, 1989).
  7. Trellis Codes for Partial Response Channels, United States Patent No. 4,888,775, R. Karabed and P. H. Siegel, (December 19, 1989).
  8. Matched Spectral Null Trellis Codes for Partial Response Channels, United States Patent No. 4,888,779, R. Karabed and P. H. Siegel, (December 19, 1989).
  9. Method and Apparatus for Asymmetrical RLL Coding, United StatesPatent No. 4,949,196, N. Davies, M. Hassner, T. Howell, R. Karabed, and P. H. Siegel, (August 14, 1990).
  10. Phase-Invariant Rate 8/10 Matched Spectral Null Code for PRML, United States Patent No. 5,095,484, R. Karabed and P. H. Siegel, (March 10, 1992).
  11. Time-Varying Viterbi Detector for Control of Error Event Length, United States Patent No. 5,280,489, L. Fredrickson, R. Karabed, J. Rae, P. H. Siegel, H. Thapar, and R. Wood, (January 18, 1994).
  12. Method and Means for Detecting a Partial-Response Waveform Using a Modified Dynamic Programming Heuristic, United States Patent No. 5,430,744, G. Fettweis, R. Karabed, P. H. Siegel, H. Thapar, (July 4, 1995).
  13. Method and Apparatus for Constructing Asymptotically Optimal Second Order DC-Free Channel Codes, United States Patent No. 5,450,443, P. H. Siegel and A. Vardy, (September 12, 1995).
  14. Permuted Trellis Codes for Input Restricted Partial Response Channels, United States Patent No. 5,497,384, L. Fredrickson, R. Karabed, J. Rae, P. H. Siegel, and H. Thapar, (March 5, 1996).
  15. Method for Modulation of Multi-Dimensional Data in Holographic Storage, United States Patent No. 5,510,912, M. Blaum, P. H. Siegel, G. Sincerbox, and A. Vardy, (April 23, 1996).
  16. Matched Spectral Null Codes with Partitioned Systolic Trellis Structures, United States Patent No. 5,537,424, R. Karabed, J. Rae, P. H. Siegel, and H. Thapar, (July 16, 1996).
  17. Method and Means for Generating and Detecting Spectrally Constrained Coded Partial Response Waveforms Using a Time Varying Trellis Modified by Selective Output State Splitting, United States Patent No. 5,548,600, L. Fredrickson, R. Karabed, P. H. Siegel, and H. Thapar, (August 20, 1996).
  18. Parity Check Outer Code and Runlength Constrained Outer Code Usable with Parity Bits, United States Patent No. 6,795,947, M. Öberg and P. H. Siegel, (September 21, 2004).
  19. Parity Check Outer Code and Runlength Constrained Outer Code Usable with Parity Bits, United States Patent No. 7,284,186, P.H. Siegel and M. Öberg, (October 16, 2007).
  20. Parity Check Outer Code and Runlength Constrained Outer Code Usable with Parity Bits, Unite States Patent No. 7,484,168 P.H. Siegel and M. Öberg, (January 27, 2009)

Visitors

Name: Sangho Yun
Email: s7yun@ucsd.edu

Graduate Students

Student Name: Wenyu Peng
Email: w6peng@ucsd.edu

Student Name: Andrew Tan
Email: a2tan@ucsd.edu

Student Name: Simeng Zheng
Email: sizheng@ucsd.edu

Student Name: Ziyuan Zhu
Email: ziz050@ucsd.edu

Undergraduate Students:

Jaron Zamora
Email: j2zamora@ucsd.edu d

 

Alumni

Student Name: Minghai Qin
Dissertation: Signal Processing and Coding for Non-Volatile Memories
Degree: Ph.D.
Year: 2014

Student Name: Aman Bhatia
Dissertation: Improved Coding Techniques for Digital Recording Systems
Degree: Ph.D.
Year: 2014

Student Name: Sharon Aviran
Dissertation: Constrained Coding and Signal Processing for Data Storage Systems [Abstract] [PDF UCSD only]
Degree: Ph.D.
Year: July 2006

Student Name: Jiangxin Chen
Dissertation: Information Rates for Two-Dimensional Recording Channels [Abstract] [PDF UCSD only]
Degree: Ph.D.
Year: June 2005

Student Name: Michael Cheng
Dissertation: Algebraic Soft-Decision Reed-Solomon Decoding Techniques for High-Density Magnetic Recording [Abstract] [PDFUCSD only]
Degree: Ph.D.
Year: June 2004

Student Name: Amir Hadi Djahanshadi
Dissertation:Optimizing and Decoding LDPC codes with Graph-Based Techniques [Abstract] [PDF UCSD only ]
Degree: Ph.D.
Year: March 2010

Student Name: Lynn Greiner
Degree: M.S.
Year: 2009

Student Name: Junsheng Han
Dissertation: Code Representation and Performance of Graph-Based Decoding [Abstract] [PDF UCSD only]
Degree: Ph.D.
Year: April 2008

Student Name: Seyhan Karakulak
Dissertation: From Channel Modeling to Signal Processing for Bit-Patterned Media Recording.
Degree: Ph.D.
Year: April 2010

Student Name: Brian Kurkoski
Dissertation: Algorithms and Schedules for Turbo Equalization [Abstract] [PDF UCSD only]
Degree: Ph.D.
Year: June 2004

Student Name: Bruce Moision
Dissertation: Constrained Coding and Detection for Magnetic Recording Channels [Abstract] [PDF UCSD only]
Degree: Ph.D.
Year: 2000

Student Name: Mats Oberg
Dissertation: Turbo Coding and Decoding for Signal Transmission and Recording Systems [Abstract] [PDF UCSD only]
Degree: Ph.D.
Year: 2000

Student Name: Henry Pfister
Dissertation: On the Capacity of Finite State Channels and the Analysis of Convolutional Accumulate-{m} codes [Abstract] [PDF UCSD only]
Degree: Ph.D.
Year: March 2003

Student Name: Joseph Soriaga
Dissertation: On Near-Capacity Code Design for Partial-Response Channels [Abstract] [PDF UCSD only]
Degree: Ph.D.
Year: June 2005

Student Name: M. Hossein Taghavi
Dissertation: Decoding Linear Codes via Optimization and Graph-Based Techniques [Abstract] [PDF]
Degree: Ph.D.
Year: October 2008

Student Name: Han Wang
Degree: M.S.
Year: March 2011

Student Name: Zheng Wu
Dissertation: Channel Modeling, Signal Processing and Coding for Perpendicular Magnetic Recording [Abstract] [PDF]
Degree: Ph.D.
Year: December 2008

Student Name: Brian Butler
Dissertation: Error Floors of LDPC Codes and Related Topics
Degree: Ph.D.
Year: 2013

Student Name: Aravind Iyengar
Dissertation: Synchronization Error Channels & Windowed Decoding in Theory & Practice
Degree: Ph.D.
Year: 2012

Student Name: Vasu Kanekal
Dissertation: Data Reconstruction from a Hard Disk Drive using Magnetic Force Microscopy
Degree: Ph.D.
Year: 2013

Student Name: Scott Kayser
Dissertation:
Degree: Ph.D.
Year: 2013 

Studnet Name: Xiaojie (Eric) Zhang
Dissertation: LDPC Codes - Structural Analysis and Decoding Techniques
Degree: Ph.D.
Year: 2012 

Past Postdoctoral Researchers

Ido Tal

Eitan Yaakobi

Past Visiting Scholars/Research Scientists

Wai-Ho Mow

Akihiko Takeo

Sashi Chilappagari

Ron M. Roth

Anxiao Jiang

Pascal Vontobel

Past Visiting Students

Hiroshi Kambe

Paul Ellingsen

Henry Pfisher

Garin Federica

Toshio Ito

Maeda Maki

Saeed Sharifi Tehrani

Masoud Alipour Babaei

Ryan Gabys

Spring Quarter 2012
  • ECE 259C: Advanced Topics in Coding: Coding for Storage Systems
Winter Quarter 2012 Fall Quarter 2011 Winter Quarter 2011 Fall Quarter 2010
  • ECE 101 - Linear Systems Fundamentals
Winter Quarter 2010 Fall Quarter 2009
  • ECE 101 - Linear Systems Fundamentals
Spring Quarter 2009 Winter Quarter 2009 Fall Quarter 2008
  • ECE 101 - Linear Systems Fundamentals
Winter Quarter 2008 Fall Quarter 2007