Skip Navigation

The Computer Journal 1990 33(4):308-313; doi:10.1093/comjnl/33.4.308
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bailey, R. L.
Right arrow Articles by Mukkamala, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Pipelining Data Compression Algorithms

R. L. Bailey1 * and R. Mukkamala2 §

1 UNISYS Defense Systems, Virginia Beach Operations, Virginia Beach, VA 23452, USA, 2 Department of Computer Science, Old Dominion University, Norfolk, VA 23529, USA

Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.

Received February 1990.

* UNISYS Defense Systems, Virginia Beach Operations, Virginia Beach, VA 23452, USA

§ Department of Computer Science, Old Dominion University, Norfolk, VA 23529, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.