OVSF code system and methods

Details OVSF code system and methods OVSF code system and methods

2001-12-28

2003-04-22

Vanderpuye, Ken (Department: 2663)

Multiplex communications

Generalized orthogonal or special mathematical techniques

Particular set of orthogonal functions

C370S208000

Reexamination Certificate

active

06552996

ABSTRACT:

FIELD OF INVENTION
The present invention relates CDMA communication systems and, in particular, to Orthogonal Variable Spreading Factor (OVSF) codes and methods for allocating, generating and determining orthogonality of OVSF codes of different data rates.
BACKGROUND
Orthogonal variable spreading factor (OVSF) codes provide an orthogonal code set of variable spreading factors. In the prior art, methods exist for allocating a set of OVSF codes of different data rates employing Walsh codes of variable length. The code assignment is made on the basis of channel data rates in a manner that results in improved utilization of the available frequency spectrum.
An alternative method to obtain OVSF codes based on the code tree structure is based on the modified Hadamard transformation, which requires two indices to indicate a specific code, (i.e., spreading factor and code number). In order to handle the code allocation process, an ASSIGNED list and a BUSY conventionally generated.
These prior art methods have drawbacks in that they require a large amount of memory to store a large number of codes, or require fast processing speeds to generate the codes or effectively allocate the available codes.
SUMMARY
A code indexing system and method for orthogonal variable spreading factor (OVSF) codes introduces a single number mapped to the each code. The new code number itself not only provides the code signature, but it is also used for the OVSF code generation. In addition, it provides easy and fast generation of the available code list without the help of look-up table. This capability improves the dynamic code assignment.
OVSF codes are selected from a set of Walsh codes by using an index p where p represents the (p+1)−2
i
th Walsh code of the ith layer of Walsh codes where i is an integer such that 2
i
≦p<2
i+1
. Preferably, the OVSF code is selected on the basis of a spreading factor SF which is a power of 2 and a Walsh code is selected having an associated index p where SF≦p<2SF.
The relative orthogonality of a selected Walsh code of layer i represented by index value p with another Walsh code of layer j represented by an index value q is determined by comparing the binary forms of p and q. The binary form of p is a sequence of i significant binary digits and the binary form of q is a sequence of j significant binary digits. The represented Walsh codes are determined to be not orthogonal if either the binary form of p is the same as the i most significant binary digits of the binary form of q or the binary form of q is the same as the j most significant binary digits of the binary form of p.
A selected Walsh code represented by index value p is easily generated based upon the sequence of significant binary digits representing the binary form of p. The selected Walsh code is generated as the Kronecker Product of i Walsh codes represented by index values 2 and 3 correspondingly to the sequence of i significant binary digits of the binary form of p where each binary digit 0 corresponds to the Walsh code of index value 2 and each binary digit 1 corresponds to the Walsh code of index value 3.
Alternatively, the selected Walsh code is generated by the Kronecker product of two Walsh codes represented by index values q and r of respective layers of j and k where j+k=i . In such case, the binary form of p is the same as the binary form of q concatenated with the binary forms of (r−2
k
).
In general, OVSF codes are used and selected based upon a spreading factor SF where SF is a positive power of 2, using an index p from a set of codes where for each integer p>3 the corresponding code is defined by C(p)=C(m+2)⊕C(k), with p=2·k+m, where k and m are integers with m=0 or 1. The codes corresponding to p=1, 2 or 3 are C(1)=[1], C(2)=[1, 1], and C(3)=[1, −1]. Accordingly, p represents the (p+1)−2
i
th code of an ith layer of codes for SF=2
i
where i is the unique integer such that 2
i
≦p<2
i+1
.
Other objects and advantages of the invention will be apparent to those skilled in the art from the following description.


REFERENCES:
patent: 5751761 (1998-05-01), Gilhousen
patent: 6009091 (1999-12-01), Stewart et al.
patent: 6091757 (2000-07-01), Cudak et al.
patent: 6163524 (2000-12-01), Magnusson et al.
patent: 6222875 (2001-04-01), Dahlman
patent: 6233231 (2001-05-01), Felix et al.
patent: 6400755 (2002-06-01), Harris et al.
F. Adachi et al., “Tree Structured Generation of Orthogonal Spreading Codes With Different Length for Forward Link of DS-CMDA Mobile Radio”, Electronics Letters, vol. 33, No. 1, Jan. 1997.
E.H. Dinan et al., “Spreading Codes for Direct Sequence CDMA and Wideband CDMA Cellular Networks”, IEEE Communication Magazine, Sep. 1998.
P. Godlewski et al., “Orthogonal Variable Rate Spreading Sequences With Improved Correlation Properties for Wireless CDMA Cellular Networks”, Vehicular Technology Conference, May 1999.
R.G. Cheng et al. “OVSF Code Channel Assignment for IMT-2000”, Vehicular Technology Coference, Spring 2000.
T. Minn et al., “Dynamic Assignment of Orthogonal Variable Spreading Factor Codes in W-CDMA”, IEEE Journal on Selected Areas in Communication, vol. 18, No. 8, Aug. 2000.

Affiliated with

Also associated with

Rating

OVSF code system and methods does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with OVSF code system and methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and OVSF code system and methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3001173