• DocumentCode
    1846942
  • Title

    Signal compression using the discrete linear chirp transform (DLCT)

  • Author

    Alkishriwo, Osama A. ; Chaparro, Luis F.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Pittsburgh, Pittsburgh, PA, USA
  • fYear
    2012
  • fDate
    27-31 Aug. 2012
  • Firstpage
    2128
  • Lastpage
    2132
  • Abstract
    Signal compression aims to decrease transmission rate (increase storage capacity) by reducing the amount of data necessary to be transmitted. The discrete linear chirp transform (DLCT) is a joint frequency instantaneous-frequency transform that decomposes the signal in terms of linear chirps. The DLCT can be used to transform signals that are not sparse in either time or frequency, such as linear chirps, into sparse signals. In this paper, we propose a new algorithm for signal compression based on the direct and the dual DLCT, depending on the sparsity of the signal in either time or in frequency. Furthermore, we develop a data structure for the extracted coefficients of compressed signals. In the data structure, the extracted parameters are arranged in certain way that are predetermined for the compress and decompress processes. The ability of the proposed method in signal compression are demonstrated using test as well as actual signals. The results are compared with those obtained with compressive sensing (CS) method.
  • Keywords
    discrete transforms; signal reconstruction; CS method; compressive sensing method; data structure; discrete linear chirp transform; dual DLCT; joint frequency instantaneous-frequency transform; signal compression; signal sparsity; transmission rate; Chirp; Compressed sensing; Signal to noise ratio; Speech; Time frequency analysis; Transforms; compressive sensing; discrete linear chirp transform; duality; signal compression; sparsity;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European
  • Conference_Location
    Bucharest
  • ISSN
    2219-5491
  • Print_ISBN
    978-1-4673-1068-0
  • Type

    conf

  • Filename
    6333847