• DocumentCode
    1393435
  • Title

    Two-dimensional DCT/DST universal computational structure for 2m×2n block sizes

  • Author

    Britanak, Vladimir ; Rao, K.R.

  • Author_Institution
    Inst. of Control Theory & Robotics, Slovak Acad. of Sci., Bratislava, Slovakia
  • Volume
    48
  • Issue
    11
  • fYear
    2000
  • fDate
    11/1/2000 12:00:00 AM
  • Firstpage
    3250
  • Lastpage
    3255
  • Abstract
    A refined generalized signal flow graph for the direct two-dimensional discrete cosine transform (2-D DCT) and discrete sine transform (2-D DST) computation (the so-called 2-D DCT/DST universal computational structure) is described. It represents a generalized unified approach to the fast 2-D DCT and 2-D DST computation for any 2 m×2n block sizes, i.e., both square and rectangular blocks, including the one-dimensional (1-D) case. The regular structure, moderate arithmetic complexity, numerical stability, and multiple block size capability makes it suitable for VLSI or parallel implementation
  • Keywords
    discrete cosine transforms; matrix algebra; multidimensional signal processing; signal flow graphs; 2D DCT; 2D DCT/DST universal computational structure; 2D DST; VLSI implementation; arithmetic complexity; direct 2D discrete cosine transform; direct 2D discrete sine transform; generalized unified approach; multiple block size capability; numerical stability; one-dimensional case; parallel implementation; rectangular blocks; refined generalized signal flow graph; regular structure; square block; Arithmetic; Discrete cosine transforms; Discrete transforms; Flow graphs; History; Numerical stability; Signal processing; Signal processing algorithms; Two dimensional displays; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.875483
  • Filename
    875483