AU2006203266B2 - A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access - Google Patents

A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access Download PDF

Info

Publication number
AU2006203266B2
AU2006203266B2 AU2006203266A AU2006203266A AU2006203266B2 AU 2006203266 B2 AU2006203266 B2 AU 2006203266B2 AU 2006203266 A AU2006203266 A AU 2006203266A AU 2006203266 A AU2006203266 A AU 2006203266A AU 2006203266 B2 AU2006203266 B2 AU 2006203266B2
Authority
AU
Australia
Prior art keywords
base station
ssc
code
sscs
psch
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.)
Ceased
Application number
AU2006203266A
Other versions
AU2006203266A1 (en
Inventor
Fatih Ozluturk
Nadir Sezgin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
InterDigital Technology Corp
Original Assignee
InterDigital Technology Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from AU2003266491A external-priority patent/AU2003266491B2/en
Application filed by InterDigital Technology Corp filed Critical InterDigital Technology Corp
Priority to AU2006203266A priority Critical patent/AU2006203266B2/en
Publication of AU2006203266A1 publication Critical patent/AU2006203266A1/en
Application granted granted Critical
Publication of AU2006203266B2 publication Critical patent/AU2006203266B2/en
Priority to AU2009200936A priority patent/AU2009200936B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Description

P01l Section 29 Regulation 3.2(2)
AUSTRALIA
Patents Act 1990 COMPLETE SPECIFICATION STANDARD PATENT Application Number: Lodged: Invention Title: A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access The following statement is a full description of this invention, including the best method of performing it known to us: A BASE STATION IN A TIME DIVISION DUPLEX COMMUNICATION SYSTEM USING CODE DIVISION MULTIPLE ACCESS
BACKGROUND
This invention generally relates to a base station in a spread spectrum Time Division Duplex (TDD) communication systems using Code Division Multiple O Access (CDMA). More particularly, the present invention relates to a base station associated with a cell search procedure of User Equipment (UE) within TDD/CDMA communication systems.
INO Figure 1 depicts a wireless spread spectrum TDD/CDMA communication system. The system has a plurality of base stations 301 to 307. Each base station 301 has an associated cell 341 to 347 and communicates with user equipments (UEs) 321 to 323 in its cell 341.
In addition to communicating over different frequency spectrums, TDD/CDMA systems carry multiple communications over the same spectrum.
The multiple signals are distinguished by their respective code sequences (codes). Also, to more efficiently use the spectrum, TDD/CDMA systems as illustrated in Figure 2 use repeating frames 38 divided into a number of time slots 361 to 36 such as sixteen time slots 0 to 15. In such systems, a communication is sent in selected time slots 361 to 36n using selected codes. Accordingly, one frame 38 is capable of carrying multiple communications distinguished by both time slot 361 to 36n and code.
For a UE 32, to communicate with a base station 30,, time and code
O
N synchronization is required. Figure 3 is a flow chart of the cell search and Ssynchronization process. Initially, the UE 32, must determine which base station to 307 and cell 34, to 347 to communicate. In a TDD/CDMA system, all the base IN stations 30, to 30, are time synchronized within a base station cluster. For
(N
synchronization with UEs 32, to 327, each base station 30, to 307 sends a Primary N Synchronization Code (PSC) and several Secondary Synchronization Code (SSC)
C
signals in the time slot dedicated for synchronization. The PSC signal has an associated chip code, such as an unmodulated 256 hierarchical code, and is transmitted in the dedicated time slot, step 46. To illustrate, a base station 30, may transmit in one or two time slots, such as for a system using time slots 0 to 15 in time slot K or slot K+8, where K is either 7.
One technique used to generate a PSC signal is to use two 16 hierarchical sequences, such as XI and X2 in Equations 1 and 2.
X 1, 1, 1, 1, 1, 1, Equation 1 X2 1, 1, 1, 1, 1, 1, 1) Equation 2 Equation 3 illustrates one approach to generate a 256 hierarchal code, using X1 and X2.
y(i) Xl (i mod 16) x X2 (i div 16), where i 0, 255 Equation 3 O Using the PSC is generated such as by combining y(i) with the first row of
O
length 256 Hadamarad matrix, h 0 to produce as in Equation 4.
c y(i) x ho(i), where i 0, 255 Equation 4
ID
m Since the first row of the Hadamarad matrix is an all one sequence, Equation 4 N0 reduces to Equation Cp(i) where i 0, 255 Equation 0 The Cp(i) is used to produce a spread spectrum PSC signal suitable for transmission.
To prevent the base stations' communications from interfering with each other, each base station 30, to 30, sends its PSC signal with a unique time offset, toffs,, from the time slot boundary 40. Differing time offsets are shown for time slot 42 in Figure 4. To illustrate, a first base station 30, has a first time offset 441, tor,,, for the PSC signal, and a second base station 302, has a second time offset 442, toffse,.2 To differentiate the different base stations 30, to 30, and cells 34, to 347, each base station 30, to 307 within the cluster is assigned a different group of codes (code group). One approach for assigning a tos, for a base station using an n* code group 44,, toffs,. is Equation 6.
tofrse n n 71T, Equation 6 ID T C is the chip duration and each slot has a duration of 2560 chips. As a result, the
O
offset 42, for each sequential code group is spaced 71 chips.
c. Since initially the UE 32, and the base stations 30, to 307 are not time cn synchronized, the UE 32, searches through every chip in the frame 38 for PSC 5 signals. To accomplish this search, received signals are inputted to a matched filter
(N
on which is matched to the PSC signal's chip code. The PSC matched filter is used to I0 search through all the chips of a frame to identify the PSC signal of the base station rc 30, having the strongest signal. This process is referred to as step-1 of cell search procedure.
0 After the UE 32, identifies the PSC signal of the strongest base station the UE 32, needs to determine the time slot 361 to 36, in which that PSC and SSC signals are transmitted (referred to as the Physical Synchronization Channel (PSCH) time slot) and the code group used by the identified base station 30,. This process is referred to as step-2 of cell search procedure. To indicate the code group assigned to the base station 30, and the PSCH time slot index, the base station 30, transmits signals having selected secondary synchronization codes (SSCs), step 48. The UE 32, receives these SSC signals, step 50, and identifies the base station's code group and PSCH time slot index based on which SSCs were received, step 52.
For a TDD system using 32 code groups and two possible PSCH time slots per frame, such as time slots K and K+8, one approach to identify the code group and PSCH time slot index is to send a signal having one of 64 SSCs. Each of the synchronization codes corresponds to one of the 32 code groups and two possible PSCH time slots. This approach adds complexity at the UE 321 requiring at least C 64 matched filters and extensive processing. To identify the code group and ZPSCH time slot index, 17,344 real additions and 128 real multiplications are required in each PSCH time slot and 64 real additions are required for the decision.
11An alternative approach for step-2 of cell search procedure uses 17 SSCs.
C These 17 SSCs are used to index the 32 code groups and two possible PSCH time slots per frame. To implement this approach, at least 17 matched filters are Srequired. To identify the code group and time slot, 1,361 real additions and 34 C 10 real multiplications are required for each PSCH time slot. Additionally, 512 real additions are required for the decision.
Any discussion of documents, devices, acts or knowledge in this specification is included to explain the context of the invention. It should not be taken as an admission that any of the material formed part of the prior art base or the common general knowledge in the relevant art in Australia on or before the priority date of the claims herein.
SUMMARY
In accordance with the present invention there is provided a time division duplex (TDD) base station having a code group out of 32 code groups including: means for transmitting a primary synchronization code along with a plurality of secondary synchronization codes from the TDD base station, the plurality of secondary synchronization codes derived from a row of a Hadamard matrix and the secondary synchronization codes being quadrature phase shift keying modulated; wherein the code group of the TDD base station is indicated by the transmitted plurality of secondary synchronization codes and the 32 code groups are divided into a plurality of code group sets and each of the code group sets is identified by using a different set of secondary synchronization codes.
Preferably, the 32 code groups are divided into two code group sets and a first of the code group sets has codes 1-16 and a second of the code group set has code 17-32.
Comprises/comprising and grammatical variations thereof when used in this specification are to be taken to specify the presence of stated features, integers, steps or components or groups thereof, but do not preclude the O presence or addition of one or more other features, integers, steps, components C or groups thereof.
BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 illustrates a prior art TDD/CDMA system.
Figure 2 illustrates time slots in repeating frames of a TDD/CDMA system.
1-1 Figure 3 is a flow chart of cell search.
SFigure 4 illustrates time offsets used by differing base stations sending 0primary synchronization code signals.
(N
SFigure 5 is a diagram of the simplified components of a user equipment and a base station using binary phase shift keying modulation for cell search.
Figure 6 is a flow chart of secondary synchronization code assignment.
Figure 7 illustrates the simplified components of a user equipment and a base station using quadrature phase shift keying modulation for cell search.
Figure 8 illustrates the simplified components of a user equipment and a base station reducing the maximum number of transmitted secondary synchronization codes using quadrature phase shift keying modulation.
Figures 9 to 17 are graphs depicting the performance of various synchronization systems under varying simulated channel conditions.
IO DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The preferred embodiments will be described with reference to the drawing figures where like numerals represent like elements throughout. Figure 5 shows the Cc simplified circuitry of a base station 30, and a UE 32, for use in cell search. During 5 step-1 of the cell search, the base station 30, generates a PSC signal using a PSC
INO
Cc spread spectrum signal generator 66 having the time offset in the time slot 42 NOassociated with the base station 30,. The PSC signal is combined by a combiner 63 with M SSC signals. The combined signal is modulated by a modulator 62 to carrier frequency. The modulated signal passes through an isolator 60 and is radiated by an 0 antenna 58 or, alternately, an antenna array.
The UE 32, receives signals using an antenna 70 or, alternately, an antenna array. The received signals are passed through an isolator 72 where they are demodulated by a demodulator 74 to baseband frequency. During step-i of the cell search, the PSC matched filter 76 is used by the processor 80 to search through all the chips of a frame 38 to identify the PSC signal of the base station 30, having the strongest signal.
One approach for detection of a PSC signal location in a frame is as follows.
A selected number of positions in the received signal frame, such as forty, having the highest number of accumulated chip matches maximum signal strength), are repeatedly correlated at the same positions in subsequent frames 38. Out of the selected locations, the one having the highest number of cumulative matches the maximum signal strength) is identified as the location of the PSC signal.
IN For step-2 of the cell search procedure, the base station 301 generates SSC
O
Ssignals, SSC, to SSCm, using SSC spread spectrum signal generators 68, to 6 8 To reduce the complexity at the UE 321, a reduced number of SSCs are used. By C reducing the SSCs, the number of matched filters required at the UE 32, is reduced.
I0 5 Additionally, the reduced SSCs decreases the processing resources required to c distinguish the different codes. The reduced SSCs also reduces the probability of incorrect detection of a code group number and PSCH time slot index (see Figures C- 9-15).
One approach to reduce the SSCs is shown in the flow chart of Figure 6. The 0 number of SSCs used, M, is based on the number of code groups and PSCH time slots used per frame, step 54. The number of SSCs, M, is the log base two of the maximum combination number rounded up to the next higher integer, step 56, as in Equation 7.
M log 2 of Code Groups x of PSCH Time Slots per frame) Equation 7 The base station 30, generates, using SSC signal generators 68, to 68 the SSC signals associated with the base station's code group and the number of PSCH time slots per frame. The SSC signals are combined with each other as well as the PSC signal by combiner 63. Subsequently, the combined signal is modulated by the modulator 62, passed through the isolator 60 and radiated by the antenna 58. The e0 5
N
O
IN
0 UE 32, receives the transmitted signal, passes it through the isolator 72 and demodulates the received signal using the demodulator 74. Using corresponding SSC, to SSCM matched filters 78, to 7 8 the processor 80 determines the binary code that SSCs are modulated. Based on the determined binary code, the base station's code group and PSCH time slot index in the frame is determined. To illustrate for a system using 32 code groups and two possible time slots per frame, such as slots K and K+8, the number of binary bits needed to modulate SSCs, M, is six (log, 64). In such a system, the six SSCs are modulated with six bits using binary phase shift keying (BPSK) modulation. The six SSCs are chosen among the 256 rows of Hadamarak matrix, H 8 The Hadamarak matrix is generated sequentially, such as by Equations 8 and 9.
Ho (1) Equation 8 H, 1 H -i H.i Equation 9 A particular code, Ck.n(i), where n is the code group number associated with a SSC is produced using Equation 10. The six rows of Hadamarak matrix, H 8 are r(k) [24, 40, 56, 104, 120, 136].
Ck,(i) b.,n x x where i 0, 1, 255 and k 1, 6 Equation The value of b2 to b6 are depicted in Table 1.
Code Group b6 n b.
n b4.n b 3 bn 1 +1 +1 +1 +1 +1 2 +1 +1 +1 +1 -1 3 +1 +1 +1 -1 +1 32 -1 -1 -1 -1 -1
IND
IND
IND
Table 1 The value of b, is depicted in Table 2.
PSCH time slot order in the frame b K, where K +1 K+8 -1 Table 2 Each code corresponds to one SSC, SSC, to SSC 6 To distinguish the differing base stations' SSC signals from one another, each of the base stations' SSC signals has the same offset as its PSC signal. At the UE 321, the step-2 of the cell search procedure code group number and PSCH slot order detection) is performed as follows.
The received baseband signal is first correlated with C, as per Equation 4 to obtain phase reference. This correlation is performed by PSC matched filter 76 in Figure The phase reference is obtained by normalizing the correlation value obtained at the output of the PSC matched filter 76. The received baseband signal is also
I
INO correlated with as per Equation 10 to obtain binary data that represent the
O
code group of the base station 30, and PSCH slot order in the frame. This Scorrelation is performed by SSC matched filters 7 8 1- 7 8 in Figure 5. These t c matched filter outputs are derotated before BPSK demodulation. The derotation is 0 5 performed by complex multiplication of the complex conjugate of the phase
IN
tC reference. The derotated SSC matched filter outputs are BPSK demodulated. The
O
IND B PSK demodulation is performed by a hard limiter on the real part of the derotated
O
c SSC matched filter outputs. As a result, if the real part of the derotated SSC matched filter output is greater than zero, it is demodulated as Otherwise, it is 0 demodulated as The demodulated binary data represents the code group of the base station 30, and the PSCH time slot order in the frame as depicted in Table 1 and Table 2, respectively. To ease detection of the six SSCs, the UE 32, accumulates the derotated outputs of the SSC matched filters 7 8 7 8 M over a number of the PSCH time slots, such as four or eight.
Using six SSCs, for 32 code groups and two possible PSCH time slots, requires 653 real additions and 28 real multiplications at the UE 32, to identify the code group/PSCH time slot index. For the decision, no additions or multiplications are required. Accordingly, reducing the number of transmitted SSCs in the PSCH time slot reduces the processing at the UE 32,.
Alternately, to reduce the number of SSCs even further quadrature phase shift keying (QPSK) modulation is used. To reduce the SSC number, each SSC signal is sent on either an In-phase or Quadrature component of the PSCH. One extra -11bit of data associated with either using the I or Q carrier is used to distinguish the
O
code group/PSCH time slots. As a result, the number of SSCs, M, required by SEquation 6 is reduced by one.
e c For instance, to distinguish 32 code groups and two possible PSCH time slots, 0 5 five SSCs (M 5) are required. The code groups are divided in half (code groups
ID
c 1-16 and code groups 17-32). When the SSCs are transmitted on the I carrier, it I0 restricts the code groups to the lower half (code groups 1-16) and when the SSCs are cI transmitted on the Q carrier, it restricts the code groups to the upper half (code groups 17-32). The five SSCs distinguish between the remaining sixteen possible 0 code groups and two possible PSCH time slots.
A simplified base station 30, and UE 32, using QPSK modulation are shown in Figure 7. The base station 30, generates the appropriate SSC signals for its code group and PSCH time slot using the SSC spread spectrum signal generators 68, to 6 8 Also based on the base station's code group/PSCH time slot index, switches to 90 M either switch the outputs of the generators 68, to 68, to an I combiner 86 or a Q combiner 88. The combined I signal which includes the PSC signal is modulated by an I modulator 82 prior to transmission. The combined Q signal is modulated by a Q modulator 84 prior to transmission. One approach to produce the Q carrier for modulating the signal is to delay the I carrier by ninety degrees by a delay device 98. The UE 32, demodulates the received signals with both an I demodulator 92 and a Q demodulator 94. Similar to the base station 30,, the UE 32, may produce a Q carrier for demodulation using a delay device 96. Obtaining binary 0 data representing the lower or higher half of the 16 code groups and PSCH time slot index is the same as applying BPSK demodulation on the I and Q components of the Sreceived signal respectively. The I matched filters 1001 to 1 0 0 M are used by the cn processor 80 to determine whether any SSC signals were sent on the I component of .D 5 the PSCH. A decision variable, Idvn, is obtained such as by using Equation 11.
IDN
I0 1 dv Irxj Irx2 Irxm Equation 11 |rxjl is the magnitude of the real component (I component) of the i* SSC 0 matched filter output. Likewise, the Q matched filters 102, to 1 0 2 are used by the processor 80 to determine whether any SSC signals were sent on the Q component of the PSCH. A decision variable, Qdva, is obtained such as by using Equation 12.
Qdr l ix 2 iM Equation 12 |ixl is the magnitude of the imaginary (Q component) of the i t SSC matched filter outputs.
If ldva is greater than Qdvar, the SSC signals were transmitted on the I component.
Otherwise, the SSC signals were transmitted on the Q component.
Another approach using QPSK modulation to reduce the number of SSC signals transmitted is depicted in Figure 8. Instead of transmitting the number of SSCs of Figure 7, the number of SSCs, M, representing the code group number and ID PSCH time slot index is reduced by one. To regain the one lost bit of information
O
by reducing the SSCs, two sets of M SSCs are used. For instance using 32 code Sgroups and two possible PSCH time slots, one set, SSC, to SSC, 4 is assigned to the m lower code groups, such as code groups 1 to 16, and the second set, SSC 2 to SSC 2 4 S) is assigned to the upper code groups, such as code groups 17 to 32. For the lower \,l ec code group, sending SSC,, to SSC 1 4 on the I carrier restricts the code groups to 1 to \D 8. The Q carrier restricts the code groups to 9 to 16. Likewise, for the upper code C- group, in phase SSC 21 to SSC 24 restricts the code groups to 17 to 24 and Q SSC 2 to
SSC
24 restricts the code groups to 25 to 32. As a result, the maximum number of 3 SSCs transmitted at one time is reduced by one. By reducing the number of SSCs, the interference between SSC signals is reduced. Reduced interference between SSCs allows higher transmission power levels for each SSC signal easing detection at the UE 32,.
A simplified base station 30, and UE 32, implementing the reduced SSC approach is shown in Figure 8. At the base station 30,, two sets of M SSC spread spectrum signal generators 1041, to 1 0 4 M, generate the SSC signals corresponding to the base station's code group and PSC time slot. The corresponding SSC signals are switched using switches 106n, to 1062, to either an I 82 or Q modulator 84 as appropriate for that base station's code group and PSCH time slot. At the UE 32,, an I set of matched filters 108, to 1 0 8 2Q is used to determine if any of the SSCs were sent on the I carrier. A Q set of matched filters 1101, to 1 10 2M is used to determine -14- D if any of the SSCs were sent on the Q carrier. By detecting the transmitted I and Q
O
0 SSCs, the processor 80 determines the base station's code group and PSCH time slot.
SOne approach to determining which of 32 code groups and two possible c PSCH time slots is used by the base station 321 follows. After the processor IN accumulates data from matched filters 110,1 to 1102, the code group set, either m SSC,, to SSC,, or SSC2, to SSC 24 is determined using Equations 13 and 14.
c r var_set 1 r xn i xn r xI i x, Equation 13 Svar_ set 2 r xn i x r x2, i x, Equation 14 The values, rx,, to rx 24 are the number of accumulated matches for a respective SSC, SSCII to SSC 24 received in the I channel. Similarly, ix,, to ix 24 are the number of accumulated matches for the Q channel for SSC 1 to SSC 24 Equations 13 and 14 require a total of 16 real additions. var_set 1 represents the total accumulations of the first SSC set, SSC,, to SSC, 4 var_set 2 represents the total accumulations of the second SSC set, SSC 2 1 to SSC 24 The processor 80 compares var_set 1 to var_set 2 and the larger of the two variables is presumed to be the SSC set transmitted by the base station 32,.
To determine whether the SSCs were transmitted on the 1 or Q channel, Equations 15 and 16 are used.
var I Ir x,p r XpI Equation varQ i ji Equation 16 If var_set 1 is selected as being larger than var_set 2, the value of p is one.
CN 5 Conversely, if var set 2 is larger, the value of p is two. var_I is the accumulated
O
N values for the selected set on the I carrier and varQ is the accumulated values on the 0 Q carrier. The larger of the two variables, var_I and var_Q, is presumed to be the channel that the selected set was transmitted over. By ordering the additions in Equations 13 and 14, the values of var_I and var_Q can be determined simultaneously with var_set 1 and var_set 2. Accordingly, determining whether the 1 or Q carrier was used requires no additional additions. As a result, using QPSK modulation and two SSC sets requires 803 real additions and 36 real multiplications in each time slot and 16 real additions for the decision.
Figures 9 to 15 are graphs illustrating the performance for distinguishing 32 code groups/two PSCH time slots of systems using 32 SSCs 128, 17 SSCs 124 and 6 SSCs 126. The graphs show the performance for various simulated channel conditions. The simulations accumulated the SSC matches at the UE 32, over four or eight PSCH time slots and compared the probability of an incorrect synchronization to the channel's signal to noise ratio (SNR) in decibels.
The Figure 9 simulation uses an additive white gaussian noise (AWGN) channel and accumulation over eight PSCH time slots. The Figure 10 simulation ID uses a single path Rayleigh fading channel with a six kilohertz (kHz) frequency
O
offset and accumulation over four PSCH time slots. The Figure 11 simulation is the Ssame as the Figure 10 simulation except the accumulation was over eight PSCH
C
c time slots. The Figure 12 simulation uses an ITU channel with three multipaths with s0 a UE 32, moving at 100 kilometers per hour (km/h) and accumulation over eight eC PSCH time slots. The Figure 13 simulation uses an ITU channel with three 0 0 Omultipaths having six kilohertz (kHz) frequency offset and a UE 32, moving at 500
N
C km/h with accumulation over eight PSCH time slots. The Figure 14 simulation uses a single path Rayleigh channel having 10 kHz frequency offset with accumulation 3 over eight PSCH time slots. The Figure 15 simulation uses an ITU channel with three multipaths having 10 kHz frequency offset and the UE 32, moving at 500 km/h with accumulation over eight PSCH time slots.
Under the simulated conditions of Figures 14 and 15, 6 SSCs 128 outperforms the other techniques 124, 126. As shown in Figures 9 to 13, 6 SSCs 128 performs favorably in comparison to the other techniques 124, 126.
Figure 16 is a graph of the simulated performance of 6 SSCs 114 using BPSK and the two sets of 4 SSCs 112 using QPSK modulation. The simulation used an eight PSCH time slot accumulation of the matches for each SSC and transmission over an AWGN channel. As shown, two set QPSK modulation 112 outperformed 6 SSC BPSK modulation 114.
Figure 17 illustrates the performance of BPSK and two set QPSK modulation accumulating matches over four and eight PSCH time slots. The SSCs were -17- Ssimulated as being transmitted over a single path Rayleigh channel. Performance for
O
both modulation schemes improves with additional time slot correlations. Two set SQPSK modulation for four PSCH time slots 116 and eight PSCH time slots 120 e C outperforms BPSK modulation for four PSCH time slots 118 and eight PSCH time \0 5 slots 122, respectively.
mf
O
IND
ID
(N

Claims (2)

  1. 2. The TDD base station of claim 1 wherein the 32 code groups are divided into two code group sets and a first of the code group sets has codes 1-16 and a second of the code group sets has codes 17-32.
  2. 3. The TDD base station of claim 1 substantially as hereinbefore described with reference to figures 2 to 17 of the accompanying drawings. DATED this 3 1 st day of July 2006 INTERDIGITAL TECHNOLOGY CORPORATION WATERMARK PATENT TRADE MARK ATTORNEYS 290 BURWOOD ROAD HAWTHORN VICTORIA 3122 AUSTRALIA
AU2006203266A 1999-05-28 2006-07-31 A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access Ceased AU2006203266B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
AU2006203266A AU2006203266B2 (en) 1999-05-28 2006-07-31 A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access
AU2009200936A AU2009200936B2 (en) 1999-05-28 2009-03-10 A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US60/136664 1999-05-28
AU2003266491A AU2003266491B2 (en) 1999-05-28 2003-12-03 Cell Search Procedure for Time Division Duplex communication systems using code division multiple access
AU2006203266A AU2006203266B2 (en) 1999-05-28 2006-07-31 A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
AU2003266491A Division AU2003266491B2 (en) 1999-05-28 2003-12-03 Cell Search Procedure for Time Division Duplex communication systems using code division multiple access

Related Child Applications (1)

Application Number Title Priority Date Filing Date
AU2009200936A Division AU2009200936B2 (en) 1999-05-28 2009-03-10 A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access

Publications (2)

Publication Number Publication Date
AU2006203266A1 AU2006203266A1 (en) 2006-08-24
AU2006203266B2 true AU2006203266B2 (en) 2008-12-11

Family

ID=36928749

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2006203266A Ceased AU2006203266B2 (en) 1999-05-28 2006-07-31 A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access

Country Status (1)

Country Link
AU (1) AU2006203266B2 (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5164958A (en) * 1991-05-22 1992-11-17 Cylink Corporation Spread spectrum cellular handoff method
WO1999012273A1 (en) * 1997-08-29 1999-03-11 Telefonaktiebolaget Lm Ericsson Synchronization to a base station and code acquisition within a spread spectrum communications system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5164958A (en) * 1991-05-22 1992-11-17 Cylink Corporation Spread spectrum cellular handoff method
WO1999012273A1 (en) * 1997-08-29 1999-03-11 Telefonaktiebolaget Lm Ericsson Synchronization to a base station and code acquisition within a spread spectrum communications system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
EUROPEAN TELECOMMUNICATIONS STANDARD INSTITUTE (ETSI): "Universal Mobile Telecommunications System (UMTS); UMTS Terrestrial Radio Access (UTRA); Concept Evaluation (UMTS 30.06 version 3.0.0)" TR101146 V3.0.0, December 1997, XP002131073 *
HIGUCHI K ET AL: "FAST CELL SEARCH ALGORITHM IN DS-CDMA MOBILE RADIO USING LONG SPREADING CODES" IEEE VEHICULAR TECHNOLOGY CONFERENCE, US, NEW YORK, IEEE, vol. CONF. 47, 4 May 1997, pages 1430-1434, XP000738598 ISBN: 0-7803-3660-7 *

Also Published As

Publication number Publication date
AU2006203266A1 (en) 2006-08-24

Similar Documents

Publication Publication Date Title
US7102994B2 (en) Synchronization signal used to identify code groups
AU2009200936B2 (en) A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access
US9949225B2 (en) User equipment and base station for frame timing and cell group synchronization
AU2006203266B2 (en) A Base Station in a Time Division Duplex Communication System Using Code Division Multiple Access

Legal Events

Date Code Title Description
FGA Letters patent sealed or granted (standard patent)
DA3 Amendments made section 104

Free format text: THE NATURE OF THE AMENDMENT IS: AMEND THE NAME OF THE CO-INVENTOR TO READ OZLUTURK, FATIH

MK14 Patent ceased section 143(a) (annual fees not paid) or expired