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

• US 20060123029A1
• Filed: 12/07/2004
• Published: 06/08/2006
• Est. Priority Date: 11/30/2004
• Status: Active Grant

• Current Assignee: Lower48 IP, LLC (Lower48 Analytics, Inc.), Virginia T. Jenkins
• Original Assignee: Robert T. and Virginia T. Jenkins as Trustees for the Jenkins Family Trust Dated February 8, 2002
• Inventors: LeTourneau, Jack J.
• Granted Patent: US 7,630,995 B2
• Time in Patent Office: Days
• 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:

transmitting a sequence of binary values;

said sequence of binary values representing a sequence of finite trees.

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

3. The method of claim 1, wherein the finite trees comprise signal information in the form of natural numerals.

4. The method of claim 3, wherein said binary sequence to be transmitted is formed from said natural numerals as follows:

[0]→

empty sequence

[1]→

( )

[2x]→

( ) [x]

[Q(x)]→

([x])

[x*y]→

[x][y]

5. The method of claim 1, wherein said sequence is synchronized through a count accumulation.

6. The method of claim 1, wherein said sequence of binary values includes padding values between two or more representations of a finite tree in said sequence.

7. The method of claim 6, wherein said padding values are distinguished in said sequence through a count accumulation.

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

9. The method of claim 8, 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;

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;

or information about the content of said sequence.

10. The method of claim 1, wherein finite trees are distinguished in said sequence by a count accumulation.

11. A method comprising:

receiving a sequence of binary values;

said sequence representing a sequence of finite trees.

12. The method of claim 11, wherein the represented sequence of finite trees comprises a sequence of unitary finite trees.

13. The method of claim 11, wherein the finite trees comprise signal information in the form of natural numerals.

14. The method of claim 13, wherein said natural numerals are obtained from the received binary sequence as follows:

[0]→

empty sequence

[1]→

( )

[2x]→

( ) [x]

[Q(X)]→

([x])

[x*y]→

[x][y]

15. The method of claim 11, wherein said sequence is synchronized through a count accumulation.

16. The method of claim 11, wherein said sequence of binary values includes padding values between two or more representations of a finite tree in said sequence.

17. The method of claim 16, wherein said padding values are distinguished in said sequence through a count accumulation.

18. The method of claim 16, wherein the padding values comprise control signal information or content signal information.

19. The method of claim 18, 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;

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;

or information about the content of said sequence.

20. The method of claim 11, wherein finite trees are distinguished in said sequence by a count accumulation.

21. An article comprising:

a storage medium having stored thereon instructions that, when executed, result in performance of a method as follows;

transmitting a sequence of binary values;

said sequence of binary values representing a sequence of finite trees.

22. The article of claim 21, wherein the instructions, when executed, further result in the represented sequence of finite trees comprising a sequence of unitary finite trees.

23. The article of claim 21, wherein the instructions, when executed, further result in the finite trees comprising signal information in the form of natural numerals.

24. The article of claim 23, wherein the instructions, when executed, further result in said binary sequence to be transmitted being formed from said natural numerals as follows:

[0]→

empty sequence

[1]→

( )

[2x]→

( ) [x]

[Q(x)]→

([x])

[x*y]→

[x][y]

25. The article of claim 21, wherein the instructions, when executed, further result in said sequence being synchronized through a count accumulation.

26. The article of claim 21, wherein the instructions, when executed, further result in said sequence of binary values including padding values between two or more representations of a finite tree in said sequence.

27. The article of claim 26, wherein the instructions, when executed, further result in said padding values being distinguished in said sequence through a count accumulation.

28. The article of claim 26, wherein the instructions, when executed, further result in the padding values comprising control signal information or content signal information.

29. The article of claim 28, wherein the instructions, when executed, further result in said control signal information comprising at least one of the following:

error correction coding information;

encryption control information;

authentication control information;

watermarking control information;

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;

or information about the content of said sequence.

30. The article of claim 21, wherein the instructions, when executed, further result in finite trees being distinguished in said sequence by a count accumulation.

31. An article comprising:

a storage medium having stored thereon instructions that, when executed, further result in performance of a method as follows;

receiving a sequence of binary values;

said sequence representing a sequence of finite trees.

32. The article of claim 31, wherein the instructions, when executed, further result in the represented sequence of finite trees comprising a sequence of unitary finite trees.

33. The article of claim 31, wherein the instructions, when executed, further result in the finite trees comprising signal information in the form of natural numerals.

34. The article of claim 33, wherein the instructions, when executed, further result in said natural numerals being obtained from the received binary sequence as follows:

[0]→

empty sequence

[1]→

( )

[2x]→

( ) [x]

[Q(x)]→

([x])

[x*y]→

[x][y]

35. The article of claim 31, wherein the instructions, when executed, further result in said sequence being synchronized through a count accumulation.

36. The article of claim 31, wherein the instructions, when executed, further result in said sequence of binary values including padding values between two or more representations of a finite tree in said sequence.

37. The article of claim 36, wherein the instructions, when executed, further result in said padding values being distinguished in said sequence through a count accumulation.

38. The article of claim 36, wherein the instructions, when executed, further result in the padding values comprising control signal information or content signal information.

39. The article of claim 38, wherein the instructions, when executed, further result in said control signal information comprising at least one of the following:

error correction coding information;

encryption control information;

authentication control information;

watermarking control information;

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;

or information about the content of said sequence.

40. The article of claim 31, wherein the instructions, when executed, further result in finite trees being distinguished in said sequence by a count accumulation.

41. An apparatus comprising:

a computing platform;

said computing platform being adapted to transmit a sequence of binary values;

said sequence of binary values representing a sequence of finite trees.

42. The apparatus of claim 41, wherein said computing platform is further adapted to transmit said binary sequence so that the represented sequence of finite trees comprises a sequence of unitary finite trees.

43. The apparatus of claim 41, wherein said computing platform is further adapted to transmit said binary sequence so that the finite trees comprise signal information in the form of natural numerals.

44. The apparatus of claim 43, wherein said computing platform is further adapted to form said binary sequenced to be transmitted from said natural numerals as follows

[0]→

empty sequence

[1]→

( )

[2x]→

( ) [x]

[Q(x)]→

([x])

[x*y]→

[x][y]

45. The apparatus of claim 41, wherein said computing platform is further adapted to transmit said binary sequence so that it is capable of being synchronized through a count accumulation.

46. The apparatus of claim 41, wherein said computing platform is further adapted to transmit said binary sequence so that said sequence includes padding values between two or more representations of a finite tree in said sequence.

47. The apparatus of claim 46, wherein said computing platform is further adapted to transmit said binary sequence so that said padding values are distinguished in said sequence through a count accumulation.

48. The apparatus of claim 46, wherein said computing platform is further adapted to transmit said binary sequence so that the padding values comprises control signal information or content signal information.

49. The apparatus of claim 48, wherein said computing platform is further adapted to transmit said binary sequence so that said control signal information comprises at least one of the following:

error correction coding information;

encryption control information;

authentication control information;

watermarking control information;

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;

or information about the content of said sequence.

50. The apparatus of claim 41, wherein said computing platform is further adapted to transmit said binary sequence so that finite trees being distinguished in said sequence by a count accumulation.

51. An apparatus comprising:

a computing platform;

said computing platform adapted to receive a sequence of binary values;

said sequence representing a sequence of finite trees.

52. The apparatus of claim 51, wherein said computing platform is adapted to receive a sequence of binary values in which the represented sequence of finite trees comprise a sequence of unitary finite trees.

53. The apparatus of claim 51, wherein said computing platform is adapted to receive a sequence of binary values in which the finite trees comprise signal information in the form of natural numerals.

54. The apparatus of claim 53, wherein said computing platform is adapted to receive a sequence of binary values in which said natural numerals are obtained from the received binary sequence as follows:

[0]→

empty sequence

[1]→

( )

[2x]→

( )[x]

[Q(x)]→

([x])

[x*y]→

[x][y]

55. The apparatus of claim 51, wherein said computing platform is adapted to receive a sequence of binary values in which said sequence is synchronized through a count accumulation.

56. The apparatus of claim 51, wherein said computing platform is adapted to receive a sequence of binary values in which said sequence of binary values includes padding values between two or more representations of a finite tree in said sequence.

57. The apparatus of claim 56, wherein said computing platform is adapted to receive a sequence of binary values in which said padding values are distinguished in said sequence through a count accumulation.

58. The apparatus of claim 56, wherein said computing platform is adapted to receive a sequence of binary values in which the padding values comprise control signal information or content signal information.

59. The apparatus of claim 58, wherein said computing platform is adapted to receive a sequence of binary values in which 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;

or information about the content of said sequence.

60. The apparatus of claim 51, wherein said computing platform is adapted to receive a sequence of binary values in which finite trees are distinguished in said sequence by a count accumulation.

61. An apparatus comprising:

a computing platform;

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

said sequence of binary values representing a sequence of finite trees.

62. The apparatus of claim 61, 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.

63. The apparatus of claim 61, wherein said means for transmitting comprises means for transmitting said binary sequence so that the finite trees comprise signal information in the form of natural numerals.

64. The apparatus of claim 63, wherein said means for transmitting comprises means for forming said binary sequenced to be transmitted from said natural numerals.

65. The apparatus of claim 61, wherein said means for transmitting comprises means for transmitting said binary sequence so that it is capable of being synchronized through a count accumulation.

66. The apparatus of claim 61, wherein said means for transmitting comprises means for transmitting said binary sequence so that said sequence includes padding values between two or more representations of a finite tree in said sequence.

67. The apparatus of claim 66, wherein said means for transmitting comprises means for transmitting said binary sequence so that said padding values are distinguished in said sequence through a count accumulation.

68. The apparatus of claim 66, wherein said means for transmitting comprises means for transmitting said binary sequence so that the padding values comprise control signal information or content signal information.

69. The apparatus of claim 68, wherein said means for transmitting comprises menas for transmitting said binary sequence so that said control signal information comprises at least one of the following:

error correction coding information;

encryption control information;

authentication control information;

watermarking control information;

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;

or information about the content of said sequence.

70. The apparatus of claim 61, wherein said means for transmitting comprises means for transmitting said binary sequence so that finite trees are distinguished in said sequence by a count accumulation.

71. An apparatus comprising:

a computing platform;

said computing platform comprising means for receiving a sequence of binary values;

said sequence representing a sequence of finite trees.

72. The apparatus of claim 71, wherein said means for receiving comprising means for receiving a sequence of binary values in which the represented sequence of finite trees comprise a sequence of unitary finite trees.

73. The apparatus of claim 71, wherein said means for receiving comprising means for receiving a sequence of binary values in which the finite trees comprise signal information in the form of natural numerals.

74. The apparatus of claim 73, wherein said means for receiving comprises means for receiving a sequence of binary values in which said natural numerals are obtained from the received binary sequence.

75. The apparatus of claim 71, wherein said means for receiving comprises means for receiving a sequence of binary values in which said sequence is synchronized through a count accumulation.

76. The apparatus of claim 71, wherein said means for receiving comprising means for receiving a sequence of binary values in which said sequence of binary values includes padding values between two or more representations of a finite tree in said sequence.

77. The apparatus of claim 76, wherein said means for receiving comprises means for receiving a sequence of binary values in which said padding values are distinguished in said sequence through a count accumulation.

78. The apparatus of claim 76, wherein said means for receiving comprises means for receiving a sequence of binary values in which the padding values comprise control signal information or content signal information.

79. The apparatus of claim 78, wherein said means for receiving comprises means for receiving a sequence of binary values in which 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;

or information about the content of said sequence.

80. The apparatus of claim 71, wherein said means for receiving comprises means for receiving a sequence of binary values in which finite trees are distinguished in said sequence by a count accumulation.

81. A set of communication signals comprising:

a transmitted sequence of binary values;

said sequence of binary values representing a sequence of finite trees.

82. The set of communication signals of claim 81, wherein the represented sequence of finite trees comprises a sequence of unitary finite trees.

83. The set of communication signals of claim 81, wherein the finite trees comprise signal information in the form of natural numerals.

84. The set of communication signals of claim 83, wherein said binary sequence to be transmitted is formed from said natural numerals as follows:

[0]→

empty sequence

[1]→

( )

[2x]( )[x]

[Q(x)]→

([x])

[x*y]→

[x][y]

85. The set of communication signals of claim 81, wherein said sequence is synchronized through a count accumulation.

86. The set of communication signals of claim 81, wherein said sequence of binary values includes padding values between two or more representations of a finite tree in said sequence.

87. The set of communication signals of claim 86, wherein said padding values are distinguished in said sequence through a count accumulation.

88. The set of communication signals of claim 86, wherein the padding values comprise control signal information or content signal information.

89. The set of communication signals of claim 88, 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;

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;

or information about the content of said sequence.

90. The set of communication signals of claim 81, wherein finite trees are distinguished in said sequence by a count accumulation.

91. A set of communication signals comprising:

a received sequence of binary values;

said sequence representing a sequence of finite trees.

92. The set of communication signals of claim 91, wherein the represented sequence of finite trees comprises a sequence of unitary finite trees.

93. The set of communication signals of claim 91, wherein the finite trees comprise signal information in the form of natural numerals.

94. The set of communication signals of claim 93, wherein said natural numerals are obtained from the received binary sequence as follows:

[0]→

empty sequence

[1]→

( )

[2x]→

( )[x]

[Q(x)]→

([x])

[x*y]→

[x][y]

95. The set of communication signals of claim 91, wherein said sequence is synchronized through a count accumulation.

96. The set of communication signals of claim 91, wherein said sequence of binary values includes padding values between two or more representations of a finite tree in said sequence.

97. The set of communication signals of claim 96, wherein said padding values are distinguished in said sequence through a count accumulation.

98. The set of communication signals of claim 96, wherein the padding values comprise control signal information or content signal information.

99. The set of communication signals of claim 98, 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;

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;

or information about the content of said sequence.

100. The set of communication signals of claim 91, wherein finite trees are distinguished in said sequence by a count accumulation.