Generalized Shift-Map Codes and Their Decoding Using an Iterative Algorithm
| Autor: | Yongseok Yoo |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Block code
Theoretical computer science Iterative Viterbi decoding Computer science List decoding 0102 computer and information sciences 02 engineering and technology Sequential decoding Luby transform code 01 natural sciences 0202 electrical engineering electronic engineering information engineering Turbo code Electrical and Electronic Engineering Low-density parity-check code Error floor Berlekamp–Welch algorithm Concatenated error correction code BCJR algorithm Reed–Muller code 020206 networking & telecommunications Serial concatenated convolutional codes Linear code Computer Science Applications 010201 computation theory & mathematics Modeling and Simulation Algorithm Decoding methods Factor graph |
| Zdroj: | IEEE Communications Letters. 21:1909-1912 |
| ISSN: | 1089-7798 |
| DOI: | 10.1109/lcomm.2017.2712610 |
| Popis: | This letter investigates an iterative algorithm for decoding analog error-correcting codes. First, the shift-map code, one of the widely studied analog codes, is generalized to yield a new family of codes with a more flexible tradeoff between errors at low and high signal-to-noise ratios. Then, an iterative decoding algorithm for the generalized shift-map codes is derived from a message-passing process on a sparse factor graph. Numerical simulations demonstrate that the proposed algorithm decodes generalized shift-map codes following a small number of iterations. Combined with the efficient decoding algorithm, the flexibility of the generalized shift-map codes will enhance the applicability of analog error-correcting codes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|