A New Production method of GRM coefficients using k-map 


Vol. 30,  No. 9, pp. 860-870, Sep.  2005


PDF
  Abstract

In this paper we propose a new method to derive GRM(Generalized Reed-Muller) coefficients for each 2ⁿ polarities using cell of karnaugh map(k-map).
Generally, there are the serial and parallel method to derive GRM coefficients. As a serial method, Green method generates GRM coefficients using transform matrix. And as a parallel method, Besslich algorithm produces GRM coefficients of each polarity using the generated anteriorly.
Green's method generates GRM coefficients for n-variable by calculating transform matrix for one-variable and n-times kronecker product this matrix. And Besslich's method generates GRM coefficients of each polarity in order of Grey-code. But those methods have disadvantages that the number of variable exceeding four makes transform matrix large and there are so many operation steps.
In this paper, GRM coefficients is generated by producing cell [f_i] minimizing variable on k-map and operating this cell [f_i] and transform matrix for one-variable. So, we can generate GRM coefficients of all polarities easily by using the proposed method.

  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]

이철우(Chol-U Lee), 차문철(Wenzhe Che), 김흥수(Heung-Soo Kim), "A New Production method of GRM coefficients using k-map," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 9, pp. 860-870, 2005.

[ACM Style]

이철우(Chol-U Lee), 차문철(Wenzhe Che), and 김흥수(Heung-Soo Kim). 2005. A New Production method of GRM coefficients using k-map. The Journal of Korean Institute of Communications and Information Sciences, 30, 9, (2005), 860-870.

[KICS Style]

이철우(Chol-U Lee), 차문철(Wenzhe Che), 김흥수(Heung-Soo Kim), "A New Production method of GRM coefficients using k-map," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 9, pp. 860-870, 9. 2005.