JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Analysis of CRC-p Code Performance and Determination of Optimal CRC Code for VHF Band Maritime Ad-hoc Wireless Communication
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Analysis of CRC-p Code Performance and Determination of Optimal CRC Code for VHF Band Maritime Ad-hoc Wireless Communication
Cha, You-Gang; Cheong, Cha-Keon;
  PDF(new window)
 Abstract
This paper presents new CRC-p codes for VHF band maritime wireless communication system based on performance analysis of various CRC codes. For this purpose, we firstly describe the method of determination of undetected error probability and minimum Hamming distance according to variation of CRC codeword length. By using the fact that the dual code of cyclic Hamming code and primitive BCH code become maximum length codes, we present an algorithm for computation of undetected error probability and minimum Hamming distance where the concept of simple hardware that is consisted of linear feedback shift register is utilized to compute the weight distribution of CRC codes. We also present construction of transmit data frame of VHF band maritime wireless communication system and specification of major communication parameters. Finally, new optimal CRC-p codes are presented based on the simulation results of undetected error probability and minimum Hamming distance using the various generator polynomials of CRC codes, and their performances are evaluated with simulation results of bit error rate based on the Rician maritime channel model and /4-DQPSK modulator.
 Keywords
dual code;undetected error probability;weight distribution;
 Language
Korean
 Cited by
 References
1.
K. A. Witzke and C. Leung, "A comparison of some error detecting CRC code standards," IEEE Trans. Communications, vol. COM-33, no. 9, pp. 996-998, Sept. 1985.

2.
Tohru Fujiwara, Tadao Kasami, and Shu Lin, "Error detecting capabilities of the shortened Hamming codes adopted for error detection in IEEE standard 802.3," IEEE Trans. Communications, vol. COM-37, no. 9, pp. 986-989, Sept. 1989.

3.
Guy Castagnoli, Stefan Brauer, and Martin Herrmann, "Optimization of cyclic redundancy-check codes with 24 and 32 parity bits," IEEE Trans. Communications, vol. 41, no. 6, pp. 883-892, June 1993. crossref(new window)

4.
Guy Castagnoli, Jurg Ganz, and Patrick Graber, "Optimum cyclic-check codes with 16-bit redundancy," IEEE Trans. Communications, vol. 38, no. 1, pp. 111-114, Jan. 1990. crossref(new window)

5.
Namgi Kim, "Variable CRC scheme for efficient data transmission control for IEEE 802.16e wireless network," Korean Institute of Information Technology(Ki-iT), vol. 7, no. 3, pp. 109-115, 2009. 06.

6.
Shu Lin and Daniel J. Costello, Error Control Coding, 2nd ed., Prentice Hall, 2004.

7.
Tohru Fujiwara, Tadao Kasami, Atsushi Kitai, and Shu Lin, "On the undetected error probability for shortened Hamming codes," IEEE Trans. Communications, vol. COM-33, no. 6, pp. 570-574, June 1985.

8.
Phillip Merkey and Edward C. Posner, "Optimum cyclic redundancy codes for noisy channel," IEEE Trans. Information Theory, vol. IT-30, no. 6, pp. 865-867, Nov. 1984.

9.
G. Funk, "Determination of best shortened linear codes," IEEE Trans. Communications, vol. 44, no. 1, pp. 1-6, Jan. 1996.

10.
Peter Kazakov, "Fast calculation of the number of minimum weight words of CRC codes," IEEE Trans. Information Theory, vol. 47, no. 3, pp. 1190-1195, March 2001. crossref(new window)

11.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.

12.
T. Baicheve, S. Dodunekov and P. Kazakov, "Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy," IEE Proceeding Communications, vol. 147, no. 5, pp. 253-256, Oct. 2000. crossref(new window)

13.
Tenkasi V. Ramabadran and Sunil S. Gaitonde, "A tutorial on CRC computations," IEEE Micro, vol. 8, no. 4, pp.562-74, August 1988.

14.
Dexter Chun and Jack Keil Wolf, "Special hardware for computing the probability of undetected error for certain binary CRC codes and test results," IEEE Trans. Communications, vol. 42, no. 10, pp. 2769-2772, Oct. 1994. crossref(new window)

15.
Vladimir I. Levenshtein, "Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces," IEEE Trans. Information Theory, vol. 41, no. 5, pp. 1303-1321, Sept. 1995. crossref(new window)

16.
Philip Koopman and Tridib Chakravarty, "Cyclic redundancy code (CRC) polynomial selection for embedded networks," The International Conference on Dependable Systems and Networks (DSN-2004), June 2004.

17.
YoungBum Kim, KyungHi Chang, Changho Yun, Jong-Won Park, and Yong-Kon Lim, "Application scenarios of nautical ad-hoc network in wireless mobile communication under maritime environment," Korean Institute of Information and Commun. Eng., vol. 13, no. 10, pp. 2097-2104, 2009. 10.

18.
You-Gang Cha, and Cha-Keon Cheong, "Optimal CRC code selection based on minimum Hamming distance and undetectable error probability according to variable codeword length," Proceeding of the 2011 Korea Signal Processing Conference, pp.403-406, 2011. 09.