Analog Codes for Gross Error Correction in Signal Transmission

Article Preview

Abstract:

We proposed a novel decoding algorithm for Analog Codes (Reed-Solomon Codes over complex numbers), the syndrome repairing (SR) algorithm, for gross error correction in signal transmission. Simulations show that, if the number of gross errors is not too large and the amplitude of background noise is small enough (compared to the amplitude of gross errors), the SR algorithm recovers the original signal with nearly the same accuracy as if no gross errors occur upon transmission. In particular, if the transmission is background-noise-free, then the recovery is exact.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 341-342)

Pages:

514-518

Citation:

Online since:

September 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Jack Keil Wolf, Analog codes, " in IEEE International Conference on Communication (ICC, 83), Boston, MA, USA, vol. 1, p.310–312, June (1983).

Google Scholar

[2] Werner Henkel and Fangning Hu, OFDM and analog RS/BCH codes, in 10th International OFDM-Workshp, Hamburg, August (2005).

Google Scholar

[3] Thomas G. Marshall, Coding of real-number sequences for error correction: a digital signal processing problem, IEEE Journal on Selected Areas in Communications, vol. SAC-2, no. 2, p.381–392, March (1984).

DOI: 10.1109/jsac.1984.1146063

Google Scholar

[4] I. S. Reed and G. Solomon, Polynomial codes over certain finite fields, Journal of the Society for Industrial and Applied Mathematics, vol. 8, no. 2, p.300–304, (1960).

DOI: 10.1137/0108018

Google Scholar

[5] Richard E. Blahut, Algebraic codes for data transmission, Cambridge University Press, (2003).

Google Scholar

[6] G. W. Stewart and Ji-Guang Sun, Matrix Perturbation theory, Academic Press, San Diego, (1990).

Google Scholar

[7] Moody T. Chu, Robert E. Funderlic, and Robert J. Plemmons, Structured low rank approximation, Linear Algebra and Its Applications, vol. 366, p.157–172, June (2003).

DOI: 10.1016/s0024-3795(02)00505-0

Google Scholar