It is possible to employ different dictionaries for signal decomposition by using the matching pursuit algorithm. In this paper the atoms of four different dictionaries are compared together. The comparisons have been done in both the ambiguity and time-frequency domains, resulting in an identification of those atoms most suitable for time-frequency signal decomposition.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A comparison of different time-frequency atoms in both ambiguity and time-frequency domains


    Contributors:


    Publication date :

    2003-01-01


    Size :

    228546 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English