AU2002213647A1 - A method of quadrature spreading - Google Patents
A method of quadrature spreadingInfo
- Publication number
- AU2002213647A1 AU2002213647A1 AU2002213647A AU2002213647A AU2002213647A1 AU 2002213647 A1 AU2002213647 A1 AU 2002213647A1 AU 2002213647 A AU2002213647 A AU 2002213647A AU 2002213647 A AU2002213647 A AU 2002213647A AU 2002213647 A1 AU2002213647 A1 AU 2002213647A1
- Authority
- AU
- Australia
- Prior art keywords
- data
- bits
- combined channel
- short code
- channel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Description
A METHOD OF QUADRATURE SPREADING
FIELD OF THE INVENTION
The present invention relates generally to cellular telecommunications and more specifically to a technique for quadrature spreading of data in the transmit section of the forward channel of a code division multiple access (CDMA) communication system.
BACKGROUND TO THE INVENTION
CDMA systems and protocols are specified in Interim-Standard ninety-five (IS-95) by the US Telecommunications Industry Association and CDMA2000 RCl.
The link between a mobile station and a base station is made up of two channels, the forward channel (from the base station to the mobile station) and the reverse channel (from the mobile station to the base station) .
The forward channel is composed of four different types of code channels: a pilot channel, sync channel, paging channels and forward traffic channels.
A typical forward CDMA channel consists of 64 code channels. The 64 code channels generally consist of a pilot channel, one sync channel, seven paging channels and 55 forward traffic channels.
The pilot channel is an unmodulated, direct- sequence spread spectrum signal that is transmitted at all times by the base station on every active forward channel. The mobile station monitors the pilot channel to acquire the timing of the forward CDMA channel and to obtain a phase reference for coherent demodulation.
The sync channel is used to transport synchronisation messages to mobile stations within a CDMA cell. It is used by the mobile station to acquire initial time synchronisation.
The paging channel is used to transmit control information and pages to mobile stations residing in the CDMA cell.
The forward traffic channel is used for transmission of user and signalling traffic from the base station to a specific mobile station during a phone call.
All of the code channels in the forward CDMA channel are orthogonally spread by an appropriate Walsh function and then undergo quadrature spreading (the sync channel, paging channel and forward traffic channel also undergo several other processes before being orthogonally spread) .
The forward CDMA channels are orthogonally spread using Walsh Functions at a fixed chip rate of 1.2288Mσps. The purpose of orthogonal spreading is to provide orthogonal channelization among all code channels. The pilot channel is always spread with Walsh code 0, the SYNC channel is always spread with Walsh code 32 and the paging channels are assigned Walsh codes 1 through 7.
Following Walsh spreading, all code channels undergo Quadrature Spreading, which involves performing the modulo-2 addition of the orthogonally spread data with the pseudo noise (PN) sequence generated by the short code generator. The output of the quadrature spreader is in the form of In-Phase (I) and Quadrature (Q) channels.
The I and Q data streams (channels) are then each
passed through a Baseband Filter which shapes the waveform to meet required bandwidth constraints as well as minimize Inter Symbol Interference (ISI) .
The I and Q channels are then modulated using
Quadrature Phase Shift keying (QPSK) . This is done in the I channel by amplitude modulating the cosine function with an amplitude of binary 0's and l's to produce a BPSK (Binary Phase Shift Keying) waveform. In the Q channel, the sine function is modulated producing an orthogonal
BPSK waveform. The summation of the BPSK waveforms then yields the QPSK waveform.
In conventional systems all channels are subjected to quadrature spreading separately.
To the applicant's knowledge all existing CDMA systems are implemented as hardware. Recently, it has been proposed that existing cellular telecommunications hardware could be replaced by a software implemented radio telecommunication system. It will be appreciated that software-implementations will benefit from an efficient technique for spreading the channels with the short code and that there will be benefits if the processing load is reduced.
SUMMARY OF THE INVENTION
Accordingly, the invention provides a method of quadrature spreading in a code division multiple access communication (CDMA) system including the steps of: providing a bit of short code; adding a bit of each of N data channels together to obtain a combined channel value (Xιn) ; and performing a spreading operation: if the bit of short code =0
if the bit of short code=l
to obtain a spread channel value .
Thus, the channels are combined before the spreading option is performed.
Preferably, each combined channel value is represented using K bits and S combined channel values are combined together to form combined channel data having M bits, and said method involves performing said spreading operation on said combined channel data to obtain spread channel data containing S spread channel values.
Preferably, said spreading operation is performed by: providing S bits of short code; extending each bit of short code to have K identical bits and combining the S extended bits of short code to form short code data having M bits; providing constant data having M bits in which a binary sequence representing the number of channels N is repeated S times; performing a first manipulation of said combined channel data by logically AND-ing said combined channel data with the inverse of said short code data to thereby obtain first manipulated combined channel data; performing a second manipulation of said combined channel data by (a) subtracting said combined channel data from said constant data to obtain intermediate data, and (b) logically AND-ing said intermediate data with said short code data to thereby obtain second manipulated combined channel data; and logically OR-ing said first and second manipulated combined channel data to obtain said spread channel data.
Preferably, K is the smallest number of bits
required to represent a maximum possible combined channel value which also divides evenly into M.
Preferably, M is the native number of bits of a processor used to carry out the method.
Thus, if a 32-bit processor is used to carry out the method and the combined channel data has 32 bits, and there are 4-15 channels, four bits will be used to represent each combined channel value and there will be eight combined channel values in the combined channel data. If there are 16-255 channels, each eight bits will be used to represent each combined channel value and there will be four combined channel values in the combined channel data. It will be appreciated that a larger number of bits can be used to represent each combined channel value than is necessary - eg 8-bits for 0-15 channels - however, this will reduce computational efficiency.
The invention also provides a processor programmed to carry out the above method.
Preferably, the processor is a digital signal processor (DSP) .
Preferably, the DSP is a 32-bit DSP.
BRIEF DESCRIPTION OF THE DRAWINGS
An example of a preferred embodiment of the invention will now be described in relation to the accompanying drawings in which:
Figures 1A, IB and 1C, illustrate the forward CDMA channel structure.
Figure 2 is a schematic diagram showing
quadrature spreading of 4-channels using the technique of the preferred embodiment;
Figure 3 is a flow chart showing the method of the preferred embodiment; and
Figure 4 is a flow chart showing an alternative to the method of Figure 3.
DESCRIPTION OF THE PREFERRED EMBODIMENT
In a CDMA system the link between a mobile station and a base station is made up of two channels, the forward channel (from the base station to the mobile station) and the reverse channel (from the mobile station to the base station) .
The preferred embodiment relates to the transmit section of the forward channel. A description of a forward CDMA channel will now be given.
Figures 1A, IB and 1C illustrate the forward CDMA channel structure of the prior art . The preferred embodiment relates to a modification of this forward channel structure as it specifically relates to a method which allows quadrature spreading to be efficiently performed in software.
As the Figures show, the forward channel is composed of four different types of code channels: a pilot channel 20a, sync channel 20b, paging channels 20c and forward traffic channels 20d.
A typical forward CDMA channel consists of 64 code channels that are available for use. The 64 code channels are generally comprised of a pilot channel, a sync channel, seven paging channels and fifty-five forward
traffic channels .
The pilot channel 20a is an unmodulated, direct- sequence spread spectrum signal that is transmitted at all times by the base station on every active forward channel. The mobile station monitors the pilot channel to acquire the timing of the forward CDMA channel and provides a phase reference for coherent demodulation.
The sync channel 20b is used to transport synchronization messages to mobile stations within the CDMA cell. It is used by the mobile station to acquire initial time synchronization.
The paging channels 20c are used to transmit control information and pages to mobile stations residing in the CDMA cell.
The forward traffic channels 20d are used for transmission of user and signaling traffic from the base station to a specific mobile station during a phone call.
Referring to Figs 1A and IB, all of the code channels 20a - 20d in the forward CDMA channel are orthogonally spread by the appropriate Walsh function 36 before they undergo quadrature spreading. However, as known to persons skilled in the art, the sync channel, paging channel and forward traffic channel undergo several other processes which will now be described.
The sync, paging and traffic channels all undergo convolutional encoding using a convolutional encoder 101, 201, 303. This process protects the system from errors that can occur at the high data rates used in CDMA. In convolutional encoding, the channel data streams are divided into smaller blocks of length k and are then encoded into code word symbols of length n. The (n, k, m)
convolutional code is implemented where k is the input, n is the output and m is memory order. The rate of the encoder is then defined by the code rate R = k/n. The sync, paging and traffic channels all use an encoder with a code rate R=l/2.
Symbol repetition 102, 202, 304 is also used by all channels except the pilot channel. The function of this process is to increase the data rate to the level used by the Block Interleaver 103, 203, 305, which is
19200 sps (symbols per second) or 19.2ksps. For example, the data rate on the sync channel after convolutional encoding is 2.4ksps. This value is increased 8 times to 19.2Ksps by repeating each convolutionally encoded symbol 7 times. A 9.6ksps stream however (such as the one in the paging channel), would only need to be repeated once to produce a 19.2ksps stream.
Block interleaving 103, 203 and 305 is performed in order to reorder a sequence of symbols and is performed to achieve time diversity and improve performance.
Long code generation is performed in the paging and traffic channels by long code generator 204, 307. The Long Code Generator produces long codes, which are 42 bit pseudo-noise (PN) sequences that are used for scrambling on the forward CDMA channel and this produces limited privacy.
The Long Code Generator produces 242 - 1 combinations of different long code and each long code uniquely identifies a mobile station on both the forward traffic channel and reverse traffic channel. The long code is characterized by the long code mask that is used to form either the public long code or the private long code.
The output of the Long Code Generator is fed through a Decimator 205, 308. The Deσimator reduces the size of the long code by taking 1 out of every 64 bits. This has the result of reducing the data rate from 1228800 σps (chips per second) or 1.2288 Mcps to 19.2 ksps.
As mentioned above, after the above-described processes have been performed on the relevant channels, all the code channels on the forward CDMA channel are orthogonally spread using Walsh Functions at a fixed chip rate of 1.2288 Mcps. This provides orthogonal channelization among all code channels. The pilot channel is always spread with Walsh code 0, the sync channel is always spread with Walsh channel 32 and the paging channels are assigned code channels 1 through 7.
As shown in Figure 1C, in the prior art, following Walsh spreading, all code channels undergo quadrature spreading, which involves performing the modulo-2 addition of the orthogonally spread data of each code channel with a PN sequence generated by the short code generator. The output of the quadrature spreader is in the form of In-Phase (I) and Quadrature (Q) channels 401, 402.
The I and Q data streams (channels) are then each passed through a Baseband Filter 403 which shapes the waveform to meet required bandwidth constraints as well as minimize inter symbol interference (ISI) .
After the required filtering, the I and Q channels are modulated using Quadrature Phase Shift keying (QPSK) . This is done in the I channel by amplitude modulating the cosine function with an amplitude of binary O's and l's to produce a BPSK (Binary Phase Shift Keying) waveform, in the Q channel, the sine function is modulated producing an orthogonal BPSK waveform. The
summation of the BPSK waveforms then yields the QPSK waveform which is transmitted on the forward channel .
The preferred embodiment departs from the prior art by combining N data channels before performing quadrature spreading.
The preferred embodiment will be explained in relation to an example in which four channels are combined (i.e. N = 4), however the technique can be applied to a larger number of channels - for example, the S-95 specification of sixty-four channels per cell. Each channel 20, may be turned off if channel control signal 24 is set to zero. The channels 20 will be on when the channel control signal 24 is set to one.
The preferred embodiment is illustrated in Figure 2 which shows a pilot channel 20a, a sync channel 20b, a paging channel 20c, and a traffic channel 20d.
In the preferred embodiment, bits of channels 20a to 20d are summed to provide a binary combined channel value in the range of zero to four (represented in binary) . These combined values are then spread in quadrature by the I and Q short code generators 28 and 30.
I and Q code generators 28, 30 are shown in Figure 2 which provide short code values for quadrature spreading. The short code generators of IS-95 are based on the polynomials: Pι(x)=x15 + x13 + x9 + x8 + x7 + x5 + 1 for the I channel; and Pq(x) = x15 + x12 + x11 + x10 + x6 + x5 x4 + x3 + 1 for the Q-channel . To generate the short code 15 bit shift registers are used for each of the P and Q code generators . These can be implemented in software as 16-bit or 32-bit entities. As IS-95 requires short codes to be of the length 215, a counter is used to insert a zero after every fourteen consecutive zero's.
To spread the signal in quadrature, every symbol of the combined channel value is exclusive OR-ed (XOR-ed) with a bit from the short code generator. Separate XOR operations are performed on the combined channel value for each of the I and Q components using the respective short PN codes. In this respect, a special XOR operation is performed where: X0ut=X_.n ® PN That is : Xin if the bit of short code =0
-Xi,„n if the bit of short code =l where N = the number of channels (Equation 1) .
In the preferred embodiment, the method of the present invention is implemented using processors in the form of digital signal processors (DSPs) . In the preferred embodiment, a 32-bit DSP architecture is employed, however it will be apparent to those skilled in the art that DSPs capable of handling different bit lengths can be employed as appropriate, and the technique of the present invention can be adapted to the native number of bits of the processor being used.
It will be appreciated that when the channels are combined at point 26 of Figure 2, the combined channel value will need to be represented using sufficient bits to allow the maximum possible combined channel value to be represented. For example, for 4 channels which can produce a maximum binary value of 100, 3-bits will be required. However, given that 32-bit DSP architecture is suited to the processing of 32-bit data, to achieve computational efficiency, it is desirable to pack multiple combined channel values into a single 32-bit data entity and to carry out the spreading operation on all of the combined channel values simultaneously. To do so, it is desirable to represent each combined channel value with a
number of bits which divides equally into the number of bits of the data entity being used to store the combined channel values which are to be processed at the same time. Therefore, for a 32-bit DSP, eight combined channel values of 4-bits each are combined to form 32-bit combined channel data. As a general rule where N data channels are combined and an M-bit processor is used, K bits are used to represent each combined channel value, where K is the smallest number of bits required to represent N in binary which also divides evenly into M. Hence, S * K-bit combined channel values will be packed into each M-bit combined channel data.
Packing a number of data segments into the 32-bit value has the potential to create undesirable computational complexity - i.e. potentially, groups of K-bits corresponding to each combined channel value would need to be extracted, the XOR operation performed on each combined channel value and then steps repeated for the other seven combined channel values . This procedure would be computationally intensive with multiple conditional operations and would not be suitable for a digital signal processor implementation.
The above described special XOR operation, together with special treatment of the short code, allows operations to be carried out on all 32-bits at one time.
In a four channel example, all values of Xin will be in the range of 0-4 and hence all values of Xout will also be in the range 0-4. Then, as each combined channel value should be logically XOR-ed with the same short code value, the short code is extended to the same number of bits as are used to represent each combined channel value. Thus, in the four channel example, 8-bits of short code are extended to occupy 32-bits. As shown in Figure 3, the initial value of the shift register which stores the short
code is obtained at step 50. The register is then shifted eight times at step 52 to produce 8 bits of short code which is extended to 32-bits by extending each bit to occupy 4 bits. For example, the eight bits of short code 10010101 are extended to the 32-bit value 1111 0000 0000 1111 0000 1111 0000 1111.
To carry out Equation 1, the channel values need to be manipulated separately for the short code values 0 and 1 and the results combined to produce the appropriate output. To this end, two manipulations of the combined channel data are performed and the first and second manipulated combined channel data are then combined using a logical OR operation at step 68 to produce output data in the form of 32-bit channel data at step 70.
The first manipulation is performed by inverting the short code data at step 56 and, at step 60, logically AND-ing the inverted short code data with the combined channel data produced at step 58. This produces first manipulated combined channel data.
The second manipulation is performed by subtracting, at step 64, the combined channel data obtained at step 58 from a 32-bit constant provide at step 62 to obtain intermediate data. For the four channel case, the constant consists of eight repetitions of the binary sequence 0100 (i.e. four in binary). Then, at step 66, the intermediate data is logically AND-ed with the short code data to produce second manipulated combined channel data.
The method will be described further in relation to the following example. However, it will be appreciated that the quadrature spreading will be performed separately for each of the I and Q channels.
Example 1
Assume 8 bits of each of 4 channels have been combined to form combined channel data: 0001 0011 0000 0011 0010 0000 0010 0011
Assume 8 bits of short code have been extended to form short code data:
1111 0000 0000 1111 0000 1111 0000 1111
Then inverse of the short code data is : 0000 1111 1111 0000 1111 0000 1111 0000
Step 1. AND-ing combined channel data with inverse of short code will produce first manipulated channel data:
0000 0011 0000 0000 0010 0000 0010 0000 This result is saved.
Step 2.
Create binary constant 0x44444444
0100 0100 0100 0100 0100 0100 0100 0100
Subtracting combined channel data from this constant gives intermediate data: 0011 0001 0100 0001 0010 0100 0010 0001
Step 3. AND-ing the result of step 2 with short code data will produce second manipulated data:
0011 0000 0000 0001 0000 0100 0000 0001
Note that every bit corresponding to the short code 0 now has 0 in it.
Step 4 .
Combine second manipulated channel data obtained at step 3 with first manipulated channel data obtained at Step 1. (OR operation) 0011 0011 0000 0001 0010 0100 0010 0001
It will be apparent to persons skilled in the art that, if there are more than fifteen channels and up to the sixty-four channels required by IS-95, that it will be necessary to represent combined channel values with (8- bits), thus four data segments will be in each piece of combined channel data on which the above operation is performed. Further, 4-bits of short code will need to be extended to occupy the 32 bits .
Figure 4 shows an alternative technique for carrying out the method of illustrating Figure 3.
In the embodiment illustrated in Figure 4, the first manipulation is performed by logically AND-ing the short code data with the combined channel data at step 60 instead of with the inverted short code data. As a result of this change, the second manipulation is performed with the inverse short code data and it is necessary to make a correction after step 68 in order to obtain the correct output spread channel data at step 70. This is achieved at step 69 by subtracting the result of step 68 from the M-bit constant provided at step 62.
It will be apparent that skilled programmers can generate an appropriate computer program for implementing the method of the invention. The invention includes within its scope such a program and a processor, such as a DSP, so programmed.
Various modifications to the foregoing system will be apparent to persons skilled in the art and should be considered as falling within the scope of the present invention.
Claims (10)
1. A method of quadrature spreading in a code division multiple access communication (CDMA) system including the steps of: providing a bit of short code; adding a bit of each of N data channels together to obtain a combined channel value (Xιn) ; and performing a spreading operation:
[ Xin if the bit of short code =0
Xout =
N~X.„ if the bit of short code= l to obtain a spread channel value.
2. A method as claimed in claim 1, wherein each combined channel value is represented using K bits and S combined channel values are combined together to form combined channel data having M bits, and said method involves performing said spreading operation on said combined channel data to obtain spread channel data containing S spread channel values .
3. A method as claimed in claim 2, wherein said spreading operation is performed by: providing S bits of short code; extending each bit of short code to have K identical bits and combining the S extended bits of short code to form short code data having M bits; providing constant data having M bits in which a binary sequence representing the number of channels N is repeated S times; performing a first manipulation of said combined channel data by logically AND-ing said combined channel data with the inverse of said short code data to thereby obtain first manipulated combined channel data; performing a second manipulation of said combined channel data by (a) subtracting said combined channel data from said constant data to obtain intermediate data, and (b) logically AND-ing said intermediate data with said short code data to thereby obtain second manipulated combined channel data; and logically OR-ing said first and second manipulated combined channel data to obtain said spread channel data.
4. A method as claimed in claim 2, wherein said spreading operation is performed by: providing S bits of short code; extending each bit of short code to have K identical bits and combining the S extended bits of short code to form short code data having M bits; providing constant data having M bits in which a binary sequence representing the number of channels N is repeated S times; performing a first manipulation of said combined channel data by logically AND-ing said combined channel data with said short code data to thereby obtain first manipulated combined channel data; performing a second manipulation of said combined channel data by (a) subtracting said combined channel data from said constant data to obtain first intermediate data and (b) logically AND-ing said intermediate data with the inverse of said short code data to thereby obtain second manipulated combined channel data; logically OR-ing said first and second manipulated combined channel data; and subtracting said logically OR-ed first and second manipulated combined channel data from said constant data to obtain said spread channel data.
5. A method as claimed in any one of claims 2 to 4 wherein K is the smallest number of bits required to represent a maximum possible combined channel value which also divides evenly into M.
6. A method as claimed in any one of claims 1 to 5 where N is 4.
7. A method as claimed in any one of claims 2 to 6 where M is the native number of bits of a processor used to carry out the method.
8. A method as claimed in claim 7 where M is 32.
9. A processor programmed to carry out the method of any one of claims 1 to 8.
10. A program which when executed by a processor will cause said processor to carry out the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU2002213647A AU2002213647B2 (en) | 2000-12-13 | 2001-10-29 | A method of quadrature spreading |
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AUPR2063 | 2000-12-13 | ||
| AUPR2063A AUPR206300A0 (en) | 2000-12-13 | 2000-12-13 | A method for quadrature spreading |
| AU2002213647A AU2002213647B2 (en) | 2000-12-13 | 2001-10-29 | A method of quadrature spreading |
| PCT/AU2001/001387 WO2002049228A1 (en) | 2000-12-13 | 2001-10-29 | A method of quadrature spreading |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| AU2002213647A1 true AU2002213647A1 (en) | 2002-08-29 |
| AU2002213647B2 AU2002213647B2 (en) | 2009-07-09 |
Family
ID=3826097
Family Applications (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| AUPR2063A Abandoned AUPR206300A0 (en) | 2000-11-15 | 2000-12-13 | A method for quadrature spreading |
| AU2002213647A Ceased AU2002213647B2 (en) | 2000-12-13 | 2001-10-29 | A method of quadrature spreading |
| AU1364702A Pending AU1364702A (en) | 2000-12-13 | 2001-10-29 | A method of quadrature spreading |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| AUPR2063A Abandoned AUPR206300A0 (en) | 2000-11-15 | 2000-12-13 | A method for quadrature spreading |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| AU1364702A Pending AU1364702A (en) | 2000-12-13 | 2001-10-29 | A method of quadrature spreading |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US7613158B2 (en) |
| EP (1) | EP1350335A1 (en) |
| KR (1) | KR100805342B1 (en) |
| CN (1) | CN1488199A (en) |
| AU (3) | AUPR206300A0 (en) |
| WO (1) | WO2002049228A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7787885B1 (en) * | 2006-08-10 | 2010-08-31 | Nextel Communications Inc. | Walsh code expansion in wireless communications systems |
Family Cites Families (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6693951B1 (en) * | 1990-06-25 | 2004-02-17 | Qualcomm Incorporated | System and method for generating signal waveforms in a CDMA cellular telephone system |
| KR970011690B1 (en) * | 1994-11-22 | 1997-07-14 | 삼성전자 주식회사 | Data receiver & transmitter of spread spectrum using pilot channel |
| JP2737730B2 (en) | 1995-11-30 | 1998-04-08 | 日本電気株式会社 | Spread spectrum transceiver |
| JP3796870B2 (en) * | 1997-01-21 | 2006-07-12 | ソニー株式会社 | Receiving device, receiving method, and terminal device of mobile phone system |
| KR100246537B1 (en) * | 1997-11-25 | 2000-03-15 | 정선종 | Pilot symbol aidea dual channel QPSK for CDMA system |
| US6389138B1 (en) * | 1998-11-12 | 2002-05-14 | Lucent Technologies Inc. | Method and apparatus for generating a complex scrambling code sequence |
| JP2000236285A (en) | 1999-02-16 | 2000-08-29 | Nec Corp | Cdma radio receiver |
| JP2001156749A (en) * | 1999-09-17 | 2001-06-08 | Hitachi Kokusai Electric Inc | Cdma mobile station device |
| DE19947019A1 (en) * | 1999-09-30 | 2001-06-07 | Infineon Technologies Ag | Method and device for generating spread-coded signals |
| US6603804B1 (en) * | 1999-10-01 | 2003-08-05 | Agere Systems Inc. | Upsampling filter having one-bit multipliers for multiple spread-data streams |
| US7006428B2 (en) * | 2000-07-19 | 2006-02-28 | Ipr Licensing, Inc. | Method for allowing multi-user orthogonal and non-orthogonal interoperability of code channels |
| CN100490353C (en) * | 2000-10-24 | 2009-05-20 | 北方电讯网络有限公司 | Shared channel structure, ARQ systems and methods |
-
2000
- 2000-12-13 AU AUPR2063A patent/AUPR206300A0/en not_active Abandoned
-
2001
- 2001-10-29 KR KR1020037007979A patent/KR100805342B1/en not_active IP Right Cessation
- 2001-10-29 CN CNA018224067A patent/CN1488199A/en active Pending
- 2001-10-29 WO PCT/AU2001/001387 patent/WO2002049228A1/en not_active Application Discontinuation
- 2001-10-29 AU AU2002213647A patent/AU2002213647B2/en not_active Ceased
- 2001-10-29 EP EP01981946A patent/EP1350335A1/en not_active Withdrawn
- 2001-10-29 AU AU1364702A patent/AU1364702A/en active Pending
- 2001-10-29 US US10/450,722 patent/US7613158B2/en not_active Expired - Fee Related
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1088416B1 (en) | Quadriphase spreading codes in code division multiple access communications | |
| JP3601816B2 (en) | Modulator, terminal, and modulation method in mobile communication system | |
| US6233271B1 (en) | Method and apparatus for decoding trellis coded direct sequence spread spectrum communication signals | |
| KR100567180B1 (en) | High-data-rate supplemental channel for cdma telecommunications system | |
| EP1055996A2 (en) | Method for updating a linear feedback shift register of code generator | |
| US6496474B1 (en) | Spread encoding device and method | |
| KR20010013624A (en) | Data scrambling system and method and communications system incorporating same | |
| US6125136A (en) | Method and apparatus for demodulating trellis coded direct sequence spread spectrum communication signals | |
| US6215813B1 (en) | Method and apparatus for encoding trellis coded direct sequence spread spectrum communication signals | |
| KR20010012192A (en) | Mask generating polynomials for pseudo-random noise generators | |
| AU2002213647B2 (en) | A method of quadrature spreading | |
| WO2000057588A1 (en) | Method for updating linear feedback shift register of code generator | |
| US7433906B2 (en) | Method of updating a shift register | |
| AU2002213647A1 (en) | A method of quadrature spreading | |
| EP1320940B1 (en) | Method and apparatus for efficient walsh covering and summing of signals in a communication system | |
| US6714599B1 (en) | Method and apparatus for efficient processing of signal in a communication system | |
| AU2002213658A1 (en) | A method of updating a shift register | |
| ZA200303779B (en) | A method of updating a shift register. | |
| JP2004511164A (en) | Communication system method and apparatus | |
| WO2001020799A1 (en) | Method and apparatus for decoding trellis coded direct sequence spread spectrum communication signals | |
| EP1415422A1 (en) | Code generation | |
| WO2001020834A1 (en) | Method and apparatus for encoding of trellis coded direct sequence spread spectrum communication signals | |
| Bhanja | Performance Evaluation of Phase Optimized Spreading Codes in Non Linear DS-CDMA Receiver |