We address the problem of code size minimization in VLSI systems with embedded DSP processors. Reducing code size reduces the production cost of embedded systems. We use data compression methods to develop code size m...
详细信息
We address the problem of code size minimization in VLSI systems with embedded DSP processors. Reducing code size reduces the production cost of embedded systems. We use data compression methods to develop code size minimization strategies. We present a framework for code size minimization where the compressed data consists of a dictionary and a skeleton. The dictionary can be computed using popular text compression algorithms. We describe two methods to execute the compressed code that have varying performance characteristics and varying degrees of freedom in compressing the code. Experimental results obtained with a TMS320C25 code generator are presented.
Real-time video compression is a challenging subject for FPGA implementation because it typically has a large computational complexity and requires high data throughput. Previous implementations have used parallel ban...
详细信息
Real-time video compression is a challenging subject for FPGA implementation because it typically has a large computational complexity and requires high data throughput. Previous implementations have used parallel banks of FPGAs or DSPs to meet these requirements. Using design techniques that maximize FPGA utilization, we have implemented two video compression systems, each of which uses a single FPGA. In the first system, algorithmic optimizations are made to create a low-complexity implementation that exploits the in-system programmability of the FPGA. This low-complexity implementation performs well, but is limited to a single compression algorithm. In the second system, the FPGA is augmented with an external, low-complexity, video signal processor (VSP.) This combination of ASIC and FPGA is flexible enough to implement four common compression algorithms, and powerful enough to execute them in real time.
Summary form only given. A new algorithmic approach to block data compression, using a highly contextual codification of the dictionary, that gives substantial compression-rate advantages over existing technologies, i...
详细信息
Summary form only given. A new algorithmic approach to block data compression, using a highly contextual codification of the dictionary, that gives substantial compression-rate advantages over existing technologies, is described. The algorithm takes into account the limitations and characteristics of small systems, such as a low consumption of memory, high speed and short latency, as required by communication applications. It uses a novel construction of the prefix-free dictionary, a simple but powerful heuristic for filtering out the non-compressed symbols and a predictive dynamic prefix coding for the output entities. It also employs universal codification of the integers, allowing a very fast and direct implementation in silicon. A dynamic compression software package is detailed. Also, several techniques developed to maximize the usable disk-space and the software speed, among others, are discussed.
Unsupervised artificial neural learning algorithms have clearly demonstrated their practical value for vector quantization of speech and stationary images. We examine competitive learning as an adaptive compression al...
详细信息
Unsupervised artificial neural learning algorithms have clearly demonstrated their practical value for vector quantization of speech and stationary images. We examine competitive learning as an adaptive compression algorithm for highly repetitious video signals such as those found in animated cartoons. The characteristics of animated video are presented and their suitability for compression are examined. An artificial neural network system based on the soft competitive learning algorithm is presented for the adaptive compression of these video signals. Based on comparisons with existing compression techniques, this investigation indicates that a compression ratio of better than 100:1 is a reasonable expectation.
A compression technique is required to increase the efficiency of the communication channel. The LZW (Lempel Ziv Welch) algorithm is used as a compression algorithm in communication channel. The LZW algorithm, however...
详细信息
ISBN:
(纸本)0780324862
A compression technique is required to increase the efficiency of the communication channel. The LZW (Lempel Ziv Welch) algorithm is used as a compression algorithm in communication channel. The LZW algorithm, however, has some redundancies in Hangeul text and voice. The VDI-LZW (voice data integrated LZW) algorithm that decreases the redundancies of the LZW algorithm is suggested as an efficient compression method of Hangeul text and voice. The VDI-LZW algorithm uses both the codeword of the complete Hangeul and a variable length codeword methodology in data compression. For voice compression, it uses the differential method that reduces the codeword size as well as the length of repeated string. This increases the repetition ratio. According to the simulation results, it can be seen that the performance of the proposed compression algorithm is better by 4% to 18% in the data compression ratio and by 35% to 44% in the voice compression ratio than that of the conventional modified LZW algorithms.
Summary form only given. As part of an industry standardization effort, we have evaluated compression algorithms for throughput enhancement in a synchronous communication environment. Synchronous data compression syst...
详细信息
Summary form only given. As part of an industry standardization effort, we have evaluated compression algorithms for throughput enhancement in a synchronous communication environment. Synchronous data compression systems are link layer compressors used between digital transmission devices in internetworks to increase effective throughput. compression is capable of speeding such links, but achievable performance is effected by interaction of algorithm, the networking protocols, and implementation details. The compression environment is different from traditional file compression in inducing a trade-off between compression ratio, compression time, and the performance metric (network throughput). In addition, other parameters and behavior are introduced, including robustness to data retransmission and multiple interleaved streams. Specifically, we have evaluated the following issues through both synchronous queuing and direct network simulation: (1) relative algorithm capability; (2) throughput improvement for various algorithms as a function of compression processor capability; (3) the impact of multiple compression context; (4) protocol interactions; and (5) specialized algorithms.
Lossless waveform data compression is useful in application areas where the fidelity of the signal being compressed is critical, This paper presents a two stage lossless seismic waveform data compression algorithm and...
详细信息
Lossless waveform data compression is useful in application areas where the fidelity of the signal being compressed is critical, This paper presents a two stage lossless seismic waveform data compression algorithm and a discussion of various issues related to the algorithm's real time implementation. The first stage of the algorithm performs lossless adaptive prediction using a recursive least squares lattice (RLSL) while the second stage performs arithmetic coding. The RLSL uses an a priori algorithm and floating-point operations. The second stage of the algorithm uses an arithmetic coding algorithm that is capable of encoding 14 bit residue sequences. The algorithm was implemented in real time on a Texas Instruments TMS320C30 chip.
Most practical compression methods in the LZ77 and LZ78 families parse their input using a greedy heuristic. However the popular gzip compression program demonstrates that modest but significant gains in compression p...
详细信息
Most practical compression methods in the LZ77 and LZ78 families parse their input using a greedy heuristic. However the popular gzip compression program demonstrates that modest but significant gains in compression performance are possible if non-greedy parsing is used. Practical implementations for using non-greedy parsing in LZ77 and LZ78 compression are explored and some experimental measurements are presented.
A JBIG compliant, quadtree based, lossless image compression algorithm is described. In terms of the number of arithmetic coding operations required to code an image, this algorithm is significantly faster than previo...
详细信息
A JBIG compliant, quadtree based, lossless image compression algorithm is described. In terms of the number of arithmetic coding operations required to code an image, this algorithm is significantly faster than previous JBIG algorithm variations. Based on this criterion, our algorithm achieves an average speed increase of more than 9 times with only a 5% decrease in compression when tested on the eight CCITT bi-level test images and compared against the basic non-progressive JBIG algorithm. The fastest JBIG variation that we know of, using "PRES" resolution reduction and progressive buildup, achieved an average speed increase of less than 6 times with a 7% decrease in compression, under the same conditions.
暂无评论