This article discusses the theory, model, implementation and performance of a combinatorial fuzzy-binary and-or (FBAR) algorithm for lossless data compression (LDC) and decompression (LDD) on 8-bit characters. A combinatorial pairwise flags is utilized as new zero/nonzero, impure/pure bit-pair operators, where their combination forms a 4D hypercube to compress a sequence of bytes. The compressed sequence is stored in a grid file of constant size. Decompression is by using a fixed size translation table (TT) to access the grid file during I/O data conversions. Compared to other LDC algorithms, doubleefficient (DE) entropies denoting 50% compressions with reasonable bitrates were observed. Double-extending the usage of the TT component in code, exhibits a Universal Predictability via its negative growth of entropy for LDCs > 87.5% compression, quite significant for scaling databases and network communications. This algorithm is novel in encryption, binary, fuzzy and information-theoretic methods such as probability. Therefore, information theorists, computer scientists and engineers may find the algorithm useful for its logic and applications. 4.1 FBAR Components, Process and Test 4.2 Methods of Double-Efficiency 5 Simulation Results, Contribution and Analysis 5.1 Contribution 5.2 The FBAR Entropic Comparisons 5.3 Costs and Future Work Acknowledgements Notations and Acronyms References 1.1. Overview 3
OverviewThis paper aims to introduce FBAR logic, apply it to information in a model, causing data compression. The compression model is constructed after introducing the theory of FBAR. From there, its usage and implementation in code are discussed. Furthermore, a clarification between model representation and logic is established for both, the FBAR algorithm and its double-efficient (DE) input/output (I/O) evaluation. The evaluation on the algorithm's efficiency is conditioned by conducting two steps:(1) data compaction and compression processes, using a new bit-flag encoding technique for a lossless data compression (LDC), ( 2) validating data at the other end with the bit-flag decoding technique for a successful lossless data decompression (LDD).We introduce FBAR logic from its theoretical premise relative to model construction. We further implement the model for a successful LDC and LDD. The general use of the algorithm is aimed for current machines, and its advanced usage denoting maximum DE-LDCs for future generation computers.This article is organized as follows: Section 2 gives background information on FBAR model, and its universality compared to other algorithms. It concludes with Subsection 2.6 introducing FBAR synthesis with expected outcomes. Section 3 focuses on FBAR LDC/LDD theory, model and structure. It introduces FBAR test on data by model components, functions, operators, proofs and theorems. Section 4 presents implementation. Section 5 presents the main contribution made in this work. Subsection 5.2 describes the experiment on DE performance including results. Subsection 5.3 onward, end the paper w...
