# US 2019/0356465 A1 · Method and/or system for transmitting and/or receiving data

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

- Number: US 2019/0356465 A1
- Document ID: US20190356465A1
- Status: Published application
- Kind: A1
- Application number: 16/427,054
- Filed: 2019-05-30
- Published: 2019-11-21
- Earliest claimed: 2004-11-30
- Assignees: Robert T. and Virginia T. Jenkins as Trustees of the Jenkins Family Trust Dated Feb. 8, 2002
- Applicants: Robert T. and Virginia T. Jenkins as Trustees of the Jenkins Family Trust Dated Feb. 8, 2002
- Inventors: Jack J. LeTourneau
- Web page: https://patentgrep.com/patent/US20190356465A1

## CPC

- H04L 7/041: {using special codes as synchronising signal}
- G06F 16/235: {Update request formulation}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 7/04: Speed or phase control by synchronisation signals {(H04L7/0075 takes precedence)}
- H04N 19/68: involving the insertion of resynchronisation markers into the bitstream
- H04M 2201/22: Synchronisation circuits
- Y10S 707/99942: Manipulating data structure, e.g. compression, compaction, compilation
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

Embodiments of a method and/or system of transmitting and/or receiving data is disclosed.

## Claims

### Claim at position 1

1-100. (canceled)

### Claim 101

A method of executing computer instructions, the method comprising:
accessing instructions from one or more physical memory devices for execution by one or more processors;
executing the instructions accessed from the one or more physical memory devices by the one or more processors;
storing, in at least one of the physical memory devices, signal values resulting from having executed the instructions on the one or more processors;
wherein the accessed instructions to communicate a sequence of binary values; and
wherein executing the sequence communication instructions further comprising:
receiving, via a communications channel, a sequence of binary values in the form of digital electronic signals, the digital electronic signals comprising content signals,
the sequence comprising a sequence of labeled tree structures in the form of the sequence of binary values and the sequence of the labeled tree structures representing content, wherein the labeled tree structures comprise labeled tree hierarchies; and
converting the labeled tree hierarchies to symbols,
wherein the sequence of binary values further comprises a sequence to synchronize the transmitting and receiving ends of the communications channel.

### Claim 102 (depends on 101)

The method of claim 101, wherein the content signals comprise at least one of the following content signals: audio content signals; video content signals; picture content signals; alphanumerical string content signals; or VoIP content signals.

### Claim 103 (depends on 101)

The method of claim 101, wherein the converting the labeled tree hierarchies to symbols comprises accessing the one or more of the physical memory devices to identify the symbols associated with the labeled tree hierarchies, the one or more physical memory devices storing an accessible structure comprising stored values representing the symbols.

### Claim 104 (depends on 103)

The method of claim 103, wherein the accessing the one or more physical memory devices to identify the symbols associated with the labeled tree hierarchies comprises performing a table look up operation to determine the symbols associated with the labeled tree hierarchies

### Claim 105 (depends on 101)

The method of claim 101, further comprising: comparing a symbol representing a labeled tree hierarchy to other symbols stored in the one or more physical memory devices to detect a presence of the symbol, wherein a correspondence between the symbol and at least one of the other symbols is indicative of a presence of content in electronic content corresponding to the at least one of the other symbols stored and is indicative of one or more locations thereof.

### Claim 106 (depends on 101)

The method of claim 101, the sequence further comprising control signals.

### Claim 107 (depends on 101)

The method of claim 101, the sequence further comprising padding signals.

### Claim 108 (depends on 101)

The method of claim 101, wherein the sequence comprises a self-synchronizing sequence.

### Claim 109 (depends on 101)

The method of claim 101, wherein the sequence comprises a cross-synchronizing sequence.

### Claim 110

An article comprising:
a non-transitory storage medium comprising instructions stored thereon:
wherein the instructions being accessible from the non-transitory storage medium as physical memory states on one or more physical memory devices, the one or more physical memory devices coupled to one or more processors able to execute the instructions stored as physical memory states, the one or more physical memory devices also able to store binary digital signal quantities, if any, as physical memory states, that are to result from execution of the instructions on the one or more processors, wherein the executable instructions to communicate a sequence of binary values, and wherein the sequence communication instructions further to:
communicate, via a communications channel, a sequence of binary values in the form of digital electronic signals, the digital electronic signals comprising content signals,
the sequence to comprise a sequence of labeled tree structures in the form of the sequence of binary values and the sequence of the labeled tree structures to represent content, wherein the labeled tree structures to comprise the labeled tree hierarchies and the sequence to further comprise a sequence to synchronize the transmitting and receiving ends of the communications channel; and
convert the labeled tree hierarchies to symbols,
wherein the sequence of binary values further comprises a sequence to synchronize the transmitting and receiving ends of the communications channel.

### Claim 111 (depends on 110)

The article of claim 110, wherein the content signals to comprise at least one of the following content signals: audio content signals; video content signals; picture content signals; alphanumerical string content signals or VoIP encoding content signals.

### Claim 112 (depends on 110)

The article of claim 110, wherein to convert the labeled tree hierarchies to symbols comprises to access the physical memory devices to identify the symbols associated with the labeled tree hierarchies, the one or more physical memory devices to store an accessible structure comprising stored values representing the symbols.

### Claim 113 (depends on 112)

The article of claim 112, wherein the accessing the one or more physical memory devices to identify the symbols associated with the tree hierarchies comprises to perform a table look up operation to determine the symbols associated with the labeled tree hierarchies.

### Claim 114 (depends on 110)

The article of claim 110, wherein the sequence communication instructions further to compare a symbol representing a labeled tree hierarchy to other symbols in the one or more physical memory devices to detect a presence of the symbol, wherein a correspondence between the symbol and at least one of the other symbols is indicative of a presence of content in electronic content corresponding to the at least one of the other symbols and is indicative of one or more locations thereof.

### Claim 115 (depends on 110)

The article of claim 110, the sequence to further comprise control signals.

### Claim 116 (depends on 110)

The article of claim 110, the sequence to further comprise padding signals.

### Claim 117 (depends on 110)

The article of claim 110, wherein the sequence to further comprise a self-synchronizing sequence.

### Claim 118 (depends on 110)

The article of claim 110, wherein the sequence to further comprise a cross-synchronizing sequence.

### Claim 119

An apparatus comprising:
one or more processors coupled to one or more physical memory devices to store executable instructions and to store binary digital storage quantities as physical memory states, wherein the executable instructions being accessible from the one or more physical memory devices for execution by one or more processors; and
the one or more processors able to store in at least one of the physical memory devices, binary digital signal quantities, if any, that are to result from execution of the instructions on the one or more processors, wherein the accessed executable instructions to communicate a sequence of binary values; and
wherein the sequence communication instructions further to:
communicate, via a communications channel, a sequence of binary values in the form of digital electronic signals, the digital electronic signals to comprise content signals;
the sequence to comprise a sequence of labeled tree structures in the form of the sequence of binary values and the sequence of the labeled tree structures to represent content, wherein the labeled tree structures to comprise labeled tree hierarchies; and
convert the labeled tree hierarchies to symbols,
wherein the sequence of binary values further to comprise a sequence to synchronize the transmitting and receiving ends of the communications channel.

### Claim 120 (depends on 119)

The apparatus of claim 119, wherein the content signals comprise at least one of the following content signals: audio content signals; video content signals; picture content signals; alphanumerical string content signals; or VoIP encoding content signals.

### Claim 121 (depends on 119)

The apparatus of claim 119, wherein the symbols to convert the labeled tree hierarchies to symbols to comprise to access the one or more physical memory devices to identify the symbols associated with the labeled tree hierarchies.

### Claim 122 (depends on 121)

The apparatus of claim 121, wherein to access the one or more physical memory devices to identify the symbols associated with the labeled tree hierarchies to comprise to perform a table lookup operation to determine the symbols associated with the labeled tree hierarchies.

### Claim 123 (depends on 119)

The apparatus of claim 119, further to comprise to compare a symbol to represent a labeled tree hierarchy to other symbols stored in the one or more physical memory devices to detect a presence of the symbol, wherein a correspondence between the symbol and at least one of the other symbols is indicative of a presence of content in electronic content corresponding to at least one of the other symbols stored and is indicative of one or more locations thereof.

### Claim 124 (depends on 119)

The apparatus of claim 119, wherein the sequence to comprise a self-synchronizing sequence.

### Claim 125 (depends on 119)

The apparatus of claim 119, wherein the sequence to comprise a cross-synchronizing sequence.

### Claim 126 (depends on 119)

The apparatus of claim 119, wherein the sequence of binary values further to comprise control signals.

### Claim 127 (depends on 119)

The apparatus of claim 119, wherein the sequence of binary values further to comprise padding signals.

### Claim 128

An apparatus to communicate a sequence of binary values to represent a sequence of finite labeled trees, the apparatus comprising:
means for accessing instructions from one or more physical memory devices for execution by one or more processors;
means for executing the instructions accessed from the one or more physical memory devices by the one or more processors;
means for storing, in at least one of the physical memory devices, signal values resulting from having executed the instructions on the one or more processors;
wherein the accessed instructions to communicate a sequence of binary values; and
wherein the means for executing the sequence communication instructions comprises:
means for communicating via a communications channel a sequence of binary values in the form of digital electronic signals, the digital electronic signals comprising content signals;
the sequence comprising a sequence of labeled tree structures in the form of the sequence of binary values and the sequence of the finite labeled tree structures representing content, wherein the labeled tree structures comprising labeled tree hierarchies; and
means for converting the labeled tree hierarchies to symbols,
wherein the sequence of binary values further comprises a sequence to synchronize the transmitting and receiving ends of the communications channel.

### Claim 129 (depends on 128)

The apparatus of claim 128, wherein the content signals comprise at least one of the following content signals: audio content signals; video content signals; picture content signals; alphanumerical string content signals; or VoIP encoding content signals.

### Claim 130 (depends on 128)

The apparatus of claim 128, wherein the sequence comprises a self-synchronizing sequence.

### Claim 131 (depends on 128)

The apparatus of claim 128, wherein the sequence comprises a cross-synchronizing sequence.

### Claim 132 (depends on 128)

The apparatus of claim 128, wherein the means for converting the labeled tree hierarchies comprises means for accessing the one of the physical memory devices to identify the symbols associated with the labeled tree hierarchies.

### Claim 133 (depends on 132)

The apparatus of claim 132, wherein the means for accessing the one or more physical memory devices to identify the symbols associated with the labeled tree hierarchies comprises a means for performing a table look up operation to determine the symbols associated with the labeled tree hierarchies.

### Claim 134 (depends on 128)

The apparatus of claim 128, further comprising a means for comparing a symbol representing a labeled tree hierarchy to other symbols stored in the one or more physical memory devices to detect a presence of the symbol, wherein a correspondence between the symbol and at least one of the other symbols is indicative of a presence of content in electronic content corresponding to the at least one of the other symbols stored and is indicative of one or more locations thereof.

### Claim 135 (depends on 128)

The apparatus of claim 128, the sequence further comprising control signals.

### Claim 136 (depends on 128)

The apparatus of claim 128, the sequence further comprising padding signals.
