Prof. Paul H. Siegel Profile

Prof. Paul H. Siegel

at Univ of California San Diego

SPIE Involvement:

Author

Publications (3)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 22 June 2006 Paper

Information-theoretic limits of two-dimensional optical recording channels

Paul Siegel

Proceedings Volume 6282, 62820W (2006) https://doi.org/10.1117/12.685223

KEYWORDS: Sensors, Detection and tracking algorithms, Binary data, Data storage, Optical storage, Holography, Computer programming, Optical recording, Signal processing, Signal to noise ratio

Read Abstract +

During the past five years, advances in the information-theoretic analysis of "one-dimensional (1D)" recording channels have clarified the limits on linear densities that can be achieved by track-oriented magnetic and optical storage technologies. Channel architectures incorporating powerful codes, such as turbo codes and low-density parity-check codes, have been shown to achieve performance very close to the information-theoretic limits. As 1D track-oriented data storage technologies reach maturity, there is increasing interest in "two-dimensional (2D)" recording technologies, such as two-dimensional optical storage (TwoDOS) and holographic storage. This paper provides an overview of some recently developed techniques for determining analytical bounds and simulation-based estimates for achievable densities of such 2D recording channels, as well as some recently proposed signal processing and coding methods that can move system performance closer to the information-theoretic limits.

Proceedings Article | 22 November 1999 Paper

Efficient coding for a two-dimensional runlength-limited constraint

Ronald Roth, Paul Siegel, Jack Wolf

Proceedings Volume 3802, (1999) https://doi.org/10.1117/12.370243

KEYWORDS: Computer programming, Binary data, Digital recording, Data storage, Transformers, Computing systems, Lanthanum, Holography, Magnetism, Radon

Read Abstract +

Runlength-limited (d,k) constraints and codes are widely used in digital data recording and transmission applications. Generalizations of runlength constraints to two dimension are of potential interest in page-oriented information storage systems. However, in contrast to the one-dimensional case, little is known about the information-theoretic properties of two-dimensional constraints or the design of practical, efficient codes for them. In this paper, we consider coding schemes that map unconstrained binary sequences into two- dimensional, runlength-limited (d, (infinity) ) constrained binary arrays, in which 1's are followed by at least d 0's in both the horizontal and vertical dimensions. We review the derivation of a lower bound on the capacity of two-dimensional (d, (infinity) ) constraints, for d greater than or equal to 1, obtained by bounding the average information rate of a variable-to-fixed rate encoding scheme, based upon a 'bit- stuffing' technique. For the special case of the two- dimensional (1, (infinity) ) constraint, upper and lower bounds on the capacity that are very close to being tight are known. For this constraint, we determine the exact average information rate of the bit-stuffing encoder, which turns out to be within 1% of the capacity of the constraint. We then present a fixed- rate, row-by-row encoding scheme for the two-dimensional (1, (infinity) ) constraint, somewhat akin to permutation coding, in which the rows of the code arrays represent 'typical' rows for the constraint. It is shown that, for sufficiently long rows, the rate of this encoding technique can almost achieve that of the variable-rate, bit-stuffing scheme.

Proceedings Article | 8 December 1995 Paper

Coding for higher-order partial-response channels

Razmik Karabed, Paul Siegel

Proceedings Volume 2605, (1995) https://doi.org/10.1117/12.228239

KEYWORDS: Sensors, Computer programming, Magnetism, Binary data, Information technology, Digital recording, Distance measurement, Silicon, Systems modeling, Magnetic semiconductors

Read Abstract +

Partial-response maximum-likelihood (PRML) methods are now being adopted in many digital magnetic recording systems. It is expected that as linear densities continue to increase, there will be a need to use 'extended' PRML techniques. In fact, commercial systems incorporating extended partial-response target channels, denoted EPRML and EEPRML, employing the EPR4 transfer polynomial h(D) equals 1 plus D minus D² minus D³ and the EEPR4 transfer polynomial h(D) equals 1 plus 2D minus 2D³ minus D⁴, respectively, have recently appeared. Among these systems, several apply the rate 2/3, (d,k) equals (1,7) runlength-limited code, originally designed for use with peak-detection, in combination with a detector trellis structure reflecting the d equals 1 constraint. In the EEPR4 case, the d equals 1 constraint is known to provide a coding gain of 2.2 dB, unnormalized for the rate loss, relative to the uncoded channel. In this paper, we describe a nested family of code constraints, properly containing the d equals 1 constraint, intended for use on the EEPR4 channel. These constraints are shown to have the same distance-enhancing properties as the d equals 1 constraint. They permit the design of practical codes for EEPR4 that offer the same coding gain as the (1,7)-coded system, but with higher achievable code rates. The paper concludes with the construction for such a code which, having rate 4/5, offers a 20% increase over the 1,7) code.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years