Topic
Run-length encoding
About: Run-length encoding is a research topic. Over the lifetime, 504 publications have been published within this topic receiving 4441 citations. The topic is also known as: RLE.
Papers published on a yearly basis
Papers
More filters
13 Dec 2018
TL;DR: An efficient lossless DNA compression algorithm based One-Bit Compression method (OBComp) that will compress both repeated and non-repeated sequences.
Abstract: Recently, the ever-increasing growth of genomic sequences DNA or RNA stored in databases poses a serious challenge to the storage, process and transmission of these data. Hence effective management of genetic data is very necessary which makes data compression unavoidable. The current standard compression tools are insufficient for DNA sequences compression. In this paper we proposed an efficient lossless DNA compression algorithm based One-Bit Compression method (OBComp) that will compress both repeated and non-repeated sequences. Unlike direct coding technique where two bits are assigned to each nucleotide resulting compression ratio of 2 bits per byte (bpb), OBComp used just a single bit 0 or 1 to code the two highest occurrence nucleotides. The positions of the two others are saved. To further enhance the compression, modified version of Run Length Encoding technique and Huffman coding algorithm are then applied respectively. The proposed algorithm has efficiently reduced the original size of DNA sequences. The easy way to implement our algorithm and the remarkable compression ratio makes its use interesting.
4 citations
08 Aug 2012
TL;DR: A novel indexing scheme called count indexes is proposed that supports O(log n) in-place insertions, deletions, updates and look ups on a run-length encoded sequence with n runs and it is shown that count indexes efficiently update a batch of tuples requiring almost a constant time per updated tuple.
Abstract: Run-length encoding is a popular compression scheme which is used extensively to compress the attribute values in column stores. Out of order insertion of tuples potentially degrades the compression achieved using run-length encoding and consequently, the performance of reads. The in-place insertions, deletions and updates of tuples into a column store relation with n tuples take O(n) time. The linear cost is typically avoided by amortizing the cost of updates in batches. However, the relation is decompressed and subsequently re-compressed after applying a batch of updates. This leads to added time time complexity. We propose a novel indexing scheme called count indexes that supports O(log n) in-place insertions, deletions, updates and look ups on a run-length encoded sequence with n runs. We also show that count indexes efficiently update a batch of tuples requiring almost a constant time per updated tuple. Additionally, we show that count indexes are optimal. We extend count indexes to support O(log n) updates on bitmapped sequences with n values and adapt them to block-based stores.
4 citations
TL;DR: In the proposed approach, a hybrid test pattern compression technique is used along with different schemes such as Huffman and Run length encoding and an improved compression ratio is obtained.
Abstract: Background : VLSI testing plays a very crucial role in the design of a VLSI chip. The advances in technology have led to increasing density of transistors and increased circuit complexity in a chip. With the increasing number of inputs, the memory overheads associated with storing test patterns increases. Thus the test pattern volume needs to be compressed. Method: In the proposed approach, a hybrid test pattern compression technique is used along with different schemes such as Huffman and Run length encoding. These encoding schemes are applied on ISCAS’85 and ISCAS’89 benchmark circuits and the results are compared and analyzed based on their compression ratio . Findings : In the proposed approach, an improved compression ratio is obtained when compared to the existing techniques in the literature.
4 citations
Patent•
21 Jun 1994
TL;DR: In this article, the authors proposed a variable length encoder to suppress the data amount of digital video signals after high efficiency encoding without inviting the picture quality degradation of reproducing pictures.
Abstract: PURPOSE:To provide a high efficiency encoder capable of suppressing the data amount of digital video signals after high efficiency encoding without inviting the picture quality degradation of reproducing pictures. CONSTITUTION:'0' run length encoding is performed to blocked digital video data in a data separation circuit 11 and they are separated into run length data and coefficient data. After the '0' run length encoding is performed to the separated run length data in a data separation circuit 12 and '1' run length encoding is performed to the separated coefficient data in a data separation circuit 13, variable length encoding is performed to the respective data in variable length encoders 14 and 15.
4 citations
03 Aug 2010
TL;DR: A custom designed communication protocol for bidirectional data telemetry to and from the implanted module is presented and a global controller is also presented which configures, operates and unites all the modules together effectively and efficiently into a 32-channel system.
Abstract: Multi-channel neural signal recordings need high data compression and efficient data transmission. Our previous work has shown a practical data compression solution based on discrete wavelet transform, multi-level thresholding and run length encoding. This paper presents a custom designed communication protocol for bidirectional data telemetry to and from the implanted module. A global controller is also presented which configures, operates and unites all the modules together effectively and efficiently into a 32-channel system. Performance of the communication protocol and the compression engine is analyzed.
4 citations