By Topic

Adaptive Coding for Self-Clocking Recording

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Andrew Gabor ; 30 Burlington Road, Bedford, Mass. 01730.

Self-clocking of binary information involves a coding constraint whereby the maximum length of zero strings is limited to a predetermined number. For reasons of operational stability it is desirable to keep this number low. The price of such constraint is a degradation in code density. The class of serial recording which includes the well-known frequency modulation and phase encoding represents one extreme where every other symbol is mandatory, making the code density one bit for every two symbols. This paper describes a coding method which improves code efficiency while maintaining the constraint on the length of zero strings. It will be shown that adaptive coding, which is an extension of the block code concept known from information theory, offers a significant improvement. The concept is illustrated by describing a practical application in which the code density is improved from two symbols per bit to three symbols per bit pair, while keeping the maximum length of zero strings to one. It is shown that while this technique represents an improvement by one third over phase encoding, it approaches the theoretical limit for this class of codes to within 4 percent.

Published in:

IEEE Transactions on Electronic Computers  (Volume:EC-16 ,  Issue: 6 )