# Patent

## Title
Apparatus and method for modulating data message by employing orthogonal variable spreading factor (OVSF) codes in mobile communication system

## Abstract

A method for converting source data to a channel-modulated signal having a plurality of pairs of in-phase (I) and quadrature-phase (Q) data in a mobile station, wherein the mobile station uses at least one channel, includes the steps of: a) encoding the source data to generate at least one data part and a control part; b) generating at least one spreading code to be allocated to the channel, wherein each spreading code is selected on the basis of a data rate of the data part and the control part and spreading codes are selected so that two consecutive pairs of the I and Q data are correspondent to two points located on same point or symmetrical with respect to a zero point on a phase domain; and c) spreading the control part and the data part by using the spreading code, to thereby generate the channel-modulated signal. The method is capable of improving a power efficiency of a mobile station by reducing a peak-to-average power ratio in a mobile communication system.

## Background
RELATED APPLICATIONS
This patent application is a Continuation of U.S. patent application Ser. No. 09/584,189, filed on May 31, 2000 now U.S. Pat. No. 7,443,906, which claims priority to and the benefit of Korean Patent Application No. 1999-19813, filed on May 31, 1999 and Korean Patent Application No. 1999-36383, filed on Aug. 30, 1999, all of which are hereby incorporated by reference in their entirety.


FIELD OF THE INVENTION
The present invention relates to an apparatus and method for modulating a data message in a mobile communication system; and, more particularly, to an apparatus and method for modulating a data message by employing orthogonal variable spreading factor (OVSF) codes in a mobile communication system.
DESCRIPTION OF THE PRIOR ART
Generally, a mobile communication system such as an international mobile telecommunication-2000 (IMT-2000) system is capable of providing various services of good quality and large capacity, an international roaming and so on. The mobile communication system can be applicable to high-speed data and multimedia services such as an Internet service and an electronic commerce service. The mobile communication system carries out orthogonal spread with respect to multiple channels. The mobile communication system allocates the orthogonal spread channels to an in-phase (I) branch and a quadrature-phase (Q) branch. A peak-to-average power ratio (PAPR) needed to simultaneously transmit I-branch data and Q-branch data affects power efficiency of a mobile station and a battery usage time of the mobile station.
The power efficiency and the battery usage time of the mobile station are closely related to a modulation scheme of the mobile station. As a modulation standard of IS-2000 and asynchronous wideband-CDMA, the modulation scheme of orthogonal complex quadrature phase shift keying (OCQPSK) has been adopted. The modulation scheme of OCQPSK is disclosed in an article by JaeRyong Shim and SeungChan Bang: ‘Spectrally Efficient Modulation and Spreading Scheme for CDMA Systems’ in electronics letters, Nov. 12, 1998, vol. 34, No. 23, pp. 2210-2211.
As disclosed in the article, the mobile station carries out the orthogonal spread by employing a Hadamard sequence as a Walsh code in the modulation scheme of the OCQPSK. After the orthogonal spread, I and Q channels are spread by a Walsh rotator and a spreading code, e.g., a pseudo noise (PN) code, a Kasami code, a Gold code and so on.
Further, as for multiple channels, the mobile station carries out the orthogonal spread by employing different Hardamard sequences. After the orthogonal spread, the orthogonal spread channels are coupled to I and Q branches. Then, the orthogonal spread channels coupled to the I branch and the orthogonal spread channels coupled to the Q branch is separately summed. The I and Q branches are scrambled by the Walsh rotator and the scrambling code. However, there is a problem that the above-mentioned modulation scheme can not effectively reduce the PAPR in the mobile communication system.
SUMMARY OF THE INVENTION
It is, therefore, an object of the present invention to provide an apparatus and method for modulating a data message that is capable of improving a power efficiency of a mobile station by reducing a peak-to-average power ratio in a mobile communication system.
In accordance with an embodiment of an aspect of the present invention, there is provided an apparatus for converting source data to a channel-modulated signal having a plurality of pairs of in-phase (I) and quadrature-phase (Q) data in a mobile station, wherein the mobile station uses at least one channel, comprising: channel coding means for encoding the source data to generate at least one data part and a control part; code generating means for generating at least one spreading code to be allocated to the channel, wherein each spreading code is selected on the basis of a data rate of the data part and the control part and spreading codes are selected so that two consecutive pairs of the I and Q data are correspondent to two points located on same point or symmetrical with respect to a zero point on a phase domain; and spreading means for spreading the control part and the data part by using the spreading code, to thereby generate the channel-modulated signal.
In accordance with another embodiment of the aspect of the present invention, there is provided an apparatus for converting source data to a channel-modulated signal having a plurality of pairs of in-phase (I) and quadrature-phase (Q) data in a mobile station, wherein the mobile station uses N number of channels where N is a positive integer, comprising: channel coding means for encoding the source data to generate (N−1) number of data parts and a control part; code generating means for generating N number of spreading codes to be allocated to the channels, wherein each spreading code is selected on the basis of a data rate of each data part and the control part and the spreading codes are selected so that two consecutive pairs of the I and Q data are correspondent to two points located on same point or symmetrical with respect to a zero point on a phase domain; and spreading means for spreading the control part and the data parts by using the spreading codes, to thereby generate the channel-modulated signal.
In accordance with an embodiment of another aspect of the present invention, there is provided a mobile station for converting source data to a channel-modulated signal having a plurality of pairs of in-phase (I) and quadrature-phase (Q) data, wherein the mobile station uses N number of channels where N is a positive integer, comprising: channel coding means for encoding the source data to generate (N−1) number of data parts and a control part; code generating means for generating N number of spreading codes to be allocated to the first and the second channels, wherein each spreading code is selected on the basis of a data rate of each data part and the control part and the spreading codes are selected so that two consecutive pairs of the I and Q data are correspondent to two points located on same point or symmetrical with respect to a zero point on a phase domain; and spreading means for spreading the control part and the data parts by using the spreading codes, to thereby generate the channel-modulated signal.
In accordance with an embodiment of further another aspect of the present invention, there is provided a method for converting source data to a channel-modulated signal having a plurality of pairs of in-phase (I) and quadrature-phase (Q) data in a mobile station, wherein the mobile station uses at least one channel, comprising the steps of: a) encoding the source data to generate at least one data part and a control part; b) generating at least one spreading code to be allocated to the channel, wherein each spreading code is selected on the basis of a data rate of the data part and the control part and spreading codes are selected so that two consecutive pairs of the I and Q data are correspondent to two points located on same point or symmetrical with respect to a zero point on a phase domain; and c) spreading the control part and the data part by using the spreading code, to thereby generate the channel-modulated signal.
In accordance with another embodiment of further another aspect of the present invention, there is provided a method for converting source data to a channel-modulated signal having a plurality of pairs of in-phase (I) and quadrature-phase (Q) data in a mobile station, wherein the mobile station uses N number of channels where N is a positive integer, comprising: a) encoding the source data to generate (N−1) number of data parts and a control part; b) generating N number of spreading codes to be allocated to the channels, wherein each spreading code is selected on the basis of a data rate of each data part and the control part and the spreading codes are selected so that two consecutive pairs of the I and Q data are correspondent to two points located on same point or symmetrical with respect to a zero point on a phase domain; and c) spreading the control part and the data parts by using the spreading codes, to thereby generate the channel-modulated signal.



BRIEF DESCRIPTION OF THE DRAWINGS
The above and other objects and features of the instant invention will become apparent from the following description of preferred embodiments taken in conjunction with the accompanying drawings, in which:
FIG. 1 is a block diagram illustrating a mobile station to which the present invention is applied;
FIG. 2 is an exemplary view illustrating a tree structure of spreading codes applied to the present invention;
FIG. 3 is an exemplary block diagram depicting a modulator shown in FIG. 1 in accordance with the present invention;
FIG. 4 is a block diagram describing a spreading code generator shown in FIG. 3;
FIG. 5 is an exemplary diagram illustrating a case where a mobile station uses two channels;
FIG. 6 is an exemplary diagram depicting a case where multiple mobile stations share a common complex-valued scrambling code;
FIG. 7 is an exemplary diagram showing a case where a mobile station uses multiple channels;
FIG. 8 is a first exemplary view describing a desirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips;
FIG. 9 is a second exemplary view showing a desirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips;
FIG. 10 is a first exemplary view depicting an undesirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips;
FIGS. 11 and 12 are third exemplary views illustrating a desirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips;
FIGS. 13 and 14 are second exemplary views illustrating an undesirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips;
FIG. 15 is a graphical diagram describing the probability of peak power to average power; and
FIGS. 16 to 22 are flowcharts illustrating a method for modulating a data message in a mobile station in accordance with the present invention.



DETAILED DESCRIPTION OF THE INVENTION
Referring to FIG. 1, there is shown a block diagram illustrating a mobile station to which the present invention is applied. As shown, the mobile station includes a user interface 20, a central processing unit (CPU) 180, a modem 12, a source codec 30, a frequency converter 80, a user identification module 50 and an antenna 70. The modem 12 includes a channel codec 13, a modulator 100 and a demodulator 120. The channel codec 13 includes an encoder 110 and a decoder 127.
The user interface 20 includes a display, a keypad and so on. The user interface 20, coupled to the CPU 180, generates a data message in response to a user input from a user. The user interface 20 sends the data message to the CPU 180.
The user identification module 50, coupled to the CPU 180, sends user identification information as a data message to the CPU 180. The source codec 30, coupled to the CPU 180 and the modem 12, encodes source data, e.g., video, voice and so on, to generate the encoded source data as a data message. Then, the source codec 30 sends the encoded source data as the data message to the CPU 180 or the modem 12. Further, the source codec 30 decodes the data message from the CPU 180 or the modem 12 to generate the source data, e.g., video, voice and so on. Then, the source codec 30 sends the source data to the CPU 180.
The encoder 110, contained in the channel codec 13, encodes the data message from the CPU 180 or the source codec 30 to generate one or more data parts. Then, the encoder 110 generates a control part. The encoder 110 sends the one or more data parts to the modulator 100. The modulator 100 modulates the one or more data parts and the control part to generate I and Q signals as baseband signals. The frequency converter 80 converts the baseband signals to intermediate frequency (IF) signals in response to a conversion control signal from the CPU 180. After converting the baseband signals to the IF signals, the frequency converter 80 converts the IF signals to radio frequency (RF) signals. The frequency converter 80 sends the RF signals to the antenna 70. Further, the frequency converter 80 controls a gain of the RF signals. The antenna 70 sends the RF signals to a base station (not shown).
The antenna 70 sends the RF signals from the base station to the frequency converter 80. The frequency converter 80 converts the RF signals to the IF signals. After converting the RF signals to the IF signals, the frequency converter 80 converts the IF signals to the baseband signals as the I and Q signals. The demodulator 90 demodulates the I and Q signals to generate the one or more data parts and the control part. The decoder 127, contained in the channel codec 13, decodes the one or more data parts and the control part to generate the data message. The decoder 127 sends the data message to the CPU 180 or the source codec 30.
Referring to FIG. 2, there is shown an exemplary view illustrating a tree structure of spreading codes as orthogonal variable spreading factor (OVSF) codes applied to the present invention. As shown, a spreading code is determined by a spreading factor (SF) and a code number in a code tree, wherein the spreading code is represented by CSF, code number. CSF, code number is made up of a real-valued sequence. The SF is 2N where N is 0 to 8, and the code number is 0 to 2N−1.




  
    
      
        
          [
          
            
              
                
                  C
                  
                    2
                    ,
                    0
                  
                
              
            
            
              
                
                  C
                  
                    2
                    ,
                    1
                  
                
              
            
          
          ]
        
        =
        
          
            [
            
              
                
                  
                    C
                    
                      1
                      ,
                      0
                    
                  
                
                
                  
                    C
                    
                      1
                      ,
                      0
                    
                  
                
              
              
                
                  
                    C
                    
                      1
                      ,
                      0
                    
                  
                
                
                  
                    -
                    
                      C
                      
                        1
                        ,
                        0
                      
                    
                  
                
              
            
            ]
          
          =
          
            
              
                [
                
                  
                    
                      1
                    
                    
                      1
                    
                  
                  
                    
                      1
                    
                    
                      
                        -
                        1
                      
                    
                  
                
                ]
              
              ⁢
              
                
              
              ⁢
              where
              ⁢
              
                
              
              ⁢
              
                C
                
                  1
                  ,
                  0
                
              
            
            =
            0
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          1
          )
        
      
    
  
  
    
      
        
          [
          
            
              
                
                  C
                  
                    
                      2
                      
                        (
                        
                          N
                          +
                          1
                        
                        )
                      
                    
                    ,
                    0
                  
                
              
            
            
              
                
                  C
                  
                    
                      2
                      
                        (
                        
                          N
                          +
                          1
                        
                        )
                      
                    
                    ,
                    1
                  
                
              
            
            
              
                
                  C
                  
                    
                      2
                      
                        (
                        
                          N
                          +
                          1
                        
                        )
                      
                    
                    ,
                    2
                  
                
              
            
            
              
                
                  C
                  
                    
                      2
                      
                        (
                        
                          N
                          +
                          1
                        
                        )
                      
                    
                    ,
                    3
                  
                
              
            
            
              
                ⋮
              
            
            
              
                
                  C
                  
                    
                      2
                      
                        (
                        
                          N
                          +
                          1
                        
                        )
                      
                    
                    ,
                    
                      
                        2
                        
                          (
                          
                            N
                            +
                            1
                          
                          )
                        
                      
                      -
                      2
                    
                  
                
              
            
            
              
                
                  C
                  
                    
                      2
                      
                        (
                        
                          N
                          +
                          1
                        
                        )
                      
                    
                    ,
                    
                      
                        2
                        
                          (
                          
                            N
                            +
                            1
                          
                          )
                        
                      
                      -
                      1
                    
                  
                
              
            
          
          ]
        
        =
        
          
            [
            
              
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      0
                    
                  
                
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      0
                    
                  
                
              
              
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      0
                    
                  
                
                
                  
                    -
                    
                      C
                      
                        
                          2
                          N
                        
                        ,
                        0
                      
                    
                  
                
              
              
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      1
                    
                  
                
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      1
                    
                  
                
              
              
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      1
                    
                  
                
                
                  
                    -
                    
                      C
                      
                        
                          2
                          N
                        
                        ,
                        1
                      
                    
                  
                
              
              
                
                  ⋮
                
                
                  ⋮
                
              
              
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      
                        
                          2
                          N
                        
                        -
                        1
                      
                    
                  
                
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      
                        
                          2
                          N
                        
                        -
                        1
                      
                    
                  
                
              
              
                
                  
                    C
                    
                      
                        2
                        N
                      
                      ,
                      
                        
                          2
                          N
                        
                        -
                        1
                      
                    
                  
                
                
                  
                    -
                    
                      C
                      
                        
                          2
                          N
                        
                        ,
                        
                          
                            2
                            N
                          
                          -
                          1
                        
                      
                    
                  
                
              
            
            ]
          
          ⁢
          
            
          
          ⁢
          where
          ⁢
          
            
          
          ⁢
          N
          ⁢
          
            
          
          ⁢
          is
          ⁢
          
            
          
          ⁢
          1
          ⁢
          
            
          
          ⁢
          to
          ⁢
          
            
          
          ⁢
          7
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          2
          )
        
      
    
  




For example, a spreading code having an SF of 8 and a code number of 1 is represented by C8, 1={1, 1, 1, 1, −1, −1, −1, −1} according to Eqs. (1) and (2). In case where the SF is more than 2, the spreading codes are grouped by two groups, including a first group and a second group according to a code number sequence. The first group includes the spreading codes with the SF and code numbers of 0 to SF/2−1 and the second group includes the spreading codes with the SF and code numbers of SF/2 to SF−1. Therefore, the number of spreading codes contained in the first group is the same as that of spreading codes contained in the second group.
Each spreading code contained in the first or second group is made up of real values. Each spreading code contained in the first or second group can be employed in an OCQPSK modulation scheme. It is preferred that a spreading code, contained in the first group, is selected for the OCQPSK modulation scheme. However, where a spreading code, contained in the second group, is multiplied by another spreading code with a minimum code number, i.e., SF/2, contained in the second group, the multiplication of the spreading codes, contained in the second group, becomes the same as a spreading code contained in the first group. Accordingly, the multiplication of the spreading codes contained in the second group is represented by a spreading code of the first group. As a result, all the spreading codes, i.e., OVSF codes, of the first and second groups are useful for reducing the peak-to-average power ratio (PAPR) of the mobile station.
Referring to FIG. 3, there is shown a block diagram depicting a modulator shown in FIG. 1 in accordance with the present invention. The mobile communication system includes a base station and a mobile station employing a plurality of channels, wherein the mobile station includes the modulator. The channels include a control channel and one or more data channels.
The one or more data channels include a physical random access channel (PRACH), a physical common packet channel (PCPCH) and dedicated physical channel (DPCH). In a PRACH or PCPCH application, a control channel and only one data channel, i.e., PRACH or PCPCH, are coupled between the encoder 110 and the spreader 130. The DPCH includes dedicated physical data channels (DPDCHs). In a DPCH application, a dedicated physical control channel (DPCCH) as a control channel and up to six data channels, i.e., DPDCH 1 to DPDCH 5 are coupled between the encoder 110 and the spreader 130. As shown, a modulator 100 includes an encoder 110, a code generator 120, a spreader 130, a scrambler 140, a filter 150, a gain adjuster 160 and an adder 170.
The encoder 110 encodes the data message to be transmitted to the base station to generate one or more data parts. The encoder 110 generates a control part having a control information. The encoder 110 evaluates an SF based on a data rate of the one or more data parts.
The CPU 180, coupled to the encoder 110, receives the SF related to the one or more data parts from the encoder 110. The CPU 180 produces one or more code numbers related to the one or more data parts and an SF and a code number related to the control part.
The code generator 120 includes a spreading code generator 121, a signature generator 122 and a scrambling code generator 123. The code generator 120, coupled to the CPU 180, generates spreading codes, i.e., Cd1 to Cdn and Cc, a signature S and a complex-valued scrambling code. The spreading code generator 121, coupled to the CPU 180 and the spreader 130, generates the spreading codes in response to the SF and the one or more code numbers related to the one or more data parts and an SF and a code number related to the control part from the CPU 180. The spreading code generator 121 sends the spreading codes to the spreader 130.
The signature generator 122, coupled to the CPU 180 and the spreading code generator 121, generates the signature S to send the signature S to the spreading code generator 121. The scrambling code generator 123 generates the complex-valued scrambling code to send the complex-valued scrambling code to the scrambler 140.
The spreader 130 spreads the control part and the one or more data parts from the encoder 110 by the spreading codes from the code generator 120.
The scrambler 140 scrambles the complex-valued scrambling code, the one or more data parts and the control part spread by the spreader 130, thereby generating scrambled signals. The scrambler 140 includes a Walsh rotator, which is typically employed in the OCQPSK modulation scheme. The Walsh rotator rotates the one or more data parts and the control part spread by the spreader 130.
The filter 150, i.e., a root raised cosine (PRC) filter, pulse-shapes the scrambled signals to generate pulse-shaped signals. The gain adjuster 160 multiplies each of the pulse-shaped signals by the gain of each channel, thereby generating gain-adjusted signals. The adder 170 sums the gain-adjusted signals related to an I branch or the gain-adjusted signals related to a Q branch, to thereby generate a channel-modulated signal having a plurality of pairs of I and Q data in the mobile station.
Referring to FIG. 4, there is shown a block diagram describing a spreading code generator shown in FIG. 3. As shown, the spreading code generator includes a storage device 210, an 8-bit counter 220, a plurality of logical operators 231 and 233 and a plurality of multiplexers 232 and 234.
The storage device 210 includes one or more registers 211 related to the one or more data parts and a register 212 related to the control part. The one or more registers 211 stores an SF and code numbers related to the one or more data parts sent from the CPU 180 shown in FIG. 3. The register 212 stores an SF and a code number related to the control part sent from the CPU 180.
The 8-bit counter 220 consecutively produces a count value of B7B6B5B4B3B2B1B0 as 8-bit count value in synchronization with a clock signal CHIP_CLK issued from an external circuit, wherein B0 to B7 are made up of a binary value of 0 or 1, respectively.
The one or more logical operators 231 carry out one or more logical operations with the SF and the code numbers related to the one or more data parts stored in the one or more register 211, thereby generating the spreading codes related to the one or more data parts. A code number is represented by I7I6I5I4I3I2I1I0, wherein I0 to I7 are the binary value of 0 or 1, respectively.
The logical operator 233 carries out a logical operation with the SF and the code number of I7I6I5I4I3I2I1I0 related to the control part stored in the register 212, thereby generating a spreading code related to the control part.




  
    
      
        
          
            ∏
            
              i
              =
              0
            
            
              
                N
                -
                2
              
              ⁢
              
                
              
            
          
          ⁢
          
            
              
                I
                i
                
                
                  
                  ⊕
              
              ·
              
                B
                
                  N
                  -
                  1
                  -
                  i
                
              
            
            ⁢
            
              
            
            ⁢
            where
            ⁢
            
              
            
            ⁢
            2
          
        
        ≤
        N
        ≤
        8
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          3
          )
        
      
    
  




where “·” denotes a multiplication in modulo 2 and Π⊕ denotes an exclusive OR operation. Each logical operator 231 or 233 carries out a logical operation according to Eq. (3) where SF=2N.
If the SF is 256, each logical operator 231 or 233 carries out a logical operation of B7·I0⊕B6·I1⊕B5·I2⊕B4·I3⊕B3·I4⊕B2·I5⊕B1·I6⊕B0·I7 
If the SF is 128, each logical operator 231 or 233 carries out a logical operation of B6·I0⊕B5·I1⊕B4·I2⊕B3·I3⊕B2·I4⊕B1·I5⊕B0·I6.
If the SF is 64, each logical operator 231 or 233 carries out a logical operation of B5·I0⊕B4·I1⊕B3·I2⊕B2·I3⊕B1·I4⊕B0·I5.
If the SF is 32, each logical operator 231 or 233 carries out a logical operation of B4·I0⊕B3·I1⊕B2·I2⊕B1·I3⊕B0·I4.
If the SF is 16, each logical operator 231 or 233 carries out a logical operation of B3·I0⊕B2·I1⊕B1·I2⊕B0·I3.
If the SF is 8, each logical operator 231 or 233 carries out a logical operation of B2·I0⊕B1·I1⊕B0·I2.
If the SF is 4, each logical operator 231 or 233 carries out a logical operation of B1·I0⊕B0·I1.
The one or more multiplexers 232 selectively output the one or more spreading codes from the one or more logical operators 231 in response to one or more select signals as the SF related to the one or more data parts.
The multiplexer 234 selectively outputs the spreading code from the logical operator 233 in response to a select signal as the SF related to the control part.
Referring to FIG. 5, there is shown an exemplary diagram illustrating a case where a mobile station uses two channels.
As shown, when the mobile station uses the two channels and SF=2N where N=2 to 8, the spreading code generator 121 generates a spreading code of CSF, SF/4 to be allocated to the DPDCH or the PCPCH as a data channel. Further, the spreading code generator 121 generates a spreading code of C256, 0 to be allocated to the DPCCH or the control channel. Then, the spreader 130 spreads the DPDCH or the PCPCH by the spreading code of CSF, SF/4. Further, The spreader 130 spreads the control channel by the spreading code of C256, 0. At this time, the scrambling code generator 123 generates a complex-valued scrambling code assigned to the mobile station. Further, the complex-valued scrambling code can be temporarily reserved in the mobile station.
Referring to FIG. 6, there is shown an exemplary diagram depicting a case where multiple mobile stations share a common complex-valued scrambling code in the PRACH application.
As shown, where the multiple mobile stations share a common complex-valued scrambling code and SF=2N where N=5 to 8 and S=1 to 16, the spreading code generator 121 generates a spreading code of CSF, SF(S−1)/16 to be allocated to the PRACH. Further, the spreading code generator 121 generates a spreading code of C256, 16(S−1)+15 to be allocated to the control channel.
Then, the spreader 130 spreads the PRACH by the spreading code of CSF, SF(S−1)/16. Also, the spreader 130 spreads the control channel by the spreading code of C256, 16(S−1)+15. At this time, the scrambling code generator 123 generates a common complex-valued scrambling code.
Referring to FIG. 7, there is shown an exemplary diagram showing a case where a mobile station uses multiple channels. As shown, where the mobile station uses one control channel and two data channels and the SF related to the two data channels is 4, the spreading code generator 121 generates a spreading code of C256, 0 to be allocated to the DPCCH. Further, the spreading code generator 121 generates a spreading code of C4, 1 allocated to the DPDCH 1. Furthermore, the spreading code generator 121 generates a spreading code of C4, 1 allocated to the DPDCH 2.
Then, the spreader 130 spreads the DPDCH 1 by the spreading code of C4, 1. Further, the spreader 130 spreads the DPDCH 2 by the spreading code of C4, 1. Furthermore, the spreader 130 spreads the DPCCH by the spreading code of C256, 0. At this time, the scrambling code generator 123 generates a complex-valued scrambling codes assigned to the mobile station.
As shown, where the mobile station uses one control channel and three data channels and the SF related to the three data channels is 4, the spreading code generator 121 further generates a spreading code of C4, 3 to be allocated to the DPDCH 3. Then, the spreader 130 further spreads the DPDCH 3 by the spreading code of C4, 3.
As shown, where the mobile station uses one control channel and four data channels and the SF related to the four data channels is 4, the spreading code generator 121 further generates a spreading code of C4, 3 to be allocated to the DPDCH 4. Then, the spreader 130 further spreads the DPDCH 4 by the spreading code of C4, 3.
As shown, where the mobile station uses one control channel and five data channels and the SF related to the five data channels is 4, the spreading code generator 121 further generates a spreading code of C4, 2 to be allocated to the DPDCH 5. Then, the spreader 130 further spreads the DPDCH 5 by the spreading code of C4, 2.
As shown, where the two mobile station uses one control channel and six data channels and the SF related to the six data channels is 4, the spreading code generator 121 further generates a spreading code of C4, 2 to be allocated to the DPDCH 6. Then, the spreader 130 further spreads the DPDCH 6 by the spreading code of C4, 2.
Referring to FIG. 8, there is shown a first exemplary view describing a desirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips.
As shown, in case where an SF is 4 and a code number is 0, a spreading code of C4, 0 is represented by {1, 1, 1, 1}. Further, in case where the SF is 4 and a code number is 1, a spreading code of C4, 1 is represented by {1, 1, −1, −1}.
Assume that two channels are spread by the spreading code of C4, 0={1, 1, 1, 1} and the spreading code of C4, 1={1, 1, −1, −1}, respectively. At this time, real values contained in the spreading code of C4, 0={1, 1, 1, 1} are represented by points on a real axis of a phase domain. Further, real values contained in the spreading code of C4, 1={1, 1, −1, −1} are represented by points on an imaginary axis of the phase domain.
At a first or second chip, a point {1, 1}, i.e., a point {circle around (1)} or {circle around (2)}, is designated on the phase domain by first or second real values contained in the spreading codes of C4, 0 and C4, 1. At a third or fourth chip, a point {1, −1}, i.e., a point {circle around (3)} or {circle around (4)}, is designated on the phase domain by third or fourth real values contained in the spreading codes of C4, 0 and C4, 1. The points {circle around (1)} and {circle around (2)} are positioned on the same point as each other. Also, the points {circle around (3)} and {circle around (4)} are positioned on the same point as each other. Where the Walsh rotator rotates the points at chips, the points are rotated by a predetermined phase, respectively.
For example, where the Walsh rotator rotates the point {circle around (1)} or {circle around (3)} at an odd chip, the point {circle around (1)} or {circle around (3)} is rotated to a clockwise direction by a phase of 45°. Further, where the Walsh rotator rotates the point {circle around (2)} or {circle around (4)} at an even chip, the point {circle around (2)} or {circle around (4)} is rotated to a counterclockwise direction by the phase of 45°. After rotating the points {circle around (1)} and {circle around (2)} or the points {circle around (3)} and {circle around (4)} at the odd and even chips as two consecutive chips, a phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ or the rotated points {circle around (3)}′ and {circle around (4)}′ becomes 90°. Where the phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ or the rotated points {circle around (3)}′ and {circle around (4)}′ becomes 90°, a peak-to-average power ratio (PAPR) of a mobile station can be reduced.
For another example, where the Walsh rotator rotates the point {circle around (1)} or {circle around (3)} at an odd chip, the point {circle around (1)} or {circle around (3)} is rotated to the counterclockwise direction by the phase of 45°. Further, where the Walsh rotator rotates the point {circle around (2)} or {circle around (4)} at an even chip, the point {circle around (2)} or {circle around (4)} is rotated to the clockwise direction by the phase of 45°. After rotating the points {circle around (1)} and {circle around (2)} or the points {circle around (3)} and {circle around (4)} at the odd and even chips as two consecutive chips, a phase difference between the rotated points {circle around (1)}′′ and {circle around (2)}′′ or the rotated points {circle around (3)}′′ and {circle around (4)}′′ becomes 90°. Where the phase difference between the rotated points {circle around (1)}′′ and {circle around (2)}′′ or the rotated points {circle around (3)}′′ and {circle around (4)}′′ becomes 90°, the peak-to-average power ratio of the mobile station can be reduced.
Referring to FIG. 9, there is shown a second exemplary view showing a desirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips.
First, assume that two channels are spread by a spreading code of C4, 2={1, −1, 1, −1} and a spreading code of C4, 3={1, −1, −1, 1}, respectively.
At a first chip, a point {1, 1}, i.e., a point {circle around (1)}, is designated on the phase domain by first real values contained in the spreading codes of C4, 2 and C4, 3. At a second chip, a point {−1, −1}, i.e., a point {circle around (2)}, is designated on the phase domain by second real values contained in the spreading codes of C4, 2 and C4, 3. The points {circle around (1)} and {circle around (2)} are symmetrical with respect to a zero point as a center point on the phase domain.
At a third chip, a point {1, −1}, i.e., a point {circle around (3)}, is designated on the phase domain by third real values contained in the spreading codes of C4, 2 and C4, 3. At a fourth chip, a point {−1, 1}, i.e., a point {circle around (4)}, is designated on the phase domain by fourth real values contained in the spreading codes of C4, 2 and C4, 3. The points {circle around (3)} and {circle around (4)} are symmetrical with respect to the zero point on the phase domain. Where the Walsh rotator rotates the points at chips, the points are rotated by a predetermined phase, respectively.
For example, where the Walsh rotator rotates the point {circle around (1)} or {circle around (3)} at an odd chip, the point {circle around (1)} or {circle around (3)} is rotated to a clockwise direction by a phase of 45°. Further, where the Walsh rotator rotates the point {circle around (2)} or {circle around (4)} at an even chip, the point {circle around (2)} or {circle around (4)} is rotated to a counterclockwise direction by the phase of 45°. After rotating the points {circle around (1)} and {circle around (2)} or the points {circle around (3)} and {circle around (4)} at the odd and even chips as two consecutive chips, a phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ or the rotated points {circle around (3)}′ and {circle around (4)}′ becomes 90°. Where the phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ or the rotated points {circle around (3)}′ and {circle around (4)}′ becomes 90°, a peak-to-average power ratio of a mobile station can be reduced.
For another example, where the Walsh rotator rotates the point {circle around (1)} or {circle around (3)} at an odd chip, the point {circle around (1)} or {circle around (3)} is rotated to the counterclockwise direction by the phase of 45°. Further, where the Walsh rotator rotates the point {circle around (2)} or {circle around (4)} at an even chip, the point {circle around (2)} or {circle around (4)} is rotated to the clockwise direction by the phase of 45°. After rotating the points {circle around (1)} and {circle around (2)} or the points {circle around (3)} and {circle around (4)} at the odd and even chips as two consecutive chips, a phase difference between the rotated points {circle around (1)}′′ and {circle around (2)}′′ or the rotated points {circle around (3)}′′ and {circle around (4)}′′ becomes 90°. Where the phase difference between the rotated points {circle around (1)}′′ and {circle around (2)}′′ or the rotated points {circle around (3)}′′ and {circle around (4)}′′ becomes 90°, the peak-to-average power ratio of the mobile station can be reduced.
Referring to FIG. 10, there is shown a first exemplary view depicting an undesirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips.
First, assume that two channels are spread by the spreading code of C4, 0={1, 1, 1, 1} and the spreading code of C4, 2={1, −1, 1, −1}, respectively.
At a first chip, a point {1, 1}, i.e., a point {circle around (1)}, is designated on the phase domain by first real values contained in the spreading codes of C4, 0 and C4, 2. At a second chip, a point {1, −1}, i.e., a point {circle around (2)}, is designated on the phase domain by second real values contained in the spreading codes of C4, 0 and C4, 2. The points {circle around (1)} and {circle around (2)} are symmetrical with respect to the real axis on the phase domain.
At a third chip, a point {1, 1}, i.e., a point {circle around (3)}, is designated on the phase domain by third real values contained in the spreading codes of C4, 0 and C4, 2. At a fourth chip, a point {1, −1}, i.e., a point {circle around (4)}, is designated on the phase domain by fourth real values contained in the spreading codes of C4, 0 and C4, 2. The points {circle around (3)} and {circle around (4)} are symmetrical with respect to the real axis on the phase domain. Where the Walsh rotator rotates the points at chips, the points are rotated by a predetermined phase, respectively.
For example, where the Walsh rotator rotates the point {circle around (1)} or {circle around (3)} at an odd chip, the point {circle around (1)} or {circle around (3)} is rotated to a counterclockwise direction by a phase of 45°. Further, where the Walsh rotator rotates the point {circle around (2)} or {circle around (4)} at an even chip, the point {circle around (2)} or {circle around (4)} is rotated to a clockwise direction by the phase of 45°. After rotating the points {circle around (1)} and {circle around (2)} or the points {circle around (3)} and {circle around (4)} at the odd and even chips as two consecutive chips, a phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ or the rotated points {circle around (3)}′ and {circle around (4)}′ becomes zero. Where the phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ or the rotated points {circle around (3)}′ and {circle around (4)}′ does not become 90°, a peak-to-average power ratio of a mobile station can not be reduced.
Referring to FIGS. 11 and 12, there are shown third exemplary views illustrating a desirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips.
First, assume that data of 1 allocated to a first channel is spread by a spreading code of C4, 1={1, 1, −1, −1}. Further, assume that data of −1 allocated to a second channel is spread by a spreading code of C4, 1={1, 1, −1, −1}. Furthermore, assume that data of 1 allocated to a third channel is spread by a spreading code of C4, 0={1, 1, 1, 1}.
In terms of the first channel, the spreader 130 shown in FIG. 3 multiplies the data of 1 by the spreading code of C4, 1={1, 1, −1, −1}, thereby generating a code of {1, 1, −1, −1}. Further, in terms of the second channel, the spreader 130 multiplies the data of −1 by the spreading code of C4, 1={1, 1, −1, −1}, thereby generating a code of {−1, −1, 1, 1}. Furthermore, in terms of the third channel, the spreader 130 multiplies the data of 1 by the spreading code of C4, 0={1, 1, 1, 1}, thereby generating a code of {1, 1, 1, 1}.
Where the spreader 130 includes an adder 131 shown in FIG. 12, the adder 131 generates a code of {0, 0, 2, 2} by adding the code of {−1, −1, 1, 1} to the code of {1, 1, 1, 1}.










TABLE 1









Chip













1
2
3
4

















First Channel
1
1
−1
−1



Second Channel
−1
−1
1
1



Third Channel
1
1
1
1



Second channel +
0
0
2
2



Third channel










Table 1 represents the spreading codes allocated to three channels and a sum of two channels depending upon chips. At a first or second chip, a point {1, 0}, i,e., a point {circle around (1)} or {circle around (2)}, is designated on the phase domain by first or second real values contained in the code of {1, 1, −1, −1} and the code of {0, 0, 2, 2}. At a third or fourth chip, a point {−1, 2}, i.e., a point {circle around (3)} or {circle around (4)}, is designated on the phase domain by third or fourth real values contained in the code of {1, 1, −1, −1} and the code of {0, 0, 2, 2}. The points {circle around (1)} and {circle around (2)} are positioned on the same point as each other. Also, the points {circle around (3)} and {circle around (4)} are positioned on the same point as each other. Where the Walsh rotator rotates the points at chips, the points are rotated by a predetermined phase, respectively.
For example, where the Walsh rotator rotates the point {circle around (1)} or {circle around (3)} at an odd chip, the point {circle around (1)} or {circle around (3)} is rotated to a clockwise direction by a phase of 45°. Further, where the Walsh rotator rotates the point {circle around (2)} or {circle around (4)} at an even chip, the point {circle around (2)} or {circle around (4)} is rotated to a counterclockwise direction by the phase of 45°. After rotating the points {circle around (1)} and {circle around (2)} or the points {circle around (3)} and {circle around (4)} at the odd and even chips as two consecutive chips, a phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ or the rotated points {circle around (3)}′ and {circle around (4)}′ becomes 90°. Where the phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ or the rotated points {circle around (3)}′ and {circle around (4)}′ becomes 90°, a peak-to-average power ratio of a mobile station can be reduced.
Referring to FIGS. 13 and 14, there are shown second exemplary views illustrating an undesirable phase difference between rotated points on a phase domain where a Walsh rotator rotates points at consecutive chips.
First, assume that data of 1 allocated to a first channel is spread by a spreading code of C4, 1={1, 1, −1, −1}. Further, assume that data of −1 allocated to a second channel is spread by a spreading code of C4, 2={1, −1, 1, −1}. Furthermore, assume that data of 1 allocated to a third channel is spread by a spreading code of C4, 0={1, 1, 1, 1}.
In terms of the first channel, the spreader 130 shown in FIG. 2 multiplies the data of 1 with the spreading code of C4, 1={1, 1, −1, −1}, thereby generating a code of {1, 1, −1, −1}. Further, in terms of the second channel, the spreader 130 multiplies the data of −1 by the spreading code of C4,2={1, −1, 1, −1}, thereby generating a code of {−1, 1, −1, 1}. Furthermore, in terms of the third channel, the spreader 130 multiplies the data of 1 by the spreading code of C4, 0={1, 1, 1, 1}, thereby generating a code of {1, 1, 1, 1}.
Where the spreader 130 includes an adder 133 shown in FIG. 14, the adder 133 generates a code of {0, 2, 0, 2} by adding the code of {−1, 1, −1, 1} to the code of {1, 1, 1, 1}.










TABLE 2









Chip













1
2
3
4

















First Channel
1
1
−1
−1



Second Channel
−1
1
−1
1



Third Channel
1
1
1
1



Second channel +
0
2
0
2



third channel










Table 2 represents the spreading codes allocated to three channels and a sum of two channels depending upon chips. At a first chip, a point {1, 0}, i.e., a point {circle around (1)}, is designated on the phase domain by first real values contained in the code of {1, 1, −1, −1} and the code of {0, 2, 0, 2}. At a second chip, a point {1, 2}, i.e., a point {circle around (2)}, is designated on the phase domain by second real values contained in the code of {1, 1, −1, −1} and the code of {0, 2, 0, 2}. At a third chip, a point {−1, 0}, i.e., a point {circle around (3)}, is designated on the phase domain by third real values contained in the code of {1, 1, −1, −1} and the code of {0, 2, 0, 2}. At a fourth chip, a point {−1, 2}, i.e., a point {circle around (4)}, is designated on the phase domain by third real values contained in the code of {1, 1, −1, −1} and the code of {0, 2, 0, 2}.
The points {circle around (1)} and {circle around (2)} or the points {circle around (3)} and {circle around (4)} are positioned on different points from each other. Where the Walsh rotator rotates the points at chips, the points are rotated by a predetermined phase, respectively.
For example, where the Walsh rotator rotates the point {circle around (1)} or {circle around (3)} at an odd chip, the point {circle around (1)} or {circle around (3)} is rotated to a clockwise direction by a phase of 45°. Further, where the Walsh rotator rotates the point {circle around (2)} or {circle around (4)} at an even chip, the point {circle around (2)} or {circle around (4)} is rotated to a counterclockwise direction by the phase of 45°. After rotating the points {circle around (3)} and {circle around (4)} at the odd and even chips as two consecutive chips, a phase difference between the rotated points {circle around (3)}′ and {circle around (4)}′ does not become 90°. Where the phase difference between the rotated points {circle around (3)}′ and {circle around (4)}′ does not become 90°, a peak-to-average power ratio of a mobile station can increase.
Further, after rotating the points {circle around (1)} and {circle around (2)} at the odd and even chips as two consecutive chips, a phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ does not become 90°. Where the phase difference between the rotated points {circle around (1)}′ and {circle around (2)}′ does not become 90°, the peak-to-average power ratio of a mobile station can increase.
Referring to FIG. 15, there is shown an exemplary graphical diagram describing the probability of peak to average power.
When a mobile station employs two channels and spreading codes of C4, 0={1, 1, 1, 1} and C4, 1={1, 1, −1, −1} allocated to the two channels, a curve G1 is shown in the graphical diagram. At this time, the probability of the peak power exceeding the average power by 2.5 dB is approximately 1%.
Further, when a mobile station employs two channels and spreading codes of C4, 0={1, 1, 1, 1} and C4, 2={1, −1, 1, −1} allocated to the two channels, a curve G2 is shown in the graphical diagram. At this time, the probability of the peak power exceeding the average power by 2.5 dB is approximately 7%.
Referring to FIG. 16, there is shown a flowchart depicting a method for modulating a data message in a mobile station in accordance with the present invention.
As shown, at step S1302, an encoder receives a data message to be transmitted to a base station.
At step S1304, the encoder encodes the data message having one or more data parts and generates a control part.
At step S1306, the encoder evaluates an SF related to the one or more data parts to send the SF from an encoder to a CPU.
At step S1308, the CPU produces information necessary to generate spreading codes to be allocated to channels.
At step S1310, a code generator generates the spreading codes.
At step S1312, a spreader spreads the control part and the one or more data parts by the spreading codes.
At step S1314, a scrambler scrambles the control part and the one or more data parts spread and a complex-valued scrambling code, to thereby generate a channel-modulated signal having a plurality of pairs of in-phase (I) and quadrature-phase (Q) data in the mobile station.
Referring to FIGS. 17 to 19, there are flowcharts illustrative of a procedure for producing information necessary to generate spreading codes to be allocated to channels.
As shown, at step S1402, the CPU receives the SF related to the one or more data parts from the encoder.
At step S1404, the CPU determines a type of an event.
At step S1408, if the event is a case where a mobile station uses two channels, the CPU produces an SF of 256 and a code number of 0 related to the control part.
At step S1410, the CPU produces a code number of SF/4 related to the one data part where SF=2N and N=2 to 8.
At step S1412, the CPU sends the code numbers and the SFs related to the data and control parts to the code generator.
On the other hand, at step S1414, if the event is a case where multiple mobile stations share a common complex-valued scrambling code, the CPU produces a signature S.
At step S1416, the CPU produces the SF of 256 and a code number of 16(S−1)+15 related to the control part where S=1 to 16.
At step S1418, the CPU produces a code number of SF(S−1)/16 related to the one data part where SF=2N, N=2 to 8 and S=1 to 16.
At step S1420, the CPU sends the code numbers and the SFs related to the data and control parts to the code generator.
On the other hand, at step S1424, if the event is a case where a mobile station uses multiple channels, the CPU produces a code number of 0 and the SF of 256 related to the control part allocated to the control channel.
At step S1502, the CPU determines the number of data channels.
At step S1504, if the number of data channels is two data channels, the CPU produces a code number of 1 and an SF of 4 related to a first data part allocated to a first data channel coupled to an I branch.
At step S1506, the CPU produces a code number of 1 and the SF of 4 related to a second data part allocated to a second data channel.
On the other hand, at step S1508, if the number of data channels is three data channels, the CPU produces the code number of 1 and the SF of 4 related to the first data part allocated to the first data channel.
At step S1510, the CPU produces the code number of 1 and the SF of 4 related to the second data part allocated to the second data channel.
At step S1512, the CPU produces a code number of 3 and the SF of 4 related to the third data part allocated to the third data channel.
On the other hand, at step S1514, if the number of data channels is four data channels, the CPU produces the code number of 1 and the SF of 4 related to the first data part allocated to the first data channel.
At step S1516, the CPU produces the code number of 1 and the SF of 4 related to the second data part allocated to the second data channel.
At step S1518, the CPU produces the code number of 3 and the SF of 4 related to the third data part allocated to the third data channel.
At step S1520, the CPU produces the code number of 3 and the SF of 4 related to a fourth data part allocated to a fourth data channel.
On the other hand, at step S1522, if the number of data channels is five data channels, the CPU produces the code number of 1 and the SF of 4 related to the first data part allocated to the first data channel.
At step S1524, the CPU produces the code number of 1 and the SF of 4 related to the second data part allocated to the second data channel.
At step S1526, the CPU produces the code number of 3 and the SF of 4 related to the third data part allocated to the third data channel.
At step S1528, the CPU produces the code number of 3 and the SF of 4 related to the fourth data part allocated to the fourth data channel.
At step S1530, the CPU produces the code number of 2 and the SF of 4 related to a fifth data part allocated to a fifth data channel.
On the other hand, at step S1532, if the number of data channels is six data channels, the CPU produces the code number of 1 and the SF of 4 related to the first data part allocated to the first data channel.
At step S1534, the CPU produces the code number of 1 and the SF of 4 related to the second data part allocated to the second data channel.
At step S1536, the CPU produces the code number of 3 and the SF of 4 related to the third data part allocated to the third data channel.
At step S1538, the CPU produces the code number of 3 and the SF of 4 related to the fourth data part allocated to the fourth data channel.
At step S1540, the CPU produces the code number of 2 and the SF of 4 related to the fifth data part allocated to the fifth data channel.
At step S1542, the CPU produces the code number of 2 and the SF of 4 related to a sixth data part allocated to a sixth data channel.
At step S1521, the CPU transmits the code numbers and the SFs related to the data and control parts to the code generator.
Referring to FIG. 20, there is shown a flowchart showing a procedure of generating the spreading codes.
As shown, at step S1702, registers receive the code numbers and the SFs from the CPU.
At step S1704, registers store the code numbers and the SFs.
At step S1706, logical operators carry out logical operations in response to an 8-bit count value, thereby generating the spreading codes.
At step S1708, multiplexers select the spreading codes in response to the SFs as select signals.
Referring to FIGS. 21 and 22, there are shown flowcharts describing a procedure of carrying out the logical operations in response to the 8-bit count value, thereby generating the spreading codes.
As shown, at step S1802, each register receives a code number of I7I6I5I4I3I2I1I0 and a predetermined SF.
At step S1804, each register receives an 8-bit count value of B7B6B5B4B3B2B1B0 from an 8-bit counter.
At step S1806, a type of the predetermined SF is determined.
At step S1808, if the predetermined SF is SF256, each logical operator carries out a logical operation of B7·I0⊕B6·I1⊕B5·I2⊕B4·I3⊕B3·I4⊕B2·I5⊕B1·I6⊕B0·I7.
At step S1810, if the predetermined SF is SF128, each logical operator carries out a logical operation of B6·I0⊕B5·I1⊕B4·I2⊕B3·I3⊕B2·I4⊕B1·I5⊕B0·I6.
At step S1812, if the predetermined SF is SF64, each logical operator carries out a logical operation of B5·I0⊕B4·I1⊕B3·I2⊕B2·I3⊕B1·I4⊕B0·I5.
At step S1814, if the predetermined SF is SF32, each logical operator carries out a logical operation of B4·I0⊕B3·I1⊕B2·I2⊕B1·I3⊕B0·I4.
At step S1816, if the predetermined SF is SF16, each logical operator carries out a logical operation of B3·I0⊕B2·I1⊕B1·I2⊕B0·I3.
At step S1818, if the predetermined SF is SF8, each logical operator carries out a logical operation of B2·I0⊕B1·I1⊕B0·I2.
At step S1820, if the predetermined SF is SF4, each logical operator carries out a logical operation of B1·I0⊕B0·I1.
At step S1822, each multiplexer generates a spreading code in response to the SF.
Although the preferred embodiments of the invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope and spirit of the invention as disclosed in the accompanying claims.

## Claims

1. A spreading method for a mobile station, wherein the mobile station is capable of using at least three data channels and at least one control channel, comprising:
allocating a first code {a1, a2, a3, a4} to a first one of the data channels based on code allocation rules;
allocating a second code {b1, b2, b3, b4} to a second one of the data channels based on the code allocation rules;
allocating a third code {c1, c2, c3, c4} to a third one of the data channels based on the code allocation rules;
spreading the first one of the data channels by the first code {a1, a2, a3, a4};
spreading the second one of the data channels by the second code {b1, b2, b3, b4}; and
spreading the third one of the data channels by the third code {c1, c2, c3, c4}, wherein
the code allocation rules include that the first code {a1, a2, a3, a4} is C4,1, C4,1 being a first orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 1, the code allocation rules further include that the second code {b1, b2, b3, b4} is C4,1, and the code allocation rules further include that the third code {c1, c2, c3, c4} is C4,3, C4,3 being a second orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 3, and
when three and not more than three of the data channels are used, the first one of the data channels, the second one of the data channels, and the third one of the data channels are used.

2. The method of claim 1, further comprising:
spreading the at least one control channel by C256,0, wherein C256,0 is a third orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0.

3. The method of claim 2, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch, and
the mobile station uses the data channels and the at least one control channel such that at least the second one of the data channels and the at least one control channel are coupled to a quadrature-phase branch.

4. The method of claim 2, further comprising:
allocating the first one of the data channels and the third one of the data channels to an in-phase branch, and
allocating the at least one control channel and the second one of the data channels to a quadrature-phase branch.

5. The method of claim 1, further comprising:
when more than three of the data channels are used, allocating a fourth code {d1, d2, d3, d4 } to a fourth one of the data channels based on the code allocation rules; and
when more than three of the data channels are used, spreading the fourth one of the data channels by the fourth code {d1, d2, d3, d4}, wherein
the code allocation rules further include that code {d1, d2, d3, d4} is C4,3, and
when four and not more than four of the data channels are used, the first one of the data channels, the second one of the data channels, the third one of the data channels, and the fourth one of the data channels are used.

6. The method of claim 5, further comprising:
spreading the at least one control channel by C256,0, wherein C256,0 is a third orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0.

7. The method of claim 6, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch, and
the mobile station uses the data channels and the at least one control channel such that at least the second one of the data channels and the fourth one of the data channels and the at least one control channel are coupled to a quadrature-phase branch.

8. The method of claim 6, further comprising:
allocating the first one of the data channels and the third one of the data channels to an in-phase branch; and
allocating the second one of the data channels and the fourth one of the data channels and the at least one control channel to a quadrature-phase branch.

9. The method of claim 5, further comprising:
when more than four of the data channels are used, allocating a fifth code {e1, e2, e3, e4} to a fifth one of the data channels based on the code allocation rules;
when more than five of the data channels are used, allocating a sixth code {f1, f2, f3, f4} to a sixth one of the data channels based on the code allocation rules;
when more than four of the data channels are used, spreading the fifth one of the data channels by the fifth code {e1, e2, e3, e4}; and
when more than five of the data channels are used, spreading the sixth one of the data channels by the sixth code {f1, f2, f3, f4}, wherein
the code allocation rules further include that {e1, e2, e3, e4} is C4,2, C4,2 being a fourth orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 2, and the code allocation rules further include that the sixth code {f1, f2, f3, f4} is C4,2,
when five and not more than five of the data channels are used, the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, and the fifth one of the data channels are used, and
when six of the data channels are used, the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, the fifth one of the data channels, and the sixth one of the data channels are used.

10. The method of claim 9, further comprising:
spreading the at least one control channel by C256,0, wherein C256,0 is a third orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0.

11. The method of claim 9, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch;
the mobile station uses the data channels and the at least one control channel such that at least the second one of the data channels and the at least one control channel are coupled to a quadrature-phase branch.

12. The method of claim 11, wherein
the mobile station uses the data channels such that the fourth one of the data channels is coupled to the quadrature-phase branch.

13. The method of claim 12, wherein
the mobile station uses the data channels such that the fifth one of the data channels is coupled to the in-phase branch, and
the mobile station uses the data channels such that the sixth one of the data channels is coupled to the quadrature-phase branch.

14. The method of claim 9, further comprising:
allocating the first one of the data channels and the third one of the data channels to an in-phase branch; and
allocating the at least one control channel and the second one of the data channels to a quadrature-phase branch.

15. The method of claim 14, further comprising:
allocating the fourth one of the data channels to the quadrature-phase branch.

16. The method of claim 15, further comprising:
allocating the fifth one of the data channels to the in-phase branch, and
allocating the sixth one of the data channels to the quadrature-phase branch.

17. A mobile station, wherein the mobile station is configured to use a plurality of data channels and at least one control channel, comprising:
means for spreading the at least one control channel by C256,0, C256,0 being a first orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0;
means for receiving data on the data channels, wherein
a first one of the data channels, a second one of the data channels, and a third one of the data channels are configured to be used when three and not more than three of the data channels are configured to be used,
the first one of the data channels, the second one of the data channels, the third one of the data channels, and a fourth one of the data channels are configured to be used when four and not more than four of the data channels are configured to be used,
the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, and a fifth one of the data channels are configured to be used when five and not more than five of the data channels are configured to be used, and
the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, the fifth one of the data channels, and a sixth one of the data channels are configured to be used when six of the data channels are configured to be used; and

means for spreading the first one of the data channels by a first code {a1, a2, a3, a4}, the first code {a1, a2, a3, a4} being allocated to the first one of the data channels based on code allocation rules, spreading the second one of the data channels by a second code {b1, b2, b3, b4}, the second code {b1, b2, b3, b4} being allocated to the second one of the data channels based on the code allocation rules, spreading the third one of the data channels by a third code {c1, c2, c3, c4}, the third code {c1, c2, c3, c4} being allocated to the third one of the data channels based on the code allocation rules, spreading the fourth one of the data channels by a fourth code {d1, d2, d3, d4}, the fourth code {d1, d2, d3, d4} being allocated to the fourth one of the data channels based on the code allocation rules, spreading the fifth one of the data channels by a fifth code {e1, e2, e3, e4}, the fifth code {e1, e2, e3, e4} being allocated to the fifth one of the data channels based on the code allocation rules, and spreading the sixth one of the data channels by a sixth code {f1, f2, f3, f4}, the sixth code {f1, f2, f3, f4} being allocated to the sixth one of the data channels based on the code allocation rules, wherein
the code allocation rules include that the first code {a1, a2, a3, a4} is C4,1, C4,1 being a second orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 1, the code allocation rules further include that the second code {b1, b2, b3, b4} is C4,1, the code allocation rules further include that the third code {c1, c2, c3, c4} is C4,3, C4,3 being a third orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 3, the code allocation rules further include that the fourth code {d1, d2, d3, d4} is C4,3, the code allocation rules further include that the fifth code {e1, e2, e3, e4} is C4,2, C4,2 being a fourth orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 3, and the code allocation rules further include that the sixth code {f1, f2, f3, f4} is C4,2.

18. An apparatus for a communication system, wherein the apparatus is configured to use a plurality of data channels and at least one control channel, comprising:
a first spreading unit configured to spread a first one of the data channels by a first code {a1, a2, a3, a4}, the first code {a1, a2, a3, a4} being allocated to the first one of the data channels based on code allocation rules;
a second spreading unit configured to spread a second one of the data channels by a second code {b1, b2, b3, b4}, the second code {b1, b2, b3, b4} being allocated to the second one of the data channels based on the code allocation rules; and
a third spreading unit configured to spread a third one of the data channels by a third code {c1, c2, c3, c4}, the third code {c1, c2, c3, c4} being allocated to the third one of the data channels based on the code allocation rules, wherein
the code allocation rules include that the first code {a1, a2, a3, a4} is C4,1, C4,1 being a first orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 1, the code allocation rules further include that the second code {b1, b2, b3, b4} is C4,1, and the code allocation rules further include that the third code {c1, c2, c3, c4} is C4,3, C4,3 being a second orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 3, and
the first one of the data channels, the second one of the data channels, and the third one of the data channels are configured to be used when three and not more than three of the data channels are configured to be used.

19. The apparatus of claim 18, further comprising:
a fourth spreading unit configured to spread the at least one control channel by C256,0, wherein
C256,0 is a third orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0.

20. The apparatus of claim 19, further comprising:
an in-phase branch and a quadrature-phase branch, wherein
at least the first one of the data channels and the third one of the data channels are coupled to the in-phase branch, and
at least the second one of the data channels and the at least one control channel are coupled to the quadrature-phase branch.

21. The apparatus of claim 20, further comprising:
a fifth spreading unit configured to spread a fourth one of the data channels by a fourth code {d1, d2, d3, d4} the fourth code {d1, d2, d3, d4} being allocated to the fourth one of the data channels based on the code allocation rules, wherein
the code allocation rules further include that the fourth code {d1, d2, d3, d4} is C4,3,
the first one of the data channels, the second one of the data channels, the third one of the data channels, and the fourth one of the data channels are configured to be used when four and not more than four of the data channels are configured to be used, and
the fourth one of the data channels is coupled to the quadrature-phase branch.

22. The apparatus of claim 21, further comprising:
a sixth spreading unit configured to spread a fifth one of the data channels by a fifth code {e1, e2, e3, e4}, the fifth code {e1, e2, e3, e4} being allocated to the fifth one of the data channels based on the code allocation rules; and
a seventh spreading unit configured to spread a sixth one of the data channels by a sixth code {f1, f2, f3, f4}, the sixth code {f1, f2, f3, f4} being allocated to the sixth one of the data channels based on the code allocation rules, wherein
the code allocation rules further include that the fifth code {e1, e2, e3, e4} is C4,2, C4,2 being a fourth orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 2, and the code allocation rules further include that the sixth code {f1, f2, f3, f4} is C4,2,
the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, and the fifth one of the data channels are configured to be used when five and not more than five of the data channels are configured to be used,
the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, the fifth one of the data channels, and the sixth one of the data channels are configured to be used when six of the data channels are configured to be used,
the fifth one of the data channels is coupled to the in-phase branch, and
the sixth one of the data channels is coupled to the quadrature-phase branch.

23. The apparatus of claim 22, further comprising:
a spreading code generation unit configured to generate C4,1, C4,2, C4,3, and C256,0.

24. A mobile station programmed to perform a method wherein the mobile station is capable of using at least three data channels and at least one control channel, the method comprising:
allocating a first code {a1, a2, a3, a4} to a first one of the data channels based on code allocation rules;
allocating a second code {b1, b2, b3, b4} to a second one of the data channels based on the code allocation rules;
allocating a third code {c1, c2, c3, c4 } to a third one of the data channels based on the code allocation rules;
spreading the first one of the data channels by the first code {a1, a2, a3, a4};
spreading the second one of the data channels by the second code {b1, b2, b3, b4}; and
spreading the third one of the data channels by the third code {c1, c2, c3, c4}, wherein
the code allocation rules include that the-first code {a1, a2, a3, a4} is C4,1, C4,1 being a first orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 1, the code allocation rules further include that the second code {b1, b2, b3, b4} is C4,1, and the code allocation rules further include that the third code {c1, c2, c3, c4} is C4,3, C4,3 being a second orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 3, and
the first one of the data channels, the second one of the data channels, and the third one of the data channels are used when three and not more than three of the data channels are configured to be used.

25. The mobile station of claim 24, the method further comprising:
spreading the at least one control channel by C256,0, wherein C256,0 is a third orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0.

26. The mobile station of claim 25, the comprising:
when more than three of the data channels are used, allocating a fourth code {d1, d2, d3, d4 } to the fourth one of the data channels based on the code allocation rules; and
when more than three of the data channels are used, spreading the fourth one of the data channels by the fourth code {d1, d2, d3, d4}, wherein
the code allocation rules further include that the fourth code {d1, d2, d3, d4} is C4,3, and
the first one of the data channels, the second one of the data channels, the third one of the data channels, and the fourth one of the data channels are used when four and not more than four of the data channels are configured to be used.

27. The mobile station of claim 26, the method further comprising:
when more than four of the data channels are used, allocating a fifth code {e1, e2, e3, e4} to the fifth one of the data channels based on the code allocation rules;
when more than five of the data channels are used, allocating a sixth code {f1, f2, f3, f4} to the sixth one of the data channels based on the code allocation rules;
when more than four of the data channels are used, spreading the fifth one of the data channels by the fifth code {e1, e2, e3, e4}; and
when more than five of the data channels are used, spreading the sixth one of the data channels by the sixth code {f1, f2, f3, f4}, wherein
the code allocation rules further include that the fifth code {e1, e2, e3, e4} is C4,2, C4,2 being a fourth orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 2, and the code allocation rules further include that the sixth code {f1, f2, f3, f4} is C4,2,
the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, and the fifth one of the data channels are used when five and not more than five of the data channels are configured to be used, and
the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, the fifth one of the data channels, and the sixth one of the data channels are used when six of the data channels are configured to be used.

28. A mobile station capable of using at least three data channels and at least one control channel, the mobile station comprising one or more processors programmed to:
systematically spread a first one of the data channels by C4,1;
systematically spread a second one of the data channels by C4,1; and
systematically spread a third one of the data channels by C4,3, wherein
C4,1 is a first orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 1,
C4,3 is a second orthogonal variable spreading factor code with the spreading factor of 4 and the code number of 3, and
when three and not more than three of the data channels are used, the first one of the data channels, the second one of the data channels, and the third one of the data channels are used.

29. The mobile station of claim 28, wherein
C4,1 represents {1, 1, −1, −1} and C4,3 represents {1, −1, −1, 1}.

30. The mobile station of claim 29, the one or more processors further programmed to:
spread the at least one control channel by C256,0, wherein C256,0 is a third orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0.

31. The mobile station of claim 30, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch, and
the mobile station uses the data channels and the at least one control channel such that at least the second one of the data channels and the at least one control channel are coupled to a quadrature-phase branch.

32. The mobile station of claim 30, the one or more processors further programmed to:
allocate the first one of the data channels and the third one of the data channels to an in-phase branch, and
allocate the at least one control channel and the second one of the data channels to a quadrature-phase branch.

33. The mobile station of claim 28, the one or more processors further programmed to:
when more than three of the data channels are used, systematically spread a fourth one of the data channels by C4,3, wherein
when four and not more than four of the data channels are used, the first one of the data channels, the second one of the data channels, the third one of the data channels, and the fourth one of the data channels are used.

34. The mobile station of claim 33, the one or more processors further programmed to:
spread the at least one control channel by C256,0, wherein C256,0 is a third orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0.

35. The mobile station of claim 34, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch, and
the mobile station uses the data channels and the at least one control channel such that at least the second one of the data channels and the fourth one of the data channels and the at least one control channel are coupled to a quadrature-phase branch.

36. The mobile station of claim 34, the one or more processors further programmed to:
allocate the first one of the data channels and the third one of the data channels to an in-phase branch; and
allocate the second one of the data channels and the fourth one of the data channels and the at least one control channel to a quadrature-phase branch.

37. The mobile station of claim 33, the one or more processors further programmed to:
when more than four of the data channels are used, systematically spread a fifth one of the data channels by C4,2; and
when more than five of the data channels are used, systematically spread a sixth one of the data channels by C4,2, wherein
C4,2 is a fourth orthogonal variable spreading factor code with the spread factor of 4 and the code number of 2,
when five and not more than five of the data channels are used, the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, and the fifth one of the data channels are used, and
when six of the data channels are used, the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, the fifth one of the data channels, and the sixth one of the data channels are used.

38. The mobile station of claim 37, wherein
C4,1 represents {1, 1, −1, −1}, C4,2 represents {1, −1, 1, −1}, and C4,3 represents {1, −1, −1, 1}.

39. The mobile station of claim 38, the one or more processors further programmed to:
spread the at least one control channel by C256,0, wherein C256,0 is a third orthogonal variable spreading factor code with the spreading factor of 256 and the code number of 0.

40. The mobile station of claim 39, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch;
the mobile station uses the data channels and the at least one control channel such that at least the second one of the data channels and the at least one control channel are coupled to a quadrature-phase branch.

41. The mobile station of claim 40, wherein
the mobile station uses the data channels such that the fourth one of the data channels is coupled to the quadrature-phase branch.

42. The mobile station of claim 41, wherein
the mobile station uses the data channels such that the fifth one of the data channels is coupled to the in-phase branch, and
the mobile station uses the data channels such that the sixth one of the data channels is coupled to the quadrature-phase branch.

43. The mobile station of claim 39, the one or more processors further programmed to:
allocate the first one of the data channels and the third one of the data channels to an in-phase branch; and
allocate the at least one control channel and the second one of the data channels to a quadrature-phase branch.

44. The mobile station of claim 43, the one or more processors further programmed to:
allocate the fourth one of the data channels to the quadrature-phase branch.

45. The mobile station of claim 44, the one or more processors further programmed to:
allocate the fifth one of the data channels to the in-phase branch, and
allocate the sixth one of the data channels to the quadrature-phase branch.

46. The mobile station of claim 30, the one or more processors further programmed to:
generate C4,1 and C4,3.

47. The mobile station of claim 39, the one or more processors further programmed to:
generate C4,1, C4,3, and C4,2.

48. A mobile station capable of using at least three data channels and at least one control channel, the mobile station comprising one or more processors programmed to:
receive first data on a first one of the data channels;
receive second data on a second one of the data channels;
receive third data on a third one of the data channels;
systematically spread the first data with C4,1;
systematically spread the second data with C4,1; and
systematically spread the third data with C4,3, wherein
when three and not more than three of the data channels are used, the first and second one of the data channels and the third one of the data channels are used, and
CI,K represents an orthogonal variable spreading factor code, with I being a spreading factor and K being a code number, wherein 0≦K≦I.

49. The mobile station of claim 48, wherein
C4,1 represents {1, 1, −1, −1} and C4,3 represents {1, −1, −1, 1}.

50. The mobile station of claim 49, the one or more processors further programmed to:
allocate C256,0 to the at least one control channel.

51. The mobile station of claim 50, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch, and
the mobile station uses the data channels and the at least one control channel such that at least the at least one control channel and the second one of the data channels are coupled to a quadrature-phase branch.

52. The mobile station of claim 50, the one or more processors further programmed to:
allocate the first one of the data channels and the third one of the data channels to an in-phase branch, and
allocate the at least one control channel and the second one of the data channels to a quadrature-phase branch.

53. The mobile station of claim 48, the one or more processors further programmed to:
receive fourth data on a fourth one of the data channels; and
systematically spread the fourth data with C4,3; wherein
the mobile station uses the data channels such that when the mobile station uses four and not more than four of the data channels, the first one of the data channels, the second one of the data channels, the third one of the data channels, and the fourth one of the data channels are used.

54. The mobile station of claim 53, the one or more processors further programmed to:
allocate C256,0 to the at least one control channel.

55. The mobile station of claim 54, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch, and
the mobile station uses the data channels and the at least one control channel such that at least the second one of the data channels, the fourth one of the data channels, and the at least one control channel are coupled to a quadrature-phase branch.

56. The mobile station of claim 54, the one or more processors further programmed to:
allocate the first one of the data channels and the third one of the data channels to an in-phase branch; and
allocate the second one of the data channels and the fourth one of the data channels and the at least one control channel to a quadrature-phase branch.

57. The mobile station of claim 53, the one or more processors further programmed to:
receive fifth data on a fifth one of the data channels;
systematically spread the fifth data with C4,2;
receive sixth data on a sixth one of the data channels; and
systematically spread the sixth data with C4,2, wherein
when five and not more than five of the data channels are used, the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, and the fifth one of the data channels are used, and
when six of the data channels are used, the first one of the data channels, the second one of the data channels, the third one of the data channels, the fourth one of the data channels, the fifth one of the data channels, and the sixth one of the data channels are used.

58. The mobile station of claim 57, wherein
C4,1 represents {1, 1, −1, −1}, C4,2 represents {1, −1, 1, −1}, and C4,3 represents {1, −1, −1, 1}.

59. The mobile station of claim of 58, the one or more processors further programmed to:
allocate C256,0 to the at least one control channel.

60. The mobile station of claim 59, wherein
the mobile station uses the data channels such that at least the first one of the data channels and the third one of the data channels are coupled to an in-phase branch;
the mobile station uses the data channels and the at least one control channel such that at least the second one of the data channels and the at least one control channel are coupled to a quadrature-phase branch.

61. The mobile station of claim 60, wherein
the mobile station uses the data channels such that the fourth one of the data channels is coupled to the quadrature-phase branch.

62. The mobile station of claim 61, wherein
the mobile station uses the data channels such that the fifth one of the data channels is coupled to the in-phase branch, and
the mobile station uses the data channels such that the sixth one of the data channels is coupled to the quadrature-phase branch.

63. The mobile station of claim 59, the one or more processors further programmed to:
allocate the first one of the data channels and the third one of the data channels to an in-phase branch; and
allocate the at least one control channel and the second one of the data channels to a quadrature-phase branch.

64. The mobile station of claim 63, the one or more processors further programmed to:
allocate the fourth one of the data channels to the quadrature-phase branch.

65. The mobile station of claim 64, the one or more processors further programmed to:
allocate the fifth one of the data channels to the in-phase branch, and
allocate the sixth one of the data channels to the quadrature-phase branch.

66. The mobile station of claim 50, the one or more processors further programmed to:
generate C4,1 and C4,3.

67. The mobile station of claim 59, the one or more processors further programmed to:
generate C4,1, C4,3, and C4,2.