Method of synchronizing an independent data device of a wireless data communications system on an incident pulsed signal of the ultra wide band type, and corresponding independent data device

• US 7,254,202 B2
• Filed: 03/31/2004
• Issued: 08/07/2007
• Est. Priority Date: 04/01/2003
• Status: Active Grant

• Current Assignee: STMicroelectronics International N.V. (STMicroelectronics NV)
• Original Assignee: STMicroelectronics NV
• Inventors: Cattaneo, Chiara, Cattenoz, Re, Rinaldi, Nils, Frigerio, Matteo
• Primary Examiner(s): Bayard; Emmanuel
• Application Number:
  US10/814,824
• Publication Number:
  US 20040240597A1
• Time in Patent Office: 1,224 Days
• Field of Search: 375/354, 375/316, 375/343, 375/340
• US Class Current: 375/354
• CPC Class Codes: H04B 1/7183 Synchronisation
• CPC Class Codes: H04B 2001/6908 using time hopping

Abstract

An incident signal contains a preamble including a training sequence having a series of pulses whose polarity and time shifts are defined by respective polarity code and time-hopping code. A method includes a digital cross-correlation of the received signal with the training sequence. The cross-correlation algebraically sums in accordance with the polarity code windows of the received signal. The starting points of the windows are determined by the time-hopping code. The cross-correlation further includes detecting the end point of the preamble from the result of the digital cross-correlation. When the size of the receiving buffer, i.e., the size of the window is smaller than the number N of samples of each replica of the training sequence, it is particularly advantageous that the digital cross-correlation be performed iteratively in a block-by-block fashion. The computation of each block is split into M slices which are computed by algebraically summing windows N/M samples long.

Claims

1. A method for synchronizing a data device operating in a wireless data communications system using an incident pulsed signal of an ultra wide band type received over a channel by the data device, the incident pulsed signal comprising a preamble including a training sequence having a series of pulses whose polarity and time shifts are defined by respective polarity and time-hopping codes, the method comprising:

cross-correlating the incident pulsed signal with the training sequence, the cross-correlating comprising algebraically summing in accordance with the polarity code, windows of the incident pulsed signal, with starting points of the windows being determined by the time-hopping code; and

detecting an end point of the preamble based upon a result of the cross-correlation.

2. A method according to claim 1, wherein the training sequence is periodic and comprises replicas, with each training sequence having a size of N samples and containing L pulses, with each window having a size of N samples, with the cross-correlating being performed iteratively in a block-by-block fashion until a stop criterion is reached, with the starting points of two consecutive blocks of correlation being separated by 2N samples, and for each iteration the cross-correlating comprising:

a) initializing contents of an accumulation register capable of storing N data;

b) taking a first group of N samples of the incident pulsed signal starting from the starting point of the corresponding block increased by a time shift of a first pulse;

c) multiplying the first group by the polarity of the first pulse;

d) adding the resulting group of N samples to the contents of the accumulation register; and

e) repeating steps b) to d) for all the L pulses.

3. A method according to claim 1, wherein the training sequence is periodic and comprises at least M+1 replicas, with each replica having a size of N samples and containing L pulses, with M being a sub-multiple of N greater than or equal to 2, with the cross-correlating being performed iteratively in a block-by-block fashion until a stop criterion is reached, the computation of each block being split into M slices which are computed by algebraically summing windows N/M samples long.

4. A method according to claim 3, wherein the incident signal carries information within a super frame, each super frame containing the preamble including at least M+1 synchronization slots corresponding respectively to the replicas of the training sequence, and each slice being computed using one synchronization slot.

5. A method according to claim 4, wherein the starting points of two consecutive blocks of correlation are separated by N+N/M samples, with each iteration the cross-correlating comprising:

a) initializing contents of an accumulation register capable of storing N/M data;

b) taking a first group of N/M samples of the incident pulsed signal starting from the starting point of the corresponding block increased by a time shift of a first pulse;

c) multiplying the first group by the polarity of the first pulse;

d) adding the resulting group of N/M samples to the contents of the accumulation register; and

e) repeating steps b) to d) for all the L pulses.

6. A method according to claim 3, wherein the incident pulsed signal carries information within a super frame, with each super frame containing the preamble including at least M+1 synchronization slots corresponding respectively to the replicas of the training sequence, and each slice being computed using several adjacent synchronization slots belonging to several consecutive super frames.

7. A method according to claim 6, wherein after each correlation iteration, further comprising comparing the contents of the accumulation register with a first threshold;

and wherein the stop criterion comprises detecting at least one peak of the accumulation register having a value greater than the first threshold or a maximum number of correlation iterations.

8. A method according to claim 7, wherein the detecting comprises a first step of detecting one replica of the training sequence, the first step comprising storing in a memory the position of each peak in the accumulation register as well as its sign.

9. A method according to claim 8, wherein the preamble contains an additional flipped last replica of the training sequence;

and wherein the detecting further comprises a second step of sequentially scanning the next replicas until the flipped last replica is found.

10. A method according to claim 9, wherein scanning a next replica comprises:

performing a correlation between the next replica and the training sequence; and

comparing a result of the correlation with a second threshold, and if the absolute value of the correlation result exceeds the second threshold, using the sign of the correlation result and the sign of each detected peak to decide whether the next replica is the last one or if the scanning operation is to be performed with the replica following the next replica.

11. A method according to claim 2, wherein after each correlation iteration, further comprising comparing the contents of the accumulation register with a first threshold;

and wherein the stop criterion comprises detecting at least one peak of the accumulation register having a value greater than the first threshold or a maximum number of correlation iterations.

12. A method according to claim 11, wherein the detecting comprises a first step of detecting one replica of the training sequence, the first step comprising storing in a memory the position of each peak in the accumulation register as well as its sign.

13. A method according to claim 12, wherein the preamble contains an additional flipped last replica of the training sequence;

and wherein the detecting further comprises a second step of sequentially scanning the next replicas until the flipped last replica is found.

14. A method according to claim 13, wherein scanning a next replica comprises:

performing a correlation between the next replica and the training sequence; and

comparing a result of the correlation with a second threshold, and if the absolute value of the correlation result exceeds the second threshold, using the sign of the correlation result and the sign of each detected peak to decide whether the next replica is the last one or if the scanning operation is to be performed with the replica following the next replica.

15. A method according to claim 1, wherein the wireless data communications system comprises a wireless personal area network of the piconet type.

16. A data device comprising:

a receiver for receiving an incident pulsed signal of an ultra wide band type over a channel, the incident pulsed signal comprising a preamble including a training sequence having a series of pulses whose polarity and time shifts are defined by respective polarity and time-hopping codes; and

a synchronizer comprising

a cross-correlation circuit for performing a cross-correlation of the incident pulsed signal with the training sequence, the cross-correlating including algebraically summing in accordance with a polarity code, windows of the incident pulsed signal, with starting points of the windows being determined by the time-hopping code, and

a detection circuit for detecting an end point of the preamble based upon a result of the cross-correlation performed by said cross-correlation circuit.

17. A data device according to claim 16, wherein the training sequence is periodic and comprises replicas, with each training sequence having a size of N samples and containing L pulses, with each window having a size of N samples, and said cross-correlation circuit performing the cross-correlating iteratively in a block-by-block fashion until a stop criterion is reached, the starting points of two consecutive blocks of correlation being separated by 2N samples, said cross-correlation circuit comprising:

an accumulation register for storing N data; and

a processor adapted, for each iteration, to perform the following;

a) initializing contents of said accumulation register,

b) taking a first group of N samples of the received incident pulsed signal starting from the starting point of the corresponding block increased by the time shift of a first pulse,

c) multiplying the first group by the polarity of the first pulse,

d) adding a resulting group of N samples to the contents of said accumulation register, and

e) repeating steps b) to d) for all the L pulses.

18. A data device according to claim 16, wherein the training sequence is periodic and comprises at least M+1 replicas, with each replica having a size of N samples and containing L pulses, with M being a sub-multiple of N greater than or equal to 2;

and wherein said cross-correlation circuit performs the cross-correlating iteratively in a block-by-block fashion until a stop criterion is reached, the computation of each block being split into M slices which are computed by algebraically summing windows N/M samples long.

19. A data device according to claim 18, wherein the incident pulsed signal carries information within a super frame, each super frame containing the preamble including at least M+1 synchronization slots corresponding respectively to the replicas of the training sequence;

and

wherein said cross-correlation circuit computes each slice using one synchronization slot.

20. A data device according to claim 19, wherein the starting points of two consecutive blocks of correlation are separated by N+N/M samples, said cross-correlation circuit comprising an accumulation register for storing N/M data, and a processor adapted for each iteration to perform the following:

a) initializing the contents of said accumulation register;

b) taking a first group of N/M samples of the incident pulsed signal starting from the starting point of the corresponding block increased by the time shift of a first pulse;

c) multiplying the first group by the polarity of the first pulse;

d) adding the resulting group of N/M samples to the contents of said accumulation register; and

e) repeating sub-steps b) to d) for all the L pulses.

21. A data device according to claim 19, wherein the incident pulsed signal carries information within a super frame structure, with each super frame containing the preamble including at least M+1 synchronization slots corresponding respectively to the replicas of the training sequence;

and wherein said cross-correlation circuit computes each slice using several adjacent synchronization slots belonging to several consecutive super frames.

22. A data device according to claims 21, wherein said cross-correlation circuit comprises a comparator for comparing after each correlation iteration, the contents of said accumulation register with a first threshold, and wherein the stop criterion comprises detecting at least one peak of said accumulation register having a value greater than the first threshold or a predetermined maximum number of correlation iterations.

23. A data device according to claim 22, wherein said detection circuit comprises a memory and a store memory (STM) for storing in said memory a position of each peak in said accumulation register as well as its sign.

24. A data device according to claim 23, wherein the preamble contains an additional flipped last replica (LFR) of the training sequence;

and wherein said detection circuit comprising a scanning circuit for sequentially scanning the next replicas until the flipped last one is found.

25. A data device according to claim 24, wherein said scanning circuit comprises:

a correlation circuit for performing a correlation between the next replica and the training sequence; and

a comparison means (CMPX) for comparing the correlation result with a second threshold; and

a control circuit (CTLM) for, if an absolute value of the correlation result exceeds the second threshold, using a sign of the correlation result and a sign of each detected peak to decide whether the next replica is the last one or if the scanning operation is to be performed with the replica following the next replica.

26. A data device according to claims 17, wherein said cross-correlation circuit comprises a comparator for comparing after each correlation iteration, the contents of said accumulation register with a first threshold, and wherein the stop criterion comprises detecting at least one peak of said accumulation register having a value greater than the first threshold or a predetermined maximum number of correlation iterations.

27. A data device according to claim 26, wherein said detection circuit comprises a memory and a store memory (STM) for storing in said memory a position of each peak in said accumulation register as well as its sign.

28. A data device according to claim 27, wherein the preamble contains an additional flipped last replica (LFR) of the training sequence;

and wherein said detection circuit comprising a scanning circuit for sequentially scanning the next replicas until the flipped last one is found.

29. A data device according to claim 28, wherein said scanning circuit comprises:

a correlation circuit for performing a correlation between the next replica and the training sequence; and

a comparison means (CMPX) for comparing the correlation result with a second threshold; and

a control circuit (CTLM) for, if an absolute value of the correlation result exceeds the second threshold, using a sign of the correlation result and a sign of each detected peak to decide whether the next replica is the last one or if the scanning operation is to be performed with the replica following the next replica.

30. A data device according to claim 16, wherein the data device operates in a wireless data communications system comprising a wireless personal area network of the piconet type.

31. A wireless data communications system comprising:

a plurality of data devices, each data device comprising

a receiver for receiving an incident pulsed signal of an ultra wide band type over a channel, the incident pulsed signal comprising a preamble including a training sequence having a series of pulses whose polarity and time shifts are defined by respective polarity and time-hopping codes, and

a synchronizer comprising

a cross-correlation circuit for performing a cross-correlation of the incident pulsed signal with the training sequence, the cross-correlating including algebraically summing in accordance with a polarity code, windows of the incident pulsed signal, with starting points of the windows being determined by the time-hopping code, and

a detection circuit for detecting an end point of the preamble based upon a result of the cross-correlation performed by said cross-correlation circuit.

32. A wireless data communications system according to claim 31, wherein the training sequence is periodic and comprises replicas, with each training sequence having a size of N samples and containing L pulses, with each window having a size of N samples, and said cross-correlation circuit performing the cross-correlating iteratively in a block-by-block fashion until a stop criterion is reached, the starting points of two consecutive blocks of correlation being separated by 2N samples, said cross-correlation circuit comprising:

an accumulation register for storing N data; and

a processor adapted, for each iteration, to perform the following;

a) initializing contents of said accumulation register,

b) taking a first group of N samples of the received incident pulsed signal starting from the starting point of the corresponding block increased by the time shift of a first pulse,

c) multiplying the first group by the polarity of the first pulse,

d) adding a resulting group of N samples to the contents of said accumulation register, and

e) repeating steps b) to d) for all the L pulses.

33. A wireless data communications system according to claim 31, wherein the training sequence is periodic and comprises at least M+1 replicas, with each replica having a size of N samples and containing L pulses, with M being a sub-multiple of N greater than or equal to 2;

and wherein said cross-correlation circuit performs the cross-correlating iteratively in a block-by-block fashion until a stop criterion is reached, the computation of each block being split into M slices which are computed by algebraically summing windows N/M samples long.

34. A wireless data communications system according to claim 33, wherein the incident pulsed signal carries information within a super frame, each super frame containing the preamble including at least M+1 synchronization slots corresponding respectively to the replicas of the training sequence;

and wherein said cross-correlation circuit computes each slice using one synchronization slot.

35. A wireless data communications system according to claim 34, wherein the starting points of two consecutive blocks of correlation are separated by N+N/M samples, said cross-correlation circuit comprising an accumulation register for storing N/M data, and a processor adapted for each iteration to perform the following:

a) initializing the contents of said accumulation register;

b) taking a first group of N/M samples of the incident pulsed signal starting from the starting point of the corresponding block increased by the time shift of a first pulse;

f) multiplying the first group by the polarity of the first pulse;

g) adding the resulting group of N/M samples to the contents of said accumulation register; and

h) repeating sub-steps b) to d) for all the L pulses.

36. A wireless data communications system according to claim 31, wherein the wireless data communications system comprises a wireless personal area network of the piconet type.