By Topic

Good convolutional codes for the precoded (1-D)(1+D)n partial-response channels

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
$31 $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

2 Author(s)
Uchoa Filho, B.F. ; Dept. of Electr. Eng., Notre Dame Univ., IN, USA ; Herro, M.A.

We extend the coding technique for the 1-D channel, due to Wolf and Ungerboeck, to the case of the (1-D)(1+D)n channel. The technique employs a convolutional encoder, a precoder, and the channel in cascade. A computer-aided search for channel codes with large minimum free squared Euclidean distance, dfree2, is introduced. The search is limited to a class of convolutional encoders for which an encoder with constraint length ν generates a decoder trellis with 2ν states only, as opposed to 2ν+n+1 states obtained when a general convolutional encoder is used. These channel codes are said to be totally trellis-matched (TTM) to the (1-D)(1+D)n channel. A limitation on the maximum zero-run length, LMAX is attained by choosing a nontrivial coset of the convolutional code. A class of coset representatives from which the resulting run-length-limited channel codes are TTM is determined. While minimal encoders generate channel codes containing no flawed codewords, it is shown that some nonminimal encoders do the same while achieving larger dgfree2. Both types of encoders are considered in the search. Many new channel codes for the (1-D)(1+D)2 and the (1-D)(1+D)3 channels, with diverse rates and decoding complexities, are tabulated. The codes have relatively low decoding complexity for rates up to 0.8. Two of the new channel codes are compared to a matched spectral null (MSN) code. With the same decoding complexity and code rate, one of these two new channel codes has a smaller dfree2 and larger LMAX than the MSN code. However, with slightly higher decoding complexity, the second new channel code outperforms the MSN code

Published in:

Information Theory, IEEE Transactions on  (Volume:43 ,  Issue: 2 )