scholarly journals An MPEG decoder with embedded compression for memory reduction

1998 ◽  
Vol 44 (3) ◽  
pp. 545-555 ◽  
Author(s):  
P.H.N. De With ◽  
P.H. Frencken ◽  
M. Schaar-Mitrea
Keyword(s):  
Embedded Compression ◽  
Memory Reduction

scholarly journals FFT Splitting for Improved FPGA-Based Acquisition of GNSS Signals

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Jérôme Leclère ◽  
Cyril Botteron ◽  
René Jr. Landry ◽  
Pierre-André Farine
Keyword(s):  
Processing Time ◽  
Satellite System ◽  
Fpga Implementation ◽  
Probability Of Detection ◽  
Navigation Satellite ◽  
Code Search ◽  
Parallel Code ◽  
Memory Reduction ◽  
Straightforward Solution ◽  
Global Navigation Satellite

With modern global navigation satellite system (GNSS) signals, the FFT-based parallel code search acquisition must handle the frequent sign transitions due to the data or the secondary code. There is a straightforward solution to this problem, which consists in doubling the length of the FFTs, leading to a significant increase of the complexity. The authors already proposed a method to reduce the complexity without impairing the probability of detection. In particular, this led to a 50% memory reduction for an FPGA implementation. In this paper, the authors propose another approach, namely, the splitting of a large FFT into three or five smaller FFTs, providing better performances and higher flexibility. For an FPGA implementation, compared to the previously proposed approach, at the expense of a slight increase of the logic and multiplier resources, the splitting into three and five allows, respectively, a reduction of 40% and 64% of the memory, and of 25% and 37.5% of the processing time. Moreover, with the splitting into three FFTs, the algorithm is applicable for sampling frequencies up to 24.576 MHz for L5 band signals, against 21.846 MHz with the previously proposed algorithm. The algorithm is applied here to the GPS L5 and Galileo E5a, E5b, and E1 signals.

MODELING AND SYNTHESIS OF COMPLEX SYMMETRICAL IMAGES

2004 ◽  
Vol 18 (02) ◽  
pp. 175-195 ◽  
Author(s):  
V. V. HRYTSYK ◽  
K. M. BEREZSKA ◽  
O. M. BEREZSKY
Keyword(s):  
Considerable Time ◽  
Time Reduction ◽  
Memory Reduction

We propose a method of description and modeling of complex symmetrical images, which can be used for the synthesis of ornamental patterns. Our approach allows considerable memory reduction for storing symmetrical images and considerable time reduction for their synthesis. Our algorithms for ornamental patterns synthesis suggest the design of a special purpose ornamental patterns editor which can store and synthesize symmetrical images.

scholarly journals A memory reduction method in pricing American options

2004 ◽  
Vol 74 (7) ◽  
pp. 501-511 ◽  
Author(s):  
Raymond H. Chan ◽  
Yong Chen † ◽  
K. M. Yeung ‡
Keyword(s):  
Reduction Method ◽  
American Options ◽  
Memory Reduction

Improved Compression of DNA Sequencing Data with Cascading Bloom Filters

2018 ◽  
Vol 29 (08) ◽  
pp. 1249-1255
Author(s):  
Kamil Salikhov
Keyword(s):  
Dna Sequencing ◽  
Sequence Data ◽  
Real Data ◽  
Compression Algorithm ◽  
Computational Experiments ◽  
Bloom Filters ◽  
Dna Fragments ◽  
Sequencing Data ◽  
Sequencing Technologies ◽  
Memory Reduction

Modern DNA sequencing technologies generate prodigious volumes of sequence data consisting of short DNA fragments (reads). Storing and transferring this data is often challenging. With this motivation, several specialized compression methods have been developed. In this paper, we present an improvement of the lossless reference-free compression algorithm, suggested by Rozov et al., based on the technique of cascading Bloom filters. Through computational experiments on real data, we demonstrate that our method results in a significant associated memory reduction in practice.

Sign in / Sign up

Export Citation Format

Share Document