Code channel management in a wireless communications system

• US 7,881,327 B2
• Filed: 10/19/2007
• Issued: 02/01/2011
• Est. Priority Date: 06/23/2003
• Status: Expired due to Fees

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Tsybakov, Boris, Gaal, Peter, Tiedemann, Edward Jr.
• Primary Examiner(s): Vu; Huy D
• Assistant Examiner(s): Baig; Adnan
• Application Number:
  US11/875,634
• Publication Number:
  US 20090103427A1
• Time in Patent Office: 1,201 Days
• Field of Search: 370/203, 370/206, 370/208, 370/209, 370/320, 370/329, 370/441
• US Class Current: 370/441
• CPC Class Codes: H04J 13/004 Orthogonal
• CPC Class Codes: H04J 13/0048 Walsh
• CPC Class Codes: H04J 13/0074 Code shifting or hopping
• CPC Class Codes: H04J 13/18 Allocation of orthogonal codes
• CPC Class Codes: H04L 27/2601 Multicarrier modulation systems
• CPC Class Codes: H04W 16/02 Resource partitioning among network components, e.g. reuse partitioning

Abstract

Systems and techniques are disclosed relating to communications. The systems and techniques involve dividing a plurality of subscriber stations into a plurality of groups, assigning a different plurality of orthogonal codes to each of the groups, the number of the orthogonal codes assigned to one of the groups being less than the number of subscriber stations in said one of the groups, encoding communications to one of the subscriber stations in said one of the groups at a data rate, and determining whether to spread at least a portion of communications to said to one of the subscriber stations with one of the orthogonal codes assigned to said one of the groups as a function of the data rate.

Claims

1. A communications station, comprising:

memory having an assignment matrix having n rows, k columns, l number of ones in each of the rows, and k−

l number of zeros in each of the rows, where n=a number of subscriber stations assigned to a group, k equals a number of orthogonal codes assigned to the group, and l=a number of the orthogonal codes allocated to each of the n subscriber stations from the k number of orthogonal codes assigned to the group;

means for constructing a second matrix having k rows selected from the assignment matrix;

each of the k rows corresponding to one of k subscriber stations selected from the n subscriber stations;

means for permuting the rows of the second matrix such that a diagonal extending from the first column to the kth column comprises all ones; and

means for assigning one of the k orthogonal codes to each of the k subscriber stations as a function of the permuted second matrix.

2. The communications station of claim 1 wherein l is the lowest integer that satisfies the following equation:

l>

k(n−

k)/n.

3. The communications station of claim 1 wherein the means for permuting the rows of the second matrix comprises means for cyclically shifting the rows of the second matrix vertically until the diagonal extending from the first column to the kth column comprises all ones.

4. The communications station of claim 1 wherein k=n/2, l=(k+1)/2, and n=6+4i, where i is any non-negative integer.

5. The communications station of claim 1 wherein k=(n/2)+1, l=k/2, and n=6+4i, where i is any non-negative integer.

6. The communications station of claim 1 wherein k=n/2, l=(k+1)/2, and n=5+4i, where i is any non-negative integer.

7. The communications station of claim 1 wherein k=(n/2)+1, l=k/2, and n=5+4i, where i is any integer greater than 1.

8. The communications station of claim 1 wherein the assignment matrix includes all ones in the first l columns of the first row and all zeros in the remaining columns of the first row, and wherein each of the remaining rows of the assignment matrix are cyclically shifted horizontally by one bit from the row immediately above it.

9. The communications station of claim 1 wherein the assignment matrix comprises a submatrix comprising the first k−

1 columns, the submatrix comprising all ones in the first l columns of the first row and all zeros in the remaining columns of the first row, and wherein each of the remaining rows of the submatrix are cyclically shifted horizontally by one bit from the row immediately above it, and wherein the kth column includes all zeros in the upper n/2 rows and all ones in the lower n/2 rows.

10. The communications station of claim 1 further comprising means for constructing an intermediate matrix including all ones in the first l columns of the first row and all zeros in the remaining columns of the first row, and wherein each of the remaining rows of the intermediate matrix are cyclically shifted horizontally by one bit from the row immediately above it, and wherein the assignment matrix comprises n rows from the intermediate matrix, where n is less than or equal to the number of rows in the intermediate matrix and n≧

k.

11. The communications station of claim 1 further comprising means for constructing an intermediate matrix having a number of rows and k columns, the intermediate matrix including a submatrix comprising the first k−

1 columns, the submatrix comprising all ones in the first l columns of the first row and all zeros in the remaining columns of the first row, and wherein each of the remaining rows of the submatrix are cyclically shifted horizontally by one bit from the row immediately above it, and wherein the kth column of the intermediate matrix includes all zeros in the upper half of the rows and all ones in the bottom half of the rows, and wherein the assignment matrix comprises n rows from the intermediate matrix, where n is less than or equal to the number of rows in the intermediate matrix and n≧

k.