| Ovsf code system and methods for cdma stations -> Monitor Keywords |
|
|
 
Ovsf code system and methods for cdma stationsRelated Patent Categories: Multiplex Communications, Generalized Orthogonal Or Special Mathematical Techniques, Particular Set Of Orthogonal Functions, Walsh FunctionsOvsf code system and methods for cdma stations description/claimsThe Patent Description & Claims data below is from USPTO Patent Application 20070171812, Ovsf code system and methods for cdma stations. Brief Patent Description - Full Patent Description - Patent Application Claims
CROSS-REFERENCE TO RELATED APPLICATIONS [0001] This application is a continuation of U.S. patent application Ser. No. 10/831,254, filed on Apr. 23, 2004, which is a continuation of U.S. patent application Ser. No. 10/419,485, filed Apr. 21, 2003, which is a continuation-in-part of U.S. patent application Ser. No. 10/040,513, filed Dec. 28, 2001, now U.S. Pat. No. 6,552,996 which in turn claims the benefit of U.S. Provisional Patent Application Ser. No. 60/323,120, filed Sep. 18, 2001 which all are incorporated by reference. FIELD OF INVENTION [0002] 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 used in CDMA wireless communication stations. BACKGROUND [0003] CDMA communication systems are well known in the art. Generally, such systems comprise communication stations which transmit and receive wireless communication signals between each other. Typically, base stations are provided which are capable of conducting wireless concurrent communications with a plurality of subscriber stations. In CDMA systems specified by the Third Generation Partnership Project (3GPP), base stations are called Node Bs, subscriber stations are called User Equipments (UEs) and the wireless interface between the Node Bs and UEs is known as the Uu interface. FIG. 3 illustrates a typical 3GPP CDMA system. [0004] 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. [0005] 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 list are conventionally generated. [0006] 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 [0007] Communication stations for a CDMA system include a code indexing system and method for orthogonal variable spreading factor (OVSF) codes that introduces a single number mapped to 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 a look-up table. This capability improves the dynamic code assignment. [0008] In general, each communication station is configured with a processor and an associated memory device so that OVSF codes are selected from a set of Walsh codes by using an index value p where p represents the (p+1)-2.sup.ith Walsh code of the ith layer of Walsh codes where i is an integer such that 2.sup.i.ltoreq.p<2.sup.i+1. Accordingly, the memory device includes an index P for the code values p where each successive index value represents one of the OVSF codes such that the index values representing any given layer of Walsh codes are less than the index values representing any Walsh code of any layer of Walsh codes successive to the given layer. [0009] 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.ltoreq.p<2SF. [0010] 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. [0011] 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. Accordingly, the binary form of p is preferably the index P value stored in the memory device of the communication station. 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. [0012] 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.sup.k). Thus the processor is preferably configured to use the binary form of q concatenated with the binary forms of (r-2.sup.k) as the binary form of p to generate a selected Walsh code. [0013] In general, the processor of the communication station is configured to use and select OVSF codes based upon a spreading factor SF where SF is a positive power of 2, using an index value p from a set of codes where for each integer p>3 the corresponding code is defined by C(p)=C(m+2){circle around (.times.)}C(k), with p=2k+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.sup.ith code of an ith layer of codes for SF=2.sup.i where i is the unique integer such that 2.sup.i.ltoreq.p<2.sup.i+1. [0014] Other objects and advantages of the invention will be apparent to those skilled in the art from the following description. BRIEF DESCRIPTION OF THE DRAWING(S) [0015] FIG. 1 is a prior art OVSF code tree of Walsh codes. [0016] FIG. 2 is a table representing an indexing system according to the teaching of the present invention. [0017] FIG. 3 is a schematic diagram of a typical CDMA system in accordance with current 3GPP specifications. [0018] FIG. 4 is block diagram of a communications station made in accordance with the teachings or the present invention. [0019] FIG. 5 is diagram of a method in accordance with the teachings or the present invention. Continue reading about Ovsf code system and methods for cdma stations... Full patent description for Ovsf code system and methods for cdma stations Brief Patent Description - Full Patent Description - Patent Application Claims Click on the above for other options relating to this Ovsf code system and methods for cdma stations patent application. ###  How KEYWORD MONITOR works... a FREE service from FreshPatents1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored. 3. Each week you receive an email with patent applications related to your keywords. Start now! - Receive info on patent apps like Ovsf code system and methods for cdma stations or other areas of interest. ### Previous Patent Application: Wireless communication system and wireless communication method Next Patent Application: Method and apparatus for fast fft processing of paging information Industry Class: Multiplex communications ### FreshPatents.com Support Thank you for viewing the Ovsf code system and methods for cdma stations patent info. IP-related news and info Results in 0.10945 seconds Other interesting Feshpatents.com categories: Canon USA , Celera Genomics , Cephalon, Inc. , Cingular Wireless , Clorox , Colgate-Palmolive , Corning , Cymer , 174 |
 * Protect your Inventions * US Patent Office filing 
PATENT INFO |
|
