# Patent

## Title
Method and apparatus for achieving channel variability in spread spectrum communication systems

## Abstract

A method and apparatus are disclosed for modulating a communication signal in a code division multiple access (CDMA) environment using orthogonal N by N Hadamard spread spectrum codes Orthogonal spreading codes are used that have lengths that are not a power-of 2 to provide additional channel variability for various multimedia applications and increase the flexibility of the number of channels/bandwidth relationship. The Hadamard codes are multiples of 4 (4n) and demonstrate a good cross-correlation property, making them very useful in the flexible design of code division multiple access (CDMA) systems. A transmitter encodes each of N data streams (N not being a power of 2), to be transmitted using a 4n codeword, Ni. The received signal is passed through a filter matched to the characteristics of the appropriate codeword, Ni, and PN spreading sequence.

## Background
CROSS-REFERENCE OF RELATED APPLICATION
This application is a divisional application of U.S. patent application Ser. No. 10/155,144, filed May 24, 2002 now U.S. Pat. No. 7,324,580 which is a continuation of U.S. patent application Ser. No. 09/184,613, filed Nov. 2, 1998, now abandoned each incorporated by reference herein.


FIELD OF THE INVENTION
The present invention relates to cellular and other wireless communication systems, and more particularly, to methods and apparatus for achieving additional channels in a given bandwidth for a communication system utilizing code division multiple access (CDMA) techniques.
BACKGROUND OF THE INVENTION
Code division multiple access (CDMA) techniques have been employed in many digital wireless communication systems to permit a large number of system users to communicate with one another. Code division multiple access (CDMA) techniques transmit multiple information signals on the same channel, and differentiate each user sub-channel by encoding the channel with a unique spreading code. Many communication systems utilizing code division multiple access (CDMA) techniques comply with the IS-95 standard, adopted by the Telecommunication Industry Association (TIA). Under the IS-95 standard, a communication system substantially eliminates co-channel interference and improves the bit energy-to-noise density ratio, Eb/No, on the forward link from a base station or cell site to a mobile receiver unit by modulating the information signals with Walsh orthogonal function sequences having a length equal to a power of 2 (2n). A more detailed discussion of the IS-95 standard is provided in “Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System,” Telecommunication Industry Association Doc No TIA/EIA/IS-95 (1993), incorporated by reference herein.
Walsh orthogonal function sequences having a length equal to a power of 2 exhibit excellent cross correlation properties that optimize the detection of the transmitted information (each codeword goes to zero unless modulated by itself). The constraint on the code length, however, directly limits the number of channels that can be supported in a given bandwidth. While “power of 2” Walsh codes are suitable for many applications that can match the number of channels to the available bandwidth, the efficiency and utility of CDMA networks could be significantly extended if further variation on the number of channels could be achieved.
Specifically, since each Walsh code must have a length that is equal to a power of 2, only a limited number of channel and bandwidth combinations are supported efficiently For example, if a broadcasting system transmits 72 channels of audio information using current code division multiple access (CDMA) technology, then Walsh codes having a length of 128 must be utilized. Assuming each channel includes 96 Kilobits-per-second (Kbps) of audio information, the required system bandwidth is 12.29 Megahertz (MHz) (96 Kbps times 128 channels) and the bandwidth overhead is 5 38 Megahertz (MHz) (96 KBps times (128−72) channels). Thus, a need exists for a code division multiple access (CDMA) transmission system that does not require orthogonal spreading codes having a length that is a power-of 2. A further need exists for a code division multiple access (CDMA) transmission system that accommodates more channels in a given bandwidth.
SUMMARY OF THE INVENTION
Generally, a method and apparatus are disclosed for modulating a communication signal in a code division multiple access (CDMA) environment using orthogonal 4n by 4n Hadamard spread spectrum codes. The present invention improves on conventional CDMA spread spectrum modulation techniques by utilizing orthogonal spreading codes having lengths that are not a power-of 2 to provide additional channel variability for various multimedia applications and increase the flexibility of the number of channels/bandwidth relationship. N by N orthogonal Hadamard matrices exist where N=0 (mod 4) 4n by 4n Hadamard matrices accommodate more users in a given bandwidth.
The Hadamard codes used in accordance with the present invention are multiples of 4 (4n) and demonstrate a good cross-correlation property, making them very useful in the flexible design of code division multiple access (CDMA) systems. A transmitter is disclosed that encodes each of N data streams (N not being a power of 2), to be transmitted using a 4n codeword, Ni. The forward link in a CDMA system is a synchronous link, with all user signals arriving at the same time. The received signal is passed through a filter in the receiver that is matched to the characteristics of the appropriate codeword, Ni, and PN spreading sequence. Typically, each end user will have a receiver that uses the codeword, Ni, corresponding to the channel that the user desires to receive. The receiver for the i-th user must synchronize its PN-orthogonal code sequence to the appropriate lag due to the channel transmission delay.
A more complete understanding of the present invention, as well as further features and advantages of the present invention, will be obtained by reference to the following detailed description and drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 illustrates a block diagram of a CDMA transmission system that provides a variable number of channels, in accordance with the present invention;
FIG. 2 illustrates a block diagram of a CDMA receiver that receives a variable number of channels, in accordance with the present invention;
FIG. 3 illustrates the cross-correlation characteristics of the 4n codes at lag zero (no time shift);
FIGS. 4 and 5 illustrate the correlation where the codes are shifted by one unit of time for Walsh codes of length 64 and for Hadamard (4n) codes of length 96, respectively;
FIG. 6 illustrates the auto-correlation function of the PN sequence utilized in the transmission system of FIGS. 1 and 2; and
FIGS. 7 and 8 illustrate the auto and cross-correlation where the combined spreading codes and PN sequence are shifted by one unit of time for Walsh codes of length 64 and for Hadamard (4n) codes of length 96, respectively



DETAILED DESCRIPTION
The present invention relates to a method and apparatus for modulating a communication signal in a code division multiple access (CDMA) environment using orthogonal spread spectrum codes. As discussed further below, conventional CDMA spread spectrum modulation techniques with orthogonal codes require spreading codes that have a length that is a power of 2 (2n). The present invention improves on conventional CDMA spread spectrum modulation techniques by utilizing orthogonal spreading codes having lengths that are not a power-of 2 to provide additional channel variability for various multimedia applications. Specifically, by using 4n by 4n Hadamard matrices in accordance with the present invention, more users are accommodated in the given bandwidth. N by N orthogonal Hadamard matrices exist where N=0 (mod 4) Thus, the present invention utilizes Hadamard codes that are multiples of 4 (4n).
Thus, the present invention provides greater flexibility in designing CDMA communication systems. As previously indicated, requiring Walsh codes having lengths that are powers of 2, such as 32, 64 or 128, greatly restricts the number of users that can share a certain bandwidth. By using 4n length codes, the present invention increases the flexibility of the number of channels/bandwidth relationship. It has been found that Hadamard codes having a length of 4n demonstrate a good cross-correlation property, making them very useful in the flexible design of code division multiple access (CDMA) systems.
As previously indicated, it is often desirable to differentiate a number of information signals transmitted on the same carrier frequency with unique orthogonal spread spectrum codes. This is typically accomplished by encoding each bit to be transmitted using a predefined codeword, or pattern, consisting of n “chips” or “signal elements.” A number of orthogonal spread spectrum codes, such as Walsh codes, have been discovered which have unique properties that optimize the detection of the transmitted information. Under the IS-95 standard for CDMA networks, for example, sixty four different Walsh codewords, w0 through w63, each consisting of sixty four chips, permit 64 different information signals or channels to be transmitted on the same carrier frequency. Since a number of channels are reserved for administration, such as the pilot, synch and paging channels, less than the available sixty four channels typically transmit user information.
FIG. 1 illustrates a block diagram of a CDMA transmission system 100 that provides a variable number of user streams (or channels), in accordance with the present invention. As shown in FIG. 1, in order to transmit data on the downlink portion of a CDMA system from one or more information sources, such as sources 101-103, to a plurality of end users, a transmitter 100 encodes each of N data streams (N not being a power of 2), to be transmitted using a 4n codeword, Ni. In the illustrative implementation N=72 channels. In order to improve the cross correlation properties of the 4n codewords, the encoded signals are multiplied by a PN sequence by a PN spreading stage 130 The PN spreading is discussed further below in a section entitled CROSS CORRELATION WITH PN SPEADING.
The encoded signal will then be combined and modulated in a conventional manner, prior to transmission over a transmission medium 140. The transmission medium 140 may be embodied, for example, as a wireless communications network The modulator may employ a modulation technique, for example, which multiplies the codeword by a sinusoidal carrier wave in order to shift the signal frequency upward to the carrier frequency (not shown) In this manner, the original signal spectrum may be translated into a particular frequency band allocated by the Federal Communications Commission (FCC) or another regulatory body
FIG. 2 illustrates a block diagram of a CDMA receiver 200 that provides a variable number of user streams (or channels), in accordance with the present invention. It is noted that the forward link in a CDMA system is a synchronous link, with all user signals arriving at the same time As shown in FIG. 2, the receiver 200 receives the transmitted signal using the antenna 210 and shifts the frequency of the received signal down to the base band by a demodulator, (not shown), thus returning the signal to its original form prior to modulation. Thereafter, the received signal is passed through a filter 220 that is matched to the characteristics of the appropriate codeword, Ni, and PN spreading sequence. Typically, each end user will have a receiver 200 that uses the codeword, Ni, corresponding to the channel that the user desires to receive. The receiver 200 for the i-th user must synchronize its PN-orthogonal code sequence to the appropriate lag due to the channel transmission delay. The time delay, tj, is the time delay of the j-th path of the multipath between the transmitter 100 and receiver 200. If the estimated channel transmission delay is not the actual channel transmission delay of the channel, then the energy captured from the i-th code will decrease, and the interference will increase. In view of the desire for good energy capture and good rejection of interference, the cross-correlation property of the code set should be evaluated at non-zero lags, discussed below. For a mote detailed discussion of a prior art CDMA communication system, see U.S. Pat. No. 4,901,307, incorporated by reference herein
Cross Correlation Properties
The primary characteristic for evaluating orthogonal codes for CDMA transmission is the cross-correlation property. The codes used in accordance with the present invention are orthogonal by design. In other words, at the zero-th lag, each code when correlated with itself picks up the most amount of energy, and picks up no energy from all other codes. Mathematically, this is represented as:




  
    
      
        
          
            1
            N
          
          ⁢
          
            
              ∑
              
                n
                =
                1
              
              N
            
            ⁢
            
              
                
                  H
                  i
                
                ⁡
                
                  (
                  n
                  )
                
              
              ⁢
              
                
                  H
                  j
                
                ⁡
                
                  (
                  n
                  )
                
              
            
          
        
        =
        
          {
          
            
              
                1
                ⁢
                
                  
                
                ⁢
                if
                ⁢
                
                  
                
                ⁢
                i
              
              =
              j
            
            
              0
              ⁢
              
                
              
              ⁢
              otherwise
            
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        
          (
          1
          )
        
      
    
  




where Hi is the i-th member of the orthogonal set.

As previously indicated, the present invention uses 4n by 4n Hadamard matrices, or Hadamard codes that are multiples of 4 (4n), to permit more users in a given bandwidth. (For a detailed description of Hadamard matrices see, for example, Golomb et al., “The Search for Hadamard Matrices,” Jet Propulsion Laboratory, California Institute of Technology, 1963.). For these codes to be useful, they must exhibit good cross-correlation characteristics. The cross-correlation characteristic is evaluated by observing the inner product of each of the 4n vectors with all of the other 4n vectors shifted by one unit of time. By definition, the cross-correlation characteristic of the 4n codes are zero at lag zero (no time shift), shown in FIG. 3. The auto and cross correlation at the zero-th lag demonstrates perfect orthogonality.
The circular correlation of Hadamard i=HI with the one time shifted Hadamard j=Hj at lag on is given by:




  
    
      
        
          
            
              
                corr
                ij
              
              =
              
                abs
                (
                
                  
                    1
                    N
                  
                  ⁢
                  
                    
                      ∑
                      
                        n
                        =
                        1
                      
                      N
                    
                    ⁢
                    
                      
                        
                          H
                          i
                        
                        ⁡
                        
                          (
                          n
                          )
                        
                      
                      ⁢
                      
                        
                          H
                          j
                        
                        ⁡
                        
                          (
                          
                            n
                            +
                            1
                          
                          )
                        
                      
                    
                  
                
                )
              
            
          
        
        
          
            
              =
              
                abs
                (
                
                  
                    
                      1
                      N
                    
                    ⁢
                    
                      
                        ∑
                        
                          n
                          =
                          2
                        
                        N
                      
                      ⁢
                      
                        
                          
                            H
                            i
                          
                          ⁡
                          
                            (
                            n
                            )
                          
                        
                        ⁢
                        
                          
                            H
                            j
                          
                          ⁡
                          
                            (
                            
                              n
                              +
                              1
                            
                            )
                          
                        
                      
                    
                  
                  +
                  
                    
                      
                        H
                        i
                      
                      ⁡
                      
                        (
                        1
                        )
                      
                    
                    ⁢
                    
                      
                        H
                        j
                      
                      ⁡
                      
                        (
                        2
                        )
                      
                    
                  
                
                )
              
            
          
        
      
    
    
      
        
          
            
              Eq
              .
              
                
              
              ⁢
              
                (
                2
                )
              
            
          
        
        
          
            
              
            
          
        
        
          
            
              
            
          
        
        
          
            
              Eq
              .
              
                
              
              ⁢
              
                (
                3
                )
              
            
          
        
      
    
  




FIGS. 4 and 5 illustrate the correlation where the codes are shifted by one unit of time for Walsh codes of length 64 and for Hadamard (4n) codes of length 96, respectively. It is noted that both the Walsh codes of length 64 and the Hadamard (4n) codes of length 96 show strong cross correlation values on the order of N. The Hadamard (4n) codes of length 96 show a greater number of non-diagonal peaks, suggesting a greater amount of interference from the other user signals due, for example, to time misalignment of the codes. It is further noted that the interference picked up from other users is a function of the IQ PN spreading, as well as the codewords that are used. Thus, the effect of the PN code was considered as well.
Cross Correlation With PN Spreading
The PN code that was used for evaluation purposes was the quadrature code of the IS-95 standard:

q(n)=q(n−15)⊕q(n−12)⊕q(n−11)⊕q(n−10)⊕q(n−9)⊕q(n−5)⊕q(n−4)⊕q(n−3)

The auto-correlation function of the PN sequence is shown in FIG. 6. FIG. 6 demonstrates the typical auto-correlation function of maximum length feedback shift register sequences. The illustrative PN sequence used herein has a length of 215−1 The Hadamard matrix is then element-wise multiplied by the PN sequence of the appropriate length which is developed according to the linear congruential equation given above.

FIGS. 7 and 8 illustrate the auto and cross-correlation where the combined spreading codes and PN sequence are shifted by one unit of time for Walsh codes of length 64 and for Hadamard (4n) codes of length 96, respectively. Thus, in the presence of spreading, the performance of Walsh codes of length 64 and Hadamard (4n) codes of length 96 are similar. Noise is experienced from other codes.
It is to be understood that the embodiments and variations shown and described herein are merely illustrative of the principles of this invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention.

## Claims

1. A method for receiving spread spectrum signals in a communication system comprising:
decoding said received spread spectrum signal with an orthogonal function sequence to produce a digital signal, wherein the length of said orthogonal function is selected from a group that includes substantially all multiples of four that are not an integral power of two with a range of channels supported by said communication system; and
detecting a data signal in said digital signal.

2. The method according to claim 1, wherein said orthogonal function sequence is a length of N and is a Hadamard code having a length of 4n, where N equals 4n and n is an integer.

3. The method according to claim 1, further comprising the step of demodulating said spread signal using a PN sequence.

4. The method according to claim 3, further comprising the step of synchronizing said PN sequence to an appropriate lag due to channel transmission delay.

5. The method according to claim 1, further comprising the step of synchronizing said decoding to an appropriate lag due to channel transmission delay.

6. The method according to claim 2, wherein said decoding step is performed for up to 4n data signals.

7. A receiver for receiving spread spectrum signals in a communication system comprising:
an orthogonal function decoder that combines said received spread spectrum signal with an orthogonal function sequence to produce a digital signal, wherein the length of said orthogonal function is selected from a group that includes substantially all multiples of four that are not an integral power of two within a range of channels supported by said communication system; and
a processor for detecting a data signal in said digital signal.

8. The receiver according to claim 7, wherein said orthogonal function sequence has a length of N and is a Hadamard code having a length of 4n, where N equals 4n and n is an integer.

9. The receiver according to claim 7, further comprising a decoder for demodulating said spread signal using a PN sequence.

10. The receiver according to claim 9, further comprising means for synchronizing said PN sequence to an appropriate lag due to channel transmission delay.

11. The receiver according to claim 7, further comprising means for synchronizing said orthogonal function decoder to an appropriate lag due to channel transmission delay.

12. The receiver according to claim 7, wherein said orthogonal function decoder processes up to 4n data signals.