Recognition Algorithm for RM Codes Using Fast Hadamard Transform 


Vol. 37,  No. 1, pp. 43-50, Jan.  2012


PDF
  Abstract

The use of an error-correcting code is essential in digital communication systems where the channel is noisy. Unless a receiver has accurate channel coding parameters, it becomes difficult to decode the digitized encoding bits correctly. In this paper, estimation algorithm for RM(Reed-Muller) codes using FHT (Fast Hadamard algorithm) is proposed. The proposed algorithm estimates the channel coding parameters of RM codes and then decodes the codes using the characteristic of FHT. And we also verify the algorithm by performing intensive computer simulation in additive white gaussian noise (AWGN) channel.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

I. Kang, H. Lee, J. Lee, S. Yun, C. Park, Y. Song, "Recognition Algorithm for RM Codes Using Fast Hadamard Transform," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 1, pp. 43-50, 2012. DOI: .

[ACM Style]

In-sik Kang, Hyun Lee, Jae-hwan Lee, Sang-bom Yun, Cheol-sun Park, and Young-joon Song. 2012. Recognition Algorithm for RM Codes Using Fast Hadamard Transform. The Journal of Korean Institute of Communications and Information Sciences, 37, 1, (2012), 43-50. DOI: .

[KICS Style]

In-sik Kang, Hyun Lee, Jae-hwan Lee, Sang-bom Yun, Cheol-sun Park, Young-joon Song, "Recognition Algorithm for RM Codes Using Fast Hadamard Transform," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 1, pp. 43-50, 1. 2012.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880