Nobody downloaded yet

Compression Algorithms - Research Paper Example

Comments (0) Cite this document
Compression Algorithms: Name: Institution: Course: Tutor: Date: Introduction In information theory and computer technology, source coding, reduction in the bit rate or data compression involves encoding of information by the use of fewer bits compared to original representations…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER97.2% of users find it useful
Compression Algorithms
Read TextPreview

Extract of sample "Compression Algorithms"

Download file to see previous pages This process of size reduction of data is popularly known as compression of data, though it was formally known as source coding. Compression is important as it aids in cutting down the use of resources, like space of data storage or capacity of transmission. As compressed data should be decompressed in order to use, the extra processing computation or costs that arise from decompression, the situation differs far from free lunch. Algorithm compression is likely to be subjected to a trade off of time space complexity. For example, a video compression scheme needs a costly hardware to decompress the video with speed for it to be observed during the decompressing process. Opting for decompression of the video before watching may be of inconvenience or may need additional storage. Data compression design schemes entail tradeoffs amid various factors, inclusive of compression degree, distortion introduced and required computational resources to uncompress and compress the data. There are new options for traditional systems that sample fully then compress providing effective usage of resource based on compressed sensing principles. Compressed sensing methods circumvent the requirement for compression of data choosing from a selected basis. Origin The compression is either lossless or lossy. ...
Compression is important as it aids in cutting down the use of resources, like space of data storage or capacity of transmission. Algorithm compression has played an important role in IT from the 1970s. During this time, internet was growing in its popularity and there was invention of Lempel-Ziv algorithms. The Lempel-Ziv algorithm unfortunately, has a stretched history in non-computing. The earliest invention of compression algorithms is the Morse code that took place in 1883. It involves the a compression of data entailing common letters found in English like t and e which are allocated Morse codes that are shorter. Later, when mainframe computers started taking hold in the year 1949, Robert Fano and Claude Shannon invented coding that was named Shannon-Fan. Their algorithm allocates codes to cipher in a specific data blocks based on likelihood of occurrence of the symbol. The probability being of one symbol occurring is indirectly proportional to the code length which results to a shorter means of representing data (Wolfram, 2002) After two years, David Huffman as he studied information theory shared a class with Fano Robert. Fano issued the class with the option of either taking final exam or writing a research paper. Huffman made for the research paper that was on the topic of working out on the most effective binary coding method. After a research carried out for months that proved not to be fruitful, Huffman almost gave up on the work to study for a final exam to cover for the paper. At that point is when Huffman got an epiphany, building a technique that was more efficient yet similar to the coding of Shannon-Fano. The major difference between Huffman and Shannon-Fano is in the later is there is a bottom-up built ...Download file to see next pagesRead More
Cite this document
  • APA
  • MLA
(“Compression Algorithms Research Paper Example | Topics and Well Written Essays - 1750 words”, n.d.)
Compression Algorithms Research Paper Example | Topics and Well Written Essays - 1750 words. Retrieved from
(Compression Algorithms Research Paper Example | Topics and Well Written Essays - 1750 Words)
Compression Algorithms Research Paper Example | Topics and Well Written Essays - 1750 Words.
“Compression Algorithms Research Paper Example | Topics and Well Written Essays - 1750 Words”, n.d.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document

CHECK THESE SAMPLES OF Compression Algorithms

Breaker Failure Detection Algorithms

...Breaker Failure Detection Algorithms In a power system world, breaker failure protection became a critical element to provide a back up protection for circuit breakers (CBs). Practically, every apparatus is equipped with primary protection to interrupt the current flow whenever a fault occurs. Thus, the breaker failure relay opens adjacent breakers to isolate the problem. Fast and secure breaker failure detection algorithm would be a critical challenge facing a numerical BF relay. In the first part, it presents the need for breaker failure protection. The second part addresses issues worth consideration when applying Breaker Failure Protection and lastly, advances towards breaker Failure Protection....
7 Pages(1750 words)Research Paper

Compression in Media

...? Compression in Media Introduction In the modern day phenomenon, media is believed to play an imperative part in our life and the overall society. The smooth run of important information is considered to be vital for the reason of contributing to the progress of the overall society as well as the communities. This run of information is learnt to be facilitated by the different forms of media present around us. The absence of the efficient flow or exchange of such extensive information would as a result restrict the viewpoints and attitudes of the general people further exploiting their respective thoughts and inferences in relation to the happenings in the world around them. It needs to be mentioned in this context that...
5 Pages(1250 words)Essay

Data Compression Algorithms.Use of Compression Algorithms in Forensics

...?Data Compression Algorithms From the many years, numerous data compression algorithms have been developed to deal with specific data compression problem. From the developed data compression algorithms, there does not exist a single compression algorithm that compress all data types efficiently. Therefore, each algorithm has a number of strengths as well as weaknesses. The compression algorithms are also commonly used in forensics. These algorithms are used to reduce space amount required to store data on the computer hard disk. Usually, these algorithms are employed on the large files so that their size may be reduced. Mainly, there are two types of the compression algorithms include: lossless and lossy algorithms. The lossless... ...
4 Pages(1000 words)Essay

Compression Molded Tires

...Compression Molded Tires An automobile is composed of various parts both seen and unseen. The complexities embedded within the structure require every part to be present so as to perform the function of the whole machine. One of the most vital parts in an automobile is the tires. Compression molded tires are significant parts of the automobile that offers a lot of advantages in the automobile ensemble as well as in the auto industry. I. Tires Design and Parameters Tires are basically the structures that cause the automobile to run. They look like simple and homogenous made materials, but actually they are mixtures of different kinds of materials such as carbon black, rubber, inorganic and organic materials, wires or fabrics... in the...
6 Pages(1500 words)Assignment

Video Compression

...up less space, is easier to distribute, and so forth. There are different brands and types of concentrate to meet the consumers' needs or desires. Likewise, video compression takes a large file and makes it smaller. The smaller files require less hard disk space, less memory to run, and less bandwidth to play over networks or the Internet. Many compression schemes exist and have their specific strengths and weaknesses. According to Video/Imaging DesignLine "Video compression algorithms" ("codecs") manipulate video signals to dramatically reduce the storage and bandwidth required while maximizing perceived video quality. Understanding the operation of video codecs is...
12 Pages(3000 words)Essay

Genetic Algorithms

...Running Head: GENETIC ALGORITHMS GENETIC ALGORITHMS [The [The of the Genetic Algorithms Genetic Algorithms The N-Queens problem is a traditional AI problem. Its name is resulting from the allowable moves for the ruler part in chess. Queens are allowable to move flat, vertically, or diagonally, toward the back and forward, with the merely restriction being that they can go in only one course at a time. A queen that can reach one more piece in one move capture it. The N-Queens problem is based on the idea of trying to put N queens on an N x N grid, such that no ruler will be able to imprison any other queen. The N-queens problem is characteristic of a lot of combinatorial...
4 Pages(1000 words)Essay

Genetic Algorithms

...Genetic algorithms are used as a synthetic but extremely useful means of solving extremely complex problems. It is a particularly beneficial means of problem solving because it is an efficient way of managing large quantities of arbitrary information. The use of GA’s is not limited to genetics but rather is used in business and other professional fields. For argument’s sake, we will approach genetic algorithms in this paper, from a Biological approach. approach. The principles of the genetic algorithm rests on the principles of natural selection, evolution and Mendelian Genetics. (Jamshidi 2003). The preliminary step to a genetic algorithm is to identify a means of...
3 Pages(750 words)Essay

Data Compression

...compression methods. According to Yoshida, Morihara, Yahagi, & Satoh (1999), the text compression and pattern matching algorithms are two significant subjects in the extensive field of text processing. These text compression and pattern matching algorithms are implemented to deal with the texts (word editors), to the management and handling the storage of text compression (textual data), as well as to data repossession systems (full text search). In addition, they are fundamental components employed in development of the practical software executing on the majority of operating systems. Furthermore, they highlight programming techniques...
6 Pages(1500 words)Essay

Compression test

...Compression Test Lecturer: Address: Side Crushing Side Crushing Compression is the use of forces that work towards theinside of an object. In the case of side crushing a can, the forces are subjected to the sides of the can. In the graph, the can is subjected to a progressive force, which is increased evenly. From the results, the standard travel (mm) is reflected with an application of little force. This can be derived from the structure of the soda can. From the graph, it is evident that the material used in the construction is not ductile as upon reaching the ultimate stress, it crumbles (Voland, 2003, p. 191). The lateral forces acting on the can ultimately act on a single line, which is, takes a...
1 Pages(250 words)Essay

Routing Algorithms

...Routing Algorithms I.D. of the Routing Algorithms In this paper, some widely used complex routing algorithms are discussed which can be used to manage complicated networks and build routing tables. Today, OSPF is most widely used while once popular RIP is undergoing extensive development. (Forouzan 2006) Open Shortest Path First (OSPF) OSPF is a complex routing algorithm that can analyze the link-state situation of the given network. It can maintain the routes for all possible destinations in a network continuously. The routing table built by OSPF is based on topology database, and selection of nodes is done along shortest paths. The shortest path has least number of...
2 Pages(500 words)Assignment
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.

Let us find you another Research Paper on topic Compression Algorithms for FREE!

Contact Us