# US 2025/0150091 A1 · Lossless Binary Data Compression

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0150091 A1
- Document ID: US20250150091A1
- Status: Published application
- Kind: A1
- Application number: 18/500,419
- Filed: 2023-11-02
- Published: 2025-05-08
- Earliest claimed: 2023-11-02
- Assignees: Radu Mircea Secareanu
- Inventors: Radu Mircea Secareanu
- Web page: https://patentgrep.com/patent/US20250150091A1

## CPC

- H03M 7/28: Programmable structures, i.e. where the code converter contains apparatus which is operator-changeable to modify the conversion process
- H03M 7/3059: {Digital compression and data reduction techniques where the original information is represented by a subset or similar information, e.g. lossy compression}
- H03M 7/55: {Compression Theory, e.g. compression of random number, repeated compression}
- H03M 7/6011: {Encoder aspects}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

Lossless binary data compression of any arbitrary input file is disclosed, wherein the arbitrary input file is transformed using a well defined finite set of binary constructs, wherein the content of said arbitrary input file is organized in well defined constituents, groups, and slices wherein said constituents, groups, and slices are formed with reference to said binary constructs and wherein one said slice comprising several said groups and each said group comprising several said constituents, wherein two or more data structures are formed for each of said slices wherein each of said data structures have specific and well defined properties with respect to said constituents, and wherein based on said specific and well defined properties of said data structures, said constituents within and in-between said data structures are subject to well defined procedures comprising operations such as swap, replace, alter, exchange, wherein after said well defined procedures, compression gain is achieved, wherein the process of obtaining compression gain is uniquely reversible, wherein when a compression cycle of said arbitrary input cycle is complete, the compressed output becomes the input file for another compression cycle, and wherein the cycle repeats an unlimited number of times until a well defined criteria is met.

## Claims

### Claim 1

A first data structure, comprising:
a first set of well defined binary elements, wherein the said first set has a well defined number of members, wherein each of said members has a different and well defined number of bits, wherein one or more members have the same number of bits, and wherein said first set can describe any arbitrary binary input string, IFDS;
a first collection of instances of said members, wherein said instances occur in said IFDS;
a second set of well defined binary constructs, wherein said second set comprising all possible combinations of either one or a well defined number of more than one of said elements;
a second collection of binary constituents, wherein said constituents comprising said possible combinations of said instances, and wherein the content of said IFDS is described by consecutive said constituents;
one or more first target constituents belonging to said second collection, wherein said first target constituents have a well defined target number of bits;
a well defined number of said consecutive constituents wherein said consecutive constituents are organised in a well defined number of one or more first groups of said consecutive constituents, wherein the number of said consecutive constituents in each of said first groups is well correlated to well defined criteria;
wherein the said consecutive constituents in each of said first groups are organised such that each of said constituents receives a first order number within said first group, and wherein the said constituents with the same said first order number in consecutive said groups comprise a column construct that receives the same first order number as said first order number of said constituents;
wherein within each of said columns of a said first order number, said first target constituents occur a well defined number of times, and wherein the location where said first target constituents occur within said column receives a location number wherein said location number is between 1 and the maximum number of constituents in said column; and
wherein said first data structure is built by taking said constituents from said columns based on a well defined procedure in order to include in said first data structure zero or a minimum number of said first target constituents.

### Claim 2

A second data structure, comprising:
a first set of well defined binary elements, wherein the said first set has a well defined number of members, wherein each of said members has a different and well defined number of bits, wherein one or more members have the same number of bits, and wherein said first set can describe any arbitrary binary input string, IFDS;
a first collection of instances of said members, wherein said instances occur in said IFDS;
a second set of well defined binary constructs, wherein said second set comprising all possible combinations of either one or a well defined number of more than one of said elements;
a second collection of binary constituents, wherein said constituents comprising said possible combinations of said instances, and wherein the content of said IFDS is described by consecutive said constituents;
one or more second target constituents belonging to said second collection, wherein said second target constituents have a well defined target number of bits;
a well defined number of said consecutive constituents wherein said consecutive constituents are organised in a well defined number of one or more second groups of said consecutive constituents, wherein the number of said consecutive constituents in each of said second groups is well correlated to well defined criteria;
wherein the said consecutive constituents in each of said second groups are organised such that each of said constituents receives a second order number within said second group, and wherein the said constituents with the same said second order number in consecutive said groups comprise a column construct that receives the same second order number as said second order number of said constituents;
wherein within each of said columns of a said second order number, said second target constituents occur a well defined number of times, and wherein the location where said second target constituents occur within said column receives a location number wherein said location number is between 1 and the maximum number of constituents in said column; and
wherein said second data structure is built by taking said constituents from said columns based on a well defined procedure in order to include in said second data structure a maximum number of said second target constituents.

### Claim 3 (depends on 1)

The data structure of claim 1 wherein said number of said consecutive constituents in each of said first groups is well correlated to said number of bits in said first target constituents.

### Claim 4 (depends on 1, 2)

The data structure of claim 1 wherein:
said first target constituents have a zero number of occurrences in said first data structure;
a said second data structure of claim 2 of the same size as said first data structure is employed;
a second data structure, comprising:
one or more second target constituents belonging to said second collection, wherein said second target constituents have a well defined target number of bits;
a well defined number of said consecutive constituents wherein said consecutive constituents are organised in a well defined number of one or more second groups of said consecutive constituents, wherein the number of said consecutive constituents in each of said second groups is well correlated to well defined criteria;
wherein the said consecutive constituents in each of said second groups are organised such that each of said constituents receives a second order number within said second group, and wherein the said constituents with the same said second order number in consecutive said groups comprise a column construct that receives the same second order number as said second order number of said constituents;
wherein within each of said columns of a said second order number, said second target constituents occur a well defined number of times, and wherein the location where said second target constituents occur within said column receives a location number wherein said location number is between 1 and the maximum number of constituents in said column; and
wherein said second data structure is built by taking said constituents from said columns based on a well defined procedure in order to include in said second data structure a maximum number of said second target constituents;
said first target constituents that occur in said second data structure are being swapped on the same location with constituents that occur in the said first data structure, therefore making the second data structure to have zero number of occurrences of said first target constituents; and
wherein in said second data structure, said first target constituents replace or alter the representation of said second target constituents, wherein said replace or alter representation is made to have a number of bits smaller than the original number of bits of said second target constituents, and wherein by said replace or alter, a gross compression gain is achieved wherein said gross compression gain is a function of the difference between the said original number of bits of said second target constituents and said number of bits of said replaced or altered representation of said second target constituents and is a function of said maximum number of said second target constituents included in said second data structure.

### Claim 5 (depends on 4)

The data structure of claim 4 wherein in order to define choices such as said first target constituent, said second target constituent, said swapping of said constituents between said first data structure and said second data structure, a total cost is implied.

### Claim 6 (depends on 5)

The data structure of claim 5 wherein said number of said consecutive constituents in each of said second groups is well correlated to said total cost, wherein said correlated means that a net compression gain is defined as being the difference between said gross compression gain and said total cost, wherein said net compression gain is greater or equal to zero.

### Claim 7

A method to create compression gain, comprising:
describing any arbitrary input data string, IFDS, using a well defined and finite collection of binary constructs;
organizing the content of said IFDS in term of said binary constructs that occur in said IFDS;
organizing said content in term of well defined binary builds;
creating one or more well defined slices out of said IFDS content wherein each of said well defined slices comprising a size in term of number of well defined binary builds;
creating well defined groups of said binary builds within each of said slices;
creating two or more data structures within each of said slices using well defined rules and procedures, wherein each of said data structures comprising one or more targets that belong to a well defined selection of said groups, wherein said targets comprising one or more of said binary builds, and wherein each of said data structures have well defined properties with respect to said targets and builds;
defining and engaging well defined procedures wherein said procedures comprising a combination of operations such as replace, alter, or swap of targets and builds within or in-between said data structures, wherein by such procedures, a net compression gain is achieved wherein said net compression gain includes a cost associated to said procedures; and
wherein the compressed output for each of said slices is assembled in the same order as the said input, uncompressed slices in a total compressed output.

### Claim 8 (depends on 7)

The method of claim 7, wherein the said well defined binary builds comprising either single of said binary constructs, or pairs of said binary constructs, or any other combination of more than two of said binary constructs, or any other representation of the exhaustive combinations of said two or more binary constructs.

### Claim 9 (depends on 8)

The method of claim 8, wherein any group out of said well defined groups of said binary builds comprising a first well defined number of said binary builds wherein said binary builds are taken at well defined intervals within said content of said IFDS to form said group, wherein said first well defined number and said well defined intervals have correlated values that are related to the number of bits in said binary builds and to said cost, and wherein the number of said well defined groups represents a well defined second number that has a value that is related to said cost and to said well defined rules and procedures in creating said data structures.

### Claim 10 (depends on 7)

The method of claim 7 where the compression process is uniquely reversible, wherein the input of said uniquely reversible process is said total compressed output, wherein the result of said uniquely reversible process is said IFDS, and wherein said uniquely reversible process is called decompression.

### Claim 11 (depends on 10)

The method of claim 10 wherein in order to insure the integrity and uniqueness of said decompression, well defined of said slices may be either skipped, or alternated in-between being processed for compression, or remaining unprocessed for compression, wherein said processed or unprocessed for compression means respectively engaging said well defined procedures for compression.

### Claim 12 (depends on 7)

The method of claim 7 wherein a compression cycle is defined when a said total compressed output is generated, wherein said total compressed output becomes input for another said compression cycle, and wherein such said another compression cycles are repeated until a well defined criteria is achieved, wherein said well defined criteria comprising obtaining a target file size for said total compressed output of the last said compression cycle or obtaining a well defined floor size for the said total compressed output of the last said compression cycle, after which another compression cycle is not optimal.

### Claim 13 (depends on 1)

The data structure of claim 1 wherein:
said first target constituents have a first minimal number of occurrences in said first data structure;
a second said first data structure of the same size as the said first data structure, wherein second first target constituents have a second minimal number of occurrences in said second first data structure;
a second data structure, comprising:
one or more second target constituents belonging to said second collection, wherein said second target constituents have a well defined target number of bits;
a well defined number of said consecutive constituents wherein said consecutive constituents are organised in a well defined number of one or more second groups of said consecutive constituents, wherein the number of said consecutive constituents in each of said second groups is well correlated to well defined criteria;
wherein the said consecutive constituents in each of said second groups are organised such that each of said constituents receives a second order number within said second group, and wherein the said constituents with the same said second order number in consecutive said groups comprise a column construct that receives the same second order number as said second order number of said constituents;
wherein within each of said columns of a said second order number, said second target constituents occur a well defined number of times, and wherein the location where said second target constituents occur within said column receives a location number wherein said location number is between 1 and the maximum number of constituents in said column; and
wherein said second data structure is built by taking said constituents from said columns based on a well defined procedure in order to include in said second data structure a maximum number of said second target constituents;
wherein said second data structure is of the same size as said first data structure and said second first data structure;
wherein in-between the said first data structure and the said second first data structure, said first target constituents and said second first target constituents are being subject to operations such as swap, alter, exchange, such that after said operations, either said first data structure or said second first data structure achieve with a zero occurrence for their respective first target constituent or said second first target constituent, wherein said constituent with zero occurrences is called zero constituent and the data structure that achieve this zero constituent is called zero data structure;
said zero constituents that occur in said second data structure are being swapped on the same location with constituents that occur in the said zero data structure, therefore making the second data structure to have zero number of occurrences of said zero target constituents; and
wherein in said second data structure, said zero target constituents replace or alter the representation of said second target constituents, wherein said replace or alter representation is made to have a number of bits smaller than the original number of bits of said second target constituents, and wherein by said replace or alter, a gross compression gain is achieved wherein said gross compression gain is a function of the difference between the said original number of bits of said second target constituents and said number of bits of said replaced or altered representation of said second target constituents and is a function of said maximum number of said second target constituents included in said second data structure.

### Claim 14 (depends on 9)

The method of claim 9, wherein when said binary builds represent combinations of two or more of said binary constructs, the binary builds within the said first number of said binary builds are formed by combining any binary constructs within said first number.

### Claim 15 (depends on 14)

The method of claim 14 wherein within each of said data structures, said targets and said binary builds are formed and chosen using well defined procedures.

### Claim 16 (depends on 13)

The data structure of claim 13, wherein when said binary constituents represent combinations of two or more of said binary elements, the binary constituents within said well defined number of said consecutive constituents are formed by combining any said binary elements within said well defined number.

### Claim 17 (depends on 16)

The data structure of claim 16 wherein within each of said data structures, said target constituents and said binary constituents are formed and chosen using well defined procedures.
