View this week's entry ad »
Part Inventory
powered by:
Part Finder
Go
powered by:
  • Quick Poll
What Social Networking site do you use the most?



VOTE VIEW RESULTS
Previous Polls
Hotspots » Analog & Mixed SignalPowerEmbedded

Premium Content

Editors' Picks

Featured Industry Resources

Content-Addressable Memory Speeds Up Lossless Compression

When software-implemented compression schemes run out of steam, give your CPU a break by employing these speedy hardware-based techniques.

By Romain Saha

September 29, 2003

Print
Reprints Comment Subscribe

DESIGN VIEW is the summary of the complete DESIGN SOLUTION contributed article, which begins on Page 2.

When software-implemented compression schemes run out of steam, give your CPU a break by employing these speedy hardware-based techniques.

Companies want to reduce their WAN bandwidth requirements to minimize cost and reduce network congestion. As a result of these forces, considerable interest is bubbling up in the area of data compression as a way to reduce the number of packets that must be transmitted across networks.

Two broad categories of compression are currently in use. In lossy compression, data is intentionally discarded. As a result, the decompression of the data doesn't exactly match the original data. This method will allow for higher compression ratios and is useful if the lost data has minimal effect on the decompressed output. Typical applications for lossy compression include audio and video compression.

Lossless compression is used for applications where the original data must be fully restored following decompression. Examples of applications requiring lossless compression include network data, medical and satellite imaging, and military traffic.

Until now, compression algorithms such as the Lempel-Ziv-Welch (LZW) have been implemented in software. This provided acceptable compression performance in many older systems. But with today's increasing numbers of connections, Web servers are now a bottleneck. CPU-intensive compression algorithms can no longer scale to meet next-generation requirements. Plus, as more and more content is served up dynamically, the CPU load increases significantly.

As with many such examples that predate compression, the limitations of software-based implementations are now creating an interest in the migration of this compression technology to hardware—offloading the CPU to perform higher-level functions. However, very little dedicated compression hardware currently exists. But content-addressable memories (CAMs), traditionally targeted at high-speed lookups for packet classification, can represent a key element in the acceleration of lossless compression.

HIGHLIGHTS:
Encoding And Decoding The LZW algorithm encodes variable-length strings of symbols as single codes. Con-struction of the dictionary used to decode is similar to that of the encoding table. But, the tables are used differently. The encoder relies on content searching, while the decoder can be implemented using conventional memory.
CAMs Content-addressable memories (CAMs) speed the searching of content data. In a conventional device, an address is supplied and data is read from the memory. In a CAM, data is presented to the CAM and a parallel search is performed for a match.
Implementation Examples A basic approach yields an average input bit rate of 78 Mbits/s. An enhanced, CAM-optimized scheme boosts the average input rate by 4×

Full article begins on Page 2

Average ( Ratings):
Filed Under:

Check for price and availability on Source ESB:

Go
powered by  

Related Products

You must log on before posting a comment.

Are you a new visitor? Register Now

Acceptable Use Policy

Sponsored Links