Chung-Hua University Repository:Item 987654321/37360
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 8557/14866 (58%)
Visitors : 1417297      Online Users : 1707
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/37360


    Title: The Fast DCT and IDCT Algorithm by Subband Decomposition of signal
    Authors: 謝曜式
    Shieh, Yaw-Shih
    Contributors: 電子工程學系
    Electronics Engineering
    Keywords: 離散餘旋轉換;反離散餘旋轉換;子頻帶分解
    discrete cosine transforms;DCT;IDCT;Inverse Discrete Cosine Transforms;subband decomposition
    Date: 2009
    Issue Date: 2014-07-01 10:24:15 (UTC+8)
    Abstract: 為了簡化傳統的DCT演算法，減少運算的複雜度，並且加快傳統DCT演算法的運算速度。在此設計前提之下，我們首先將輸入信號分解成多階層的信號再與SB_DCT及SB_DST運算。將輸入的信號分解成許多的子信號：ㄧ部分的子信號是原信號的平均，另一部份的子信號是原信號的差分，利用多階層的運算達到加快傳統DCT運算的速度與大幅降低運算的複雜度。
    DCT (Discrete Cosine Transforms) and IDCT (Inverse Discrete Cosine Transforms) are widely used for digital signal and image processing. Computational efficiency of DCT and IDCT dominate the performance of processing. How to improve computational effici
    Appears in Collections:[Department of Microelectronics] Journal Articles

    Files in This Item:

    File Description SizeFormat
    p_i403_0047.pdf26KbAdobe PDF139View/Open


    All items in CHUR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback