Code channel management in a wireless communications system
First Claim
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.
1 Assignment
0 Petitions
Accused Products
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.
83 Citations
11 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification