Method and/or system for transmitting and/or receiving data

• US 9,425,951 B2
• Filed: 05/29/2015
• Issued: 08/23/2016
• Est. Priority Date: 11/30/2004
• Status: Active Grant

• Current Assignee: Lower48 IP, LLC (Lower48 Analytics, Inc.)
• Original Assignee: Robert T. Jenkins, Virginia T. Jenkins
• Inventors: LeTourneau, Jack J.
• Primary Examiner(s): LU, KUEN S
• Application Number:
  US14/726,192
• Publication Number:
  US 20150341165A1
• Time in Patent Office: 452 Days
• Field of Search: 707/797, 375/359
• US Class Current: 1/1
• CPC Class Codes: G06F 16/235 Update request formulation
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 7/04 Speed or phase control by synchronisation signals H04L7/0075 takes precedence
• CPC Class Codes: H04L 7/041 using special codes as synchronising signal
• CPC Class Codes: H04M 2201/22 Synchronisation circuits
• CPC Class Codes: H04N 19/68 involving the insertion of resynchronisation markers into the bitstream
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

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

Claims

1. A method comprising:

executing instructions on one or more processors, the executing comprising;

communicating via a communications channel a sequence of binary values in the form of digital electronic signals;

the sequence representing a sequence of finite labeled trees in the form of digital electronic signals and the sequence further comprising control signals,

wherein the sequence of binary values comprises a sequence to synchronize the transmitting and receiving ends of the communications channel, and

wherein the control signals comprise at least one of the following;

error correction coding signals, encryption control signals, authentication control signals, watermarking control signals, or multiplexing control signals.

2. The method of claim 1, wherein the finite labeled trees comprise natural numerals in the form of digital electronic signals.

3. The method of claim 2, further comprising a conversion from the natural numerals in the form of digital electronic signals to finite trees in the form of digital electronic signals.

4. The method of claim 1, wherein the sequence of binary values further represents tree operations on the finite labeled trees and the tree operations include one or more merger operations.

5. The method of claim 1, wherein the sequence of binary values comprises padding values between two or more representations of a finite tree in the sequence of binary values.

6. The method of claim 1, wherein the sequence of binary values further represents tree operations on the finite labeled trees and the tree operations include one or more operations having no argument.

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

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

9. An article comprising:

a non-transitory storage medium comprising instructions stored thereon, the instructions being executable by one or more processors of one or more computing devices to;

communicate via a communications channel a sequence of binary values in the form of digital electronic signals;

the sequence to represent a sequence of finite labeled trees in the form of digital electronic signals and the sequence further to comprise control signals,

wherein the sequence of binary values to comprise a sequence to synchronize the transmitting and receiving ends of the communications channel, and

wherein the control signals to comprise at least one of the following;

error correction coding signals, encryption control signals, authentication control signals, watermarking control signals, or multiplexing control signals.

10. The article of claim 9, wherein the sequence to comprise a self-synchronizing sequence.

11. The article of claim 9, wherein the sequence to comprise a cross-synchronizing sequence.

12. The article of claim 9, the non-transitory storage medium further to comprise instructions stored thereon, the instructions being executable by the one or more processors of the one or more computing devices to result in the finite labeled trees to comprise natural numerals in the form of digital electronic signals.

13. The article of claim 12, the non-transitory storage medium further to comprise instructions stored thereon, the instructions being executable by the one or more processors of the one or more computing devices to result in a conversion from the natural numbers in the form of digital electronic signals to the finite trees in the form of digital electronic signals to comprise a table lookup operation.

14. The article of claim 9, the non-transitory storage medium further to comprise instructions stored thereon, the instructions being executable by the one or more processors of the one or more computing devices to result in the sequence of binary values further to represent tree operations on the finite labeled trees and the tree operations to comprise one or more merger operations.

15. The article of claim 9, the non-transitory storage medium further to comprise instructions stored thereon, the instructions being executable by the one or more processors of the one or more computing devices to result in the sequence of binary values further to represent tree operations on the finite labeled trees and the tree operations to comprise one or more operations having no argument.

16. The article of claim 9, the non-transitory storage medium further to comprise instructions stored thereon, the instructions being executable by the one or more processors of the one or more computing devices to result in the sequence of binary values to comprise padding values between two or more representations of a finite tree in the sequence of binary values.

17. An apparatus comprising:

a computing device;

the computing device to

communicate via a communications channel a sequence of binary values in the form of digital electronic signals;

the sequence to represent a sequence of finite labeled trees in the form of digital electronic signals and the sequence further to comprise control signals,

wherein the sequence of binary values to comprise a sequence to synchronize the transmitting and receiving ends of the communications channel,

wherein the control signals to comprise at least one of the following;

error correction coding signals, encryption control signals, authentication control signals, watermarking control signals, or multiplexing control signals.

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

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

20. The apparatus of claim 17, wherein the computing device is to communicate a sequence of binary values in which the finite trees to comprise natural numerals in the form of digital electronic signals.

21. The apparatus of claim 20, wherein the computing device is to communicate a sequence of binary values in which a conversion from the natural numbers in the form of digital electronic signals to the finite trees in the form of digital electronic signals to comprise a table lookup operation.

22. The apparatus of claim 17, wherein the computing device is to communicate a sequence of binary values further to represent tree operations on the finite labeled trees and the tree operations to comprise one or more merger operations.

23. The apparatus of claim 17, wherein the computing device is to communicate a sequence of binary values further to represent tree operations on the finite labeled trees and the tree operations to comprise one or more operations having no argument.

24. The apparatus of claim 17 wherein the computing device is to communicate a sequence of binary values in which the sequence of binary values to comprise padding values between two or more representations of a finite tree in the sequence of binary values.

25. An apparatus comprising:

a computing device, the computing device comprising;

means for communicating via a communications channel a sequence of binary values in the form of digital electronic signals;

the sequence representing a sequence of finite labeled trees in the form of digital electronic signals and the sequence further comprising control signals,

wherein the sequence of binary values comprises a sequence to synchronize the transmitting and receiving ends of the communications channel, and

wherein the control signals comprise at least one of the following;

error correction coding signals, encryption control signals, authentication control signals, watermarking control signals, or multiplexing control signals.

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

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

28. The apparatus of claim 25, wherein the means for communicating comprises means for communicating in which the finite trees comprise natural numerals in the form of digital electronic signals.

29. The apparatus of claim 28, wherein the means for communicating comprises means for communicating in which a conversion from natural numbers in the form of digital electronic signals to the finite labeled trees in the form of digital electronic signals comprises a table lookup operation.

30. The apparatus of claim 25, wherein the means for communicating comprises means for communicating a sequence of binary values which further represents tree operations on the finite labeled trees and the tree operations includes one or more merger operations.

31. The apparatus of claim 25, wherein the means for communicating comprises means for communicating a sequence of binary values which further represents tree operations on the finite labeled trees and the tree operations includes one or more operations having no argument.

32. The apparatus of claim 25, wherein the means for communicating comprises means for communicating a sequence of binary values in which the sequence includes padding values between two or more representations of a finite tree in the sequence of binary values.