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

• US 7,630,995 B2
• Filed: 12/07/2004
• Issued: 12/08/2009
• Est. Priority Date: 11/30/2004
• Status: Active Grant

• Current Assignee: Lower48 IP, LLC (Lower48 Analytics, Inc.), Virginia T. Jenkins
• Original Assignee: Skyler Technology Incorporated
• Inventors: Letourneau, Jack J.
• Primary Examiner(s): Lu, Kuen S
• Application Number:
  US11/006,842
• Publication Number:
  US 20060123029A1
• Time in Patent Office: 1,827 Days
• Field of Search: 707/101
• 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 are disclosed. In certain embodiments, a sequence of binary values may represent a sequence of trees. Such a sequence may be transmitted as an electrical digital signal. In at least one particular implementation, such trees may be represented by natural numerals.

Claims

1. An article comprising:

a storage medium having stored thereon instructions that, in response to being executed by a processor, direct said processor to;

initiate transmission of one or more electrical digital signals representative of a sequence of binary values;

said sequence of binary values representing a sequence of finite trees comprising signal information in the form of natural numerals, said binary sequence to be formed from said natural numerals according to the following mapping of natural numerals to sequences;

[0]→

empty sequence

[1]→

( )

[2x]→

( ) [x]

[Q(x)]→

([x])

[x*y]→

[x][y], wherein

x and y are natural numerals;

“

(“

and”

)”

are binary values in a sequence;

[x] is a binary sequence formed according to said mapping from x;

Q( ) is a Kleene prime enumeration operation; and

[x][y] is a concatenation of binary sequences formed according to said mapping from x and y, respectively.

2. The article of claim 1, wherein the represented sequence of finite trees comprises a sequence of unitary finite trees.

3. The article of claim 1, wherein the instructions, in response to being executed by said processor, further direct said processor to synchronize said sequence through a count accumulation.

4. The article of claim 1, wherein the instructions, in response to being executed by said processor, further direct said processor to include padding values between two or more representations of a finite tree in said sequence of binary values.

5. The article of claim 4, wherein the instructions, in response to being executed by said processor, further direct said processor to distinguish said padding values in said sequence through a count accumulation.

6. The article of claim 4, wherein the padding values comprise control signal information or content signal information.

7. The article of claim 6, wherein said control signal information comprises at least one of the following:

error correction coding information;

encryption control information;

authentication control information;

watermarking control information; and

/or

multiplexing control information, and/or wherein said content signal information comprises at least one of the following;

VoIP encoding signal information;

video signal information;

audio signal information;

picture signal information; and

/or

information about the content of said sequence.

8. The article of claim 1, wherein the instructions, in response to being executed by said processor, further direct said processor to distinguish said finite trees by a count accumulation.

9. An apparatus comprising:

a computing platform;

said computing platform comprising one or more processors programmed with instructions to initiate transmission of one or more electrical digital signals representative of a sequence of binary values;

said sequence of binary values representing a sequence of finite trees comprising signal information in the form of natural numerals, and wherein said binary sequence to be formed said natural numerals according to the following mapping of natural numerals to binary sequences;

[0]→

empty sequence

[1]→

( )

[2x]→

( ) [x]

[Q(x)]→

([x])

[x*y]→

[x][y], wherein

x and y are natural numerals;

“

(“

and”

)”

are binary values in a sequence;

[x] is a binary sequence formed according to said mapping from x;

Q( ) is a Kleene prime enumeration operation; and

[x][y] is a concatenation of binary sequences formed according to said mapping from x and y, respectively.

10. The apparatus of claim 9, wherein said represented sequence of finite trees comprises a sequence of unitary finite trees.

11. The apparatus of claim 9, wherein said one or more processors are further programmed with instructions to synchronize said electrical digital signal representative of said binary sequence through a count accumulation.

12. The apparatus of claim 9, wherein said sequence includes padding values between two or more representations of a finite tree in said sequence.

13. The apparatus of claim 12, wherein said padding values are distinguished in said sequence through a count accumulation.

14. The apparatus of claim 12, wherein said padding values comprise control signal information or content signal information.

15. The apparatus of claim 14, wherein said control signal information comprises at least one of the following:

error correction coding information;

encryption control information;

authentication control information;

watermarking control information; and

/or multiplexing control information, and/or wherein said content signal information comprises at least one of the following;

VoIP encoding signal information;

video signal information;

audio signal information;

picture signal information; and

/or

information about the content of said sequence.

16. The apparatus of claim 9, wherein said one or more processors are further programmed with instructions to distinguish said finite trees in said sequence by a count accumulation.

17. An apparatus comprising:

a computing platform comprising one or more processors;

said computing platform including means for transmitting a sequence of binary values;

said sequence of binary values representing a sequence of finite trees comprising signal information in the form of natural numerals, said means for transmitting further comprising means for forming said binary sequenced to be transmitted from said natural numerals.

18. The apparatus of claim 17, wherein said means for transmitting comprises means for transmitting said binary sequence so that the represented sequence of finite trees comprises a sequence of unitary finite trees.

19. The apparatus of claim 17, wherein said means for transmitting comprises means for synchronizing said binary sequence through a count accumulation.

20. The apparatus of claim 17, wherein said sequence includes padding values between two or more representations of a finite tree in said sequence.

21. The apparatus of claim 20, wherein said means for transmitting comprises means for distinguishing said padding values in said sequence through a count accumulation.

22. The apparatus of claim 20, wherein said padding values comprise control signal information or content signal information.

23. The apparatus of claim 22, wherein said control signal information comprises at least one of the following:

error correction coding information;

encryption control information;

authentication control information;

watermarking control information; and

/or multiplexing control information, and/or wherein said content signal information comprises at least one of the following;

VoIP encoding signal information;

video signal information;

audio signal information;

picture signal information; and

/or information about the content of said sequence.

24. The apparatus of claim 17, wherein said means for transmitting comprises means for distinguishing said finite trees in said sequence by a count accumulation.