• DocumentCode
    759217
  • Title

    A Fast Computational Algorithm for the Discrete Sine Transform

  • Author

    Yip, P. ; Rao, K.R.

  • Author_Institution
    McMaster Univ., Hamilton, Ont., Canada
  • Volume
    28
  • Issue
    2
  • fYear
    1980
  • fDate
    2/1/1980 12:00:00 AM
  • Firstpage
    304
  • Lastpage
    307
  • Abstract
    A sparse-matrix factorization is developed for the discrete sine transform (DST). This factorization has a recursive structure and leads directly to an efficient algorithm for implementing the DST, a feature most desirable and very similar ot that of the DCT. This algorithm requires fewer arithmetic operations compared to that for the discrete cosine transform (DCT).
  • Keywords
    Karhunen-Loeve transforms; Sparse-matrix methods; Bit error rate; Computational modeling; Convolutional codes; Decoding; Discrete transforms; Equations; Error analysis; Power generation; Statistics; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOM.1980.1094656
  • Filename
    1094656
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=759217