loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th IEEE International Workshop on Rapid System Prototyping (RSP'01)
Prototyping of Efficient Hardware Algorithms for Data Compression in Future Communication Systems
Monterey, California
June 25-June 27
ISBN: 0-7695-1206-2
A. Mukherjee, University of Central Florida
N. Motgi, University of Central Florida
J. Becker, Institute of Microelectronic Systems, Darmstadt University of Technology
A. Friebe, Institute of Microelectronic Systems, Darmstadt University of Technology
C. Habermann, Institute of Microelectronic Systems, Darmstadt University of Technology
M. Glesner, Institute of Microelectronic Systems, Darmstadt University of Technology
Abstract: Due to high bandwidth requirements up to 2 Mbits/sec in third generation mobile communication systems, efficient data compression approaches are necessary to reduce communication and storage costs. Recent VLSI technologies status promises complete System-on-Chip (SoC) solutions for both mobile and network based communication systems, including new compression algorithms based on Burrows-Wheeler transform (BWT). The most complex task of the BWT algorithm is its lexicographic sorting of n cyclic rotations of a given string of n characters. The paper discusses the feasibility and VLSI implementation of this scalable BWT architecture in simulating and prototyping its systolic highly utilized hardware structure with Virtex FPGAs.
Citation:
A. Mukherjee, N. Motgi, J. Becker, A. Friebe, C. Habermann, M. Glesner, "Prototyping of Efficient Hardware Algorithms for Data Compression in Future Communication Systems," rsp, pp.0058, 12th IEEE International Workshop on Rapid System Prototyping (RSP'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.