(7, 4) Binary Hamming Code for Data Transition of Spread Spectrum Communications

Article Preview

Abstract:

The theory analysis of the (7, 4) binary hamming coding and decoding algorithm in spread spectrum communication is given and implemented with C language programming. The verification testing is implemented on a HD 111 communication principle platform. The theory results are in consistent with that of the experiment. It shows that (7, 4) binary hamming coding could rectify one error symbol which would emerge in the signal transmission process.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

770-773

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Jaehwan Kim and Joong-kuen Lee: Journal of the Acoustical Society of America, Vol. 112 (2002), p.990.

Google Scholar

[2] Amirshahi P., Navidpour S. M., Kavehrad and Mohsen: Power Delivery, Vol. 21(2006), p. (1927).

Google Scholar

[3] Martin Bossert: Channel Coding for Telecommunications (John Wiley & Sons, Inc. New York 1999).

Google Scholar

[4] Farvardin, N.: Information Theory, Vol. 33(1987), p.799.

Google Scholar

[5] Chin-chen chang, Kieu and Yung-Chen Chou: Electronic Commerce and Security, 2008. p.16.

Google Scholar

[6] Viterbi A. J.: Selected Areas in Communications, Vol. 16(1998), p.260.

Google Scholar