US20070171812A1 - Ovsf code system and methods for cdma stations - Google Patents

Ovsf code system and methods for cdma stations Download PDF

Info

Publication number
US20070171812A1
US20070171812A1 US11566002 US56600206A US2007171812A1 US 20070171812 A1 US20070171812 A1 US 20070171812A1 US 11566002 US11566002 US 11566002 US 56600206 A US56600206 A US 56600206A US 2007171812 A1 US2007171812 A1 US 2007171812A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
code
codes
binary
index
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US11566002
Inventor
Younglok Kim
Jung-Lin Pan
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
InterDigital Technology Corp
Original Assignee
InterDigital Technology Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/10Code generation
    • H04J13/12Generation of orthogonal codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0007Code type
    • H04J13/004Orthogonal
    • H04J13/0044OVSF [orthogonal variable spreading factor]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/16Code allocation
    • H04J13/18Allocation of orthogonal codes
    • H04J13/20Allocation of orthogonal codes having an orthogonal variable spreading factor [OVSF]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0007Code type
    • H04J13/004Orthogonal
    • H04J13/0048Walsh

Abstract

A code indexing system for a CDMA communication station that uses orthogonal variable spreading factor (OVSF) codes having 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, the system provides easy and fast generation of the available code list without the help of look-up table. This capability improves the dynamic code assignment.

Description

    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)−2ith Walsh code of the ith layer of Walsh codes where i is an integer such that 2i≦p<2i+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≦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−2k). Thus the processor is preferably configured to use the binary form of q concatenated with the binary forms of (r−2k) 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 (×)}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)−2ith code of an ith layer of codes for SF=2i where i is the unique integer such that 2i≦p<2i+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.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)
  • [0020]
    OVSF codes are used in the encoding and decoding of communication signals between communication stations, such as between Node Bs and UEs of the CDMA system depicted in FIG. 3. A conventional OVSF code tree structure is shown in FIG. 1 which codes are referred to as Walsh codes herein. CSF(n) denotes the OVSF code word with the spreading factor SF=2k, where n is the code number and k is the layer number. The indices n and k are known as the Hadamard indices. The Walsh codes are conventionally generated recursively from the code tree as shown in FIG. 1.
  • [0021]
    The mother codes are the lower layer codes on the path from the specific code to the root code C1(0), and the descendent codes are those produced from the specific code. For example, the mother codes of C8(2) is C4(1), C2(0) and C1(0), and the descendent codes of C4(1) are C8(2), C8(3) and their descendent codes.
  • [0022]
    Two codes are orthogonal if, and only if, any one is not the mother code or the descendent code of another. When a specific code is assigned, its mother codes and descendent codes cannot be assigned in the same channel since they are not orthogonal to each other. In other words, two OVSF codes with different spreading factors are not orthogonal when they are on the same branch of the code tree.
  • [0023]
    When a new call is requested with a specific data rate, the communication station needs to assign a code from an available set of codes with the corresponding spreading factor. Conventionally, in order to maintain the orthogonality between assigned codes, the set of available code list is updated whenever the new code is assigned. This code set is updated by removing the assigned code itself and all of its descendent and mother codes.
  • [0024]
    The inventors have recognized that the prior art codes can each be assigned via a single indice system instead of the dual indice system per the known Hadamard method. In the single indice system of the present invention, a sequential numerical code label p is assigned where p equals the sum of the code layer plus the code number of the conventional tree structure designation using Hadamard indices as reflected in step 30 of FIG. 5. As such, the code labels are sequential integers starting with the one code of layer 0 where SF=1 labeled as 1, the two codes of layer 1 where SF=2 labeled as 2 and 3, followed by the 2i codes of layer i where SF=2i labeled as the next 2i integers for each successive layer i from 2 onward as represented in FIG. 2 for layers 0 through 3. Although only codes for spreading factors up to 8 are shown in FIG. 2, the system is applicable for spreading codes of any power of 2. Accordingly, as illustrated in FIG. 4, a processor 20 within a communication station 10 that selects the OVSF codes has an associated memory device 15 that includes an index P which contains the code label values p.
  • [0025]
    In general for each positive integer label p, there is a unique integer i, where 2i≦p<2(i+1), and p represents the (p+1)−2ith Walsh code of the ith layer of Walsh codes. For example, when p=87, i=6 since 64≦p<128, so that 87 represents the 24th Walsh code of the 6th layer of the Walsh codes. For p=1, i=0 since 20≦1<2, so 1 represents the first code of the zeroth layer. Generally, for a prior art code designated CN(x), that code is the (x+1) th code of layer N, since the prior art code designations start for each layer with x=0.
  • [0026]
    In lieu of using the prior art designations of FIG. 1, the prior art tree-structured codes can be generated for each positive integer p by the recursive Kronecker procedure where for each integer p>3 the corresponding code is defined by:
    C(p)=C(m+2){circle around (×)}C(k),  Equation (1)
    with
    p=2·k+m,  Equation (2)
  • [0027]
    where k and m are integers with m=0 or 1, and the codes corresponding to p=1, 2 or 3 are:
    C(1)=[1], C(2)=[1, 1], and C(3)=[1, −1].  Equation (3)
  • [0028]
    As noted above, for any specified p there is a unique integer i such that 2i≦p<2i+1, so that each p represents a code of only one SF, namely SF=2i. Also, the code represented by p is the (p+1)−2ith code of an ith layer of codes starting with p=1 representing the first code of a zeroth layer.
  • [0029]
    Codes generated in this manner meet the following three properties:
  • [0030]
    Property 1: The OVSF code for code label p where SF≦p<2SF and SF=2L can be factored into a Kronecker product with L terms of C(2) or C(3) as follows:
    C(p)=Ci−1+2){circle around (×)} . . . {circle around (×)}C1+2){circle around (×)}C0+2)  Equation (4)
  • [0031]
    where α0=1 and each αi, for i=1 to L−1, is 0 or 1 and p = a 0 · 2 L - 1 + a 1 · 2 L - 2 + + a L - 1 = i = 0 L - 1 ( a i · 2 ( L - i - 1 ) ) Equation ( 5 )
  • [0032]
    Thus, α0, α1 . . . αL−1 is the binary representation of p where α0=1 and each αi, for i>1, is the binary digit 1 or 0.
  • [0033]
    Property 2: The mother codes of C(p) are all of the form:
    [CL−m+2){circle around (×)} . . . {circle around (×)}C1+2){circle around (×)}C0+2)] with m=2, 3, . . . L.
  • [0034]
    Property 3: The descendent codes of C(p) are all C(q){circle around (×)}C(p) with any positive integer q.
  • [0035]
    For notational purposes, code designations of the present invention C(p) where p is in decimal form can also be represented as c(pbinary), i.e. c(α0 . . . αN−1) where α0 . . . αN−1 is the binary representation of p. For example, C(6)=c(110), since 6 in decimal notation equals 110 in binary notation.
  • [0036]
    The code indexing system implemented in CDMA communication stations in accordance with the present invention is illustrated in FIG. 2 and FIG. 4. The OVSF code words with their spreading factor up to 8 are shown with both the conventional index using the Hadamard indices and the new code index representations.
  • [0037]
    The OVSF code layer numbers are shown in the first column. The conventional OVSF code indices are shown in the second column, i.e., SF and code number. The third and fourth columns are the binary and decimal forms of the code labels of the present invention. Preferably, the binary code label values are stored in an index P of a memory device 15 associated with the communication station's processor 20 that selects and generates the Walsh codes.
  • [0038]
    The code label index maps a code label to each codeword shown in the last column. The code words of FIG. 2 correspond directly to the Walsh code sets of 1s and −1s in FIG. 1 with 0s in the codeword being substituted for each −1 of the corresponding Walsh code.
  • [0039]
    In view of properties 2 and 3, the mother codes and descendent codes of c(α0, α1, α2, α3) are {c(α0), c(α0, α1), c(α0, α1, α2)} and all the codes having binary indices starting with (α0, α1, α2, α3), i.e., c(α0, α1, α2, α3, X, X, X, . . . ) are easily identifiable.
  • [0040]
    The code label indexing method in accordance with the present invention has several distinct advantages over prior art methods:
  • [0041]
    1) Reduced Number of Bits for Identifying Codes and Increased Capacity
  • [0042]
    The new indexing method reduces the memory size requirements for the communication stations since only L+1 bits are required to support the maximum spreading factor 2L, while the conventional indexing requires L+┌log2(L)−1┐ bits for the same case. For example, there is a 3 bit saving for the maximum spreading factor 512. For maximum spreading factor 512, the conventional method needs 4 bits to store ten spreading factors {1, 2, 4, 8, 16, 32, 64, 128, 256, 512} or ten layer numbers {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} correspondingly. In addition, the conventional method needs 9 bits to distinguish between the 512 codes in the 10th layer. Accordingly, a total of 13 bits are conventionally required to identify a particular code within a 10 layer system which supports spreading factors up to and including 512. In comparison, the new method needs only 10 bits to distinguish all the codes of 1023 for spreading factors up to and including 512. The reduction of 3 bits from 13 bits represents a nearly 25% increase in capacity.
  • [0043]
    2) Easy to Generate Available Orthogonal Codes During Code Assignment
  • [0044]
    As reflected in FIG. 5, with the new indexing, the available code with the specific spreading factor are generated directly with a processor in a straightforward way from the binary form of the indices of the assigned code without requiring the use of look-up tables.
  • [0045]
    For instance, if the code represented by 89 (or 1011001) is assigned, its mother codes and descendent codes cannot be assigned for the use simultaneously to maintain relative orthogonality of used codes. Those codes would normally be marked “BUSY” when code 89 is used. The BUSY codes are easily generated because mother codes of code#89 are code#70 (101100), code#22 (10110), code#11 (1011), code#5 (101), code#2 (10), code#1 (1), and its descendent codes, in a nine layer system, are code#178 (10110010), code#179 (10110011), code#356 (101100100), code#357 (101100101), code#358 (101100110), code#359 (101100111) according to properties 2 and 3.
  • [0046]
    In general, each code index has a binary form which is represented by a sequence of significant binary digits of a length equal to the layer of the Walsh code it represents. To determine the relative orthogonality of one Walsh code of layer i, represented by index value p, with another Walsh code of layer j, represented by an index value q, the binary forms of p and q are compared. Since 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 not orthogonal only 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 as reflected in step 32 of FIG. 5. For p=87, this condition is true only for q=1, 2, 5, 11, 22, 70, 178, 178, 356, 357, 358 or 359 in a nine layer system as referenced above.
  • [0047]
    3) Easy to Spread with the Long Code
  • [0048]
    The spread sequence with a long code can be obtained by the multiple spreading with shorter spreading factors. The short spreading code numbers are directly extracted from the long code number.
  • [0049]
    For example, the spreading code c(α0, α1, . . . , αM) is the Kronecker product of c(α0, α1, . . . , αN) and c(α0, αN+1, αN+2, . . . , αM) with N≦M. Hence, the long spreading can be obtained by two consecutive spreadings, first with c(α0, αN+1, αN+2, . . . , αM) and then with c(α0, α1, . . . , αN).
  • [0050]
    4) Easy to Generate the Long Code
  • [0051]
    The long code c(α0, α1, . . . , αM) can be obtained by spreading c(α0, α1, . . . , αN) with c(α0, αN+1, αN+2, . . . , αM). There is no additional hardware complexity in generating the long code from the shorter code.
  • [0052]
    For example, with references to FIG. 2:
    c(1110)=c(11){circle around (×)}c(110)  Equation (6)
    since,
    [1, −1, −1,1,1, −1, −1,1]=[1, −1]{circle around (×)}[1, −1,1, −1]  Equation (7)
    Also:
    c(1110)=c(111){circle around (×)}c(10)  Equation (8)
    since,
    [1, −1, −1,1,1, −1, −1,1]=[1, −1, −1,1]{circle around (×)}[1,1]  Equation (9)
  • [0053]
    In general, any Walsh code of layer i, represented by an index value p, can be generated by the Kronecker product of two Walsh codes of layers j and k represented by respective index values of q and r where j+k=i. In such case the binary form of p is equal to the binary form of q concatenated with the binary form of (r−2k).
  • [0054]
    5) Reduced Memory Size for Code Table
  • [0055]
    The whole spreading code set does not have to be tabulated in the memory. The above multi-stage spreading scheme needs a much smaller table supporting a lower spreading factor. In addition, there is no need to store the look-up table for the mother codes and descendent codes of all codes. They can be generated in a straightforward manner. For example, a 256 length OVSF code of layer 8 can be generated by two 16 length OVSF codes of layer 4. Hence a code table supporting codes up through layer 4 for a 16 SF is enough to support the easy generation of all codes through layer 8 for a 256 SF. Alternatively, all spreading codes can be generated using the layer two codes c(10) and c(11) per equation 4 above where c(10)=C(2)=[1,1] and c(11)=C(3)=[1, −1].
  • [0056]
    6) Enable Easy and Fast Dynamic Channel Assignment (DCA)
  • [0057]
    The indexing of the present invention benefits the dynamic code assignment for easy and fast generation of AVAILABLE and BUSY code lists. In conventional indexing methods, look-up tables are required to store and search through all the mother codes and descendent codes of all codes. Conventionally, the look-up tables take up large amounts of memory and the searching process is time-consuming.
  • [0058]
    With the new indexing method, there is no need for look-up tables. All the mother codes and descendent codes can be obtained directly in a straightforward manner from the assigned codes. This enables a easy and fast dynamic code assignment.
  • [0059]
    Moreover, only a list of the index values of used codes need be maintained to determine whether an orthogonal code is available and to select such an orthogonal code. Where a code of spreading factor SF is needed and prior used codes indexes p1 . . . pn have been stored to a used code list, each value p from SF through 2SF−1 can be compared against the stored used code index values to determine the availability of an orthogonal code.
  • [0060]
    For simplicity, p can be first set equal to SF and the binary form of p can be compared to the binary form of each of the stored used code index values to determine orthogonality as set forth above. If a comparison yields a determination of non-orthogonality, the comparison process can be stopped, p incremented by 1 and the comparison process repeated with the incremented p. The process continues until a p is found which represents a code orthogonal to all the used codes or until p is incremented to equal 2SF. In the first case, the code corresponding to p is selected for use as an orthogonal code and p is stored to the set of used codes. In the second case where p is incremented to equal 2SF, no orthogonal code is available.
  • [0061]
    The new code index method is a method for assigning single number that indicates the layer number and the code number, and moreover it indicates the structure of the code and the information about the orthogonality to other codes.

Claims (17)

  1. 1. A communication station configured for use in a communications system where orthogonal variable spreading factor (OVSF) codes are selected from a set of Walsh codes represented as a binary tree having multiple layers such that a zeroth layer has one Walsh code and each successive layer has twice the number of Walsh codes as the layer it succeeds, the communication station comprising:
    a memory device having an index of consecutive positive integer index values that have a binary form of significant bits 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.
  2. 2. The communication station according to claim 1 further comprising:
    a processor associated with said memory device configured to select codes from the set of OVSF codes; and
    said processor configured to select a second code that is orthogonal to a previously selected first code such that the binary form of the index value of the first code is not the same as the most significant bits of the binary form of the index value of the second code and the binary form of the index value of the second code is not the same as the most significant bits of the binary form of the index value of the first code.
  3. 3. The communication station according to claim 2 wherein the processor is configured to select a second code by:
    first indicating as busy the index value of the previously selected first code and the index values of all other codes where the index value of the first code is the same as the most significant bits of the binary form of the index value of the other code or the binary form of the index value of the other code is the same as the most significant bits of the binary form of the index value of the first code, and
    then selecting a code having an index value that is not indicated as busy as the second code.
  4. 4. The communication station according to claim 2 wherein said processor is configured to determine the relative orthogonality of a selected OVSF code represented by a first index value with another OVSF code represented by a second index value by comparing the binary forms of the first and second index values.
  5. 5. The communication station of claim 4 wherein said processor is configured to determine OVSF codes to be not orthogonal if either the binary form of the index value of one code is the same as the most significant binary digits of the binary form of the index value of another code or the binary form of the index value of the another code is the same as the most significant binary digits of the binary form of the index value of the one code.
  6. 6. The communication station of claim 2 wherein said processor is configured to generate OVSF codes as the Kronecker Product of codes represented by index values 2 and 3 corresponding to a sequence of significant binary digits of the binary form of its index value where each binary digit 0 corresponds to the code of index value 2 and each binary digit 1 corresponds to the code of index value 3.
  7. 7. The communication station according to claim 1 wherein said communication station is a User Equipment.
  8. 8. The communication station according to claim 1 wherein said communication station is a Node B.
  9. 9. The communication station according to claim 2 wherein said communication station is a User Equipment.
  10. 10. The communication station according to claim 2 wherein said communication station is a Node B.
  11. 11. A method for a communication station configured for use in a communications system where orthogonal variable spreading factor (OVSF) codes are selected from a set of Walsh codes represented as a binary tree having multiple layers such that a zeroth layer has one Walsh code and each successive layer has twice the number of Walsh codes as the layer it succeeds, the method comprising:
    a providing an index of consecutive positive integer index values that have a binary form of significant bits 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.
  12. 12. The method according to claim 11 further comprising:
    selecting codes from the set of OVSF codes such that a second code that is orthogonal to a previously selected first code is selected such that the binary form of the index value of the first code is not the same as the most significant bits of the binary form of the index value of the second code and the binary form of the index value of the second code is not the same as the most significant bits of the binary form of the index value of the first code.
  13. 13. The method according to claim 12 wherein the selecting a second code is by:
    first indicating as busy the index value of the previously selected first code and the index values of all other codes where the index value of the first code is the same as the most significant bits of the binary form of the index value of the other code or the binary form of the index value of the other code is the same as the most significant bits of the binary form of the index value of the first code, and
    then selecting a code having an index value that is not indicated as busy as the second code.
  14. 14. The method according to claim 12 wherein the relative orthogonality of a selected OVSF code represented by a first index value with another OVSF code represented by a second index value is determined by comparing the binary forms of the first and second index values.
  15. 15. The method of claim 14 wherein OVSF codes are determined to be not orthogonal if either the binary form of the index value of one code is the same as the most significant binary digits of the binary form of the index value of another code or the binary form of the index value of the another code is the same as the most significant binary digits of the binary form of the index value of the one code.
  16. 16. The method of claim 12 wherein OVSF codes are generated as the Kronecker Product of codes represented by index values 2 and 3 corresponding to a sequence of significant binary digits of the binary form of its index value where each binary digit 0 corresponds to the code of index value 2 and each binary digit 1 corresponds to the code of index value 3.
  17. 17. The method of claim 11 wherein OVSF codes are generated as the Kronecker Product of codes represented by index values 2 and 3 corresponding to a sequence of significant binary digits of the binary form of its index value where each binary digit 0 corresponds to the code of index value 2 and each binary digit 1 corresponds to the code of index value 3.
US11566002 2001-09-18 2006-12-01 Ovsf code system and methods for cdma stations Abandoned US20070171812A1 (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
US32312001 true 2001-09-18 2001-09-18
US10040513 US6552996B2 (en) 2001-09-18 2001-12-28 OVSF code system and methods
US10419485 US6747947B2 (en) 2001-09-18 2003-04-21 OVSF code system and methods for CDMA stations
US10831254 US7239604B2 (en) 2001-09-18 2004-04-23 OVSF code system and methods for CDMA stations
US11566002 US20070171812A1 (en) 2001-09-18 2006-12-01 Ovsf code system and methods for cdma stations

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US11566002 US20070171812A1 (en) 2001-09-18 2006-12-01 Ovsf code system and methods for cdma stations

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10831254 Continuation US7239604B2 (en) 2001-09-18 2004-04-23 OVSF code system and methods for CDMA stations

Publications (1)

Publication Number Publication Date
US20070171812A1 true true US20070171812A1 (en) 2007-07-26

Family

ID=26717132

Family Applications (4)

Application Number Title Priority Date Filing Date
US10040513 Expired - Fee Related US6552996B2 (en) 2001-09-18 2001-12-28 OVSF code system and methods
US10419485 Expired - Fee Related US6747947B2 (en) 2001-09-18 2003-04-21 OVSF code system and methods for CDMA stations
US10831254 Expired - Fee Related US7239604B2 (en) 2001-09-18 2004-04-23 OVSF code system and methods for CDMA stations
US11566002 Abandoned US20070171812A1 (en) 2001-09-18 2006-12-01 Ovsf code system and methods for cdma stations

Family Applications Before (3)

Application Number Title Priority Date Filing Date
US10040513 Expired - Fee Related US6552996B2 (en) 2001-09-18 2001-12-28 OVSF code system and methods
US10419485 Expired - Fee Related US6747947B2 (en) 2001-09-18 2003-04-21 OVSF code system and methods for CDMA stations
US10831254 Expired - Fee Related US7239604B2 (en) 2001-09-18 2004-04-23 OVSF code system and methods for CDMA stations

Country Status (7)

Country Link
US (4) US6552996B2 (en)
EP (1) EP1428341A4 (en)
JP (1) JP4074249B2 (en)
KR (2) KR100594416B1 (en)
CN (1) CN1555626A (en)
CA (1) CA2460579C (en)
WO (1) WO2003026182A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070064590A1 (en) * 2005-08-23 2007-03-22 Tomasz Prokop Buffer-based generation of OVSF code sequences
US20120166982A1 (en) * 2010-12-27 2012-06-28 Udo Klein Code list cache for value help

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10004873A1 (en) * 2000-02-04 2001-08-23 Infineon Technologies Ag Generating orthogonal code with variable spreading factor enables code words to be generated with very low circuit costs - involves computing computation index, storing as binary word, computing computation index data word width, exchanging significant data bits, logic processing
US7248698B2 (en) * 2001-04-06 2007-07-24 Interdigital Technology Corporation System for generating pseudorandom sequences
EP1438795B1 (en) * 2001-09-29 2012-02-08 LG Electronics, Inc. Method for transferring and /or receiving data in communication system and apparatus thereof
US7020176B2 (en) * 2001-10-30 2006-03-28 Samsung Electronics Co., Ltd. Method and system for downlink channelization code allocation in a UMTS
KR101011837B1 (en) * 2002-01-22 2011-01-31 이 아이 듀폰 디 네모아 앤드 캄파니 Quinazolinediones for Invertebrate Pest Control
EP1468529A2 (en) * 2002-01-25 2004-10-20 Nokia Corporation Method and system for adding ip routes to a routing mobile terminal with 3g messages
US7346038B2 (en) * 2002-05-11 2008-03-18 Accton Technology Corporation Method for generating 2D OVSF codes in multicarrier DS-CDMA systems
US7197007B2 (en) * 2002-05-11 2007-03-27 Accton Technology Corporation Method for generating 2D OVSF codes in multicarrier DS-CDMA systems
US8699505B2 (en) * 2002-05-31 2014-04-15 Qualcomm Incorporated Dynamic channelization code allocation
WO2004002034A1 (en) * 2002-06-21 2003-12-31 Telefonaktiebolaget Lm Ericsson (Publ) Generation of orthogonal codes
JP4310272B2 (en) * 2002-07-18 2009-08-05 インターデイジタル テクノロジー コーポレーション Ovsf code assignment
US7289426B2 (en) * 2002-09-24 2007-10-30 Stmicroelectronics S.R.L. Method and low consumption device for parallel generating channelization codes for CDMA transmissions, in particular WH and OVSF codes
US7933250B2 (en) * 2003-06-23 2011-04-26 Qualcomm Incorporated Code channel management in a wireless communications system
US7065365B2 (en) 2003-09-30 2006-06-20 Interdigital Technology Corporation Code tree fragmentation in call admission control
US8072942B2 (en) * 2003-11-26 2011-12-06 Qualcomm Incorporated Code channel management in a wireless communications system
KR100565313B1 (en) * 2003-11-26 2006-03-30 엘지전자 주식회사 Method of time domain and code domain power measurement for combined tdma and cdma operated communication system
US7450491B2 (en) * 2004-01-15 2008-11-11 Accton Technology Corporation Multicarrier and multirate CDMA system
KR20050100549A (en) * 2004-04-14 2005-10-19 삼성전자주식회사 Spreading code selecting method for reduce iui
GB0426548D0 (en) * 2004-12-02 2005-01-05 Ttp Communications Ltd Interference characterisation and removal
EP1742403B1 (en) * 2005-07-05 2007-10-24 Alcatel Lucent Base station and method for allocating HS-DSCH channelisation codes in a wireless communication system
US7729235B2 (en) * 2005-09-27 2010-06-01 Mediatek Inc. Method and apparatus for OVSF code generation
JP4601596B2 (en) * 2006-10-03 2010-12-22 株式会社エヌ・ティ・ティ・ドコモ The base station apparatus and method
EP3046282A3 (en) * 2007-06-21 2016-11-23 Electronics and Telecommunications Research Institute Method for transmitting control information in wireless communication systems

Citations (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5442627A (en) * 1993-06-24 1995-08-15 Qualcomm Incorporated Noncoherent receiver employing a dual-maxima metric generation process
US5751761A (en) * 1993-07-20 1998-05-12 Qualcomm Incorporated System and method for orthogonal spread spectrum sequence generation in variable data rate systems
US6001757A (en) * 1996-10-04 1999-12-14 Sumitomo Electric Industries, Ltd. Hard sintered body for tool
US6009091A (en) * 1998-03-13 1999-12-28 Motorola, Inc. Method and apparatus for mobile station location within a communication system
US6091757A (en) * 1998-12-03 2000-07-18 Motorola, Inc. Data transmission within a spread-spectrum communication system
US6163524A (en) * 1998-10-19 2000-12-19 Telefonaktiebolaget Lm Ericsson (Publ) Code allocation in CDMA
US6222875B1 (en) * 1997-07-11 2001-04-24 Telefonaktiebolaget Lm Ericsson (Publ) Low-delay rate detection for variable rate communication systems
US6233231B1 (en) * 1998-12-03 2001-05-15 Motorola, Inc. Data transmission within a spread-spectrum communication system
US6330291B1 (en) * 1996-03-29 2001-12-11 Qualcomm Inc. Frequency tracking for communication signals using M-ary orthogonal walsh modulation
US20020018457A1 (en) * 2000-01-17 2002-02-14 Sung-Ho Choi Apparatus and method for allocating channel using OVSF code for uplink synchronous transmission scheme in a W-CDMA communication system
US6400755B1 (en) * 1999-04-23 2002-06-04 Motorola, Inc. Data transmission within a spread-spectrum communication system
US6466142B1 (en) * 1999-01-13 2002-10-15 Paolo Emilio Barbano Method and apparatus for generating families of code signals using multi-scale shuffling
US6483828B1 (en) * 1999-02-10 2002-11-19 Ericsson, Inc. System and method for coding in a telecommunications environment using orthogonal and near-orthogonal codes
US6532250B1 (en) * 1999-12-21 2003-03-11 Telefonaktiebolaget Lm Ericsson (Publ) Methods and apparatus for spreading and despreading information signals in code division multiple access communications systems
US6693952B1 (en) * 1999-03-16 2004-02-17 Lucent Technologies Inc. Dynamic code allocation for downlink shared channels
US6813506B1 (en) * 1999-11-18 2004-11-02 Lg Electronics Inc. Method for coding and transmitting transport format combination indicator
US6813258B2 (en) * 2000-01-28 2004-11-02 Robert Bosch Gmbh Detection method and device
US6885691B1 (en) * 1999-08-02 2005-04-26 Lg Information & Communications, Ltd. Scrambling codes and channelization codes for multiple chip rate signals in CDMA cellular mobile radio communication system
US6956948B1 (en) * 1999-09-22 2005-10-18 Samsung Electronics Co., Ltd. Apparatus and method for generating multiple scrambling codes in asynchronous mobile communication system
US6956890B2 (en) * 2000-09-15 2005-10-18 Stmicroelectronics S.R.L. Process and device for the generation of codes, for example channeling codes for CDMA applications
US6982946B2 (en) * 2001-04-05 2006-01-03 Telefonaktiebolaget Lm Ericsson (Publ) Partly orthogonal multiple code trees
US7012886B2 (en) * 2001-05-16 2006-03-14 Lucent Technologies Inc. Walsh code allocation/de-allocation system
US7209461B2 (en) * 2001-05-09 2007-04-24 Qualcomm Incorporated Method and apparatus for chip-rate processing in a CDMA system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5009091A (en) * 1989-03-31 1991-04-23 Hinterman William H Press counterbalance system
US6108369A (en) 1997-07-11 2000-08-22 Telefonaktiebolaget Lm Ericsson Channelization code allocation for radio communication systems
DE10004873A1 (en) 2000-02-04 2001-08-23 Infineon Technologies Ag Generating orthogonal code with variable spreading factor enables code words to be generated with very low circuit costs - involves computing computation index, storing as binary word, computing computation index data word width, exchanging significant data bits, logic processing

Patent Citations (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5442627A (en) * 1993-06-24 1995-08-15 Qualcomm Incorporated Noncoherent receiver employing a dual-maxima metric generation process
US5751761A (en) * 1993-07-20 1998-05-12 Qualcomm Incorporated System and method for orthogonal spread spectrum sequence generation in variable data rate systems
US6330291B1 (en) * 1996-03-29 2001-12-11 Qualcomm Inc. Frequency tracking for communication signals using M-ary orthogonal walsh modulation
US6001757A (en) * 1996-10-04 1999-12-14 Sumitomo Electric Industries, Ltd. Hard sintered body for tool
US6222875B1 (en) * 1997-07-11 2001-04-24 Telefonaktiebolaget Lm Ericsson (Publ) Low-delay rate detection for variable rate communication systems
US6009091A (en) * 1998-03-13 1999-12-28 Motorola, Inc. Method and apparatus for mobile station location within a communication system
US6163524A (en) * 1998-10-19 2000-12-19 Telefonaktiebolaget Lm Ericsson (Publ) Code allocation in CDMA
US6091757A (en) * 1998-12-03 2000-07-18 Motorola, Inc. Data transmission within a spread-spectrum communication system
US6233231B1 (en) * 1998-12-03 2001-05-15 Motorola, Inc. Data transmission within a spread-spectrum communication system
US6466142B1 (en) * 1999-01-13 2002-10-15 Paolo Emilio Barbano Method and apparatus for generating families of code signals using multi-scale shuffling
US6483828B1 (en) * 1999-02-10 2002-11-19 Ericsson, Inc. System and method for coding in a telecommunications environment using orthogonal and near-orthogonal codes
US6693952B1 (en) * 1999-03-16 2004-02-17 Lucent Technologies Inc. Dynamic code allocation for downlink shared channels
US6400755B1 (en) * 1999-04-23 2002-06-04 Motorola, Inc. Data transmission within a spread-spectrum communication system
US6885691B1 (en) * 1999-08-02 2005-04-26 Lg Information & Communications, Ltd. Scrambling codes and channelization codes for multiple chip rate signals in CDMA cellular mobile radio communication system
US6956948B1 (en) * 1999-09-22 2005-10-18 Samsung Electronics Co., Ltd. Apparatus and method for generating multiple scrambling codes in asynchronous mobile communication system
US6813506B1 (en) * 1999-11-18 2004-11-02 Lg Electronics Inc. Method for coding and transmitting transport format combination indicator
US6532250B1 (en) * 1999-12-21 2003-03-11 Telefonaktiebolaget Lm Ericsson (Publ) Methods and apparatus for spreading and despreading information signals in code division multiple access communications systems
US20020018457A1 (en) * 2000-01-17 2002-02-14 Sung-Ho Choi Apparatus and method for allocating channel using OVSF code for uplink synchronous transmission scheme in a W-CDMA communication system
US6813258B2 (en) * 2000-01-28 2004-11-02 Robert Bosch Gmbh Detection method and device
US6956890B2 (en) * 2000-09-15 2005-10-18 Stmicroelectronics S.R.L. Process and device for the generation of codes, for example channeling codes for CDMA applications
US6982946B2 (en) * 2001-04-05 2006-01-03 Telefonaktiebolaget Lm Ericsson (Publ) Partly orthogonal multiple code trees
US7209461B2 (en) * 2001-05-09 2007-04-24 Qualcomm Incorporated Method and apparatus for chip-rate processing in a CDMA system
US7012886B2 (en) * 2001-05-16 2006-03-14 Lucent Technologies Inc. Walsh code allocation/de-allocation system

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070064590A1 (en) * 2005-08-23 2007-03-22 Tomasz Prokop Buffer-based generation of OVSF code sequences
US7894327B2 (en) * 2005-08-23 2011-02-22 Agere Systems Inc. Buffer-based generation of OVSF code sequences
US20110110399A1 (en) * 2005-08-23 2011-05-12 Agere Systems Buffer-based generation of ovsf code sequences
US8462614B2 (en) 2005-08-23 2013-06-11 Agere Systems Llc Buffer-based generation of OVSF code sequences
US20120166982A1 (en) * 2010-12-27 2012-06-28 Udo Klein Code list cache for value help

Also Published As

Publication number Publication date Type
EP1428341A4 (en) 2006-05-24 application
US20040196781A1 (en) 2004-10-07 application
US6747947B2 (en) 2004-06-08 grant
KR20050098966A (en) 2005-10-12 application
US20030058788A1 (en) 2003-03-27 application
JP2005504467A (en) 2005-02-10 application
CN1555626A (en) 2004-12-15 application
WO2003026182A1 (en) 2003-03-27 application
KR100594416B1 (en) 2006-06-30 grant
CA2460579A1 (en) 2003-03-27 application
US7239604B2 (en) 2007-07-03 grant
JP4074249B2 (en) 2008-04-09 grant
US20030179699A1 (en) 2003-09-25 application
KR20040033061A (en) 2004-04-17 application
EP1428341A1 (en) 2004-06-16 application
US6552996B2 (en) 2003-04-22 grant
CA2460579C (en) 2008-05-13 grant

Similar Documents

Publication Publication Date Title
Mazzini et al. Interference minimisation by auto-correlation shaping in asynchronous DS-CDMA systems: chaos-based spreading is nearly optimal
Hu et al. Optimal computer search trees and variable-length alphabetical codes
Maric et al. A class of frequency hop codes with nearly ideal characteristics for use in multiple-access spread-spectrum communications and radar and sonar systems
US6393047B1 (en) Quadriphase spreading codes in code division multiple access communications
US20040042386A1 (en) Data transmission apparatus and data transmission method
US6005899A (en) Method for efficiently computing sequence correlations
US20030063595A1 (en) Method for transferring and /or receiving data in communication system and apparatus thereof
US6731673B1 (en) Synchronization channel with cyclic hierarchical sequences and method for cell site search with low detector complexity
US6876774B2 (en) Method and apparatus for compressing data string
US5870414A (en) Method and apparatus for encoding and decoding digital signals
US6693952B1 (en) Dynamic code allocation for downlink shared channels
US5559829A (en) Method of constructing a spreading code associated with one user of a direct sequence code division multiple access digital transmission system and corresponding method of generating a table
Yang et al. Performance comparison of multiwavelength CDMA and WDMA+ CDMA for fiber-optic networks
US5206882A (en) System for and method of creating and assigning address codes in a cellular spread spectrum system
US6560194B1 (en) Method of allocating orthogonal codes in a code division multiple access mobile radio system using codes of variable length
US7352796B1 (en) Multiple data rate complex Walsh codes for CDMA
US6885653B2 (en) Apparatus and method for allocating channel using OVSF code for uplink synchronous transmission scheme in a W-CDMA communication system
US6526065B1 (en) Code management system and method for CDMA communication networks
US5751704A (en) Technique for minimizing the variance of interference in packetized interference-limited wireless communication systems
US7379489B2 (en) Orthogonal variable spreading factor (OVSF) code assignment
Minn et al. Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA
US6563808B1 (en) Apparatus for incorporating multiple data rates in an orthogonal direct sequence code division multiple access (ODS-CDMA) communications system
US6456612B1 (en) Device and method for generating short PN code in a mobile communication system
KR20010016706A (en) Allocation Method for channelization code in multi code rate
Lin et al. Optimal PN sequence design for quasisynchronous CDMA communication systems