Error-pattern-correcting cyclic codes tailored to a prescribed set of error cluster patterns
Збережено в:
| Опубліковано в:: | ProQuest Dissertations and Theses (2007) |
|---|---|
| Автор: | |
| Опубліковано: |
ProQuest Dissertations & Theses
|
| Предмети: | |
| Онлайн доступ: | Citation/Abstract Full Text - PDF |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Короткий огляд: | A new class of error correction codes is proposed that is highly tailored to a prescribed set of dominant error cluster patterns inherent in intersymbol interference channels. The classical method of error correction attempts to correct as many erroneous bits as possible within a codeword, irrespective of the error patterns. The proposed approach, on the other hand, is less concerned about the total number of erroneous bits it can correct, but focuses on a specific set of dominant error cluster patterns, observed at the output of the optimal channel detector. The code construction is based on a generator polynomial that possesses a distinct syndrome set for each error pattern in the target set. By tailoring the generator polynomial specifically to the set of dominant error patterns, the code becomes highly effective in handling single and multiple occurrences of dominant error patterns at a very high code rate. A list decoding strategy, based on a set of test word-error events, is developed for the proposed codes, which efficiently utilizes both the algebraic information from the captured syndrome, and the reliability measures provided by the local pattern correlators matched to the dominant error patterns. By forcing a decoder to correct a single-pattern event for each test input word, multiple decoders running in parallel on the list of test words can effectively correct multiple error-pattern occurrences within the channel detector output word. A new strategy for imposing a {K, G}-constraint is also proposed that can be applied to any recording systems, by making use of the error-pattern-correcting codes. The strategy is based on the deliberate insertion of a short pattern of known type without any rate penalty, in lieu of traditional runlength-limited coding, in order to attain a given { K, G}-constraint. The inserted pattern is then corrected by an error-pattern-correcting list decoder with little extra implementation cost, but without requiring additional error correction capability. |
|---|---|
| ISBN: | 9780549367161 |
| Джерело: | ProQuest Dissertations & Theses Global |