• DocumentCode
    1231146
  • Title

    An efficient two-dimensional inverse discrete cosine transform algorithm for HDTV receivers

  • Author

    Yang, Jar-Fen ; Bai, Bor-Long ; Hsia, Shih-Chang

  • Author_Institution
    Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
  • Volume
    5
  • Issue
    1
  • fYear
    1995
  • fDate
    2/1/1995 12:00:00 AM
  • Firstpage
    25
  • Lastpage
    30
  • Abstract
    In this paper, we propose an efficient two-dimensional inverse discrete cosine transform (2-D IDCT) algorithm based upon coefficient-by-coefficient implementations. The algorithm, which is developed in the use of the symmetrical properties of computational kernel matrices, can effectively combine with the run length code (RLC) decoder in progressive manners. The proposed method requires only N/2 multipliers in an `N×N´ 2-D IDCT processor. By evaluating the efficiency performance, the processor can complete 2N/M pixels per multiplier per system cycle where M is the number of non-zero quantized DCT coefficients. Due to its inherent parallel and coefficient-by-coefficient characteristics, the proposed efficient 2-D IDCT algorithm is suitable for the future digital HDTV receivers and recording systems
  • Keywords
    decoding; digital television; discrete cosine transforms; high definition television; matrix algebra; runlength codes; television receivers; video coding; 2-D IDCT processor; HDTV receivers; N/2 multipliers; coefficient-by-coefficient implementations; computational kernel matrices; efficiency performance; efficient two-dimensional inverse discrete cosine transform algorithm; quantized DCT coefficients; recording systems; run length code decoder; symmetrical properties; Computational complexity; Decoding; Digital recording; Discrete cosine transforms; Discrete transforms; Frequency; HDTV; Karhunen-Loeve transforms; Kernel; Symmetric matrices;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems for Video Technology, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1051-8215
  • Type

    jour

  • DOI
    10.1109/76.350775
  • Filename
    350775