Journal ArticleDOI
Text compression using hybrids of BWT and GBAM.
Reads0
Chats0
TLDR
A new data and text lossless compression method, based on the combination of BWT1 and GBAM2 approaches, is presented that was tested on many texts in different formats (ASCII and RTF).Abstract:
In this paper we considered a theoretical evaluation of data and text compression algorithm based on the Burrows–Wheeler Transform (BWT) and General Bidirectional Associative Memory (GBAM). A new data and text lossless compression method, based on the combination of BWT1 and GBAM2 approaches, is presented. The algorithm was tested on many texts in different formats (ASCII and RTF). The compression ratio achieved is fairly good, on average 28–36%. Decompression is fast.read more
Citations
More filters
Patent
Optimized data condenser and method
TL;DR: In this paper, a data condenser and method provides lossless condensation of numbers, letters, words, phrases, and other indicia to data object values which results in reduction of file size.
References
More filters
Proceedings ArticleDOI
A fast block-sorting algorithm for lossless data compression
TL;DR: A new transformation for block-sorting data compression methods is introduced, similar to the one presented by Burrows and Wheeler, but avoids the drawbacks of uncertain runtime and low performance with large blocks.
Proceedings ArticleDOI
Modifications of the Burrows and Wheeler data compression algorithm
TL;DR: Based on the context tree model, the specific statistical properties of the data at the output of the BWT are considered, which lead to modifications of the coding method, which improve the coding efficiency.
Journal ArticleDOI
Asymmetric bidirectional associative memories
TL;DR: A new modification of the BAM is made and a new model named asymmetric bidirectional associative memory (ABAM) is proposed, which can cater for the logical asymmetry of interconnections but also is capable of accommodating a larger number of non-orthogonal patterns.
Journal ArticleDOI
Better learning for bidirectional associative memory
TL;DR: This paper explores the equivalence between the stability of all desired attractors and certain bidirectional linear separabilities and relates three optimal criteria to expanding the kernal basin of attraction of each desired attractor in both the X-space and Y-space.