• Title/Summary/Keyword: 호프만코딩

Search Result 2, Processing Time 0.015 seconds

MPEG-2 AAC Encoder Implementation Using a floating-Point DSP (부동 소수점 DSP를 이용한 MPEG-2 AAC 부호차기 구현)

  • Kim Seung-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.7
    • /
    • pp.882-888
    • /
    • 2005
  • MPEG-2 Advanced Audio Coding (AAC) has already been standardized as a sophisticated next generation technology AAC provides an audio signal that has CD quality at 96-128kbps/stereo. This paper describes a high-quality and efficient software implementation of an MPEG-2 AAC LC Profile encoder. Common scalefactor and noisless coding are accelerated by $45\%$ and $27\%$, respectively, through the use of TMS320C30 instructions. The implemented encoder uses 7.5kWords of program memory, 18kWords of data ROM and 92kBytes of data RAM, respectively. The results of subjective Qualify test showed that the sound quality achieved at 96kbps/stereo was equivalent to that of MP3 at 128kbps/stereo.

  • PDF

A Balanced Binary Search Tree for Huffman Decoding (허프만 복호화를 위한 균형이진 검색 트리)

  • Kim Hyeran;Jung Yeojin;Yim Changhun;Lim Hyesook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.382-390
    • /
    • 2005
  • Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.