TW201128977A - Method and system for multi-user detection using two-stage processing - Google Patents

Abstract

Systems and methods for multi-user detection in a multiple access system are provided. In one aspect, an apparatus is provided. The apparatus comprises a processing unit configured to process received chips into received symbols for a plurality of users and a computation unit configured to compute a multi-user matrix using a Hadamard matrix, wherein the multi-user matrix relates user symbols for the plurality of users to the received symbols. The apparatus further comprises a detection unit configured to detect the user symbols for the plurality of users using the received symbols and the computed multi-user matrix.

Description

201128977 VI. Description of the invention: [Technical field to which the invention pertains]

A method and system for multi-user reconnaissance and more specifically for multiplexed access systems. [Prior Art] In a wireless communication system, many users communicate on a wireless channel. For example, code division multiplex access (CDMA) modulation techniques are one of several techniques for facilitating communication for a large number of system users. Other multiplex access communication system technologies such as time division multiplex access (tdma) and frequency division multiplex access (FDMA) can also be used. Since there are multiple data transmissions for multiple users in a wireless communication system, there is a need to mitigate multi-user interference (MUI) and inter-symbol interference and, for example, other noise. Traditionally, interference cancellation has been performed at the chip level in the receiver, where complexity increases directly with the number of users and the number of iterations involved. Chip-level interference cancellation is more complex and involves the problem-level algorithm and implementation difficulties. This complexity causes the receiver to be susceptible to J a mispropagation. Accordingly, there is a need for systems and methods for providing accurate multi-user interference and inter-symbol interference cancellation while overcoming chip-level interference cancellation. SUMMARY OF THE INVENTION In one aspect of the present invention, a multi-user detection method is provided that includes: processing received chips into received symbols for a plurality of users 201128977; and calculating using a Hadamard matrix A user matrix, wherein the multi-user matrix associates user symbols for the plurality of users with received symbols. The method further includes detecting the user symbols for the plurality of users using the received symbols and the calculated multi-user matrix. In another aspect of the invention, an apparatus is provided. The apparatus includes a processing unit 7L configured to process received chips into received symbols for a plurality of users, and a computing unit configured to calculate a multi-user matrix using a Hadamard matrix juice, wherein The multi-user matrix associates user symbols for the plurality of users with the received symbols. The apparatus further includes a detection unit configured to detect the user symbols for the plurality of users using the received symbols and the calculated multi-user matrix. In yet another aspect of the invention, an apparatus is provided. The apparatus includes: means for processing the received chips into received symbols for a plurality of users; and means for computing a multi-user matrix using a Hadamard matrix, wherein the multi-user matrix is to be used The user symbols of the plurality of users are associated with the received symbols. The apparatus further includes means for detecting the user symbols for the plurality of users using the received symbols and the calculated multi-user matrix. In yet another aspect of the invention, a machine readable medium having a magazine 7 stored thereon is provided. The instructions are executable by one or more processors and include code for processing the received razor as received symbols for a plurality of users; and calculating the 201128977 multi-user matrix using a Hadamard matrix, Wherein the multi-user matrix associates user symbols for the plurality of users with the received symbols, the instructions further comprising for detecting the received symbols and the calculated multi-user matrix A code for the user symbols for the plurality of users. In yet another aspect of the invention, an apparatus is provided. The apparatus includes at least one processor configured to: process the received chips into received symbols for a plurality of users; calculate a multi-user matrix using a Hadamard matrix, wherein the multi-user matrix is to be used The user symbols of the plurality of users are associated with the received symbols; and the received symbols and the calculated multi-user matrix are used to detect the user symbols for the plurality of users. It is to be understood that other configurations of the present technology will be readily apparent to those skilled in the art in the <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; It will be appreciated that the invention may be embodied in various other forms and various modifications can be made in various other aspects without departing from the scope of the invention. Therefore, the drawings and the embodiments are to be regarded as illustrative and not restrictive. [Embodiment] In the following [Embodiment], a large number of specific details are set forth to provide a thorough understanding of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced without some of these specific details. In other instances, well-known 201128977 structures and techniques have not been illustrated in detail so as not to obscure the inventive technology. The term "exemplary" as used herein means "serving as an example or description." _ Any "exemplary" aspect or design described herein need not be construed as superior or superior to other aspects or designs. DETAILED DESCRIPTION OF THE INVENTION Reference will now be made in detail to the claims claims It is understood that the specific order or hierarchy of steps in the processes disclosed herein is an example of an exemplary method. It will be understood that the specific order or hierarchy of steps in the process can be rearranged and still remain within the scope of the invention. The dependent method request items provide elements of the various steps in an exemplary order and are not intended to be limited to the specific order and hierarchy provided. 1 is a diagram of a wireless communication system supporting multiple users in accordance with certain aspects of the present invention. The communication system 100 provides communication for a plurality of cell service areas 102A-102G (referred to as cell service areas 1〇2), each cell service area being performed by a corresponding base station 104A_1〇4G (referred to as a base station 1〇4). service. Of course, any number of field cell service areas 102 and base stations 104 can be included in the communication system i. In the exemplary communication system i , , some of the base stations 1 〇 4 have multiple receive antennas, while the other base stations have only one receive antenna. Similarly, some of the base stations 104 have a single transmit antenna, while other base stations have only a single transmit antenna. Mobile stations 106A-106H (referred to as mobile stations ι 6) may represent, for example, cellular telephones, PDAs, etc., and may also be referred to as mobile devices, user equipment (UE), wireless communication devices, terminals, Station, mobile equipment [7 201128977 (ME) or - some other terms. As shown! As shown, various mobile stations ι 6 can be interspersed throughout communication system 100, and at any given time, each mobile station 1-6 communicates with at least one base station 104 on the downlink and uplink. Different technologies can be used for various multiplex access communication systems, such as: (1) cdma systems that use different orthogonal code sequences to transmit data to different users, and (2) different uses in different frequency sub-bands. FDMA system that sends data '(3) TDMA system that sends data for different users in different time slots' (4) Space-division multiplex access (SDMA) for transmitting data to different users on different spatial channels a system, (5) an orthogonal frequency division multiplexing access (OFDMA) system that transmits data for different users on different frequency sub-bands, and the like. Figure 2 is a block diagram of a mobile station 106 for use in a wireless communication system in accordance with a particular aspect of the present invention. The mobile station 1-6 may include a receiver 200 configured to receive the transmitted signal using the antenna 22A. Receiver 200 is communicatively coupled to front end processing unit 210, which can be used to filter received signals using, for example, channel matched filters and/or equalizers. The mobile station 106 can include a de-buffering and despreading single-element 230' de-sampling and de-spreading unit 230 to de-amplify and de-spread the output of the front-end processing unit 210. The mobile station 106 can further include a processing unit 240, a communicably coupled memory 25A, and a communicatively coupled detection unit 260. The detection unit 260 is for multi-user detection and is described in more detail below. description. The mobile station 106 is not limited to any particular configuration&apos; and any combination of components and 8 201128977 other components may be included in the mobile station 106. 3 is a diagram of a single user channel model in accordance with a particular aspect of the present invention. As shown in FIG. 3, a user symbol is transmitted from a transmitter (not shown). The transmitter may be located, for example, in a base station 1〇4. . The user symbol can also be referred to as a data symbol for the user, and can be implemented by using phase shift keying (BPSK) modulation, quadrature phase shift keying (QPSK) modulation, quadrature amplitude modulation (QAM), or the like. The aspect is obtained by mapping one or more data bits to a batten symbol. Note that M represents the symbol period of the user's symbol coffee. Thus the 'previous user symbol will be marked as and the next user symbol will be marked as + 〇. Use, for example, Walsh to spread the user symbol Μ - and use the code pair to "crush. The Walsh code can have a spread factor #, where the Walsh code consists of spanning a symbol The sequence of # chips of the cycle transmits the result of the chirp and the agitation on the channel in block 310. The stalk station 106 uses the antenna 22 at the receiver 2〇〇 to receive the chip and then precedes it. The processing unit 210 filters it, and at the de-tuning, the unit 230 de-scrambles it using the de-scrambling code and despreads it using the despreading code one (8), and then seeks And block: 2: sum it. The received symbols 将 = obtained at action &amp; 1〇6 are summed for summing block 320 for the de-spread apostrophes over a symbol period' To get each received symbol coffee, ., ., leather machine 3 00 "{c}" represents the total filter, which is the cyclotron of channel 3 1 与6 and filter plus /. Channels based on pilot frequency and/or data-assisted channel estimation (discussed further) can be used to estimate 201128977 channel 310 A. Taking a channel matched filter as an example, the filter / can be based on the channel estimation &amp; When the length of the total filter 300 is less than 2 ΛΓ +1 (where # is the spreading factor), the received symbol with respect to the symbol period w can be expressed by the following equation (1): z(m) 1) + α. (/η) Ζ&gt;(/η)+α丨(w)厶(m + 1) (1) According to c(7) ' ·π; (8) and corpse (8), can be as equation (2) - equation (4) Shown in the matrix Ι〆%), <... and . mN-ld &quot; ^ (2) 〇i(m)^c(dN) ^w*[n + dN)p*[n + d- Ν]Μ{ή\ρ[η] + ά]·φί\ ρ[η\ (4) Figure 4(a) is a diagram of a multi-user channel model in accordance with a particular aspect of the present invention. Figure 4(a) illustrates a set of user symbols. The transmission of 〆^^}, instead of the transmission of the user symbol as shown in Fig. 3). That is, it is possible to send a symbol/calendar to a plurality of users 1 to 6 hearts~^. The symbol to j can be represented as a vector. Therefore, it is possible to apply a separate spreading code (for example, Walsh code) to WArttw for each user symbol. Of course, the use of Walsh codes is merely exemplary and other spread spectrum techniques can be used without departing from the scope of the present invention. In addition, it is possible to apply a separate gain to each user's symbol illusion to "^". It is noted that the individual user symbols can be used without departing from the scope of the present invention. Smoke w~ apply different or similar spread spectrum code or gain ^ in the application of the frequency code p (before the heart can r η- λ

i i J 10 201128977 to combine the spread spectrum signals for different users at combiner 400. The resulting combined signal is transmitted via channel 3 1 〇 /2. The mobile station 106 receives the chips at the receiver 2〇〇 using the antenna 22, and then filters them at the front end processing unit 21〇. Various front-end filtering techniques (e.g., front-end channel matched filters and/or equalization) can be implemented. Then, at the de-buffering and de-spreading unit 230, the de-buffered code ρπγ&quot; is used; the chips of the wave are de-amplified and despread using the de-spreading code to W (&gt; 2) . The solution of the frequency code and the decoding of the frequency code, you can be the conjugate of the frequency code 〆 ... and the spread code ... to .... Each de-spread signal is summed over a symbol period by a respective summation block 320 to obtain the received symbols. The received symbols to the heart (to Zhfw) indicate the symbols received at the mobile station 1〇6. The resulting received symbols can be taken. (The history is expressed as a vector, as shown in the following equation (5): - ^-i(m)G6(wl) + ^0(m)G0(w) + y41(wi)G!^(«2 +l) (5)=](cut)&lt;5good(where) where G is the gain matrix 415 (see Figure 4(c)) and 0 is the stacked gain matrix 42〇 (see Figure 4 ( b)), which can be expressed as shown in equation (6): not 201128977 k{m) = (7) The color is the vector of the user symbol ^"/^ to ^ and can be expressed as equation (7) Shown in: coffee), k(m) = k{m~\y • bNu{m)_ 6(m + l) can be called multiuser interference matrix 4ι as shown in equation (8): Expressed as A(m) = [A^(m) A, (m) According to some embodiments, Jd i A〇n) and AKm) are Nu multi-Nu multi-user interference (MM) matrices and shoulder matrices, Where ^ is the number of code channels of the service cell service area 102. The decision on the matrix (5), (5) and sum will be discussed in more detail with reference to Figure $. The expression obtained in Equation (5) can be rewritten as Equation (7) below. Shown in:

I 2(^) = 24 (w)G0(w + /) (9) As a result of the foregoing equation, 'user symbol ^ can be represented as shown in Fig. 4(b); ^ and received symbols A simplified model of the transmission of WW). In Figure 4(b), the layered gain matrix 0 is labeled 420 and the multiuser interference matrix is marked as clear (as shown by the dashed line in Figure 4(a). Some aspects of the present invention include a simplified multi-user channel model of noise. As shown in Figure 4(c), the user symbol is scaled in block 415 r- λ 12 201128977, And it is spread and agitated in block 425. The resulting signal is transmitted via channel 310a and the resulting signal is subject to noise during transmission. Received at the receiver in front end processing unit 2 1 0 The obtained signal is filtered, and de-amplified and de-spreaded at the de-amplifier and de-spreading unit 23〇. The obtained connected symbols can be expressed by the equation (1〇), where ^ is used to indicate the impurity. z(m) = A(m)Gb(m)-[-v(m) (1〇) Therefore, a single expression can be used to display the resulting received symbols (eg, despread CDMA signals). , the expression represents multi-user inter-symbol interference (ISI), multi-user interference (MUI), and other unspoken moon noise The single expression represents a time-varying multi-user model of the symbol-level of the despread signal as shown in equation (11). _Huiyi 1 (_咖))+^(w)(5)仏i(w G^+i)t(f) As a generation, the equation = Σ Ai (m) Gb(m + /) + v(m) 1〇 can be written as an equation (12 12). Figure 5 is a view of some aspects of the invention. A schematic diagram of a multi-user Detective (four) system using two levels of processing at the receiver in a wireless communication system. The _ level 5 〇 0 represents the chip level 'that is received at the splicer 200 (shown in Figure 2) When the chip is in the chip, the received chip is subjected to the front end processing at the filter 21 (for example, the channel matched filter and/or the equalizer). The output of 13 201128977 210 is input to the de-amplifier and the de-spreading single. 230. In the de-buffering and de-spreading unit 230, de-buffering is performed using the descrambling code 〆 ( , τ 掏 yf / i) and the de-spreading code is used to de-spread it 'for example' before storage. In the memory 25〇, the decoding frequency is stored in the memory 25〇. The de-buffering and de-spreading unit 230 outputs the received symbol ~[~ to ^ In one aspect, the de-buffering and de-spreading unit 23A includes a de-mixing mixer 315 and a despreading mixer 317, which will pass the $-wave code and de-frequency code (10) Mixing, and 1 de-spreading mix 317 combines the de-spreaded chips with the de-spreading code. The de-buffering and de-spreading unit 23〇 also includes a summing block 32〇 for

The despread signals are summed over the symbol periods to obtain the received symbols evenly </Wj to 2^(^). J should understand that the filtering, de-buffering and de-spreading operations of the multi-user detection system can be arranged in a different order than that shown in the example of Fig. 5 to obtain the received symbols ~(4) to Ww). For example, the solution and the spread-spectrum operation can be performed before the seam. Therefore, the multi-user detection system is not limited to the specific order of filtering, de-buffering, and de-spreading operations. As above, the total filter 300c represents the cyclotron of the channel 310/z and the filter 21〇. Therefore, 咐 is equal to the maneuver of the continent, which can be calculated as (7) and / (7) and stored in the memory 25〇. According to and 〆, the matrix and 々Μ can be expressed as shown in equation (13) - equation (15). [')!广|V)n to 201128977 (13) [^, («)](, =ZjC{dN) Z w* [« + - N]p *[n + d- Λ^]νν [ri \p[ri\ M — ( 14) [&lt;]= Σc(4) £ w* [n^^p^n + d^^plri] rt*(wt)AT-rf ( 1 $ ) The second level 510 represents Symbol level, at which the output of the de-buffering and de-spreading unit 230 is obtained (i.e., the resulting received symbols are ~ < 夕至2心...). Equation (11) above provides a symbol-level time-varying multi-user model that associates the received symbol z; to, with the desired user symbol fm). Using the equations (and the calculated matrix meanings and mountains, the gain matrix, and the received symbols, the desired user symbol can be solved. According to some embodiments, the shoulder matrix can be small and can be used by noise. Iifm) absorbs it and gets total interference. Therefore, i(fn)=AQ(m)GbXm)+^_(m) (16) can be expressed as shown in the equation (16). FIG. 6 is a diagram of use in a wireless communication system according to some aspects of the present invention. : Schematic diagram of a multi-user detection system for level processing and multi-user interference matrices. Fig. 6 is similar to ffl 5' but includes a matrix calculation unit 24A and the measurement unit 260. The same processing of the first stage and the second stage 51 is performed as described above with reference to FIG. However, according to some aspects, matrix calculation unit 240 may, for example, calculate a multi-user interference matrix bar) and transmit the matrix to tilting unit 260. In the case where the multi-user interference matrix and the value of the received symbol coffee are given, the 'detection list' is detected by 1 S5 15 201128977, for example, to solve the required money (4) of the equation (16) towel. User symbol coffee). The pointed superscript indicates the detected user symbol, and the detected user symbol provides an estimate of the user symbol at the transmitter (e.g., 'base 104'). Note that the received symbol coffee was previously determined by de-sampling and de-spreading the received chips, which were previously known or can be estimated. The following discussion (4) is used to estimate the method for the increase in enthalpy for different uses. Based on equation (16), detection unit 260 can use various detection and estimation techniques to determine desired user symbols, such as minimum mean square error estimation (MMSE), extreme probation (MLD), or sphere decoding (sd). ), maximum a posteriori detection (MAPD) and slieing e may also use other techniques known in the art. Although the matrix calculation unit 24A and the detection unit 26A are separately illustrated in Fig. 6 for ease of explanation, the operation may be performed by the same processor or a plurality of processors. In one aspect, the multi-user interference matrix is a matrix of Arws associated with the corresponding user symbols and other user symbols associated with each received symbol ~» to 2 hearts&gt;). For example, for the received symbol multi-user interference matrix (4) coefficient [heart (...l) associates the received symbol with the corresponding user symbol 。. In addition, other coefficients in the first row of the multi-user interference matrix [AWh, 2 to associate the received symbols ~^ with other user symbols, respectively, and these other user symbols to 6 hearts» have contributed multi-user interference to the received symbols. This can also be applied to other The symbol has been received. 16 201128977 Therefore, when solving the user symbol in equation (16), the multi-user interference matrix in the pattern illustrates multi-user interference. Therefore, the multi-user interference matrix Provides symbol-level multi-user user symbol detection that illustrates multi-user interference without the need to perform complex chip-level multi-user interference cancellation. Therefore, by using the symbol level A wide, powerful and advanced receiver that accurately detects the desired symbol. Figure 7 is a diagram illustrating the use of two-stage processing in a wireless communication system in accordance with certain aspects of the present invention. A flowchart of a multi-user detection method. In operation, a chip is received at a receiver 2 that is part of the mobile station 106. The program continues from operation 700 to operation 71, in operation 71, the code is The slice is processed into one or more received symbols for a plurality of users. For example, the received chips may be filtered and then de-amplified and de-spread into received symbols. The program continues from operation 710 to operation 72. 〇, in operation 72, the multi-user interference matrix is calculated based on known codes, filter coefficients, and channel estimates (eg, based on equations (13. For example, pilot-based channel estimation or data-assisted channels may be used) Estimates (which are described below) to estimate the channel. The program continues from operation 720 to operation 730, in which the calculated matrix and received symbols are used, based on being used to associate the desired user symbol with the received symbol. The symbol level model is used to detect the desired user symbol. For example, the symbol-level, time-varying multi-user model can be represented by equation (16). In this example, 17 201128977 can be used to detect user symbols in various equations by using various techniques including MMSE, MLD, SD, MAPD, and slicing to detect user symbols. The matrix will not only be used. Each user's received symbols are associated with the desired user symbol for the respective user and are associated with the user symbol for the other user. Thus, the matrix illustrates multi-user interference. To illustrate multi-user intersymbol interference, the nasal shoulder matrix and the 〆 can also be counted in operation 72. The received symbols ^^ and matrix, Uwa and 〆 can then be used in operation 73〇, for example, by Solve the user symbol ^ in equation (12) to detect the user symbol. You can use one of the shoulder matrix mountains and 丄〆... to detect the user symbol instead of using two shoulder matrices. In this case, when the user symbol in the equation (12) is solved, the term corresponding to the unused shoulder matrix in the equation (12) is omitted. Figure 8 is a flow chart illustrating a procedure for transmitting chips in accordance with certain aspects of the present invention. For example, the program can be executed at base station 1 or other transmitters to transmit chips to mobile station 1 〇 6 or other receiving devices. In operation 800, respective gains are applied to one or more user symbols to be transmitted. Any of the general components for applying the gain can be used, and the respective gains can be the same or different from each other. For example, the base station can adjust the gain applied to the user symbol using a power adaptation scheme based on feedback from the mobile station. The program continues to apply the frequency from operation 800 to the one or to operation 810, and in operation 81, a plurality of gain-scaled symbols are displayed. It is possible to implement 18 201128977 traditional CDMA spread spectrum techniques, such as applying Walsh codes. For example, user symbols can be spread to separate user symbols for different users. At operation 820, the one or more spread symbols are combined using a combiner 4'. The program continues from operation 820 to operation 830 where the combined signal is agitated. For example, the combined signal can be frequency multiplexed to separate the combined signal from signals from a cell service area (e.g., 'served by other base stations 1 〇 4). Thereafter, in operation 84, a combined signal is transmitted on channel 310 A (see Fig. 3). Figure 9 is a flow diagram illustrating a method for processing a chip into - or a plurality of received symbols for a plurality of users, in accordance with certain aspects of the present invention. This procedure can be performed at Action #1〇6 or other receiving injury locations. In operation 900, the processing of the received chips by the filter 21() y is performed by the filter 21 II , , , , 使用 使用 使用 , , , β β β β β β β β β β 已 已 已 已 已 已 已 已 已The filter and/or equalizer are used to perform front-end processing. However, other waveover techniques can be implemented without departing from the materials of the present invention. The program continues from operation 900 to operation 91, and the demodulated chip ρ is de-asserted using the de-asserted code ρ* in operation 91, which is based on the previous use of the signal at the transmitting end. The scrambling of the frequency-frequency Mart (8) is common. Thereafter, the descrambled chip is despread using the despreading code in operation 920. The despreading code is based on the previous (four) Μ (4) (for example) Walsh code at the transmitter end. A total of vehicles. Each despreading code can correspond to a different user or code channel. Can be de-scrambled and de-spreading unit 23

Si decomposes the spread spectrum and de-amplifier. The despreading code 201119 201128977 and the solution search code can be pre-programmed into the memory 25〇, and the memory 25〇 can be communicatively coupled to the de-buffering and de-spreading unit 23 0 . The program continues from operation 920 to operation 930, in which the despreading chips for each user are summed over _ number 4 cycles to obtain received symbols for the respective users. . This summation can be performed by separate summing blocks 320. The operations in Fig. 9 can also be performed in a different order to obtain received symbols. The Figure is a block diagram of a mobile station 106 for use in a wireless communication system 1A in accordance with certain aspects of the present invention. The mobile station 1〇6 in Fig. 1 includes a module 1000 for receiving chips. The mobile station 1 6 also includes a module 1010' for processing chips into one or more received symbols for a plurality of users, wherein the chips are filtered via the front end processing unit and then the chips are solved The frequency is summed and spread out and output as a symbol. The mobile station 106 further includes a modular set 1020 for computing a multi-user interference matrix. As described above, the multi-user interference matrix j can be calculated from known codes, filter coefficients, and channel estimates. The mobile station 106 further includes a module 1030 that uses the calculated matrix and received symbols to model both based on the time-variant of the symbol level used to associate the desired user symbol with the received symbol 釭W. / Detect the user symbol ^(w). For example, a time-varying multi-user model of the symbol level can be represented by equation (16). In this example, the use of equation (16) is solved by using various techniques including MMSE, MLD, SD, MAPD, and slice. Symbol ^^j to detect user symbol b(m) 0 r λ 20 201128977 Efficient calculation of multi-user interference matrix and shoulder matrix According to some aspects of the present invention, a multi-user interference matrix is provided for calculation An effective method and system for the shoulder matrix. In one aspect, when using Walsh codes to spread the user symbols, the multi-user interference matrix and shoulder matrix can be efficiently computed using the Fast Hadamard Transform (FHTs) detailed below. . Figure Π is a diagram of a multi-channel model based on an aspect. In Figure U, the user symbol 0//„; of the symbol period m is represented as a color in the form of a column vector where #„ is the number of users or code channels. Applying the gain matrix g (block m〇) to the user symbol gain matrix cp is a chest diagonal matrix that applies gains 1 to 各 to the respective user symbols 〆^//, and can be provided as follows: G= ··· ° Do j ( 17) Then use the spread spectrum matrix 展 to spread the gain-scaled user symbol (block 1120). The spread spectrum matrix 酽 is a wxw matrix that applies a Walsh code containing #値 chips to each of the gain-scaled user symbols. The spread spectrum matrix # can be provided as follows: W = Wj ·· Wj. LJ (18) where is the hi column vector used to represent the Walsh code for the first user, and 4 is for the Nuth The # Xl column vector of the user's Walsh code. Each * 什 code I to H 乂 includes a solid chip. Then, the frequency-spreading user symbol is used for the frequency-frequency user symbol (block 21 201128977 1130). The frequency aliasing matrix /YW is a # x iV diagonal matrix that applies an agitation code containing # chips to the spread spectrum user symbol. The frequency-stacking matrix household (^) can be provided as follows: &gt;((ml)A〇〇Ί P(m)~ · '°山19) where Μ-Μ to... is the frequency code corresponding to the symbol period. AM solid chip &amp; chip index. After spreading and agitation, the resulting chips are transmitted on channel Δ (block 1132). The transmitted chip of the symbol period can be represented as h 1 column vector_ as shown in FIG. The transmitted chip for the symbol period can be provided as follows: [(m) = P{m) WGb{m) ^ 2 〇^ The number of transmitted symbols of the symbol period -1 and the next symbol period W+1 It can be provided as follows: where it is assumed that for the symbol periods w], (7) and w+1, the Walsh code and the gain 疋 are the same. In this aspect, the 夭 什 code can be repeated every symbol period. The transmitted chips are transmitted to the receiver on channel /z (block U32) and filtered by the front H-picker / (block 1135) at the receiver, the chopper of the wave symbol period w / The output can be expressed as # X 1 % @量' which can be as follows: ▲-ί)&quot;] y{m) = C ί_(ηι) jXm + l) i Si 22 (23) 201128977 where C is the total 遽The matrix of the waver (block 114 0 ), the total chopper is provided by the channel and the cyclotron of the filter /. The transmitted chips of the symbol periods w-1 and w+1 are included in the expression to illustrate the intersymbol interference. The total filter matrix C can be represented by the #X3# torpitz matrix provided below: cHV+i] ··. c[-1] *** c[—Λ^+l] c[—TV] WC[N-1] ... c[i] 4〇] 4-1] - 4 --^+1] C= ^ ·_· ···: ·. 4^-1] ; ··· .-· c[-l] , _ c[A^ ··· c[l] cf〇 i L Cq (24) where the chopper length spans 2# chips (-# to jy), and c /, C〇 and C; represents the total filter matrix C applied to the previous, current and lower respectively The portion of a symbol period that is sent a chip. The total filter matrix c can be represented by Q. The expression of the transmitted code month in equation (20)_equation (22) is inserted into the expression in the equation (23) for the filter wheel zfwj, which yields: 1 l(m) = Σ C, P(m +lWGb{m + /) , =_I (25) After filtering by the front-end filter/filtering, the filter output is de-amplified with the de-sampling matrix (block 11 5 0), which is the frequency-crushing r The matrix of Hermione is light. The frequency is despreaded by the despreading frequency matrix π (block 1160), which despreads the demodulated frequency data output, which is the transposition of the spread frequency moment P π. The deciphering frequency and the despreading frequency are obtained for the received symbols to be used by the user i; The received symbols can be provided as follows?~(m): [S} 23 201128977 (26) lijn) = WT PH (rn)yim) Insert the relevant expression into equation (26). (27) z(m) = WTPH QP{m + l)WGb{m+/) . /=-1 Based on equation (27), the symbol period_multiuser interference matrix and shoulder matrix 4 can be represented as follows:

A_l{rn) = WTPH{m)C_lP{m-\)W is (4)= (4)c〇p(4)妒(29) A (^) = WTPH (jn)CxP{m + l)fV ^ 3 〇^ Use equation (28 )--(3〇), which can calculate the multi-user interference matrix and the shoulder matrix, and can use the fast Hadamard transform (FHTS) to efficiently calculate the multi-user interference matrix and the shoulder matrix. As described below. The FHT operation can calculate the product of the Hadamard matrix and a vector by "recursively defining the 2n-order Hadamard matrix. VH^ Η. 1 卞Η, -Η. Η., (31) -1 Apply below to provide η2:

A (32) can also be used to calculate the Hadamard matrix and a matrix ό: product' because the matrix can be represented by multiple vectors. Systems and methods that are otherwise effective have been developed to perform FHT operations. For example, the title of "MethQdandAppa_f〇" published on the next day of 1996 (4)

SI

A description of the computationally efficient bribery operation is found in the U.S. Patent No. 5, issued to the United States of America, the entire disclosure of which is incorporated herein by reference. It is possible to reorder the 仃 or column of the Walsh moment z, ^ piL # . to smash the m: damma matrix. Alternatively, the Walsh codes in the Walsh matrix are ordered to form a 啥Dama matrix, in which case the matrix does not need to be transformed. Walsh can be used to efficiently perform the E-user interference matrix and the shoulder matrix in equation (28)-equation (30) with FHT operation. In one aspect, the spread spectrum matrix W in the equation (30) - equation (30) is a Walsh matrix, and 1 can be ', by 行 the row of the matrix FT or The column m is reordered to replace the money with Hadamard m(28). The despreading matrix π in equation (30) is the transposition of the spread spectrum matrix ^, which can be regarded as Walsh. A matrix in which a row or column of a matrix expansion can also be transformed into a Hadamard matrix by reordering it. In this aspect, the Walsh matrix r can be transformed into a corresponding Hadamard matrix by reordering the rows or columns of the Walsh moments (four), and the rows or columns of the other matrix are similar in time series. Reordering is performed to efficiently calculate the product of the Walsh matrix ^ in equation (28) - equation (μ) and the other matrix using the fht operation. The other matrix may be a matrix of equations (28) _ equation (30) or a combination of multiple matrices. The FHT operation is then used to account for the product of the corresponding Hadamard matrix and the other matrix whose rows or columns are reordered. After the FHT operation, the rows or columns of the resulting matrix can be reordered in the opposite manner to the Walsh matrix F to obtain the desired product. If the Walsh code in the Walsh matrix F has been ordered to form a Hadamard matrix, then the reordering operation is not required. In this case, 25 201128977 can directly apply the FHT operation to the Walsh matrix π. The equation () equation can also be calculated using FHT operations in a similar manner. The product of the Walsh matrix ^ in 〇) and another matrix. The equation (20-equation (3〇) ten matrix can be selected for the fht operation based on, for example, a choice that can result in efficient hardware and/or software implementation. The following provides an efficient use of FHT operations to calculate multi-use mats and shoulders. Two examples of matrices. In the example, the FHT operation can be used to efficiently calculate the product as follows: A(m) = WTM ( 33 ) 疋 疋 spread spread matrix 'in this example it includes multiple vo And...the combination matrix provided as follows: (Γ二:和::二积*算干(四)“(四)式)^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ The reordering of the lights to make the Walsh material W(4) into a matrix π-like way to reorder the rows of the matrix 类. After reordering the rows, the product can be provided as follows:

Aq (rn) = HM, μ is the Hadamard matrix corresponding to π, and the matrix after reordering is used in the calculation of equation (35) for hypersynthesis and can be used to operate efficiently with the matrix ~ A:: Product. The rows of the resulting matrix can be reordered after the FHT operation, 丨 26 201128977 to obtain the interference matrix. The shoulder matrix meaning/sum hill can be calculated in a similar manner using the FHT operation. It is also possible to use the FHT operation to calculate the matrix Μβ in equation (33). In one aspect, the characteristic can be used: Μ=[Μτ]τ ( 37 ) is used to represent the matrix Μ: M=[[PH(m)C0P( m)Wf]r ^36) where "is transposed. Equation (36) can be rewritten as follows: M-[W\p^m)fCrpr{m)]T (3g) M^[WTP\m)C〇T{pH(m)f]T ^39) MHW \P\m)C0TP*{m))]T ( 4〇) In one aspect, the FHT operation is used to efficiently calculate the matrix M in the equation (4〇). For this purpose, the matrix is gray transformed into the corresponding Hadamard matrix by reordering the rows of the matrix γ, and the combination (4) is reordered in a similar manner, and the row of (Ο) can be used after reordering the rows. The operation calculates the product efficiently. After the bribe operation, the rows of the obtained material are reordered in the opposite way to the row of W. Finally, the matrix obtained by re-feeding the H to the row is transposed to obtain a matrix. A similar method can be used to calculate the matrix for the shoulder matrix and the mountain. From these aspects, the flow chart of the program measured in the wireless communication system. The chip is received at 200. In operation, multiple operations are used. One or more of FIG. 12a is a receiver 122 illustrating a portion of a multi-user detection mobile station 106 using a Hadamard matrix in accordance with the present invention, 'processing received chips into 27 201128977 The program is received from operation 1220 to operation 1230, and the multi-user interference matrix is calculated using the Hadamard matrix in operation 123. For example, the Walsh matrix in equation = (7)) can be transformed into The Hadamard matrix and the FHT operation multiply the Hadamard matrix with the other matrix of the equation (29) or two other matrices to calculate the multiuser interference matrix: = Walsh matrix is already Hada The Mar form can then use the bribe operation to multiply the Walsh matrix directly with the other matrix. The program continues from operation (10) to operation _, and the desired multi-user + ___ user interference matrix and received symbols are used in operation (10) to detect the desired user symbol. The if matrix diagram is not used in accordance with certain aspects of the present invention for the use of Hadamard vehicles to calculate multi-user interference material (4)_. In operation (2) 2, for example, the car is transformed into a Hadamard matrix by reordering the columns or columns of the Walsh Mausoleum. The Walsh matrix may be a spread spectrum matrix or a despreading matrix including complex interference. When calculating the multi-user scrambling matrix, the matrix corresponding to the Walsh matrix y-.f KJ σ can be stored in the memory and retrieved from the memory. Program from operation! 232 continued to operate 裣 Recognize 裣 κ 社 社 社 社 社 社 社 社 社 社 社 社 社 社 社The matrix is multiplied by another matrix. For example, the hen _ &amp; * frequency matrix, the solution from the _ &quot; matrix can be a mixture of the other moments of the land - +, the early division of the eight. Can be on the Wal-Mart:! Reordering, in order to perform the reordering of the rows or columns of the ten matrix of the operation... (4) The multiplication in (10) is implemented in order to use the bribe operation to achieve an effective calculation. ^ 28 201128977 The program continues from operation 1234 to operation 1236, in which the rows or columns of the matrix obtained by operation 1234 are reordered. For example, 'U can reorder the rows or 歹I of the resulting matrix in the opposite way to the Walsh matrix. If the Walsh code of the Walsh matrix has been sorted into a Hadamard matrix form, the above reordering operation can be omitted. In this case, the FHT operation can be directly used to multiply the Walsh matrix by the other rectangular car to calculate the matrix 丄;, (in addition, the FHT operation can be used to perform the despreading. The program continues from operation 1236 to Operation 1238, in operation 1238, the matrix obtained by operation 1234 is used to calculate a multi-user interference matrix. Figure 12c is a block diagram of a mobile station 106 used in wireless communication system 1 (10) in accordance with certain aspects of the present invention. Figure 2. The mobile station 1 in Figure 12c includes a module 1250' for processing chips into a plurality of user or received symbols, wherein the chips are '&lt;&gt; The wave is then de-amplified and despread and output as symbol L(m). The station 106 further includes a module 1260 for computing a multi-user interference matrix using a Hadamard matrix. The Hadamard Matrix allows the use of FHT operations to efficiently compute multi-user interference matrices. The Mobile Station I% advancement includes a module 1270 for using a multi-user interference matrix (eg, based on equation (16)) and received Figure 13 is a schematic diagram of a system 1305 for computing a multi-user interference matrix and shoulder matrix meanings 7, 乂〇, and mountains according to certain aspects of the present invention. [29 201128977 In the aspect, the system shaving includes matrix calculation single &amp; uiG, generation 1320, channel estimation unit 133G, and data calculation unit generation: unit (10) provides solution (4) code 〆 (8) and despread code ice to matrix calculation unit 131 () » The de-spreading code and the despreading code for the plurality of cell service areas can be stored in the memory port 25" as illustrated in FIG. 2) and can be output for the current pair of mobile stations. 1. The code of the cell service area for service. The code unit 132 can also provide the matrix frequency code 咐 and the spreading code ~(8) to ^(5) (not shown in FIG. 13) to the matrix juice calculation unit. The code unit 132A may provide one of the agitation code or the de-spoofing code to the matrix calculation unit 1310. In this case, the matrix calculation unit 1310 may derive the agitation code or the de-agglomeration code according to the received code. Applicable to the spread spectrum code and the despreading code. Channel estimation unit 133 0 provides channel estimation 向 to matrix calculation unit 131. Channel estimation unit 1330 may estimate the channel using pilot frequency based channel estimation, data assisted channel estimation, or any other channel estimation technique. The data is described in more detail below. Auxiliary channel estimation. The filter calculation unit 13 40 provides a filter/parameter to the matrix calculation unit 。3 1 。. In one aspect, the filter calculation unit 134 〇 can calculate the filter coefficients for the other end filter, And providing a filter y parameter to the matrix calculation unit U 1 〇 based on the calculated filter coefficients. Taking a channel matched filter (CMF) as an example, a filter coefficient and thus a filter, the parameter may be based on channel estimation A Converse conjugate; ^<-... In one aspect, the matrix calculation unit 13 10 can calculate the total filter matrix c using the received channel estimate A and filter/parameters (example [30 201128977 eg, based on equation (24)). The matrix barrier can be used to use the total chopper matrix C and the 33; 丨it received code derived from the frequency matrix, the demodulation matrix, the spread spectrum matrix and the solution bottle extension And the fresh spread spectrum matrix is used to calculate the multiuser interference matrix and the shoulder matrix d , , 丄, d , 0 (for example, 'based on equation (28) - equation (3G)). When the Walsh code is used for spread spectrum as described above, the matrix calculation unit 131 can use the bribe operation to efficiently calculate the multi-user: the scrambling matrix and the shoulder matrix. The matrix calculation unit A uig can then provide the calculated multi-user interference matrix and shoulder matrix buckle, A 〇, A, to the detection unit - or any other debt measurement unit including any of the detection units described herein. Multi-user interference cancellation provides a multi-user detection system and method with symbol level multi-user interference cancellation in one aspect of the present invention. In this aspect, the user symbols of the symbol periods m-1, m, and w+! are initially detected, and the initially detected user symbols are used to calculate the symbol period (7) which is more disturbing. The calculated multi-user interference is then removed (cancelled) from the received symbols of symbol period w. The user symbol of symbol period w is then re-extracted from the received symbols from which the calculated multi-user interference has been removed. In this aspect, the symbol period, the user symbol of the initial detection of W + 1 and the W + 1 can be respectively expressed as _-1), &amp;m) and +ca + 1). The initial user symbol detection can be performed using any detection technique, including any of the detection techniques described in this disclosure. For example, Equation (16) can be used to initially detect a user symbol for a symbol period from a received symbol of a symbol period, wherein intersymbol interference is ignored [ρ 31 201128977 Simplified Price Calculation. In this example, once the interference matrix, gain matrix, and received data symbols in equation (i6) are known, various techniques including MMSE, MLD, SD, MAPD, and slice can be applied to the equation (1 6 ) to solve the desired user symbol. After the initial detection of the symbol periods W-1 and w + 1 user symbols -!) and the coffee +1), the multi-user intersymbol interference of the symbol period melon can be calculated as follows:

A A

Lnter - ^〇ι(ιτι) = Α_χ (m)Gb(jn -1) + {m)Gb{m +1) (-41) where -·() and "() shoulder matrix (which can be used separately The equations (^: and (14) are calculated), and G is the gain matrix (which can be provided by equation (17).) For each user, equation (41) illustrates intersymbol interference from other users and from Inter-symbol interference between the previous user symbol of the same user and the latter user symbol. After initially detecting the user symbol of the symbol period w, the multi-use of the user symbol from the symbol period can be calculated as follows Interference: /B,w«-Bier(/M) = 4)(7w)G0(7w)-diag{4l(/w)}G|(m) ^42)

J where (9) is a multiuser interference matrix (which can be calculated using equation (13)), and ((4) 丨 is a diagonal matrix in which only the diagonal coefficients in the multiuser interference matrix are retained ( That is, the non-diagonal coefficient is zero. The multi-user interference matrix 四 (4) not only associates the received symbols with multi-user interference, but also associates the received data symbols with their respective desired user symbols. The diagonal matrix is used in equation (42) to subtract the portion contributed by the respective desired user symbol 32 201128977, thereby retaining only multi-user interference in equation (42). Equation (41) can be combined. And the interference provided in equation (42), to represent the multi-user interference of the symbol period m as follows: (m): = + +4, (OT)G0(w)-diag{4,(w)}Gi(w (43) Multi-user interference 符号 of the symbol period calendar calculated in equation (43) illustrates multi-user interference from the user symbol in symbol period w and from the previous symbol period 1 and the next symbol Multiple users of user symbols in period w+ i Inter-symbol interference. Inter-symbol interference in equation (43) can be omitted to simplify multi-user interference calculations. Use the initial detected user symbols &amp;&gt;-1), €(»1), and (( m + 1) After calculating the multi-user interference less "), the calculated multi-user interference can be removed (cancelled) from the received symbols as follows: z(m) = z(m)-I(m) ( 44) where 2 (four) is the vector of the received symbols of the symbol period, and iO) is the vector of the received symbols of the symbol period m from which the calculated interference has been removed. Inserting the expression of multiuser interference from equation (43) into equation (44) yields: lim) = z{m) - \a_, {m)Gb{m -1) + A+1 (m)Gb (m +1)} -+ diag{\{m)} Gb(m) ( 4 5 ) After removing the calculated interference from the received symbol to obtain m), 'can re-detect the desired User symbol i(m). Therefore, the aspect uses the information on the symbol of the symbol periods m-1, m, and w+1 obtained from the initial detection at the symbol level to calculate multi-user interference. The multi-user interference calculated from the received symbols of symbol period w is then removed (excluding r r 33 201128977), thereby eliminating multi-user interference from the received symbols. Such multi-user interference cancellation to eliminate gain provides an improved multi-user. In addition, multi-user interference is calculated at the symbol level and removed from the received symbols without the need to perform complex chip-level multi-user interference cancellation. In one aspect, the slice is used to re-detect the desired user symbol from the received symbols from which the calculated interference has been removed as follows: Λ b(m) = slice(z(m)) ( 4 6 ) Taking Binary Phase Shift Keying (BPSK) modulation as an example, a slice can be provided as follows: slice(z(m)) = sign{Re(z(m))) ^ ^ In the case of BPSK modulation, it can be based on interference The symbol (sign) of the received symbol 2(m) is removed to determine the bit value of the user symbol. Taking the example of quadrature phase shift keying (qPSK) modulation with two symbols per symbol, the slice can be provided as follows: Blood (4)) = *si Ming {Re (eg (4))} (48) Modulated in QPSK In the example, the two bit values of the user symbol can be determined based on the symbols of the real and imaginary parts of the received symbol of the interference cancellation. In addition to the slice, other detection techniques can be used to re-detect the user symbol. Moreover, other modulation schemes can be used for user symbols, e.g., 16-quadrature amplitude modulation (qaM), in which each user symbol carries four-bit information. In addition, the above slice can be used in the initial debt test of the user symbol. Figure 14 is a schematic illustration of a multi-user detection system 1405 with interference cancellation in accordance with certain aspects of the present invention. The detection system 14〇5 can be located in the No. 34 201128977 line communication system in the mobile station. The detection system 14〇5 includes: a filter 141〇 for filtering the received chips, a de-buffering unit 1415 for de-sampling the filtered chips, and a descrambled frequency The chip despreading frequency is the despreading unit of the received data symbol. Filter 1410 can include an equalizer and/or a channel matched filter. After filtering, the de-buffering unit 14 15 de-aliases the filtered chips using the de-sampling code. The despreading unit 1420 then despreads the de-spreaded chips using a set of despreading codes. In one aspect, each despreading code can correspond to a different user and can be used to obtain The received symbol of the corresponding user. In this aspect, the despreading unit 142 outputs a set of received symbols using the set of despreading codes during each symbol period. The detection system 1405 further includes a detection unit i 43 〇, a matrix calculation unit 1440, an interference cancellation unit 145 〇, and a re-detection unit 146 。. Detection Single τ 1430 performs an initial detection of the desired user symbol from the received symbol during each symbol period. The detecting unit 143 can initially detect the user symbol &amp; /W using any detection technique including any of the detection techniques described in the present invention. The interference cancellation unit 1450 receives the initial detected user symbol ί for each symbol period from the detecting unit 143 (in one aspect, the interference cancellation unit 1450 uses the equation (43) and the detection unit 143 〇 The initial detected user symbols for each of the symbol periods m-1, w, and W+1]), I(10), and &m + l) ' are used to calculate the multi-user interference Z(W) for the symbol period (7). In this aspect, the cancellation unit 145 〇 can be symbolized by storing the initial (four) usage 35 201128977 symbol of the slave unit U3 在 in a period of at least three symbol periods into a note (four) (eg, a buffer). _-1), I (four) and '+1). , can be mediated by the plant and plant and ;; In this aspect, the interference cancellation unit 1450 waits until the user symbol S(w+1) of the initial detection of the symbol period w+ is received, and returns the multi-user interference 1 of the symbol period w. ). After calculating the multi-user interference, the interference cancellation unit 1450 removes the calculated dryness l(m) from the received symbol red, in order to obtain the received symbol f(w) from which the calculated interference has been removed. . The re-detection unit 1460 receives the received symbol handling device from which the calculated interference has been removed, re-detects the desired user symbol |(w) from the office 0, and outputs the user symbols. For example, the re-detection unit 丨 46 重新 can re-detect the desired user symbol &amp; m) by performing a slice ’ on the received symbol sand from which the calculated interference has been removed. The matrix discriminating unit 1440 calculates the interference matrix and the shoulder matrix for each symbol period, and supplies the matrices to the detecting unit 143 and the interference canceling unit 1450. Matrix computing unit 1440 can calculate matrix j + y using the fht operation and/or any technique. Figure 15 is a schematic illustration of a multi-user detection system 1505 with interference cancellation in accordance with certain aspects of the present invention. The detection system 15〇5 can be located in a receiver in a wireless communication system. The detection system i 5〇5 includes a filter 1510 for filtering received chips and a de-amplifying and de-spreading unit 1520. The filter 1510 may include an equalizer and/or a channel matched filter (CFM). The r· λ solution search and despreading unit 15 20 includes a de-frequency mixer 1 5 1 5 , a complex 36 201128977 number of despreading mixers 1522 and a plurality of corresponding summing blocks 1525. The de-buffer mixer 1515 combines the filtered received chips with the de-buffering code (the heart is mixed to de-sample the filtered received chips). The de-scrambling code PVW can be The conjugate of the agitation code used by the transmitter (e.g., the base station). The despreading mixer 1522 then pairs the de-amplified signal with a set of despreading codes corresponding to multiple users to the user. The heart*(^) to the mixture. The despreading code center ^^ can be the conjugate of the spreading code used at the transmitter end (eg, base station j 〇 4 ). It will come from each despreading mixer 1522 The despread signal is input to a respective summation block 1S25, and the summation block 1525 accumulates the despread signal over a symbol period to generate received symbols for the corresponding user. De-scrambling and despreading Unit 1520 outputs a set of received symbols to the heart for multiple users during each symbol period. Thus, the de-buffering and de-spreading unit 152 converts the filtered received chips from the chip level to the symbol level. The group has received the symbol. To the heart...) can also be expressed in vector form. The detection system 1505 also includes a detection unit 153, an erasing and re-detection early 1560, a code unit 1535, and a matrix calculation unit 154. The detection unit 1530 performs the process of receiving symbol homogenization from the heart to the heart. Initial detection of the desired symbol. Detection unit 1530 can initially detect user symbols ί(4) through L(9) using any detection technique, including any of the detection techniques discussed herein. For example, the 'detection unit i 5 3 求解 can solve the desired user character of the equation (16) + by using any of a variety of different techniques including MMSE, MLD, SD, MAPD, and slice 37 201128977, To initially detect the user symbol "〇". User symbols &amp; (4) to &amp; (4) can also be represented in vector form. The cancel and re-detection unit 1 560 receives the initial detected user symbol for each symbol period from the detecting unit 1 530 by m) to the heart (m), and uses the symbol period from the detecting unit 1530] , ^ and ; +1 each of the initial detected user symbols to calculate the multi-user interference of the symbol period w (eg, based on equation (43)). In this aspect, the elimination and re-detection of the unit The 1560 can include a memory 25 (shown in Figure 2) for storing user symbols from the initial detection of the detection unit 153 within a period of at least two symbol periods. Elimination and re-detection unit 56〇 can then use the stored user symbols for the initial detection of the symbol period 丨, 、, 丨+丨 to calculate the multi-user interference for the symbol period. Elimination and re-debt measurement S 156〇 from the symbol period m The received symbol is removed to remove the calculated interference of the symbol period m. The elimination and the heavy (four) measurement unit 〇 then remove the calculated interference from the received symbol re-detected I use / symbol coffee) to ~ (9), and output the user name of the re-measurement To the re-detected casual user symbol $(m) to k(m) can be expressed as a vector in the form of &amp;W). The code unit 1535 is to the dismissal phase A &amp; „ one (10)_ and the solution spread list It 1520 and the matrix calculation ^ 1565 provide the demultiplexed code and the solution _. The despreading code can be staggered = Γ° (not shown in Figure 15). Matrix calculation unit (10) period of interference matrix and shoulder matrix, Ά, and matrix. &amp; το 1530^ 除 和 and re-detection unit measurements provide such i Sj 38 201128977 Figure 16a is a flow chart illustrating a procedure for multi-user detection with interference cancellation in accordance with certain aspects of the present invention. The program can be executed, for example, at the mobile station 1-6, and the user symbol from the transmitter (e.g., base station 104) is speculated, wherein the detected user symbol is an estimate of the user symbol at the transmitter. In operation 1610, the user symbol is initially detected from the received symbols. For example, the equation can be solved by using any of various techniques including MMse, ΜΑρ〇, and cut: the user symbol of equation (i6), from a certain symbol period #received symbol 胄 initial _ the symbol The user symbol of the cycle. The program continues from operation 1610 to operation 162, and uses the initially detected user symbol to calculate multi-user interference in operation 162. For example, equation (43) and symbol period can be used, The user symbol of the initial detection of w + 1 is used to calculate the multi-user interference of the symbol period w. The program continues from operation 1620 to operation 163, and the calculated number is removed from the received symbols in operation 163. User Interference. The program continues from operation 1630 to program 1640, where the user symbol is re-detected from the received symbol from which the calculated interference has been removed, for example, by having removed the calculated symbol. The interfered received symbols are sliced to re-detect the user symbol.

ί SI Figure 16b is a block diagram of a mobile station 106 for use in a wireless communication system 1A in accordance with certain aspects of the present invention. The mobile station 1〇6 of Figure i6b includes a module 1650' for processing chips into one or more received symbols for a plurality of users 'where the chips are crossed via the front-end processing unit 39 201128977 Wave' And then it is de-amplified and despread and output as symbols. The mobile station 106 further includes a module 166〇 for detecting user symbols from received symbols. For example, the user symbol can be detected by slicing the received symbols. The mobile station 6 further includes a module 丨 67〇 for calculating multi-user interference using the detected user symbols (e.g., based on equation (43)). The mobile station 106 further includes: a module 168〇 for removing the calculated multi-user interference from the received symbols; and a module 1690 for removing (eliminating) the calculated multi-use from The received symbol that interferes with the user re-detects the user symbol. 17 is a schematic diagram of a multi-user detection system 1705 with iterative interference cancellation in accordance with certain aspects of the present invention. The detection system 17〇5 can be located in a receiver in a wireless communication system. The detection system n〇5 according to this aspect is similar to the detection system in Figure 14 except that an iterative procedure is used to refine the re-detected user symbols. Repeat the multi-user elimination and re-detection in the iterative process to refine the re-detected user symbols. In this example, the multi-users for each iteration can be provided as follows: f) (four) = bu (four) Gf + -% + 1)} . ~Mm)Gk (w) + diag{4, (m) }G6 Vm), a C 49 ) •O·丄Λ(*) where t is the iterative index, (9)) is the multi-interference for iterations, and 0%-1), 0%) and wide V+l) The knives are re-evaluated user symbols from the previous iteration w of the symbol period. For each iteration, 40 201128977 Received User Symbols with Multi-User Interference removed are available as follows: !(*)(4)=£(w) - (m) ( 5 〇) where is the iterative index, which is A vector of symbols is received, and iw(m) is a vector of received symbols that have been removed (subtracted) for multiuser interference for iteration A. After calculating (4) for iterations, any detection technique can be used to re-detect the user symbol for iteration t. For example, the user symbol |W(m) for iterative moxibustion can be re-detected by slicing (4) as follows: Λ(λ) k (jn) = slice{tk\m)) ( 51 ) After the iterative moxibustion re-detects the user symbol f\m), the iterative-free user symbol 四 (4) can be used to calculate the multi-user interference for the next iteration JK1, or can be detected by the detection system 17〇5 without More iterations. It is also possible to re-detect the user symbols ”("(7)-丨) and "()(/« + 1) for the first two symbol periods and the next symbol period for iterations in a manner similar to Γ(4). For example, 'the user symbol Γ-%-2), , and -(w) ' from the symbol periods w-2, m- and the re-detection of the one iteration 11 respectively can be used to calculate the previous symbol period. fV-i) interference z (w_1). The calculated interference fVl) can then be removed from the received symbol of the symbol period for re-detection. It can be similarly repeated for iterations. The user symbol of a symbol period is ubiquitous (W+1). In one aspect, the received symbols can be processed block by block, where on a block of L symbol periods (eg '100 symbol periods) (5) 41 201128977 Collecting received symbols '胄 It is stored in memory and processed together. During each iteration of - (4), after entering the next iteration, the block can be re-detected for the current iteration User symbol for all symbol periods in . In this manner, the interference calculation for each symbol period in the block can access the user symbol from the previous iteration of the re-detection of one symbol period and the next symbol period in the block. The received symbols can be processed symbol by symbol. In this aspect, the interference calculation for the current symbol period can use the previously stored re-detected user symbol for the previous symbol period and use the next symbol period for all iterations. The user symbol of the initial detection. In another aspect, the interference calculation for the current symbol can use the user symbol of the initial detection of the previous symbol period and the next symbol period for all iterations. In this aspect, only the user symbol of the current symbol period is updated in each iteration. In the example shown in Fig. 17, the detecting unit 173 initially detects that the user symbol 4(w) is ' This can be similar to the initial measurement in Figure 14. As shown in Figure 17, the initially detected user symbol can be represented by an iterative index - (〇) as a general (five)) Wherein moxibustion = 〇. The interference cancellation unit 175 〇 then uses the user symbol (4) of the initial detection «(0) to calculate the multi-use Λ(1) interference Ζ (/Μ) for the first iteration. And removing the calculated multi-intercept (Ι) user interference Z(10) from the received symbols. The re-detection unit 1760 then removes the received multi-user interference Ζ(8) received symbols i(1) (4) Re-detecting the user symbol 4 (8) for the first iteration of - (1). The user symbol - (4) from the re-detection of the re-(4) unit (10) can then be fed back to the interference cancellation unit 1750 using the feedback path 42 201128977 to Perform another iteration (for example, based on equation (49) _ equation (51)). The detection system 1705 can perform any number of iterations (e.g., one or more times) to refine the re-evaluated user symbols. For example, the detection system 17〇5 can perform iterations until the user symbol for the re-detection of successive iterations converges (example #, the difference between the user symbols for successive iterations is small) and/or meets other criteria. until. In another example, a predetermined number of iterations can be programmed into the detection system 17〇5. In this example, the parent performs an iteration, the detection system 1 75 can increment the counter, and the S s timer stops iterating when it reaches the programmed number of iterations. In one aspect, the feedback path 1752 between the re-detection unit 176 and the interference cancellation unit 175A may include a buffer 1755 for temporarily storing user symbols from the re-detection unit 1760 for the next iteration. . In this aspect, buffer 1755 can be used to store re-detected user symbols on a block of L symbol periods (eg, 1 symbol period) to implement block-by-block as described above. Processing. Although the detecting unit 173A and the re-detecting unit 1760 are separately illustrated in Fig. 17, a common detecting unit can be used to perform both operations. In addition, both detection unit 1730 and re-detection unit 176 can use the same detection technique, such as slicing. In this example, initial user symbol detection can be performed by applying the same detection technique to the received symbol 五 (5). Figure 18 is a flow chart illustrating a multi-user (four) procedure with iterative interference cancellation 43 201128977 in accordance with certain aspects of the present invention. In the operating coffee, the user symbol is initially detected from the received symbol. The sequence is continued from operation 181G to the operation deletion, and in the operation assistance, the user is disturbed. For the first iteration, the user symbol of the initial detection in operation (8) 可以 can be used to calculate multi-user interference. The multi-user interference can be calculated for the subsequent iterations using the re-detected user symbols from operation 1840 in the previous-iteration, which will be discussed below. The program continues from operation 1820 to the operation deletion. In the operation deletion, the calculated multi-user dry program from the operation #1820 is removed from the received symbol from the operation deletion to operation 1840, and in the operation deletion, the n has been The received symbol re-detected user character with the calculated interference removed: J, such as T, to re-detect the user symbol by slicing the received symbol from which the calculated interference has been removed. The sequence continues from operation 1840 to operation 1850, and in operation 185, it is determined whether another iteration is required. If another iteration is required, the program returns to operation 182G to perform the next iteration. In this case, the user symbol from the re-detection of operation 1840 in the previous iteration is used in operation 四 (4) to recalculate the multi-user interference. The recalculated multi-user interference is then removed from the received symbols in operation 1830, and the user symbols are re-detected from the received symbols from which the recalculated interference has been removed in operation 840. The program then continues to operation 185 to determine if a further-human iteration is required. Operation 1820 to operation 185 can be repeated any number of times. J J Jl ί 44 201128977 If another iteration is not required in operation 1850, the currently re-detected user symbol can be output in operation i86. Operation 185 can use any of the above techniques to determine if another iteration is needed. Figure 19 is a schematic illustration of an evening user detection system 1905 with iterative interference cancellation, in accordance with certain aspects of the present invention. The detection system 丨9〇5 can be located in a mobile station in a wireless communication system. The detection system 1905 includes a subtraction unit 191, a symbol detector 192, a buffer 1 93 0, and an interference unit 1 940. The detection system 丨9〇5 receives the received symbol irm) and iteratively performs multi-user interference cancellation and user symbol detection over multiple iterations. The operation of the detection system i 905 will now be discussed by taking the multi-user detection of the user symbol p (9) of the symbol period w as an example. As shown in (4) 4, the multiuser interference is initialized to zero, where the iteration index has no =〇. Therefore, the subtraction metric 1910 initially does not remove multi-user interference from the received symbols and initially inputs the received symbol illusion to the symbol detector 192. The symbol detector 1920 initially detects the user's rune (〇) f-(4) from the received symbols. For example, symbol detector 1920 can initially detect user symbol fh) by slicing the received symbols or using other detection techniques including any of the detection techniques discussed herein. The user symbol β(4) of the initial detection of the symbol period m is temporarily stored in the buffer 1930. Additionally, symbol detector 1920 initially detects the user symbols for symbol periods m-1 and w+i and also temporarily stores them in buffer 1930. The user symbols of the initial debt periods of the symbol periods m-1, m and are then output from the buffer 1930 to the interference calculation unit 45 201128977 1940. The interference calculation unit 194 uses the initially detected user symbols i (〇V IN £(〇), , , -(0) - (9)-), _(four), and -1) to calculate the moxibustion=1 for the first iteration. More than C(1) user interference - (for example, based on equation (49)). To calculate the multi-user interference Z based on equation (49), the interference calculation unit 1940 can receive the multi-user interference matrix and the shoulder matrix from the matrix calculation unit, such as the matrix calculation unit 1 3 1 图 in FIG. (4) 和山^„). In Figure 19, [()] is used to represent these matrices and mountains. The subtraction unit 1910 removes (ie, eliminates) the received symbols for the first iteration. Interference 2(). Enter the received symbol with the calculated multiuser interference Ζ()〇2) removed from the symbol detector 1920

-(1) , X mutual (w). The symbol detector 1 920 re-detects the ^(1) user symbol for the first iteration from the calculated multi-user dry A, ^(1) scrambling-(w received symbol Z(4) All (4). The user symbol S (4) for the re-detection of the first λ(1) iteration can then be fed back to the buffer 193 以便 for use in the second iteration k=l. The interference calculation unit 1 940 is used from the first The re-detected user symbol for the second iteration 'recalculates the multi-user interference 0(2) 〇- for the second iteration. The subtraction soap element 1910 is removed from the received symbol for the second-(2) iteration Multi-user interference - then input to the symbol detector 192 已 λ (2) removes the calculated multi-user interference 四 (4) received symbol f (10). The symbol detector 1920 has been removed from the calculation The multi-user interference (4) received symbol $(10) re-detects the user symbol α(2) all (4) for the second iteration. The interference calculation unit 194 can be fed back to the interference calculation unit 194 via the buffer 1930 for the second iteration. The re-detected user symbol | (2) (d) to perform the third iteration of the 46th 201128977. The detection system 1905 can perform any number of iterations, for example, until the user symbols for successive iterations converge. In one aspect, the interference calculation unit 194 uses the detected user from the previous iteration. The symbols & (-1), f &gt; (4) and P % + 1), &quot;-(Λ-ϊ)' are used to calculate multi-user interference for iterative moxibustion. In Fig. 19, 匕(W)j is used to represent the detected user symbols 4 h-1), Γ%) and f_1) from the previous iteration f1 (m+D. Cell service interval interference is eliminated above the cell Multi-user interference cancellation is discussed in the context of interference within a service area, where multiple user interference is caused by multiple users in the same cell service area (eg, 'multiple users served by the same base station 104) The mobile station 1 〇6 in the wireless communication system may also be interfered by the cell service interval, where the interference is caused by users in other cell service areas. For example, when the mobile station 106 is located near the edge of the serving cell service area, The mobile station 106 may be more susceptible to interference from cell service intervals, where interference from adjacent cell service areas is stronger at the edge of the serving cell service area. Referring now to the example in Figure 1, served by the cell service area 1 〇 2D The mobile station 1 06D may be interfered with by the cell service interval from the cell service area 102F and 1 〇 2G. In one aspect, 'the system for eliminating cell service interval interference is provided' And method. In this aspect, cell service interval interference from one or more interfering cell service areas is calculated and removed (eliminated) from the received chip in the mobile station 106. Moving from the received chip In addition to the cell service interval, the system can process the received chips to detect user symbols for the serving cell service area, for example, using any of the systems and methods described herein. The cell service area is a cell service area corresponding to the desired user symbol and may be referred to as a target cell service area. Figure 20 is a schematic diagram of a cell service interval interference cancellation system 2005 in accordance with certain aspects of the present invention. In this aspect, the cell service interval interference cancellation system 2005 can eliminate cell service interval interference from the received chips. Subsequently, it can be processed, for example, by any of the detection systems of FIG. 6, FIG. 14, FIG. 15, and FIG. The cell service interval interferes with the received chips after the cancellation to detect user symbols for the target cell service area. For example, 'cell service interval interference cancellation The received chips may first be processed as received symbols by the filter and de-amplifying and de-spreading units. A multi-user detection system for multi-user interference cancellation with respect to the target cell service area may then be used, for example, in Figure 19. To detect the user symbol of the target cell service area from the received symbol. The cell service interval interference cancellation system 2〇〇5 includes a respective first cell service area calculation unit, a second cell service area calculation unit, and a The three-cell service area calculation unit 2010a-2010c, and the respective first subtraction block second subtraction block, third subtraction block, and fourth subtraction block 2〇2〇a2〇2〇d. Each cell service area calculation unit 2010a_2〇 1〇c is configured to calculate received chips for the selected cell service area. In one aspect, the first cell service area calculating unit 2〇1〇a calculates a received chip with respect to the target cell service area, and each of the second cell service area calculating unit and the third cell service area calculating unit respectively Received chips for the first interfering cell service area and the 48th 201128977 interfering cell service area. Each of the cell service area calculation units 201〇a_2〇1〇c can be implemented using the exemplary cell service area calculation unit 211〇 illustrated in Fig. 21, which is further detailed below. The cell service interval interference cancellation system 2005 also includes a cell service area sequencing unit 2030. In one aspect, the 'cell service area sorting unit 2〇3〇 can place the interfering cell service area' in a certain order and assign an interfering cell service area to each of the cell service area calculating units 2010b-2010c based on the order. The target cell service area (i.e., the serving cell service area) is assigned to the cell service area computing unit 2〇 1 〇a. For example, cell service area sorting unit 2030 can receive pilot frequency signals from a plurality of interfering cell service areas (eg, from antenna 22A and receiver 200), measure the received signal strength of the pilot frequency signal' and based on the receiver The relative signal strength of the interfering cell service area is used to rank the interfering cell service areas. For example, the interfering cell service area can be ordered by the power of the signal. Therefore, the interference cell service area is assigned to the second cell service area calculating unit 2〇1〇b and the third cell service area calculating unit 2〇1〇c in accordance with the power reduction of the signal intensity. In operation, the 'first cell service area calculating unit 2'a receives the received chip' and calculates and outputs the received chip X〆 about the target cell service area. The first subtraction block 2〇2〇a removes the received chips from the received chips into the cell service area. The output of the first subtraction block 2〇2〇a is input to the second cell service area calculation unit 2〇1〇b. Therefore, the calculated received chip core with respect to the target cell service area is removed from the received chip (1) before reaching the second cell service area calculating unit 201 Ob. This removes the target cell service from the heart of the received chip 4, which is a reliable calculation of the received chips for the interfering cell service area. The first-cell service area calculation unit 2 calculates and rotates the received chip coffee for the first interfering cell service area (e.g., the interfering cell service area having the highest power). The second subtraction unit 2 removes the received chip from the first subtraction unit service area and outputs the second subtraction party ghost 020b to the third cell service area calculation unit 2〇i〇c from the output of the first subtraction unit 2020a. Loss. Therefore, upon reaching the third cell service area calculation unit 2010C, the received chips 々(8) and X〆~ for the target cell service area and the interfering cell service area are respectively removed from the received chip coffee. . This removes the contribution of the target cell service area and the first interfering cell service area from the received chips, enabling a more reliable calculation of the received chips for the second interfering cell service area. The third cell service area calculating unit 2010c calculates and outputs the received chip X3(n) regarding the second interfering cell service area. The third subtraction unit 2020c and the fourth subtraction unit 2〇2〇d respectively remove the calculated reception of the first interfering cell service area and the first interference, • field cell service area from the received chip /^/2) Chips... and h<hearts. Therefore, cell service interval interference from the interfering cell service areas is eliminated from the received chip coffee. The received wafers (i.e., "(8)(9), (8) after the cell service interval interference cancellation can be processed as received symbols for the target cell service area to detect the cells in the user symbol of the target cell service area. The service interval interference cancellation system can perform cell service interval interference cancellation for only one dry 50 201128977 disturbing cell service area by omitting the third cell service area calculating unit 2〇1〇c. In addition, the cell service interval interference cancellation system Cell service interval interference cancellation can be performed for three or more interfering cell service areas by adding additional cell service area calculation units. Although cell services are separately illustrated in Figure 19 for simplicity of illustration. The area calculation unit 2〇丨〇a_2〇〖〇c, but the same cell service area calculation unit can be used to perform the operations of the cell service area calculation units. For example, the same cell service area calculation unit can be used to sequentially calculate different Received chips for the cell service area. Figure 21 is a view of cells in accordance with certain aspects of the present invention. A schematic diagram of the area calculation unit 2110. The cell service area calculation unit 2110 receives the received chip r (n J ' and outputs a received chip xfW regarding the selected cell service area or the working cell service area. The cell service area calculation unit 2110 also The received chip rW having the previously calculated received chips for other cell service areas may be received. The cell service area calculation unit 211 includes a filter 2120, a de-buffering frequency, and a de-spreading unit 213, and detecting The unit 214. The waver 2120 filters the received chips and may include an equalizer and/or a channel matched filter. For the filter 2 1 20 including an example of an equalizer, a frequency domain equalizer (FDE) may be used. The equalizer is implemented. The filter 2丨2 渡 can modulate the received chips based on, for example, channel estimates for the selected cell service area using pilot signals from the selected cell service area. Thereafter, the de-buffering and de-spreading unit 213 解 de-amplifies the received chips using the de-sampling code for the selected cell service area, and de-synchronizes and de-spreads the unit. 2130 then uses a set of cells for the selected cell service area

1 J 51 201128977 The despreading frequency code despreads the de-sequenced signals, each of which can correspond to a different user of the selected cell service area. The de-buffering and de-spreading unit 13 储存 can store a plurality of decimation codes for different cell service areas in the memory and can retrieve the de-duplication code corresponding to the selected cell service area. The solution search and de-spreading single A 2130 output is about the selected cell service area @group received symbols [(4). ^ Detecting unit 2丨4() then detects the user symbol chest from the received symbols for the selected cell service area. Detection unit 214G may use slices or other detection techniques to debate user symbols for the selected cell service area (4). The measured user symbol color rmj provides an estimate of the user symbol at the transmitter end (e.g., base station) of the selected cell service area. The cell service area calculation unit 2110 further includes a gain unit 2150, a spread spectrum and frequency agitation unit 2160, and a chip calculation unit 217A. The gain unit 2150 and the spread spectrum and frequency mixing unit 216 处理 process the user symbol 'in a manner similar to the transmitter end (eg, base station) of the selected cell service area to estimate the transmission from the transmitter end of the selected cell service area Chips. The gain early 2150 applies a set of gains to the user symbol. For example, the gain unit 2150 can apply different gains to each user symbol. An example of a method for estimating the gain is described below. . The spread spectrum and frequency mixing unit 2160 then spreads the user symbols using a set of spreading codes, combines the resulting spread spectrum signals, and frequency-combines the combined spread spectrum signals to produce a transmission slice (4). The spread spectrum and frequency unit 216 can use the same spreading code and agitation code as the spreading code and the agitation code used at the transmitter end of the selected cell service area. Spreading and frequency mixing unit 216 52 52 201128977 to store a plurality of agitation codes for different cell service areas into the memory and retrieve the agitation code corresponding to the selected cell service area. Therefore, the cell service area calculating unit 210 can copy the processing performed at the transmitter side of the selected cell service area to calculate the transmitted chip. The cell service area calculation unit 217〇 then processes the transmitted chips for the selected cell service area to calculate the received chips for the selected cell service area. In one aspect, the 'cell service area calculation unit 2丨7〇 Transmitting the transmitted chip to the channel estimation heart with respect to the selected cell service area to the receiving piece of the selected cell service area. For example, a pilot frequency based channel estimation may be used, depending on the channel from the selected cell service area. The pilot signal received by the base station to estimate channel estimates for the selected cell service area; Figure 22a is a flow chart illustrating a procedure for calculating received chips for a selected cell service area in accordance with certain aspects of the present invention. In operation 22〇5, the user symbol for the selected cell service area is detected. For example, the user symbol for the selected cell service area can be detected from the received chip by performing the operations of the filter 212 〇, the de-buffering and de-spreading unit 2130 and the detecting unit 214 图 in FIG. 21 . . The program continues from operation 2205 to operation 221, where the user symbol of (4) is used in operation 221A to estimate the transmitted chips for the selected cell service area. For example, the transmitted chip can be estimated by processing the detected user symbols in a manner similar to the transmitter side of the selected cell service area. The program continues from operation 2210 to operation 2215 where the received chips for the selected cell service area are calculated. For example, the received chips for the selected cell service area can be calculated by mediating the 53 201128977, u chips and channel estimates for the selected cell service area. It is a flow chart illustrating some of the cellular service interval routines in accordance with the present invention. At operation 2220, the chip is received at the receiver. Received chips can be represented as coffee and include contributions from the target cell service area and/or multiple interfering cell service areas. The received code chip can be a chip that is finely received by the receiver of the mobile station 1G6. The program continues from operation 2220 to operation 2225 where the interfering cell service areas are ordered. For example, it may be ordered based on the relative signal (four) degrees of the multi-f I cells at the receiver. The program continues from operation 2225 to operation 223, in which the received chips for each interfering cell service area are continuously calculated based on the order of the interfering cell service areas. For example, the received chips for the first interfered cell service area may be calculated first from the received chips that have removed the received chips for the target cell service area. The received chips for the second interfering cell service area can then be calculated from the received chip leaves W that have removed (eliminated) the received chips for the target cell service area and the first interfering cell service area. Received chips for each subsequent interfering cell service area may be calculated from received chips from which received chips for the target cell service area and the previously calculated interfering cell service area have been removed. This removes the contribution of the target cell service area and the previously calculated interfering cell service area from the received chips, thereby enabling a more reliable calculation of the received chips for subsequent interfering cell service areas. The received chips for the 54 201128977 Interfering Cell Service Area with higher signal strength are first calculated because they are more reliable than interfering cell service areas with weaker signal strength. The program continues from operation 2230 to operation 2235'. In operation 2235, the calculated received chips for the interfering cell service area are removed from the received chips. After the cell service interval interference is removed from the received chips in operation 2235, the received chips may be processed as received symbols to use any detection technique including any of the detection techniques discussed herein. To detect user symbols about the target cell service area. Figure 22c is a flow chart illustrating a procedure for cell service interval interference cancellation and multi-user detection in accordance with certain aspects of the present invention. In operation 225, for example, the received code for the interfering cell service area is calculated using the procedure illustrated in Figure 22a. In operation 2255, the received chips for the interfering cell service area are removed from the received chips. In operation 2 2 60, the received chips from which the received chips of the interfering cell service area have been removed are processed as received symbols. This can be done, for example, by filtering, de-buffering, and despreading the received chips from which the received chips of the interfering cell service area have been removed. In operation 2265, the user symbol for the target cell service area is detected based on the received symbols. This can be done, for example, by slicing the received symbols. Figure 22d is a block diagram of a mobile station 106 for use in a wireless communication system 1A in accordance with certain aspects of the present invention. The mobile station 1〇6 of Figure 22d includes: a module 2270' for computing a received chip with respect to an interfering cell service area; and a module 2275' for removing the calculated interfering cell from the received chip The receiving chip of the service area. The mobile station 1-6 further includes: a module 55 201128977 2280 for processing the received chips that have been removed (eliminated) the received code for the interfering cell service area into received symbols; and the module 2285 It is used to &lt;specify the user symbol for the target cell service area based on the received symbols. Data-Aided Channel Estimation In one instance, channel estimates are enhanced using user symbols from received symbol detection. This can be referred to as data-assisted channel estimation. Before discussing data-assisted channel estimation, it is useful to first discuss an example of channel estimation based on pilot frequency. In pilot frequency based channel estimation, the pilot frequency signal is transmitted from the transmitter (e.g., base station 104) to the receiver (e.g., mobile station 1 〇 6). The pilot signal is a signal known in advance by the receiver, and the receiver uses the pilot signal to estimate the channel λ between the transmitter and the receiver. Taking CE)MA as an example, the pilot signal can include a known sequence of symbols. Taking a single-user communication system as an example, the transmitted chip at the transmitter can be expressed as: t{n) = bx{n)g\wx{n)p{n) + b2{n)g2Wi{n)p {n) ^ 5 2 ) where is the sign of the pilot signal, and 6〆... is the user symbol for the user. The pilot frequency symbol can also be indicated by a subscript zero. In equation (52), according to the chip index, the pilot frequency symbol is phantomly represented as 6 〆 "^", where the span of # chips corresponds to one symbol (where 7V is the spreading factor). The user symbol is represented as &amp; (8) according to the chip index. By adding additional user symbols for multiple users in equation (52), including its corresponding increase 56 201128977 benefit and spread code The equation (52) can be applied to a multi-user communication system that can represent the received chips at the receiver as channel/2/1, according to the discrete cyclotron and the noise and noise. Cyclotron: ^(«) = 2 h(d)t{n -d) + v(ri) "〇(53) where is the discrete revolving range. The expression about equation (52) is inserted into equation (η)# to: '

D 咖) = 卜细松松咖__师__(8) (54) In equation (54), the pilot symbol (8) is known in advance by the receiver, and the user symbol is not known in advance by the receiver. Since the user symbol is not known to the receiver in advance, the second summation in equation (54) can be combined with the noise as an unknown. Therefore, the received chip factory (8) can be expressed as: , (8) = 办 (4) 6 and _ guest 1 Wl (« — — d) + ν '(«) rf = 〇 (55) where the unknown is provided by :

D ν Χη) = Σ Kd)b2(n - d)g2Wi{n -d)p(n~d) + v(n) rf=0 (56) At the receiver, the received chip r(X&gt; , pilot symbol illusion, spreading code w; (8) and the agitation code are known. Therefore, equation (55) can be used in channel estimation based on pilot frequency to estimate A by using known techniques. Channel h. The pilot frequency symbol 6 can be a constant. In this case, the pilot frequency symbol table rs] 57 201128977 can be simply shown as h in equation (55). Equation (55) can be extended to a multi-user communication system. In this system, user symbols for multiple users can be incorporated into the unknown v丫W because it is unknown to the receiver. In the above example of pilot frequency based channel estimation, reception The pilot uses the pilot frequency signal as a reference signal known in advance by the receiver to estimate the channel 根据 based on the received chip r. One disadvantage of this method is that the power of the unknown signal v 丫 force may be high, which reduces the estimated Channel &amp; precision. In one aspect, the user symbol detected from the received symbol is used. Number to establish a virtual pilot frequency signal, which is used to enhance channel estimation. In this aspect, 'create virtual from the detected user symbol by treating the detected user symbol as a known symbol. The pilot signal is used for channel estimation purposes. The virtual pilot signal is not the actual pilot signal transmitted between the transmitter (eg, base station 104) and the receiver (eg, mobile station 1). Any detection technique, including any of the debt measurement techniques discussed herein, to detect user symbols. In the example of equation (54), the detected user symbol can be used to forget (m) The equation (55) is rewritten as follows: ^(«) - Σ Kd)(bi(n - d)gim(n - according to the chip index "represented as 2()) instead of the user symbol 6〆"). d) + b2(n-d)g2\vi{n - d))p{nd)^v'(n) (57) where the unknown is provided as follows: ^ ^ ^^d^2^n~d^ ~b2in~d))g^{nd)p{nd) + v{ri) (58) Therefore, the detected user symbol r ·*« &gt; i 58 201128977 ~ can be used in equation (57) (n) to establish a virtual pilot frequency signal, Providing an enhanced estimate of the channel; j. As described above, the virtual pilot frequency signal is established by treating the detected user symbol rabbit (") as a known symbol for use in the channel in equation (57) The purpose of the estimation. If the detected user symbol &amp; (8) is close to the actual user symbol 6 〆 "), the power of the unknown signal v 丫 ; ^ can be greatly reduced in equation (57 ), which enhances the channel estimation . Equation (57) can be extended to multiple users by generating multiple virtual pilot frequency signals using the detected user symbols for multiple users. Figure 23 is a schematic illustration of a channel estimation system 23〇5, in accordance with certain aspects of the present invention. Channel estimation system 2305 can be located in a receiver in a wireless communication system. The channel estimation system 239 includes a filter unit 2310 for fetching received chips, a de-sampling and de-spreading unit 232, and a detecting unit 2330. Filter unit 2310 can include an equalizer and/or a channel matched filter (CFM). The de-frequency and de-spreading unit 2320 includes a de-frequency mixer 2315, a plurality of despreading mixers 2322, and a plurality of corresponding summing blocks 2325. The de-buffer mixer 2315 mixes the filtered received chips 〆w with the descrambled code to de-buffer the filtered received chips. The superscript "e" indicates that the filtered chip is used to estimate the channel. The despreading mixer 2322 then mixes the despread frequency signal with the set of despread codes w*〆&quot;. The despread signal from each despread mixer 2322 is input to a respective summation block 2325 which accumulates the despread signal over a symbol period to produce a corresponding user&apos;s Receive symbols. Inputting the received symbols to the detection unit 59 201128977 2330 The preamble unit 2330 detects the user symbols #(4) to 夂() from the received symbols. Detection unit 2330 can use any detection technique, including slicing or any other detection technique discussed herein. If the user symbol - corresponding to a known pilot frequency symbol, the known pilot frequency symbol can be rotated (e.g., from memory) as one of the user symbols (4) to slave (10). Channel estimation system 2305 further includes a gain unit 2335, a spread spectrum and frequency agitation unit 2340, and a channel calculation unit aw. The gain unit Mb includes a plurality of gain mixers 2337 that apply a set of gain heart-to-centers to the user symbols &lt;(4) to 匕(4) of the debt test. The spread spectrum and frequency mixing unit 2340 includes a plurality of spread spectrum mixers 2342, combiners 23, and a mixer mixer 2345. The spread spectrum mixer 2342 combines the gain-scaled user symbol with a set of spread code ～0) to the hybrid 'combiner 23q to combine the spread spectrum signal' and the frequency-mixed H 2345 # address combined signal and scrambling Code. The spreading code and the pilot code can be the same as the spreading code and the agitation code used by the transmitter, so that the output f(w) of the spreading and frequency-stamping unit U牝 is sent to the transmitter. The estimated leaf of the chip. The round-trip and frequency-stamping unit 234〇 can be provided as follows: ί («)=成(n)giwi〇i) + ...+1 (8)g2W2(„))p(„) ( 5 $ ) where according to the chip index „To indicate the detected user symbol, the symbolic heart in equation (59)—11 is a known pilot symbol in the channel and the other symbols are the detected user symbols. Calculating the estimated transmitted by obtaining the 'W for the measured user symbol and the pilot symbol based on the detected user symbol and the known reference - 4. _ μ Hong Fu number Chips such as &amp; = are frequencyd to [S] because W provides 60 201128977 estimates of the transmitted chips, so the received chips can be represented by small rounds with the channel &amp;

D (four) (60) What about equation (59)? The expression of (") is inserted into the equation (6〇) to get: /*(8)=g V)(10)„ -咖-_ +. +匕(„ _ 咖岭(61) Channel estimation unit 2050 can then use from the spread spectrum And the wheeling () of the frequency-stamping unit 234, the received chip factory (5), and the equation (6〇) to estimate the channel. In this aspect, the detected user symbol 'to the person in equation (61) () is considered a known symbol for the purpose of channel estimation. This reduces the power of the unknown signal v, thereby enhancing the channel estimation. In one aspect, it can be calculated on the chip length 3 as follows. The cross-correlation of the received chips (9) with the estimated transmitted chip %) to obtain the scaled channel estimate" (/): A Λ Σ « « & * * * * * * * * * * * * * * * * * * * ^--- A ( 62) where () is the scaled channel estimate at the chip/section. The channel calculation unit 23 50 may provide the channel estimate 'to calculate the matrix center, 'or other system to the matrix calculation unit 丨 31 图 in FIG. 13 . The data-assisted channel estimation provides a more accurate channel estimate &amp; More accurate calculation of the matrix 1 plant 30. In addition, the channel calculation unit 2350 can provide the channel estimate to the filter to calculate the filter coefficients of the filter Γ η - Λ ί 2 s 61 201128977. For example, it can be forwarded to the front end The filter 210, 1410, 1510 or any other waver provides the data-assisted channel estimation. The filter 231 in the channel estimation system 239 can use the channel estimate derived from the pilot-based channel estimation. Since the data-aided channel estimation is performed after the filter 23 10. In one aspect, the gain unit 2335 can apply the same or different gains at the mixer 2337 based on an estimate of the corresponding gain at the transmission end. The detected user symbols β(4) to 匕(4). In one aspect, the channel leaf nose unit 2350 can compare the gains to the gain thresholds. To exclude user symbols with low gain, such symbols may be less reliable when estimating channels. In this aspect, 'gains above the gain threshold are applied to their respective user symbols 10(10) to 匕(8) and used For estimating the channel, the gain below the gain threshold and its respective user symbols (4) to &amp; (W) are not used to estimate the channel. The gain unit can also apply a uniform gain to the user symbol. An aspect of the invention is a program for estimating gains for different user symbols. In this aspect, each of the successive pilot symbols w and w+1 is differentially estimated to estimate each The gain of the user symbol or code channel, which can be provided as follows: □Z〇(//1) = z〇— z〇+1) ( 63 ) where the subscript zero represents the pilot frequency symbol. It is assumed that the pilot frequency symbol is transmitted for Each symbol period is the same 'the difference between the received pilot symbols is due to noise. Therefore, the 'guided frequency difference provides an estimate of the noise at the receiver. It can be as follows, Estimating the noise power & 2(/w) based on the difference of the received pilot frequency 62 201128977 symbol: 0-2(m) = + (1 _ 1} (64) . You can use unlimited with one tap point The impulse response (loss) filter is used to implement equation (64), where α is the filter coefficient and is the noise power estimate for the first - symbol period. For the cell service area that has been estimated (10), the noise can be Power ~) Estimate the user or code channel applied to the cell's service area. The power of the code channel ί can be provided as follows: 2 (65) where '()疋 is related to the code channel corresponding to one of the usersζ The received symbol. An nR with one tap point can be used; the equation (65) is implemented by the filter [where a is the filter coefficient and the team is like "!") is the power estimate from the previous symbol period w-i. Then you can estimate the gain &amp;amp; (4) for the code channel or user as follows: &amp;, 0) = /, 〇7)-&amp;2〇) (66). The initial value of the noise power can be It is zero. The gain unit 2335 can calculate a set of gains A to phantom/« applied to the user symbols (m) to ( \ m detected by the respective equations based on equation (66). The gain estimation technique can also be used to estimate the gain matrix. Gain of G. In one aspect, 'Before performing the data-assisted channel estimation, the waver 2310 can use the channel estimate A provided by the pilot-based channel estimation. In this aspect, the channel calculation unit 235〇 The total filter, wave c can be estimated using the output_ye of filter-filter 2 3 10 as follows (...: 63 201128977 Λ(«) = £ο(ίί)?(η-£/) + ν.(η D--° ( 67) The above equation is similar to equation (60), where the filter output is provided by ?(") and the total filter's convolution: the channel calculation unit 2350 can use the spread spectrum and frequency mixing unit 234〇 The output ί(„), filter output h(9), and equation (67) are used to estimate the total filter. It can also be similar to equation (62) by calculating the filter output with less e~; and the estimated transmitted chip ( Cross-correlation to estimate the total filtering $c(f), which uses the wave The slice L is used instead of the received chip 中 in the cross-correlation. The filter 2310 can be based on the received channel estimate using the pilot-based channel estimation or the data-aided channel estimation of one symbol period delayed by one channel. ^ Perform filtering. Further, the channel calculation unit may supply the estimated total chopper c to the matrix calculation unit (for example, the matrix calculation unit 131A). In this case, the matrix calculation unit does not have to make the channel estimation 0. The new H/parameters are used to calculate the total waver. In this state #, the channel calculation unit 235〇 can receive the output of the chopped wave from the filter 23 1 , to estimate the total m. (8). A flow chart showing the channel estimation procedure at the receiving station according to some aspects of the present invention. In operation ,, the received chips can be processed into received symbols. For example, the pure code # can be processed. The wave, and then de-sampling and de-spreading it into received symbols. The program continues from operation 2400 to operation 241, and the user symbol is received from the received symbol in operation 241. For example, The received symbol is sliced to detect the user symbol. Other detection techniques can also be used. The program continues from operation 2410 to operation 2415. In operation 2415, the transmitted code is estimated based on the detected user symbol. This may be accomplished by, for example, spreading and scrambling the detected user symbols to estimate the chips transmitted from the transmitter. The program continues from operation 2415 to operation 2420, in operation 242. Estimating the channel using the received chips and the estimated transmitted chips (eg, based on equation (6〇)). Figure 24b is a diagram of a wireless communication system used in accordance with certain aspects of the present invention. A block diagram of the mobile station 106. The mobile station 1-6 of Figure 2413 includes: modulo '' and 2450' for processing received chips as received symbols; and modulo 2455 for detecting user symbols from received symbols. The mobile station 106 further includes: a module 246〇 for estimating the transmitted chip based on the detected user symbol; and a module 2465 for basing based on the received mat and the estimated transmitted chip To estimate the channel. Figure 24c is a flow chart illustrating the procedure for estimating the total ferrocoupler c(9) in accordance with certain aspects of the present invention, wherein the total filter dead (nine) represents the loop of the channel and the filter/. In operation 247, the received chips are filtered by the filter at the receiver. The program continues from operation 2470 to operation 2475, where the processed chips are processed into received symbols. For example, the filtered chips can be descrambled and despread into received symbols. The program continues from operation 2475 to operation 248, where the user symbol is detected from the received symbol. For example, the user symbol is detected by slicing the received symbol. Other detection techniques (5) 65 201128977 can also be used. The program continues from operation 2480 to operation 2485, where the filtered chip and the detected user symbol are used to estimate the total filter (e.g., based on equation (67)). For example, the detected user symbols can be spread and buffered to estimate the transmitted chips at the transmitter. In addition, the detected user symbols can be used with one or more known pilot symbols to estimate the transmitted chip. The total filter can then be estimated using the transmitted chips and filtered chips of the estimated juice. [Heart (for example, based on equation (67)). Efficient Detection of Quadrature Amplitude Modulation (QAM) Symbols In accordance with certain aspects of the present invention, an efficient system and method for detection of QAM symbols is provided. In one aspect, the qam symbol is detected by decomposing the corresponding QAM cluster into multiple sub-clusters (eg, a QpsK cluster), detecting the components of the QAM symbol corresponding to the sub-cluster, and combining the detected The measured component is used to detect the qAM symbol. The QAM can be i 6 QAM, 64 QAM or any other M-order qAM. An example of qAM is useful before discussing the use of clustered decomposition of QAM symbol detection. Figure 25a is a diagram of an exemplary 16 QAM cluster. The 16 QAM cluster consists of 16 cluster points 2510 representing 丨6 different composite values for a 16 qAM symbol. The 16 QAM cluster is divided into four quadrants 255〇a-2550d, each of which has four of the 16 cluster points 251〇. Each cluster point 2510 has an in-phase (I) component and a quadrature (Q) component that can correspond to the real and imaginary parts of the respective symbols, respectively. A 16 qam symbol carries four bits of information. 66 201128977 Figure 25b is a diagram of an exemplary quadrature phase shift keying (QpSK:) cluster. The QPSK cluster consists of four cluster points 25 12 representing four different values for a qpsK symbol. The QPSK cluster is partitioned into four quadrants 2552a 2552d, each of which has one of the cluster points 2512. The QpSK symbol carries two bits of information. Figure 26 is a diagram of a 16 QAM cluster that is broken down into two sub-clusters in accordance with one aspect of the present invention. The first sub-cluster 262 〇 includes four cluster points 261 〇 a_2 610d centered at the origin of the 16 qAM cluster. The first sub-cluster 2620 has one cluster point 261〇a-2610d in each quadrant 245〇a_245〇d of the 16 QAM cluster, respectively. The second sub-cluster 263 〇 includes four cluster points 2650a-2650d centered on one of the cluster points 261 〇 a — 261 〇 d of the first sub-cluster 2620. The cluster points 2610a-2610d centered by the second sub-cluster 263〇 depend on the quadrants 2450a-2450d in the 16 QAM cluster corresponding to the desired QAM symbols. In the example shown in Figure 26, the desired QAM symbol corresponds to the quadrant 245〇a of the 16QAM cluster. In this aspect, the first sub-cluster 2620 is represented by a QPSK cluster, where the magnitude of the QPSK cluster point is scaled with a factor of 2, and the second sub-cluster 2630 can be represented by a QpsK cluster. In one aspect, the 16 QAM symbols can be represented as the sum of the components V and y corresponding to the first sub-cluster and the second sub-cluster, respectively, as follows: kV + V equation (68) in this aspect and first The sub-cluster and the combined component and detect the 16 QAM symbols by detecting the respective components and 62 corresponding to the first sub-cluster and grouping to detect the 16 QAM symbols. 67 201128977 QAM cluster decomposition can be applied to other QAM clusters except the 16_qAM cluster. For example, a 64 QAM cluster can be broken down into three sub-clusters (e.g., a QpsK cluster) by extending the method for decomposing the 16 QAM cluster to a 64 qAM cluster. In this example, the 64-QAM symbol can be detected by three components corresponding to the three sub-clusters of the group σ 64 QAM symbols. Figure 27 is a schematic illustration of a multi-user a qam detection system 2705 in accordance with certain aspects of the present invention. The detection system can be located in a receiver in a wireless communication system. The detection system 2705 includes a first detection drought element 2710, a target unit 2720, a buffer 2730, a reconstruction unit 274A, a subtraction unit 2750, and a second detection unit 2760. In one aspect, the first detection unit 27 i 〇 can include a QpSK slicer' that is configured to receive symbolic illusions and detect QPSK symbols for each received symbol. The first detecting unit 2710 can detect the QPSK symbol regarding the received symbol based on the symbols of the real and imaginary parts of the received symbol. For example, if the symbols of the real and imaginary parts of the received symbol are both positive, the first detecting unit 2710 can detect, for the received symbol, the cluster point 251 中 in the quadrant 2552a of the QPSK cluster. QPSK symbol. The first detecting unit 271 can also use the minimum distance detection 'minimum distance detection to determine the cluster point having the smallest distance from the received symbol. The QPSK symbol ' for each received symbol is then scaled by the scaler 2720 to obtain a first detected component scaler 2720 for the i6_qam user symbol of the received symbol by scaling the QPSK symbol to correspond to This is done by one of the cluster points .2610a-2610d in the first sub-cluster 2620, 68 201128977. Buffer 2730 stores the first detected component (4) of the received symbols over a plurality of symbol periods. In one aspect, the buffer stores the first detected component of each of the symbol periods m-1, w, and w+i, k ipt) to represent the first detected component €(four), ^+1). In Fig. 27, -() ' : (4), $(7W + 1). The reconstruction unit 2740 then reconstructs the portion of the received symbol that is contributed by (10): the first detected component of the individual user symbol ί 〇); and the symbol period 丨, w, and 丨+丨 respectively A multi-user interference caused by the measured components ^ (^), S (four), £^ + 1). The reconstruction unit 247 can calculate the production (4) as follows: Strict (10) = 77J + /), = Sale ~ (69) where G is the diagonal gain matrix ' and a denotes the matrix meaning j, respectively, where /=-1, 0 and Used to represent the matrix in Figure 27 ( dd + . The subtraction unit 2750 removes the production from the received symbols as follows (4): = z(m) -150 (jn) ( 7 0 ) where mutual (4) is removed The received symbol of (10). The operation in equation (70) removes the portion of the received symbol y(4) contributed by the first detected component S(4) of the respective user symbol έ(π), which is allowed by sc 5 (4) Perform QPSK slicing to detect the second heart of the user symbol &amp; rn). The operation in equation (7〇) also removes the first component S (speak-1), S(m), S(w + 1) caused by the symbol period w1, and w+1, respectively. User interference. This provides a multi-user interference cancellation that achieves a more accurate detection of the second component (9). The first detecting unit 2 7 6 0 then detects the desired user symbol two (four) second component ί Ο from the mutual (m). The second detecting unit 2 7 6 can achieve this operation by performing QPSK slicing on the production (8). The combiner 277 then combines the first component all (four) with the respective second component all (four) to obtain the detected user symbol for the received symbol. Thus, the multi-user 16 QAM detection system 2705 of FIG. 27 decomposes the received 16 QAM symbols into two components, wherein a sub-cluster (eg, a QPSK cluster) is used to detect each component and in the second component. Multi-user interference from the first component is removed prior to detection to enhance detection. Figure 28a is a flow chart illustrating a procedure for multi-user sub-cluster detection in accordance with certain aspects of the present invention. In operation 28, the first component of the user symbol is detected from the received symbol. Taking 16 QAM detection as an example, the first component of the user nickname may correspond to the first sub-cluster 2620 of the 16_QAM cluster. ', the μ program continues from operation 2800 to operation 281, in operation 281, the first component of the user symbol in the received symbol and the multi-user interference due to the use of: the first component of the symbol For example, the portion of the received symbol can be calculated based on equation (69). The program continues from operation 2810 to operation 282, in which the second component of the user symbol is measured from the received symbols of the portion of the beta calculation. The program continues from operation 2820 to operation 283. In operation 283, the first component of the detected user symbol of 70 201128977 is combined with the respective second component of the user symbol to detect the user symbol. _ 28b is a block diagram of a mobile station 1G6 used in a wireless communication system 100 t according to certain aspects of the present invention. The mobile station of the map includes: a module 2850 for processing received chips into received symbols; and a mode, and 2855, for detecting the first division of the user symbol from the received symbols . The motion station 106 further includes: a module 286〇 for calculating a portion of the received symbol caused by the first branch of the user symbol; and a module 2865' for calculating the calculated based on the removed A portion of the received symbols are used to measure the second component of the user symbol. The mobile station includes a module 2870' for detecting a user symbol by combining a first component of the user symbol with a respective second component of the user symbol. 29 is a schematic diagram of an instant user-user QAM detection system 2905 with iterative interference cancellation, in accordance with certain aspects of the present invention. The detection system 29〇5 can be located in a receiver in a wireless communication system. The detection system "includes a subtraction unit 2910, a re-detection unit 292", a buffer 293", and an interference calculation unit 2940. In one aspect, the interference calculation unit 294 uses a slave sub-cluster detection system (eg, a map) The sub-cluster detection system 27〇5) detects the user symbol of the user as the initial detected user symbol to calculate multi-user interference for the first iteration. For example, the interference calculation unit 294 〇 You can use the symbol period state, calendar and square + from the sub-cluster detection system to detect the user symbols '-1), &amp; 〇, and ((/?1+1), based on Equation (49) is used to calculate the multi-user interference for the symbol period. In Figure 29, 71 201128977 The iterative index a of the detected user symbol ^(8) from the sub-cluster detection system is zero because it is the user symbol for the initial detection. The subtraction unit 2910 removes (subtracts) the multi-user interference | (1) (9) calculated for the first iteration (A:=l) from the received symbols. The re-detection unit 1920 then re-detects the user symbol from the received symbol 2 (w) from which the calculated interference has been removed. In one aspect, the re-detection unit 2920 performs a single-user maximum likelihood detection (MLD) for the received symbols 1(1)(4) from which the calculated interference has been removed as follows: '♦, 卞(4)(d)- [object] uHf (71) where for the first iteration moxibustion = 丨 ' z • is the user index, [4 (m)], + f is used for the use of f received symbols and for the user / The coefficient of the matrix A 相关 associated with the desired user symbol, and ό is a possible cluster point. The MLD operation determines that the cluster point b 使得 that minimizes the error probability can be fed back to the interference calculation unit 294 via the buffer 293 to the user symbol |(1) (9) for the re-detection of the first iteration, so that the The first iteration of the symbol period - i user symbol, P%), m, and m + 1 each re-detected - (1) _ (W + 1), to recalculate for the second time Iterative multiuser interference z()(rn). The calculated multi-user interference f)(m) for the second iteration can then be removed from the received symbology, and the user symbol for the second iteration is re-detected at 290i. 4 The system can perform any number of iterations (to refine the re-detected user character 72 201128977 -&lt;jt) number (4). To simplify the calculation, the interference calculation unit 2940 can use the initial detected user symbols of the symbol periods m-i and m + i for all iterations, in which case only the user symbols of the symbol period w are updated. User symbol detection and interference cancellation in the presence of multiple spreading factors - provides a method for performing user symbol detection and interference cancellation in the presence of multiple spreading factors, in accordance with certain aspects of the present invention And system. In one aspect, the communication system can spread the user symbols using codes with different spreading factors. For example, a communication system based on the Universal Mobile Telecommunications System (UMTS) can support communication protocols using different spreading factors. The communication protocols may include High Speed Downlink Packet Access (HSDPA) and Release 99 (R99)' where HSDPA has a spread spectrum factor 16, R99 may have a spread spectrum factor of 2k, where k is between 2 and 8. Codes for different spreading factors can be selected based on an Orthogonal Variable Spreading Factor (OVSF) tree or other means. Figure 30 illustrates a diagram of an exemplary 'exemplary OVSF tree in accordance with the present invention. The OVSF tree includes multiple levels, each of which corresponds to a different spread factor. Figure 3A illustrates the first four levels of the OVSF tree corresponding to the spreading factor (SF) 1, 2, 4, and 8, respectively. The tree level for each spreading factor includes a set of codes that are orthogonal to each other. For example, the tree level for SF = 4 includes a set of four mutually orthogonal codes 3020a-3020d. The code at each spreading factor has multiple subcodes at the more advanced spreading factor. For example, code 3010a at § ρ = 2 has two subcodes 3020a-3020b at SF=4, four subcodes 3030a-3030d at ti 73 201128977 SF=8, and so on. Its subcode is treated as a parent. For example, code 3 〇 1 〇 a can be treated as parent code by its subcodes 3020a-3020b and 3030a-3030d. Each parent code has two direct subcodes in the next tree level. For example, code 3010a has two direct subcodes 3020a-3020b in the next tree level. For each parent code, the first direct subcode is a sequence containing the parent code that is repeated twice, and the second direct subcode is a sequence containing the parent code followed by the inverse of the parent code. For a parent code, each subcode can be represented by a sequence containing parent code that is repeated multiple times, where each repetition of the parent code is multiplied by a factor of one or a negative one. In addition, for the parent code, each of its subcodes is orthogonal to other code at the same spreading factor as the parent code and its subcode. A method for performing symbol detection and interference cancellation in the presence of two or more different spreading factors will now be discussed in accordance with an aspect of the present invention. In one example, there is a horse spreading code at the spreading factor of 16, and there are one spreading code at the spreading factor 256. In this example, in a UTMS based system, the spread code at the spread spectrum factor 16 may correspond to the HSDPA signal, and the spread code at the spread spectrum factor 256 may correspond to the R99 signal. Spreading factors 16 and 256 are only examples of possible spreading factors, and other spreading factors can be used. The user symbol and gain with respect to the spreading factor of 16 can be expressed by the sum, ..., and 7, respectively, and can be respectively A, , · . . . } N2 and gl, ..., The user symbol and gain for the spread spectrum factor of 256 are represented by 2'. The use of the spread factor μ can be used. 74 201128977 The symbol b;, ... &gt; r ^ , θ « heart; expressed in the form of a face, which is used for the spread factor 16 (4) index, and the user symbol bu, ..... about the spreading factor can be expressed as a pan in vector form, JL tb , w is a symbol index for the spreading factor 256. In this example, a symbol period of the user symbol .....bN2 at the spread spectrum factor 256 spans the user symbol at the spread factor 16 沁........ Heart/16 symbol period. The spreading code for the user symbol at the spreading factor of 256 can be represented as a sequence of 16 repetitions containing the parent code at the spreading factor of 16. Figure 31 is a diagram illustrating 16 repeated spreading codes for the user symbol heart at the spreading factor 256, including the parent code w. Multiply each repetition of the parent code by a factor ai[m] equal to one or negative one, where w is the symbol index for the spread spectrum factor of 16, and z• is the code index, for the spread factor 256, The range is from 1 to. In one aspect, the spreading code at the spreading factor of 256 is applied to the ice, sharing a common parent code w at the spreading factor 16, wherein the parent code w is orthogonal to the use at the spreading factor of 16. Each of the spread codes w; to vvw such that the spread codes at the two spread factors are mutually orthogonal. An example of this is illustrated in Figure 32, where % of the codes available at the spread spectrum factor 16 are assigned to the spread spectrum code, and one of the above codes is assigned to the exhibition at the spread spectrum factor 256. Frequency code W7' to

The parent code w of WiV2 ’. In one aspect, the user symbol for the spread spectrum factor 16 can be initially detected as follows: ί Si 75 201128977 b(m) = slice(z(m)) (72) where ^0) is the debt test The user symbol and is the received symbol for the spread factor of 16. The received symbols can be obtained by de-sampling and de-spreading the received chips using the de-sampling code and the de-spreading code for the spreading factor 16, respectively. The user symbol for the spread spectrum factor 256 can also be initially detected as follows: bXm') = slice(zXm')) (73) where is the detected user symbol and 2 gamma,) is about the spread factor 256 received symbols. The received symbol g'K) can be obtained by de-emphasizing and de-spreading the received chips using the de-spreading code and the despreading code for the spreading factor 256, respectively. In one aspect, the combined interference estimate can be calculated at the spread spectrum factor of 16 based on the user symbols for the initial guess of the two spreading factors as follows:

Zc(^)= X (74)

A where L(d) is a combined user symbol comprising the detected 甩 symbol 仏 ") for the spreading factor 16 and the detected user symbol for the spreading factor 256 over the symbol period w projection. The user symbol 匕 (4) of the combination can be expressed as: k (m)

A 6wl〇) (75 where the bottommost item represents the detected use of the spread spectrum factor of 256. 201128977 := in the symbol period...projection... to provide a user symbol for each (four) measurement of the exhibition 56 to the projection The contribution, in which the private is the individual gain, ", [called the coefficient used by the right 綷 at the symbol week for the respective spreading code, is the user symbol of the initial detection at the spread spectrum 6 (eg ' Based on square (four) (73)), and the magic is the code index of the heart spread factor W, the range is from ^1. In this example, each user character about the initial spread factor of 256 is in the The 16-symbol period w of the spreading factor of 16 is odd. The diagonal gain matrix can be expressed as: Γ^ι

G 0 76) The center to 仏 is the individual gain of the user symbol at the spreading factor of 16' and the coefficient one reflects that the user symbol at the spreading factor 256 is considered in the equation (68). Gain. It can be as follows: Normalize the gain &amp;·: (m) λ bm(m) ί in the equation (76), 'a, [/w] 4' factory ~ η kcim) : 77) which is provided by:

Si=g(' 'twr 78 in this case' gain matrix (5 is provided below · 77 79) 201128977

G

Sm JEs V /=1 The matrix a 乂〇, 3/ ′ can be calculated based on equation (28) _ equation (3〇), where the spread spectrum matrix 妒 can be expressed as:

Wl

Wm W (80) where is the spreading code for the user symbol at the spreading factor of 16, and the positive one is the parent code for the spreading factor of the spreading factor of 256 at the spreading factor of 16. In this example, a column vector comprising 16 chips is used to represent each of the spread code; to and the parent code and ^. Spreading moments The array can be an iVx# matrix, where # corresponds to a spread factor of 16. In this example, there may be up to 15 spreading codes for the spreading factor of 16 (eg, #尸15), as one of the above available spreading codes is used for spread spectrum with a spreading factor of 256. The parent code of the code. The total filter matrix C and the aliasing matrix corpse can be derived based on equations (24) and equations (19), respectively, where dimension # corresponds to a lower spreading factor (e.g., for the above example, 16). In this aspect, the combined interference 4 (岣 illustrates multi-user interference from user symbols for two spreading factors, and the B (four) is calculated at a lower spread factor (eg, 16) level. This simplifies the interference calculation. After the combined interference is calculated, the combined interference can be removed from the received symbols ?/mj at the spread spectrum factor 16, wherein the received symbol packets 78 201128977 include the spread spectrum The received symbols of the user symbol at factor 16 are obtained by despreading the demodulated received chips by 7 to ~ (4) and by the parent code ice based on the code at the spreading factor 256. The symbol has been received. The received symbol can be provided as follows: coffee) z{m) = zm(m) U, (9) J (81) where ^ to ~ (4) is the received corresponding to the user symbol at the spreading factor of 16. Symbol, and is a received symbol based on the parent code. The received symbols from which the combined interference has been removed can be expressed as: z(m) = z(m) - ^(/w)G0c(»2 + l) Form one (82) where the expression is removed Received symbols after interference. The received symbols 2(w) from which the combined interference has been removed include: l/m) to, which corresponds to the user symbol with respect to the spreading factor of 16; and ΐ '(π), which is based on the spreading factor 256 parent code w. Removing the combined interference from the received symbols provides for the elimination of multi-user interference from the user symbols at the two spreading factors. This achieves a more accurate re-detection of the user symbols at the two spreading factors, as will be discussed below. In one aspect, the user symbols for the spread spectrum factor 16 are re-detected using the received symbols from which the combined interference has been removed. You can use the slice as follows to re-measure each user symbol with a spread factor of 16: 4 (four) = no /ce {cafe) + [fl. (4)];g,i,(d)} (8 3 )

A is the user symbol of the re-test and z• is the code index for the spread spectrum 79 201128977 number 16, which ranges from i to. The contribution of the initially detected user symbol 四(4) is re-added using |αβ(4)](10), which is removed by the calculated combined interference in equation (82). The h(m)],., term represents the coefficients of the matrix in the /row and ζ· columns. In one aspect, the received symbol 2(m) from which the combined interference has been removed is used to re-debate the user symbol at the spreading factor 256. In order to re-detect the user symbols at the spread spectrum factor 256, 16 corresponding received symbols at the spread spectrum factor 16 are calculated and then coherently combined to estimate about the spread spectrum factor 256. The received symbol of the user symbol. Each of the 16 received symbols at the spread spectrum factor 16 that contributes to the received symbols at the spread spectrum factor of 256 may be represented as: '(10)=Γ(_[α.(四) KU ·V ( 8 4 Where z'(iv) is the received symbol '/« at the spreading factor 16 from which the combined interference has been removed is the symbol index for the spreading factor 16, and z• is the code index for the spreading factor 256 , the range is from i to. Use ί. (a) L, w J k : the item to re-add the initial detection of the user's symbolic heart, which is removed by the calculated combination interference in equation (82) The received symbols V(w) over 16 symbol periods are calculated, VO) is multiplied by the respective coefficients and then combined coherently. The combined received symbols are then sliced as follows to detect user symbols for a spread spectrum factor of 256:

(85) Λ where is the user symbol for re-detection at a spreading factor of 256. 201128977 Figure 33 is a diagram illustrating re-detection based on the equation (factor 264 of factor 256) and equation (U), with respect to S., . At block 33, block 331 is called (M6, the coffee is calculated for symbol periods (4) through _16, respectively, where ζ·(d) is based on the received symbols of the parent code from which the combined interference has been removed (eg, based on equation (82)). Adder 3320-1 to addition 339 η μ, J times benefit 3320-16 and then for symbol period W=1 to ί ί=16 Ι·α〇(4) private '4' box &amp; ), item and (w) The initial detected user symbol V corresponds to the time symbol to be re- (four), and it is strange for the symbol period 7W = 1 to w = 16. Adder 3320-1 to adder 332〇 The output of _16 yields 16 received symbols z at the spreading factor of 16 in block 333 (M to block 3330_16, respectively) (eg, 'based on equation (8 4 )). Each received symbol f, (/n) contributes to the received symbols corresponding to the user symbols to be re-detected at the spreading factor of 256. Multiplier 3340-1 to multiplier 3340_16 then 16 received symbols ^(4) The respective coefficients AM are multiplied, and the adder 335 〇 combines the received symbols. The adder 335 is then paired by the slicer 3360. The output of 0 is sliced 'to re-detect the user symbol at the spreading factor of 256 (eg, based on equation (85)). User symbols for re-detection of the two spreading factors can be used in the iterative process, To further refine the re-detected user symbol. In this aspect, the re-detected user symbol from the previous iteration is used to recalculate the combined interference for iteration &amp; and according to the following expression Removed from received symbols: 81 201128977 'One, ., 丨 (86) where A is the iterative index. Then according to the following expression, the user symbol for the spread factor 16 is re-tested for the iteration: b\k \m) = 5//ce{zf(w) + [a0(m)].f (87) It is also possible to re-detect the user symbol for the spreading factor of 256 for iteration & zM) = ^{k\rn) + {a0{m)]NNa\m]gi^&lt;k^ \ 〇〇) bi ,(i) = SliceWa, [τη]ζ,. '(w) j U = i J ( 89 ) Figure 34 is a multi-user detection capable of detecting symbols and performing interference cancellation for multiple spreading factors in accordance with certain aspects of the present invention. A schematic of the system 34〇〇. The detection system 3400 includes a de-sampling unit 34〇5, a first de-spreading unit 3410, and a first slicer unit 3450. The de-buffering unit 34〇5 de-asserts the filtered received chips with a de-spreading code, and the first de-spreading unit 3410 uses the de-spreading code pair with respect to the spreading factor of 16 to de-frequency-distributed The chip is despread. The first despreading unit 3410 outputs a set of received payouts' for the spread spectrum factor 16 which may be provided by equation (81). Received symbols? /wj may include received symbols 4 (four) to ~ (nine) obtained using the despreading code for the spreading factor of 16. As mentioned above, has the symbol been received? /w) may also include the received symbol ^((4) obtained using the parent code of the despreading code of the spreading factor of 256. The received symbol ^((9) to the caller is input to the first slicer 3450, which The received symbols Mm) to ~ ((9) detect the user symbol 关于 about the spreading factor 16 (called (for example, based on Equation 82 201128977 (72)). The detection system 3400 also includes the second de-spreading unit 342〇 And the second slice benefit unit 兀 3460. The second de-spreading unit 342 解 despreads the de-amplified chips using the despreading code of the spreading factor 256. The de-spreading unit 3420 outputs the exhibition. A set of received symbols having a frequency factor of 2S6, where w is a symbol period corresponding to 256 chips. The received symbols are mutually input, (m·) is input to a second slicer 3460, which detects from the received symbols The user symbol Hm1) of the frequency factor 256 (for example, based on the equation). The detection system 3400 further includes an interference cancellation unit 347A, a re-detection unit 3475, and a parameter calculation unit 348. The interference cancellation unit 347 The first slicer unit 3 4 50 receives the spread spectrum factor of 16. The detected user symbol &amp; (w), and the detected user symbol for the spread spectrum factor 256 is received from the second slicer unit 346. The interference cancellation unit 347 uses the two spread factor factors. The detected user symbol is used to calculate the combined interference' and the combined interference is removed from the received symbols at the spread spectrum factor 16 (eg, based on equation (82)). The re-detection unit 3475 then removes the removed The calculated received symbols of the interference re-detect the user symbol for the spreading factor of 16 (eg, based on equation (83)). The re-detection unit 3475 also re-detects the received symbols from which the calculated interference has been removed. The user symbol for the spread factor 256 is measured (eg, based on equation (84) and equation (85)). The user for the re-valuation of the two spread factors can be fed back to the interference cancellation unit 3470 via the return path 3485. The symbol beta interference cancellation unit 3470 can then recalculate the group 83 201128977 combined interference using the re-detected user symbol and remove the recalculated combined interference from the received symbols. (For example, based on equation (86)). Re-detection unit 3475 then re-detects the user symbol for the spread spectrum factor 16 from the received symbols from which the recalculated interference has been removed (eg, based on equation (87)) The re-sampling unit 3475 also re-debies the user symbol for the spread factor 16 from the received symbols that have removed the recalculated interference (eg, based on equation S (88) and equation &lt; (89)) The above iterations can be repeated for a number of times in order to refine the use of the re-detection. In the figure, the superscript for the user symbol is an iterative index, where for the first trachea 3450 and the The user symbol of the output of the two slicer 346〇, female = 〇. The parameter calculation unit 3480 calculates the matrix centers, w and supplies the matrices to the interference cancellation unit 3470 and the re-detection unit 3475. Figure 35a is a block diagram showing a user symbol detection procedure with multi-user interference cancellation in the presence of multiple spreading factors, in accordance with certain aspects of the present invention. This procedure can be performed at the receiver (e.g., mobile station 丨〇 6). In operation 3510, the combined interference is calculated using the detected user symbols for the first spreading factor and the second spreading factor (e.g., based on the equation (75)). This combined interference illustrates multi-user interference from user symbols for two spreading factors. The user symbol for the first spreading factor can be detected from the received symbols corresponding to the first spreading factor (e.g., 16). For example, the user symbol for the first spreading factor can be detected (e.g., based on equation (72)) by slicing the received symbols corresponding to the first spreading factor. The received symbols corresponding to the first spreading factor can be obtained by despreading the de-amplified chips using a despreading code for the frequency factor of the first exhibition f 84 201128977. The user symbol for the second spreading factor can be detected from the received symbols corresponding to the second spreading factor (e.g., 256). For example, the user symbol for the second spreading factor can be detected by slicing the received symbol corresponding to the second spreading factor (eg, based on equation (73)). The calculated combined interference is removed from the received symbols corresponding to the first spreading factor (eg, based on equation (82)). Finally, in operation 3530, the user symbol for the first spreading factor is re-detected from the received symbols from which the calculated combined interference has been removed (e.g., based on equation (83)). Figure 3 5b is a block diagram of a mobile station 106 for use in a wireless communication system (8) in accordance with certain aspects of the present invention. The mobile station 1〇6 in Fig. 35b includes a module 3550 for calculating combined interference based on the detected user symbols for the first spreading factor and the second spreading factor. This combined interference illustrates multi-user interference from user symbols for two spreading factors. The mobile station 106 further includes: a module 356〇 for removing the combined interference from the received symbols corresponding to the first spreading factor; and a module 3 565 for removing the combined interference based on The received symbols are used to re-detect the user symbol for the first spreading factor. Figure 36 is a flow diagram illustrating another user symbol reading program with multi-user interference cancellation in the presence of multiple spreading factors, in accordance with certain aspects of the present invention. The program in Figure 36 can be used to detect user symbols for the second spreading factor (e.g., 256). 85 201128977 $ Operation 361(), obtains a plurality of received ·^ numbers (eg, based on equation (84)) from which combined interference has been removed. For example, the plurality of combined interferences may be obtained by repeating the operation 351〇_354〇 in FIG. 35 over a plurality of symbol periods (eg, 16 symbol periods) with respect to the first spreading factor. The symbol has been received. In operation 3620, each of the plurality of received symbols from which the combined interference has been removed is multiplied by a respective coefficient. In operation 3630, a plurality of received symbols multiplied by the respective coefficients are combined. In operation 3640, the user symbol for the second spreading factor (e.g., 256) is re-detected from the combined received symbols. For example, the user symbol can be re-detected by slicing the combined received symbols (e.g., based on equation (85)). Spreading factor 16 and spreading factor 256 are merely exemplary, and the above methods and systems can be applied to other spreading factors. In addition, the methods and systems can also be applied in the case where the spreading code for a higher spreading factor corresponds to more than one parent code at a lower spreading factor. For example, a spreading code for a higher spreading factor (e.g., 256) may include two sets of spreading codes&apos; wherein each set of spreading codes has a different parent code at a lower spreading factor (e.g., &apos; 16 ). In this example, the combined user symbol can be expressed as: 86 201128977 bc(m) = λγ&quot;&gt; λb/VW] (90 ^ ^ Ys^F][m)b^ where η is the first group The detected spreading code corresponding to the user symbol on the A/port] on the symbol period w, and the detected user symbol corresponding to the second group of spreading codes in the symbol period Cast p. The gain matrix G in the gas program (%) can be expressed as: gi

G

Sm (91 ) I: 乂 The following provides the spread spectrum matrix in equation (80): Milk... Heart Witch (1) (5) 2] - (92) where &amp;/ is the spread spectrum code at the lower spread spectrum, Shot 1] The sigh of the neck code for the user symbol, [[] is the higher money code, and (4) is the parent code of the second group's spreading code at the higher spreading factor. "For example, provide the received symbols: - the parent coffee of the group spread code) Ί zrnim) Z1%) (93) U2] (bite where 〆η is from the group with the higher spread factor The parent of the spread spectrum code 87 201128977 The corresponding symbol obtained by the despreading code, and z[2] corresponds to the parent code of the second set of spreading codes at the higher spreading factor. Received symbols obtained by despreading the frequency code. In this example, combined interference cancellation and user symbol detection for two spreading factors can be performed, for example, based on equations (86) through (89). One of ordinary skill in the art will appreciate that information and signals may be represented using any of a variety of different technologies and techniques. For example, the materials, instructions, commands, information, signals, bits, symbols, and chips mentioned in the above specification. It can be represented by voltages, currents, electromagnetic waves, magnetic fields or magnetic particles, light fields or optical particles, or any combination thereof. Those of ordinary skill in the art will further appreciate the various illustrative logic described in connection with the embodiments disclosed herein. Modules, circuits, and algorithms can be implemented as electronic hardware, computer software, or a combination of both. In order to clearly illustrate the interchangeability between hardware and software, various illustrative components, blocks, and modules are described above. The circuits, and the steps are all described in their entirety. As to whether such functionality is implemented as hardware or as software, it depends on the particular application and the design constraints imposed on the overall system. A person skilled in the art can implement the described functions in a modified manner for each particular application. However, such implementation decisions should not be construed as causing a departure from the scope of the present invention. A general purpose processor, digital signal processor (DSP) can be used. ), application specific integrated circuit (ASIC), field programmable gate array (FpGA) or other programmable logic device, individual open gate or transistor logic device, individual hardware components or designed to perform the functions described herein (4) any of them Combinations, implementations, and implementations of various illustrative logic blocks, modules, and modules described in connection with the embodiments disclosed herein The general purpose processor may be a microprocessor, but in the alternative, the processor may be any general processor, controller, microcontroller, or state machine. The processor may also be implemented as a group of computing devices, for example, Dsp Combination with a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration, or in some exemplary embodiments, may be hardware, software, Firmware = any combination of them to perform the described functions. If the software is used to implement the function, the function can be stored or transmitted as a tamping instruction or code on the machine readable medium. The machine readable medium includes the computer. Storage Media and Communication Media 'Communication media includes any media that helps to transfer computer programs from one place to another. The storage medium can be any available media that is accessible to the computer. By way of example, but not limitation, such machine-readable media may include RAM, ROM, eepr〇m, cd_r〇m or other optical gamma n, disk hopper or other magnetic (4) storage or may be used Any other medium that carries or stores the desired code and is accessible by the computer in the form of an instruction or data structure. In addition, any connection is appropriately referred to as a machine n readable medium n if the software is using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (dsl) or wireless technology such as infrared, radio and microwave. For transmission to a station, feeder, or other remote source, coaxial cable, fiber optic cable, twisted pair, cable, or wireless technologies such as infrared, radio, and microwave are included in the definition of the media. Does the disk or disc include (4) discs? 89 201128977 (called a clock-disc, optical disc, digital versatile disc (, and Blu-ray disc, which allows the disc to reproduce data magnetically, = the combination of optical reproduction with a clock shot should also include reading In the context of the media, a description of the disclosed (four) (four) description is provided to enable any person skilled in the art to practice or use the invention. Various modifications of such aspects will be apparent to those of ordinary skill in the art It is obvious that the general principles defined herein may be applied to other aspects without departing from the scope of the invention, and the invention is not intended to be limited to the embodiments shown herein, but rather The principle is consistent with the broadest scope of the novel features. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a diagram of a wireless communication system with multiple users in accordance with certain aspects of the present invention. Figure 2 is a diagram of a wireless communication system having multiple users in accordance with the present invention. In some aspects, a block diagram of a mobile station used in a wireless communication system. Figure 3 is a diagram of a single user channel model in accordance with certain aspects of the present invention. Figure 4 (a) is based on Some aspects of the invention, a diagram of a multi-user channel model. Figure 4 (b) is a diagram of a simplified multi-user channel model in accordance with certain aspects of the present invention. Figure 4 (c) Some aspects, including a diagram of a simplified multi-user channel model of noise. 90 201128977 FIG. 5 is a schematic diagram of a multi-user-system in two stages processed in accordance with the present invention, in accordance with certain aspects of the present invention. In some aspects of the multi-user detection system of the user interference matrix, the two-stage processing and multi-patterning of Figure 0 are used. Figure 7 is not a certain aspect of the present invention. Figure 8 is a flow chart illustrating a method in accordance with certain aspects of the present invention. Flowchart_10 for a method of processing 1 or more received symbols for a plurality of users is a block of a mobile station used in a wireless communication system in accordance with certain aspects of the present invention. Figure. is a certain aspect of the present invention 'multichannel Figure 12a is a flow diagram of a multi-user detection method in accordance with certain aspects of the present invention. The Figure is a diagram illustrating the use of a multi-user interference matrix in accordance with certain aspects of the present invention. A flowchart of a method is a block diagram of a mobile station used in a wireless communication system in accordance with certain aspects of the present invention. Figure 13 is a diagram of a multi-user interference matrix and shoulders for use in accordance with certain aspects of the present invention. Schematic diagram of a matrix (shQulder) system. Figure 14 is a schematic diagram of a multi-user detection system with interference cancellation in accordance with certain aspects of the present invention. 91 201128977 Figure 15 is a diagram of some aspects of the present invention having interference Schematic diagram of the eliminated multi-user detection system. Figure 16a is a flow chart illustrating a multi-user detection method with interference cancellation in accordance with certain aspects of the present invention. Figure 16b is a block diagram of a mobile station for use in a wireless communication system in accordance with certain aspects of the present invention. Figure 17 is a schematic illustration of an instant user with iterative interference cancellation in accordance with certain aspects of the present invention. Figure 8A is a flow chart showing a multi-user detection method with iterative interference cancellation in accordance with certain aspects of the present invention. Figure 19 is a schematic illustration of a multi-user detection system with iterative interference cancellation in accordance with certain aspects of the present invention. Figure 20 is a schematic illustration of a detection system with cell service interval interference cancellation, in accordance with certain aspects of the present invention. Figure 21 is a schematic illustration of a cell service area calculation unit in accordance with certain aspects of the present invention. Figure 22a is a flow diagram of a method of calculating received chips for a cell service area, in accordance with certain aspects of the present invention. Figure 22b is a flow chart illustrating a cell service interval interference cancellation method in accordance with certain aspects of the present invention. Figure 22c is a flow chart illustrating a method of cell service interval elimination and multi-user ❹彳 according to certain aspects of the present invention. Figure 22d is a block diagram of a mobile station for use in a wireless communication system in accordance with certain aspects of the present invention. 92 201128977 Schematic diagram of certain aspects of a channel estimation system in accordance with the present invention. Figure 24a is a flow chart showing a method of channel estimation not according to some aspects of the present invention. Figure (10) is a flow chart illustrating a total filter estimation method in accordance with certain aspects of the present invention. Is a block diagram of a mobile station used in a wireless communication system in accordance with certain aspects of the present invention. Figure 仏 is a diagram of an exemplary 16 QAM cluster in accordance with certain aspects of the present invention. Figure 25b is a diagram of an exemplary QpsK cluster in accordance with certain aspects of the present invention. Figure 26 is a diagram of an exemplary 16 QAM cluster that is decomposed into sub-clusters in accordance with certain aspects of the present invention. Figure 7 is a schematic diagram of a multi-user "tweet cluster test system according to some aspects of the present invention. Figure is a flow chart illustrating a multi-user sub-cluster detection method in accordance with certain aspects of the present invention.圊 28b is a block diagram of a mobile station used in a wireless communication system in accordance with certain aspects of the present invention. Figure 29 is a multi-user QAM detection system with iterative interference cancellation in accordance with certain aspects of the present invention. Figure 3 is a diagram of an orthogonal variable spreading factor (OVSF) tree in accordance with certain aspects of the present invention. 93 201128977 Figure 31 is a diagram of some of the chirp codes in accordance with the present invention. 2. H0, ?, parent code to indicate the same spread spectrum factor. Figure 32 is a diagram of some of the aspects of the present invention based on the spread spectrum code. Figure 33 is a flow chart illustrating the present invention. In some aspects, the user symbol detection map 34 is in accordance with the present invention, ^ ^ · Β, - ^ two ~, sample 'this is sufficient for multiple spread spectrum diagrams. 卩 interference core multi-user system Illustrated: 35a is illustrated in accordance with certain aspects of the present invention, in the presence of multiple numbers Figure 35b is a block diagram of a mobile station in accordance with the present invention. Figure 36 is a diagram illustrating, in a wireless communication system, a plurality of spreading factors in accordance with certain aspects of the present invention. Flowchart of multi-user detection method in the case of the spread. [Main component symbol description] ^ it / ^ 1〇〇 communication system / wireless communication system 102A cell service area 102B cell service area 102C cell service area 102D cell service Area 102E Cell Service Area 102F Cell Service Area System 94 201128977 102G Cell Service Area 104A Base Station 104B Base Station 104C Base Station 104D Base Station 104E Base Station 104F Base Station 104G Base Station 106 Mobile Station 106A Mobile Station 106B Mobile Station 106C Mobile Station 106D Mobile Station 106E Mobile Station 106F Mobile Station 106G Mobile Station 106H Mobile Station 200 Receiver 210 Front End Processing Unit / Filter / Front End Filter 220 Antenna 230 De-amplifying Frequency and De-spreading Unit 240 Processing Unit / Matrix Computing Unit 250 Memory 260 Detecting Measurement unit 95 201128977 300 total filter 310 block / channel 315 Mixer Mixer 3 17 Spread Spectrum Mixer 320 Summation Block 400 Combiner 410 Multi-User Interference Matrix 415 Gain Matrix/Block 420 Layer Row Gain Matrix 425 Block 500 First Level 510 Second Stage 700 Operation 710 Operation 720 Operation 730 Operation 800 Operation 810 Operation 820 Operation 830 Operation 840 Operation 900 Operation 910 Operation 920 Operation 96 201128977 930 Operation 1000 Module 1010 Module 1020 Module 1030 Module 1110 Block 1120 Block 1130 Block 1132 Block 1135 Block 1140 Block 1150 Block 1160 Block 1220 Operation 1230 Operation 1232 Operation 1234 Operation 1236 Operation 1238 Operation 1240 Operation 1250 Module 1260 Module 1270 Module 1305 System 201128977 13 10 1320 1330 1340 1405 1410 1415 1420 1430 1440 1450 1460 1505 1510 1515 1520 1522 1525 1530 1535 1540 1560 1610 1620 matrix calculation unit code unit channel estimation unit filter calculation unit multi-user detection system chopper/front-end filter de-buffering unit de-spreading unit detection unit matrix calculation unit interference elimination Element re-detection unit multi-user detection system chopper/front-end filter de-mixing mixer de-scrambling and de-spreading unit de-spreading mixer summation square detection unit code unit matrix calculation unit elimination and re-detection Measurement unit operation 98 201128977 1630 Operation 1640 Operation 1650 Module 1660 Module 1670 Module 1680 Module 1690 Module 1705 Multi-user detection system 1730 Detection unit 1750 Elimination of interference unit / interference 1752 Feedback path 1755 Buffer 1760 Re-detection unit 1810 Operation 1820 Operation 1830 Operation 1840 Operation 1850 Operation 1860 Operation 1905 Multi-user detection system 1910 Subtraction unit 1920 Symbol detector 1930 Buffer 1940 Interference calculation unit elimination unit 99 201128977 2005 Cell service interval interference cancellation system 2010a First Cell Service Area Calculation Unit 2010b Second Cell Service Area Calculation Unit 2010c Third Cell Service Area Calculation Unit '2020a First Subtraction Block/First Subtraction Unit 2020b Second Subtraction Block/Second Subtraction Unit 2020c Third Subtraction Block/ Third subtraction Yuan 2020d fourth subtraction block/fourth subtraction unit 2030 cell service area sorting unit 2110 cell service area calculation unit 2120 waver 2130 de-sampling frequency and de-spreading unit 2140 detection unit 2150 gain unit 2160 spread spectrum and frequency-stamping unit 2170 yards Slice calculation unit / cell service area calculation unit 2205 Operation 2210 Operation • 2215 Operation. 2220 Operation 2225 Operation 2230 Operation 2235 Operation 2250 Operation 100 201128977 2255 2260 2265 2270 2275 2280 2285 2305 23 10 2315 2320 2322 23 2 5 2330 2335 2337 2340 2342 2343 2345 2350 2400 2410 2415 Operation and operation operation module module module module channel estimation system filter unit / filter de-mixing frequency mixer de-buffering frequency and de-spreading unit de-spreading mixer summing square detection unit gain Unit Gain Mixer Spread Spectrum and Mixing Unit Spread Spectrum Mixer Mixer Mixing Mixer Channel Calculation Unit Operation Operation 101 201128977 2420 Operation 2450 Module 2450a Quadrant 2450b Quadrant 2450c Quadrant 2450d Quadrant 2455 Module 2460 Module 2465 Module 2470 operation 2475 Operation 2480 Operation 2485 Operation 2510 Cluster Point 2512 Cluster Point 2550a Quadrant 2550b Quadrant 25 5 0c Quadrant 2550d Quadrant 2 552a Quadrant 2552b Quadrant 2552c Quadrant 2552d Quadrant 2610a Cluster Point 201128977 2610b Cluster Point 2610c Cluster Point 2610d Cluster Point 2620 First Subcluster 2630 Second sub-cluster 2650a Cluster point 2650b Cluster point 2650c Cluster point 2650d Cluster point 2705 Multi-user 1 6 QAM detection system / sub-cluster detection system 2710 First detection unit 2720 Scaler 2730 Buffer 2740 Reconstruction unit 2750 Subtraction unit 2760 Second detection unit 2770 Combiner 2800 Operation 2810 Operation 2820 Operation 2830 Operation 2850 Module 2855 Module 2860 Module 103 201128977 2865 Module 2870 Module 2905 Multi-user QAM detection system 2910 Subtraction unit 2920 Re-detection Measurement unit 2930 Buffer 2940 Interference calculation unit 3010a Code 3020a Subcode 3020b Subcode 3020c Code 3020d Code 3030a Subcode 3030b Subcode 3030c Subcode 3030d Subcode3310-1 Block 3310-16 Block 3320 -1 Adder 3320-16 Adder 3330-1 Block 3330-16 Block 3340-1 Multiplier 3340-16 Multiplier 104 201128977 3350 3360 3400 3405 3410 3420 3450 3460 3470 3475 3480 3485 3510 3520 3530 3550 3560 3565 3610 3620 3630 3640 Adder Slicer Multi-user Detection System De-scrambling Unit First De-spreading Unit Second De-spreading Unit First Slicer Unit/First Slicer Second Slicer Unit/Second Slicer Interference Elimination unit re-detection unit parameter calculation unit feedback path operation operation operation module module operation operation operation operation 105

Claims (1)

201128977 VII. Patent Application Range: 1. A method for multi-user detection in a wireless communication system, comprising the steps of: processing a received chip into received symbols for a plurality of users; a Hadamard matrix computing a multi-user matrix, wherein the multi-user matrix associates user symbols for the plurality of users with the received symbols; and using the received symbols and the calculated The user matrix is used to measure the user symbols for the plurality of users. 2. As requested! The method wherein, for each user, the multi-user matrix associates one or more of the user symbols for other users with the received symbol for the ammonium user. τ 〇 战 用 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 Another - matrix multiplication; and calculating the user matrix based on the multiplication of the Hadamard matrix with the another matrix. The method of claim 3, wherein the another matrix comprises a frequency search matrix 106 201128977 or a de-scrambling matrix 5. As the request item estimates two methods 'where the other matrix includes a representation-channel', a wave device - A total filter matrix of the convolution. In the method of frequency code 1, the Hadamard matrix includes a plurality of spreading codes or a plurality of despreading codes, and the method further comprises the following ^= using a fast = Hadamard transform (FHT) operation to phase the matrix Multiply the ; and , ί::: violation matrix with the other matrix to calculate the multiuser matrix. Further, 7: The method of claim 6, wherein the another-matrix comprises or a singular frequency matrix. The method of claim 6, wherein the other method comprises a __total filter matrix representing an estimate of the convolution with m. The method of channel decomposing the β term 6 'where the material dharma matrix includes the plurality of frequency codes, and the step of processing the received chips into the received symbols includes the following (4): using the complex despreading frequency Receive the code to perform the spread spectrum. r ο *ν ί ϋ 107 201128977 1 〇. A multi-user detection system comprising: a processing unit configured to process received chips into received symbols for a plurality of users; The unit 'is configured to calculate a multi-user matrix using a Hadamard matrix', wherein the multi-user matrix associates user symbols for the plurality of users with the received symbols; and a metrology unit 'It is configured to use the received symbols and the computed multi-user matrix to detect the user symbols for the plurality of users. 11. The system of claim 10, wherein for each user, the multi-user matrix uses one or more of the user symbols for other users and the received symbol for the user Associated.. 12. The system of claim 10, wherein the computing unit is configured to: transform a Walsh matrix into the Hadamard matrix; multiply the Hadamard matrix with another matrix using a fast Hadamard transform (FHT) operation And 'based on the multiplication of the Hadamard matrix with the other matrix to calculate the multi-matrix matrix comprising a frequency-stabilizing matrix 1. 3. The system of claim 12, wherein the other or a solution-frequency searching matrix. 108 201128977 14. As requested in claim j. 2, an estimate of the system with a filter, where the other moment, with 4 Φ 祀卩, includes a total filter matrix representing a convolution of a channel. Such as the system of 1〇, wherein the Hadamard frequency code or a plurality of despreading frequency codes, and the second plurality of exhibitions use the fast Hada:: the broken configuration is: matrix multiplication; and the () (four) the Hadamard matrix Computation of the multi-matrix matrix with the other matrix to calculate the multi-matrix matrix includes a scrambling matrix 16, such as the system of claim 15, wherein the other or a de-frequency search matrix. 17. The system of claim 15 wherein the another matrix comprises a total ferriser matrix representing a channel estimate and a 1' wave. 18. The system of claim 15, wherein the Hadamard matrix comprises the plurality of despreading codes' and the processing unit is configured to: (4) complex despreading codes to despread the received chips . 19. An apparatus comprising: means for receiving a received number of received symbols for a plurality of users; for computing using a Hadamard matrix - a component of a multi-user matrix, wherein VS] 109 201128977 the multi-user matrix associates user symbols for the plurality of users with the received symbols; and for using the received symbols and the calculated multi-user matrix for the test A component of the user symbols of a plurality of users. 20. The device of claim 19, wherein for each user, the multi-user matrix uses one or more of the user symbols for other users and the received symbol for the user Associated. 21. The apparatus of claim 19, wherein the means for computing the multi-user matrix comprises: means for transforming a Walsh matrix into the Hadamard matrix; for using a Fast Hadamard Code Transform (FHT) a means for multiplying the Hadamard matrix by another matrix; and means for computing the evening user matrix based on the multiplication of the Hadamard matrix with the other matrix. 22. A device as claimed in claim 21 or a frequency-distorting moment, wherein the other matrix comprises a frequency-staggered matrix. A device as estimated by a request and a filter 21, wherein the other matrix comprises a total waver matrix representing a convolution of a channel. 24. The device of item 19 of the month, the Hadamard moment in the middle of the _ includes a plurality of exhibitions 110 201128977 frequency or a plurality of despreading codes, and the device further comprises: for using the fast Hadamard tow "p port Τp &amp; FHT is a component that multiplies the Hadamard matrix by another matrix; and soap is used to multiply the multi-user matrix based on the multiplication of the Hadamard matrix with the other matrix The water element ^ 25. The f &lt; device of claim 24, wherein the other matrix comprises a - or solution search matrix. Complex moment 26. as claimed in item 24, 0 ^ device Wherein the other matrix comprises a -to-rotation-total-mechanical filter matrix representing a pass-to-wave estimator. The ambiguity of the item 24 is set to where the Hadamard matrix includes the complex order despreading code, and The means for processing the received chips into the received symbols includes: means for despreading (4) the plurality of despreading codes to the received chips. 28. A machine readable medium having instructions stored thereon, The instructions may be executed by - or a plurality of processors and the instructions include code for the operation of the squatting · processing the received chips into received symbols for a plurality of users; using - Hadamard matrix calculation - multi-use Matrix, wherein the multi-user matrix associates user symbols for the plurality of users with the received symbols; and 111 201128977 uses the received symbols and the computed multi-user matrix to detect The user symbols for the plurality of users. 29. The machine readable medium of claim 28, wherein for each user, the multi-user matrix is to be used by the other users One or more of the symbols are associated with the received symbol for the user. 3 0. A machine readable medium such as the kiss item 28, wherein the proxy for calculating the multi-user matrix includes Code for: transforming a Walsh matrix into the Hadamard matrix; operating the multiplication of the Hadamard matrix with another matrix to calculate the multi-use fast hadamard transform (fht) Matrix multiplication; and based on the Hadamard matrix and the other user matrix. 31. The machine scrambling matrix of claim 3 or the detuned state readable medium, wherein the other matrix comprises a de-frequency matrix. The readable medium, wherein the other is researched; the bottle, the other matrix of the scorpion scorpion includes a total filter matrix of a convolution. Taking the media, wherein the Hadamard matrix package decomposes the spreading code, and the instructions are further entered into a 2011 201128977 using a fast Hada monument _ matrix multiplication; and the material (FHT) operation will be the same as the other - :: the: Dharma The matrix is multiplied by the other matrix to calculate the user matrix. 1 1 通通多使34. As the request term u + μ a matrix includes the machine readable medium, wherein the other frequency matrix or _ _ ^ again test - solve the frequency matrix. 35. The machine of the second item 33 can read the medium, wherein the other matrix comprises eight, a total filter matrix of the juice and a spin of a filter. The machine of claim 3 may read the medium, wherein the Hadamard matrix includes the plurality of despreading worms, and the proxy for processing the received chips as the received symbols comprises: A code for despreading the received chips using the plurality of despreading codes. 37. An apparatus comprising: at least one processor configured to: process received chips for use Received symbols for a plurality of users; using a Hadamard moment Computing a multi-user matrix, wherein the multi-user matrix associates user symbols for the plurality of users with the received symbols; and ί Si uses the received symbols and the multi-use of the calculation The matrix is used to detect the user symbols for the plurality of users. 113 201128977 38. The device of claim 37, wherein for each user, the multi-user matrix is to be used by other users One or more of the user symbols are associated with the received symbol for the user. 39. The apparatus of claim 37, wherein the at least one processor is configured to calculate the multi-use by Matrix: transforming a Walsh matrix into the Hadamard matrix; multiplying the Hadamard matrix by another matrix using a fast Hadamard transform (FHT) operation; and based on the Hadamard matrix and the other matrix Multiplying to calculate the multi-user matrix. 4. The apparatus of claim 39, wherein the other matrix comprises a frequency-abanding matrix or a de-scrambling matrix. The device of claim 39, wherein the other The array includes a total filter matrix representing a convolution of the -channel D filter. A frequency code or a device of 37' wherein the Hadamard matrix includes a plurality of spreading/_spreading codes, and the at least one processor is configured another = = Hadamard transform (FHT) operation multiplies the matrix; and S] 114 201128977 based on the Hadamard matrix and the additional user matrix. The multiplication of a matrix calculates the multiplicity 43. As requested in item 42 or a solution A device for amplifying a frequency, wherein the other matrix comprises a frequency-stacking matrix. 4 4 - means for requesting an estimate and a filter 42, wherein the other matrix comprises a total filter representing a cyclotron of a channel matrix. 45. The apparatus of claim 42, wherein the Hadamard matrix comprises the plurality of despreading codes, and the at least one processor is configured to be decoupled by using the plurality of despreading horses Frequency, to process the received code &gt; 1 as a received symbol. 115