Method and system for multiple-shift code acquisition of optical orthogonal codes in optical CDMA systems

• US 7,120,205 B2
• Filed: 05/08/2002
• Issued: 10/10/2006
• Est. Priority Date: 01/15/2002
• Status: Expired due to Fees

• Current Assignee: Abtin Keshavarzian, Jawad Ahmed Salehi
• Original Assignee: Abtin Keshavarzian, Jawad Ahmed Salehi
• Inventors: Keshavarzian, Abtin, Salehi, Jawad Ahmed
• Primary Examiner(s): Fan, Chieh M.
• Assistant Examiner(s): Bolourchi, Nader
• Application Number:
  US10/140,669
• Publication Number:
  US 20030137956A1
• Time in Patent Office: 1,616 Days
• Field of Search: 375/316, 375/130, 375/140, 375/147, 375/224, 375/354, 375/356, 398/154, 398/140, 370/229, 370/238, 370/235, 370/508, 370/507, 370/503, 370/498, 370/464
• US Class Current: 375/316
• CPC Class Codes: H04B 1/7075 with code phase acquisition
• CPC Class Codes: H04B 2201/70715 with application-specific features
• CPC Class Codes: H04J 13/10 Code generation

Abstract

A technique for determining an arbitrary delay in a source code word propagated over a channel that introduces the arbitrary delay in the source code word to produce a received code word. The technique is based upon a multiple-shift algorithm to determine the delay by a coarse synchronization process to locate synchronization as contained within a composite code pattern, and a fine synchronization process to pinpoint the delay by examining shifts in the source code word used to form the composite code pattern.

Claims

1. A method for determining an arbitrary delay in a source code word propagated over a channel that introduces the arbitrary delay in the source code word to produce a received code word, the source code word and the received code word encompassing a given time interval, the method comprising

partitioning the time interval into cells and grouping a plurality of cells into groups of cells,

examining each of the groups to locate a particular one of the groups containing the arbitrary delay with reference to the source code word and the received code word,

estimating the arbitrary delay within the particular one of the groups with reference to the source code word and the received code word, wherein the examining includes:

generating a composite code pattern with reference to the source code word to examine each of the groups,

randomly selecting one of the groups, and

computing an overlap value between the received code word and the composite code pattern for the randomly selected one of the groups.

2. The method as recited in claim 1 wherein the particular one of the groups is determined whenever the overlap value exceeds a given threshold.

3. The method as recited in claim 2 wherein

the generating further includes generating the composite code pattern from a plurality of shifted versions of the source code word, and

the estimating includes

(a) computing another overlap value for a selected one of the shifted versions, and

(b) whenever said another overlap value exceeds a predetermined threshold, identifying the arbitrary delay with reference to said selected one of the shifted versions and the particular one of the groups;

otherwise, returning to (a) until all shifted versions are processed.

4. The method as recited in claim 2 wherein, if the overlap value is less than the given threshold, randomly selecting another one of the groups to re-compute the overlap value and continuing the randomly selecting until the re-computed overlap value exceeds the given threshold.

5. The method as recited in claim 1 wherein the generating includes augmenting the composite code pattern to produce a modified composite code pattern.

6. The method as recited in claim 5 wherein the examining includes

randomly selecting one of the groups, and

computing an overlap value between the received code word and the modified composite code pattern for the randomly selected one of the groups.

7. The method as recited in claim 6 wherein the particular one of the groups is determined whenever the overlap value exceeds a given threshold.

8. The method as recited in claim 7 wherein

the generating further includes generating the modified composite code pattern from a plurality of shifted versions an expanded source code word, and

the estimating includes

(a) computing another overlap value for a selected one of the shifted versions, and

(b) whenever said another overlap value exceeds a predetermined threshold, identifying the arbitrary delay with reference to said selected one of the shifted versions of the expanded source code word and the particular one of the groups;

otherwise, returning to (a) until all shifted versions are processed.

9. The method as recited in claim 7 wherein, if the overlap value is less than the given threshold, randomly selecting another one of the groups to re-compute the overlap value and continuing the randomly selecting until the re-computed overlap value exceeds the given threshold.

10. The method as recited in claim 7 wherein

the generating further includes generating the modified composite code pattern from a plurality of shifted versions of an expanded source code word, and

the estimating includes

(a) computing another overlap value for a selected one of the shifted versions, and

(b) whenever said another overlap value exceeds a predetermined threshold, identifying the arbitrary delay with reference to said selected one of the shifted versions of the source code word only and the particular one of the groups;

otherwise, returning to (a) until all shifted versions are processed.

11. The method as recited in claim 10 wherein, if the overlap value is less than the given threshold, randomly selecting another one of the groups to re-compute the overlap value and continuing the randomly selecting until the re-computed overlap value exceeds the given threshold.

12. A method for determining an arbitrary delay in a source code word propagated over a channel that introduces the arbitrary delay in the source code word to produce a received code word, the source code word and the received code word encompassing a given time interval, the method comprising

(a) partitioning the bit interval into a number of cells,

(b) grouping the cells into a plurality of groups,

(c) generating a composite code pattern by combining shifts in the source code word with reference to a shift parameter and a previously unused one of the groups,

(d) computing an overlap value by evaluating the overlap of the received code word with the composite code pattern,

(e) if the overlap value exceeds a given threshold, continuing with (f);

otherwise returning to (c),

(f) sequentially comparing the received code word for a selected one of the shifted versions of the source code word used to form the composite code pattern to produce a second overlap value, and

(g) whenever the second overlap value exceeds a predetermined threshold, equating the shift in the compared shifted version of the source code word to the arbitrary delay;

otherwise, either returning to (f) until all shifted versions are processed or to (c) until all groups are processed.

13. The method as recited in claim 12 wherein the generating includes augmenting the composite code pattern to produce a modified composite code pattern.

14. A method for detecting an arbitrary delay in a received code word corresponding to a source code word propagated from a transmitter to a receiver over a channel that introduces the arbitrary delay in the source code word, both the source code word and the received code word covering a bit interval subdivided into a plurality of chip intervals, the method comprising

(a) partitioning the bit interval into F cells, each of the cells having a duration substantially equal to the chip interval,

(b) determining a group number Q from the relation

$Q=\lceil$

F L ⌉

,

where L is a shift parameter, 1<

L<

F,

(c) generating a composite code pattern by combining L shifts in the source code word with reference to a randomly selected number from the set {1, 2, . . . , Q}, excluding previously-selected members of the set,

(d) computing an overlap value by evaluating the overlap of the received code word with the composite code pattern,

(e) if the overlap value exceeds a given threshold, continuing with (f);

otherwise returning to (c),

(f) comparing the received code word with a previously unprocessed one of the L shifted versions of the source code word used to form the composite code pattern to produce a second overlap value, and

(g) whenever the second overlap value exceeds a predetermined threshold, equating the shift in the compared shifted version of the source code word to the arbitrary delay;

otherwise, if shifts remain to be processed, returning to (f) if not, returning to (c).

15. The method as recited in claim 14 wherein a stream of information-bearing received code words is propagated from the transmitter upon determination of the arbitrary delay and the method further comprises synchronizing the stream in the receiver with reference to the arbitrary delay.

16. The method as recited in claim 14 wherein the generating includes augmenting the composite code pattern to produce a modified composite code pattern.

17. The method as recited in claim 16 wherein a stream of information-bearing received code words is propagated from the transmitter upon determination of the arbitrary delay and the method further comprises synchronizing the stream in the receiver with reference to the arbitrary delay.

18. The method as recited in claim 14 wherein the comparing includes augmenting the source code word when forming the L shifted versions of the source code word.

19. A receiver for determining an arbitrary delay in a source code word propagated over a channel that introduces the arbitrary delay in the source code word to produce a received code word, the source code word and the received code word encompassing a given time interval, the method comprising

means for partitioning the time interval into cells and for grouping a plurality of cells into groups of cells,

means for examining each of the groups to locate a particular one of the groups containing the arbitrary delay with reference to the source code word and the received code word,

means for estimating the arbitrary delay within the particular one of the groups with reference to the source code word and the received code word, wherein the means for examining includes:

means for generating a composite code pattern with reference to the source code word to examine each of the groups,

means for randomly selecting one of the groups, and

means for computing an overlap value between the received code word and the composite code pattern for the randomly selected one of the groups.