• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage StatisticsView Google Analytics Statistics

    Bandwidth compression

    Thumbnail
    View/Open
    200411028.pdf (267.0Kb)
    Date
    2006
    Author
    Patel, Deven
    Metadata
    Show full item record
    Abstract
    Bandwidth compression implies a reduction in bandwidth of an information carrying signal without reducing the information content of the signal. Methods such as PCM, DPCM and other redundancy removal algorithms rely on the sample-by-sample values of the signal. The work described in the thesis looks at the possibilities of encoding the sequences using shorter description, based on their second order moments. A Markov model is the simplest realization of an information source. As proved by the Asymptotic Equipartition Property [Sha48], not all sequences are produced with the same probability by such a source. Only a fraction of the total sequences is produced with a high probability. The number of these high probability sequences decide the number of bits required to represent these sequences. The number of these sequences are calculated for different models. An estimate of autocorrelation for lag 1 of these sequences is then made. The results then show that the bit rate reduction increases with the correlation coefficient.
    URI
    http://drsr.daiict.ac.in/handle/123456789/126
    Collections
    • M Tech Dissertations [923]

    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     


    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV