About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 2007
Conference paper
Enumerative encoding with non-uniform modulation constraints
Abstract
A reverse concatenation scheme based on an efficient modulation encoder satisfying non-uniform constraints, a systematic Reed-Solomon encoder and a partial symbol interleaver is presented. This architecture achieves very tight modulation constraints and minimizes error propagation and rate loss. The modulation constraints considered are of the same type as the constraints that have been used in generalized partial-response maximum-likelihood (PRML) detection systems. A class of codes that is based on serial concatenation of a prefix-constrained code and two interleaved enumerative codes with non-uniform constraints is proposed. Specific rate-199/200 PRML(G, I) codes are constructed. ©2007 IEEE.