Synchronization code methods

• US 20060020433A1
• Filed: 07/21/2004
• Published: 01/26/2006
• Est. Priority Date: 07/21/2004
• Status: Active Grant

• Current Assignee: Intellectual Ventures Holding 81 LLC (Intellectual Ventures LLC)
• Original Assignee: Pulse-Link Incorporated
• Inventors: Taha, Ali, Eldon, John Alfred
• Granted Patent: US 7,353,436 B2
• Time in Patent Office: Days
• US Class Current: 703/2
• CPC Class Codes: H03M 13/33 Synchronisation based on error coding or decoding
• CPC Class Codes: H04B 1/71632 Signal aspects H04B1/7172 and H04B1/7176 take precedence
• CPC Class Codes: H04B 1/7183 Synchronisation
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 1/0059 Convolutional codes

Abstract

A system, method and computer software product are provided. One embodiment of the present invention provides a method for generating and employing numerical sequences that may be used for synchronization codes. In one embodiment of the present invention, the derivation of numerical sequences, or codes is based on an encoding algorithm. These codes enable synchronization between communicating devices, and may also be used for channelization. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules that allow a reader to quickly ascertain the subject matter of the disclosure contained herein. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

Claims

1. A method of deriving numerical sequences, the method comprising the steps of:

providing data, the data comprising 2^k combinations of bits, where k is an integer;

encoding the data by generating 2ⁿ combinations of bits where n is an integer greater than k;

generating a group of valid data codes and a group of invalid data codes from the encoded data;

generating a Hamming distance between each of the invalid data codes and each of the valid data codes; and

generating an autocorrelation function for each of the invalid data codes.

2. The method of claim 1, further comprising the step of selecting the invalid data codes having a Hamming Distance greater than a first threshold.

3. The method of claim 2, wherein the first threshold comprises a maximum Hamming Distance.

4. The method of claim 1, further comprising the step of selecting the invalid data codes having a Hamming Distance greater than a first threshold and an autocorrelation greater than a second threshold.

5. The method of claim 4, wherein the first threshold comprises a maximum Hamming Distance, and the second threshold comprises a lowest value of a greatest non-peak autocorrelation value.

6. The method of claim 1, further comprising the steps of:

selecting the invalid data codes having a Hamming Distance greater than a first threshold and an autocorrelation greater than a second threshold; and

using at least one of the selected invalid data codes as a synchronization code.

7. The method of claim 6, wherein the first threshold comprises a maximum Hamming Distance, and the second threshold comprises a lowest value of a greatest non-peak autocorrelation value.

8. The method of claim 1, wherein the step of generating the autocorrelation is performed before the step of generating the Hamming distance.

9. The method of claim 1, wherein the step of generating a group of valid data codes comprises selecting encoded bits that represent data.

10. The method of claim 1, wherein the step of generating a group of invalid data codes comprises selecting encoded bits that do not represent data.

11. The method of claim 1, further comprising the step of selecting the invalid data codes having substantially the same number of ones and zeros.

12. The method of claim 1, further comprising the step of appending at least two invalid data codes together.

13. A computer program product for directing a general purpose digital computer to derive numerical sequences, comprising:

obtaining data, the data comprising 2^k combinations of bits, where k is an integer;

a set of computer readable instructions to encode the data by generating 2ⁿ combinations of bits where n is an integer greater than k;

a set of computer readable instructions to generate a group of valid data codes and a group of invalid data codes from the encoded data;

a set of computer readable instructions to generate a Hamming distance between each of the invalid data codes and each of the valid data codes; and

a set of computer readable instructions to generate an autocorrelation function for each of the invalid data codes.

14. The computer program product of claim 13, wherein the set of computer readable instructions to encode the data comprises a memory-based encoding algorithm.

15. The computer program product of claim 14, wherein the memory-based encoding algorithm comprises a convolutional encoding algorithm.

16. The computer program product of claim 13, wherein the set of computer readable instructions to encode the data comprises a memory-less algorithm.

17. The computer program product of claim 16, wherein the memory-less algorithm comprises a block encoding algorithm.

18. The computer program product of claim 13, further comprising a set of computer readable instructions that select the invalid data codes having a maximum Hamming Distance.

19. The computer program product of claim 13, further comprising a set of computer readable instructions that select the invalid data codes having a maximum Hamming Distance and an autocorrelation having a lowest value of a greatest non-peak autocorrelation value.

20. The computer program product of claim 13, further comprising:

a set of computer readable instructions that select the invalid data codes having a maximum Hamming Distance and an autocorrelation greater than a second threshold; and

a set of computer readable instructions that use at least one of the selected invalid data codes as a synchronization code.

21. The computer program product of claim 13, wherein autocorrelation of each of the invalid data codes is performed before generation of the Hamming distance.

22. The computer program product of claim 13, further comprising a set of computer readable instructions that select the invalid data codes having substantially the same number of ones and zeros.

23. The computer program product of claim 13, further comprising a set of computer readable instructions that append at least two invalid data codes together.

24. An ultra-wideband communication system, comprising:

at least two groups of ultra-wideband communication devices; and

a set of synchronization codes assigned to each group of communication devices;

wherein each assigned set of synchronization codes allows each group of communication devices to communicate with other communication devices in the same group, without interfering with the other groups of communication devices.

25. The communication system of claim 24, wherein each assigned set of synchronization codes is transmitted using a pseudo-random hopping sequence.

26. The communication system of claim 24, wherein each communication device is assigned a specific synchronization code from the assigned set of synchronization codes.

27. The communication system of claim 24, wherein each synchronization code is included within a frame that comprises a data payload section and an error detection section.

28. The communication system of claim 24, wherein each synchronization code is transmitted using a substantially continuous sinusoidal waveform.

29. The communication system of claim 28, wherein the substantially continuous sinusoidal waveform has a duration that ranges between about 1 microsecond to about 1 millisecond.

30. The communication system of claim 28, wherein the substantially continuous sinusoidal waveform has less than a 20% fractional bandwidth.

31. The communication system of claim 24, wherein each synchronization code is transmitted using at least one discrete pulse of electromagnetic energy.

32. The communication system of claim 31, wherein each of the discrete electromagnetic pulses has a duration that ranges between about 10 picoseconds to about 1 microsecond.

33. The communication system of claim 31, wherein each of the discrete electromagnetic pulses has a power that can range between about +30 dBm to about −

60 dBm, as measured at a single frequency.

34. The communication system of claim 24, wherein each synchronization code is transmitted using at least one ultra-wideband pulse.