CAJ | 학술논문

使用PAR方法形式化推导了解决最优编码问题的Huffman算法.推导过程充分利用最优编码树的特性,在对原问题进行分划归约为子问题时,引入一个新元素来取代原来的2个或多个元素,使用一套接近数学语言的抽象记号表示集合、二叉树等,推导过程简洁且能生成正确的算法.该Huffman算法能在PAR平台上通过自动生成系统转换成可执行语言程序,并正常运行.
사용PAR방법형식화추도료해결최우편마문제적Huffman산법.추도과정충분이용최우편마수적특성,재대원문제진행분화귀약위자문제시,인입일개신원소래취대원래적2개혹다개원소,사용일투접근수학어언적추상기호표시집합、이차수등,추도과정간길차능생성정학적산법.해Huffman산법능재PAR평태상통과자동생성계통전환성가집행어언정서,병정상운행.
Using PAR method,this paper derives formally the Huffman algorithm program for solving optimal encoding problem.It takes full advantage of the properties of optimal encoding tree.As partitioning the source problem into sub-problem,it uses a new element to replace two or more old elements.It provides a suit of abstract notations to represent set,binary tree,which is close to mathematical language.The derivation process is concise and can produce correct algorithm.The Huffman algorithm can transform into executive program and run normally using the automatic generation system in PAR platform.