# 0.6 Compression of nonparametric sources  (Page 3/3)

 Page 3 / 3

Because of the AEP  [link] ,

$Pr\left({x}_{1}^{l},:,\left|\frac{-log\left(Pr\left({x}_{1}^{l}\right)\right)}{{l}_{0}},-,H\right|,>,ϵ\right)\to 0.$

Therefore, for a typical input $Pr\left({x}_{1}^{l}\right)>{2}^{-{l}_{0}\left(H+ϵ\right)}$ .

Recall that the interval length is ${l}_{0}=\frac{log\left({n}_{w}\right)}{H+2ϵ},$ and so the probability that an interval cannot be found in the history is

$\frac{{2}^{-{l}_{0}\left(H+2ϵ\right)}}{{2}^{-{l}_{0}\left(H+ϵ\right)}}={2}^{-{l}_{0}ϵ}\to 0.$

For a long enough interval, this probability goes to zero.

## Redundancy of parsing schemes

There are many Ziv-Lempel style parsing algorithms  [link] , [link] , [link] , and each of the variantshas different details, but the key idea is to find the longest match in a window of length ${n}_{w}$ . The length of the match is $L$ , where we remind the reader that $L\approx \frac{log\left({n}_{w}\right)}{H}$ .

Now, encoding $L$ requires $log\left({n}_{w}\right)$ bits, and so the per-symbol compression ratio is $\frac{log\left({n}_{w}\right)}{L}$ , which in the limit of large ${n}_{w}$ approaches the entropy rate $H$ .

However, the encoding of $L$ must also desribe its length, and often the symbol that follows the match. These require length $log\left(L\right)\approx log\left(log\left({n}_{w}\right)\right)$ , and the normalized (per-symbol) cost is

$\frac{log\left(log\left({n}_{w}\right)\right)}{L}=O\left(\frac{log\left(log\left({n}_{w}\right)\right)}{log\left({n}_{w}\right)}\right).$

Therefore, the redundancy of Ziv-Lempel style compression algorithms is proportional to $O\left(\frac{log\left(log\left(n\right)\right)}{log\left(n\right)}\right)$ , which is much greater than the $O\left(\frac{log\left(n\right)}{n}\right)$ that we have seen for parametric sources. The fundamental reason why the redundancy is greater is that the class of non-parametric sources is much richer. Detailedredundancy analyses appear in a series of papers by Savari (c.f.  [link] ).

## Parsing for lossy compression

The parsing schemes that we have seen can also be adapted to lossy compression. Let us describe several approaches along these lines.

Fixed length: The first scheme, due to Gupta et al.  [link] , constructs a codebook of size $\approx {2}^{LR\left(D\right)}$ codewords, where $L$ is the length of the phrase being matched and $R\left(D\right)$ is the rate distortion function. The algorithm cannot search for perfect matches of the phrase, because this is lossy compression. Instead, it seeks the codeword that matches our input phrase most closely. It turns out that for large $L$ the expected distortion of the lossy match will be approximately $D$ per symbol.

Variable length: Another approach, due to Gioran and Kontoyiannis  [link] , constructs a single long database string, and searches for the longest match whose distortion w.r.t. the input is approximately $D$ ; the location and length of the approximate match are encoded. Seeing that the database is of length $\approx {2}^{LR}$ , encoding the location requires $\approx LR$ bits, and the $D$ -match (a match with distortion $D$ w.r.t. the input string) is typically of length $\approx L$ , giving a per-symbol rate of $\approx R\left(D\right)$ bits.

An advantage of the latter scheme by Gioran and Kontoyiannis  [link] is reduced memory use. The database is a string of length $\approx {2}^{LR\left(D\right)}$ , instead of a codebook comprised of $\approx {2}^{LR\left(D\right)}$ codewords, each of length $L$ . On the other hand, the Gupta et al. algorithm  [link] has better $RD$ performance, because it does not need to spend $\approx log\left(L\right)$ bits per phrase to describe its length. An improved algorithm, dubbed the hybrid algorithm by Gioran and Kontoyiannis, constructs a single database and performs fixed length coding for the best match of length $L$ in the database. Therefore, it combines the memory usage of a single database approach with the $RD$ performance of fixed length coding.

#### Questions & Answers

Is there any normative that regulates the use of silver nanoparticles?
Damian Reply
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
Stoney Reply
why we need to study biomolecules, molecular biology in nanotechnology?
Adin Reply
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
Adin
why?
Adin
what school?
Kyle
biomolecules are e building blocks of every organics and inorganic materials.
Joe
anyone know any internet site where one can find nanotechnology papers?
Damian Reply
research.net
kanaga
sciencedirect big data base
Ernesto
Introduction about quantum dots in nanotechnology
Praveena Reply
what does nano mean?
Anassong Reply
nano basically means 10^(-9). nanometer is a unit to measure length.
Bharti
do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
Damian Reply
absolutely yes
Daniel
how to know photocatalytic properties of tio2 nanoparticles...what to do now
Akash Reply
it is a goid question and i want to know the answer as well
Maciej
characteristics of micro business
Abigail
for teaching engĺish at school how nano technology help us
Anassong
Do somebody tell me a best nano engineering book for beginners?
s. Reply
there is no specific books for beginners but there is book called principle of nanotechnology
NANO
what is fullerene does it is used to make bukky balls
Devang Reply
are you nano engineer ?
s.
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
Tarell
what is the actual application of fullerenes nowadays?
Damian
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
Tarell
what is the Synthesis, properties,and applications of carbon nano chemistry
Abhijith Reply
Mostly, they use nano carbon for electronics and for materials to be strengthened.
Virgil
is Bucky paper clear?
CYNTHIA
carbon nanotubes has various application in fuel cells membrane, current research on cancer drug,and in electronics MEMS and NEMS etc
NANO
so some one know about replacing silicon atom with phosphorous in semiconductors device?
s. Reply
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
Do you know which machine is used to that process?
s.
how to fabricate graphene ink ?
SUYASH Reply
for screen printed electrodes ?
SUYASH
What is lattice structure?
s. Reply
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
what is biological synthesis of nanoparticles
Sanket Reply
Got questions? Join the online conversation and get instant answers!
Jobilize.com Reply

### Read also:

#### Get the best Algebra and trigonometry course in your pocket!

Source:  OpenStax, Universal algorithms in signal processing and communications. OpenStax CNX. May 16, 2013 Download for free at http://cnx.org/content/col11524/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Universal algorithms in signal processing and communications' conversation and receive update notifications?  By Mistry Bhavesh        By