Art of constructing low-complexity encoders/decoders for constrained block codes
Suppose we are given a block code, that is, a list of at least 2/sup p/ q-bit self-concatenable codewords. A rate p:q block encoder is a dataword-to-codeword assignment from 2/sup p/ p-bit datawords to 2/sup p/ q-bit codewords, and the corresponding block decoder is the inverse of the encoder. We pr...
Uložené v:
| Vydané v: | Information Theory: 2000 IEEE International Symposium On s. 147 |
|---|---|
| Hlavní autori: | , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
2000
|
| Predmet: | |
| ISBN: | 9780780358577, 0780358570 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | Suppose we are given a block code, that is, a list of at least 2/sup p/ q-bit self-concatenable codewords. A rate p:q block encoder is a dataword-to-codeword assignment from 2/sup p/ p-bit datawords to 2/sup p/ q-bit codewords, and the corresponding block decoder is the inverse of the encoder. We propose efficient heuristic computer algorithms (i) to eliminate the excess codewords; and (ii) to construct low hardware complexity block encoders/decoders. Constructing low-complexity encoder/decoders for very high rate codes is of immense economical value-as these codes may be implemented in mass-market magnetic recording systems. For several practical constraints, block encoders/decoders generated using the proposed algorithms are comparable in complexity to human-generated encoders/decoders, but are significantly simpler than lexicographical encoders/decoders. |
|---|---|
| ISBN: | 9780780358577 0780358570 |
| DOI: | 10.1109/ISIT.2000.866439 |