CA2491443C - Data detection for codes with non-uniform spreading factors - Google Patents
Data detection for codes with non-uniform spreading factors Download PDFInfo
- Publication number
- CA2491443C CA2491443C CA002491443A CA2491443A CA2491443C CA 2491443 C CA2491443 C CA 2491443C CA 002491443 A CA002491443 A CA 002491443A CA 2491443 A CA2491443 A CA 2491443A CA 2491443 C CA2491443 C CA 2491443C
- Authority
- CA
- Canada
- Prior art keywords
- communication
- system response
- response matrix
- spreading factor
- scrambling code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
- H04B1/7097—Interference-related aspects
- H04B1/7103—Interference-related aspects the interference being multiple access interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0007—Code type
- H04J13/004—Orthogonal
- H04J13/0044—OVSF [orthogonal variable spreading factor]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
- H04B1/7097—Interference-related aspects
- H04B1/7103—Interference-related aspects the interference being multiple access interference
- H04B1/7105—Joint detection techniques, e.g. linear detectors
- H04B1/71052—Joint detection techniques, e.g. linear detectors using decorrelation matrix
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
- H04B1/7097—Interference-related aspects
- H04B1/7103—Interference-related aspects the interference being multiple access interference
- H04B1/7105—Joint detection techniques, e.g. linear detectors
- H04B1/71055—Joint detection techniques, e.g. linear detectors using minimum mean squared error [MMSE] detector
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B2201/00—Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
- H04B2201/69—Orthogonal indexing scheme relating to spread spectrum techniques in general
- H04B2201/707—Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
- H04B2201/70703—Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation using multiple or variable rates
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B2201/00—Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
- H04B2201/69—Orthogonal indexing scheme relating to spread spectrum techniques in general
- H04B2201/707—Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
- H04B2201/70703—Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation using multiple or variable rates
- H04B2201/70705—Rate detection
Abstract
A plurality of communication signals is received. Each communication signal has an associated code. At least two of the communication signals has a different spreading factor. The associated codes have a scrambling code period. A total system response matrix has blocks. Each block has one dimension of a length M and another dimension of a length based on in part M
and the spreading factor of each communication. M is based on the scrambling code period. Data of the received plurality of communication signals is received using the constructed system response matrix.
and the spreading factor of each communication. M is based on the scrambling code period. Data of the received plurality of communication signals is received using the constructed system response matrix.
Description
DATA DETECTION FOR CODES WITH NON-UNIFORM SPREADING FACTORS
[0001] BACKGROUND
[0001] BACKGROUND
[0002] This invention generally relates to wireless code division multiple access communication systems. In particular, the invention relates to data detection of communications having non-uniform spreading factors in such systems.
[0003] In code division multiple access (CDMA) communication systems, multiple communications may be simultaneously sent over a shared frequency spectrum.
Each communication is distinguished by the code used to transmit the communication.
Data symbols of a communication are spread using chips of the code. The number of chips used to transmit a particular symbol is referred to as the spreading factor. To illustrate, for a spreading factor of sixteen (16), sixteen chips are used to transmit one symbol. Typical spreading factors (SF) are 16, 8, 4, 2 and 1 in TDD/CDMA communication systems.
Each communication is distinguished by the code used to transmit the communication.
Data symbols of a communication are spread using chips of the code. The number of chips used to transmit a particular symbol is referred to as the spreading factor. To illustrate, for a spreading factor of sixteen (16), sixteen chips are used to transmit one symbol. Typical spreading factors (SF) are 16, 8, 4, 2 and 1 in TDD/CDMA communication systems.
[0004] In some CDMA communication systems to better utilize the shared spectrum, the spectrum is time divided into frames having a predetermined number of time slots, such as fifteen time slots. This type of system is referred to as a hybrid CDMA/time division multiple access (TDMA) communication system. One such system, which restricts uplink communications and downlink communications to particular time slots, is a time division duplex communication (TDD) system.
[0005] One approach to receive the multiple communications transmitted within the shared spectrum is joint detection. In joint detection, the data from the multiple communications is determined together. The joint detector uses the, known or determined, codes of the multiple communications and estimates the data of the multiple communications as soft symbols. Some typical implementations for joint detectors use zero forcing block linear equalizers (ZF-BLE) applying Cholesky or approximate Cholesky decomposition or fast Fourier transforms.
[0006] These implementations are typically designed for all the communications to have the same spreading factor. Simultaneously handling communications having differing spreading factors is a problem for such systems.
[0007] Accordingly, it is desirable to be able to handle differing spreading factors injoint detection.
[0008] SUMMARY
[0009] A plurality of communication signals is received. Each communication signal has an associated code. At least two of the communication signals have a different spreading factor. The associated codes have a scrambling code period. A total system response matrix has blocks. Each block has one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication. M is based on the scrambling code period. Data of the received plurality of communication signals is received using the constructed system response matrix.
[0009a] The invention thus provides according to a first aspect, for a method for simultaneously estimating data transmitted in spread spectrum communications using different spreading factors. The method comprises: receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M
and the spreading factor of each communication, M is based on the scrambling code period; and using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009b] According to a second aspect, the invention provides for a user equipment comprising: means for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; means for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and means for using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009c] According to a third aspect, the invention provides for a user equipment comprising: an antenna for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; a data detection device for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period;
and for using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009d] According to a fourth aspect, the invention provides for a base station comprising:
means for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; means for constructing a total system response matrix having blocks, each block having one dimension of a length M and -2a-another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and means for using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009e] According to a fifth aspect, the invention provides for a base station comprising:
an antenna for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; a data detection device for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M
and the spreading factor of each communication, M is based on the scrambling code period; and for using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009f] According to a sixth aspect, the invention provides for a wireless communication apparatus comprising: a receiver component configured to receive and process a combined plurality of K code division multiple access (CDMA) communication signals, where each of the K communication signals has an associated code, at least two of the K communication signals have different spreading factors, and the associated codes have a scrambling code period; a data detection device configured to construct a total response matrix having a diagonal series of non-zero blocks, each block comprising a series of sub blocks that correspond to one of the K communication signals such that each block and sub block thereof have one common dimension based on the scrambling code period; and the data detection device further configured to use the total response matrix to estimate data of the K received plurality of communication signals.
-2b-[0009g] According to a seventh aspect, the invention provides for a a method for wireless communication comprising: receiving a combined plurality of K code division multiple access (CDMA) communication signals, where each of the K communication signals has an associated code, at least two of the K communication signals have different spreading factors, and the associated codes have a scrambling code period; constructing a total response matrix having a diagonal series of non-zero blocks, each block comprising a series of sub blocks that each corresponds to one of the K communication signals such that each block and sub block thereof have one common dimension based on the scrambling code period; and using the total response matrix to estimate data of the K communication signals.
[0009a] The invention thus provides according to a first aspect, for a method for simultaneously estimating data transmitted in spread spectrum communications using different spreading factors. The method comprises: receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M
and the spreading factor of each communication, M is based on the scrambling code period; and using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009b] According to a second aspect, the invention provides for a user equipment comprising: means for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; means for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and means for using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009c] According to a third aspect, the invention provides for a user equipment comprising: an antenna for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; a data detection device for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period;
and for using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009d] According to a fourth aspect, the invention provides for a base station comprising:
means for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; means for constructing a total system response matrix having blocks, each block having one dimension of a length M and -2a-another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and means for using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009e] According to a fifth aspect, the invention provides for a base station comprising:
an antenna for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period; a data detection device for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M
and the spreading factor of each communication, M is based on the scrambling code period; and for using the constructed system response matrix to estimate data of the received plurality of communication signals.
[0009f] According to a sixth aspect, the invention provides for a wireless communication apparatus comprising: a receiver component configured to receive and process a combined plurality of K code division multiple access (CDMA) communication signals, where each of the K communication signals has an associated code, at least two of the K communication signals have different spreading factors, and the associated codes have a scrambling code period; a data detection device configured to construct a total response matrix having a diagonal series of non-zero blocks, each block comprising a series of sub blocks that correspond to one of the K communication signals such that each block and sub block thereof have one common dimension based on the scrambling code period; and the data detection device further configured to use the total response matrix to estimate data of the K received plurality of communication signals.
-2b-[0009g] According to a seventh aspect, the invention provides for a a method for wireless communication comprising: receiving a combined plurality of K code division multiple access (CDMA) communication signals, where each of the K communication signals has an associated code, at least two of the K communication signals have different spreading factors, and the associated codes have a scrambling code period; constructing a total response matrix having a diagonal series of non-zero blocks, each block comprising a series of sub blocks that each corresponds to one of the K communication signals such that each block and sub block thereof have one common dimension based on the scrambling code period; and using the total response matrix to estimate data of the K communication signals.
[00010] BRIEF DESCRIPTION OF THE DRAWING(S) [00011] Figure 1 is an embodiment of a non-uniform spreading factor communication system.
[00012] Figure 2 is an illustration of a system response matrix for a kth communication.
[00013] Figure 3 is an illustration of constructing a total system response matrix.
-2c-[00014] Figure 4 is a flow chart of detecting data from communications having non-uniform spreading factors.
-2c-[00014] Figure 4 is a flow chart of detecting data from communications having non-uniform spreading factors.
[00015] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S) [00016] The embodiments of the invention can generally be used with any type of CDMA
system, such as a TDD/CDMA, TDMA/CDMA or frequency division duplex/CDMA
communication system, as well as other types of communication systems.
system, such as a TDD/CDMA, TDMA/CDMA or frequency division duplex/CDMA
communication system, as well as other types of communication systems.
[00017] Figure 1 illustrates an embodiment of a non-uniform spreading factor communication system. A transmitter 20 and a receiver 22 are shown in Figure 1. The transmitter 20 may be located at a user equipment or multiple transmitting circuits 20 may be located at the base station. The receiver 22 may be located at either the user equipment, base station or both, although the preferred use of the receiver 22 is for use at a base station for reception of uplink communications.
[00018] Data symbols to be transmitted to the receiver 22 are processed by a modulation and spreading device 24 at the transmitter 20. The modulation and spreading device 24 spreads the data with the codes and at spreading factors assigned to the communications carrying the data. The communications are radiated by an antenna 26 or antenna array of the transmitter 20 through a wireless radio interface 28.
[00019] At the receiver 22, the communications, possibly along with other transmitters' communications, are received at an antenna 30 or antenna array of the receiver 22. The received signal is sampled by a sampling device 32, such as at the chip rate or at a multiple of the chip rate, to produce a received vector, r. The received vector is processed by a channel estimation device 36 to estimate the channel impulse responses for the received communications. The channel estimation device 36 may use a training sequence in the received communication, a pilot signal or another technique to estimate the impulse responses.
A non-uniform spreading factor data detection device 34 uses the codes of the received communications and the estimated impulse responses to estimate soft symbols, d, of the spread data.
A non-uniform spreading factor data detection device 34 uses the codes of the received communications and the estimated impulse responses to estimate soft symbols, d, of the spread data.
[00020] Data detection for codes having non-uniform spreading factors is illustrated in Figures 2 and 3 and is described with the flow chart of Figure 4. A number, K, communications are transmitted during an observation interval. In a TDD/CDMA
communication system, an observation interval is typically one data field of a communication burst. However, in TDD/CDMA as well as other CDMA communication systems, other size observation intervals may be used, such as the period of the scrambling codes.
communication system, an observation interval is typically one data field of a communication burst. However, in TDD/CDMA as well as other CDMA communication systems, other size observation intervals may be used, such as the period of the scrambling codes.
[00021] The samples of the combined received K communications are collected over the observation interval as a received vector, r. The length in chips of r is the number of chips transmitted in the observation interval of each communication, N,,, added to the length of the channel impulse response, W, less one, (Nc + W - 1).
[00022] A e communication of the K communications as transmitted can be represented as x(k). An i~' chip within a symbol boundary of each symbol is defined as x;
k) and is per Equation 1.
N~1 (') - ~ d(k) v(n=k) - n n=1 Equation 1 [00023] NS(k) is the number of symbols ofthe k~' communication in the observation interval.
dõtk~ is the symbol value of an nt" symbol of the NS(k) symbols. v( k) is the portion of the code sequence of the kt" communication within the nth symbol boundary (v-" k) is zero outside the nth symbol boundary). v;("'k) is the ith chip of the portion of the code sequence within the symbol boundary (v-i(',k) is zero except for the ith chip within the nth symbol boundary).
k) and is per Equation 1.
N~1 (') - ~ d(k) v(n=k) - n n=1 Equation 1 [00023] NS(k) is the number of symbols ofthe k~' communication in the observation interval.
dõtk~ is the symbol value of an nt" symbol of the NS(k) symbols. v( k) is the portion of the code sequence of the kt" communication within the nth symbol boundary (v-" k) is zero outside the nth symbol boundary). v;("'k) is the ith chip of the portion of the code sequence within the symbol boundary (v-i(',k) is zero except for the ith chip within the nth symbol boundary).
[00024] Equation 1 can be extended to a matrix equation per Equation 2.
X(k) = V(k) d(k) Equation 2 [00025] V(k) is a spreading matrix for communication k and has Ns(k) columns and Nc rows.
An nth column of V(k) is v( 'k) [00026] After transmission through the wireless channel, x(k) experiences a channel impulse response h(k) . h(k) is W chips in length. hj(k) is a jth chip of h(k).
Ignoring noise, the contribution, r(k) of communication k to the received vector, r, is per Equation 3.
W W N~) N(~) w (k) (k) (k) (k) (k) (n,k) _ (k) (k) (n,k) r h; xi j+1=~hj ~an Vi-.1+1-~dn ~hj Vi-j+1 j=1 j=1 n=1 n=1 j=1 Equation 3 [00027] In matrix form, Equation 3 is per Equation 4.
r(k)= H(k)V(k)d(k) Equation 4 [00028] H(k) is the channel response matrix for communication k and has Nc columns and (N, + W - 1) rows. The support of an ith column of H(k) is the channel impulse response h(k).
The first element of the support for an ith column of H(k) is the ith element of that column.
X(k) = V(k) d(k) Equation 2 [00025] V(k) is a spreading matrix for communication k and has Ns(k) columns and Nc rows.
An nth column of V(k) is v( 'k) [00026] After transmission through the wireless channel, x(k) experiences a channel impulse response h(k) . h(k) is W chips in length. hj(k) is a jth chip of h(k).
Ignoring noise, the contribution, r(k) of communication k to the received vector, r, is per Equation 3.
W W N~) N(~) w (k) (k) (k) (k) (k) (n,k) _ (k) (k) (n,k) r h; xi j+1=~hj ~an Vi-.1+1-~dn ~hj Vi-j+1 j=1 j=1 n=1 n=1 j=1 Equation 3 [00027] In matrix form, Equation 3 is per Equation 4.
r(k)= H(k)V(k)d(k) Equation 4 [00028] H(k) is the channel response matrix for communication k and has Nc columns and (N, + W - 1) rows. The support of an ith column of H(k) is the channel impulse response h(k).
The first element of the support for an ith column of H(k) is the ith element of that column.
[00029] For each communication k, a system transmission matrix A(k) can be constructed per Equation 5.
A(k) = H(k) V(k) Equation 5 [00030] Figure 2 is an illustration of a system response matrix A(k). Each column of the matrix corresponds to one data symbol of the communication. As a result, the matrix has N~') columns. Each it' column has a block b(') of non-zero elements. The number of non-zero elements is determined by adding the kth communication's spreading factor, Qk, and the impulse response length, W, minus 1, (Qk + W - 1). The left-most column has a block b(') starting at the top of the column. For each subsequent column, the block starts Qk chips lower in the matrix. The resulting overall height of the matrix in chips is (Nc + W -1).
A(k) = H(k) V(k) Equation 5 [00030] Figure 2 is an illustration of a system response matrix A(k). Each column of the matrix corresponds to one data symbol of the communication. As a result, the matrix has N~') columns. Each it' column has a block b(') of non-zero elements. The number of non-zero elements is determined by adding the kth communication's spreading factor, Qk, and the impulse response length, W, minus 1, (Qk + W - 1). The left-most column has a block b(') starting at the top of the column. For each subsequent column, the block starts Qk chips lower in the matrix. The resulting overall height of the matrix in chips is (Nc + W -1).
[00031] A total system transmission matrix can be formed by combining each communication's system response matrix A(k), such as per Equation 6.
A = [A(l), A(2), ..., A(K)]
Equation 6 [00032] However, such a total system response matrix A would have an extremely large bandwidth. To reduce the matrix bandwidth, a block-banded toeplitz matrix is constructed, having the columns of the matrix of Equation 6 rearranged.
A = [A(l), A(2), ..., A(K)]
Equation 6 [00032] However, such a total system response matrix A would have an extremely large bandwidth. To reduce the matrix bandwidth, a block-banded toeplitz matrix is constructed, having the columns of the matrix of Equation 6 rearranged.
[00033] The height, (M + W - 1), of blocks in the matrix is based on the period of the scrambling code. In many communication systems, the scrambling code repeats over a specified number of chips. To illustrate for a TDD/CDMA communication system, the scrambling code repeats after 16 chips (M= 16).
[00034] A maximum spreading code of the K communications or a maximum spreading code of the communication system is referred to as QmAx. To illustrate, a typical TDD/CDMA communication system has a maximum spreading factor of 16 and a receiver in such a system receives communications having spreading factors of 4 and 8. In such a system, QmAx may be 16 (the maximum of the system) or 8 (the maximum of the received communications).
[00035] If the scrambling code period is not an integer multiple of QMAX, a multiple of the period may be used instead of M for constructing the blocks. To illustrate, if QMAX is 16 and the period is 24, three times the period (48 chips) may be used, since it is evenly divisible by 16 and 24.
[00036] Initially, columns from A(l), A(2), ..., A(K) are selected to construct the A matrix based on each k communication's spreading factor. For the first columns of the A matrix, M/QI of the first columns of A(l) are selected, as shown in Figure 3. Using a second of the K
matrices A(2), M/Q2 columns are selected. This procedure is repeated for the other K matrices, A(3), ..., A(K). All of the K matrices first columns become a super column in the total system response matrix, A, having a number of columns, SC, per Equation 7, (step 100).
K
SC=Z M /Qk k=1 Equation 7 [00037] A second super column is constructed in the same manner by selecting the next columns in the A(1), A(a), ..., A~K) matrices. The other super columns are constructed in the same manner.
matrices A(2), M/Q2 columns are selected. This procedure is repeated for the other K matrices, A(3), ..., A(K). All of the K matrices first columns become a super column in the total system response matrix, A, having a number of columns, SC, per Equation 7, (step 100).
K
SC=Z M /Qk k=1 Equation 7 [00037] A second super column is constructed in the same manner by selecting the next columns in the A(1), A(a), ..., A~K) matrices. The other super columns are constructed in the same manner.
[00038] Although this illustration selects columns from the matrices in numerical order, V,, A(2), ..., A(K), the order of the matrices can vary. Although the resource units can be arranged in any order and still achieve a reduced bandwidth, by placing resource units transmitted with the lowest spreading factors at the exterior of each block, the bandwidth may be further reduced. However, in some implementations, the potential reduction in bandwidth may not outweigh the added complexity for reordering the K communications.
[00039] Each super column is divided into blocks having M rows, as per Equation 8, (step 102).
B, 0 === 0 0 Bl . .
BL . 0 A= 0 BL '.B, 0 0 B, 0 . .BL .
0 O ... O BL
Equation 8 [00040] As shown in Equation 8, the non-zero elements of each subsequent column is M
rows (one block) lower in the matrix. The number of non-zero blocks in each column is L, which is per Equation 9.
L M+ W-1 I M I
Equation 9 [00041] The data detection can be modeled per Equation 10.
r=Ad+n Equation 10 [00042] n is the noise vector. A zero-forcing solution to Equation 10 is per Equations 11 and 12.
AHr = Rd Equation 11 R=AHA
Equation 12 (.)H is a complex conjugate transpose operation (Hermetian).
B, 0 === 0 0 Bl . .
BL . 0 A= 0 BL '.B, 0 0 B, 0 . .BL .
0 O ... O BL
Equation 8 [00040] As shown in Equation 8, the non-zero elements of each subsequent column is M
rows (one block) lower in the matrix. The number of non-zero blocks in each column is L, which is per Equation 9.
L M+ W-1 I M I
Equation 9 [00041] The data detection can be modeled per Equation 10.
r=Ad+n Equation 10 [00042] n is the noise vector. A zero-forcing solution to Equation 10 is per Equations 11 and 12.
AHr = Rd Equation 11 R=AHA
Equation 12 (.)H is a complex conjugate transpose operation (Hermetian).
[00043] A minimum mean square error solution to Equation 10 is per Equations 13 and 14.
AHr = Rd Equation 13 R=AHA+a2I
Equation 14 a 2 is the noise variance and I is the identity matrix.
AHr = Rd Equation 13 R=AHA+a2I
Equation 14 a 2 is the noise variance and I is the identity matrix.
[00044] To solve either Equation 11 or 13 in a brute force approach, a matrix inversion of R, W1, is required. Using the A matrix of Equation 8, the structure of the R
matrix of either Equation 12 or 14 is per Equation 15.
Ro R, R2 R3 RL_, 0 0 0 0 0 0 0 RH Ro Rl R2 R3 RL-1 0 0 0 0 0 0 R? RH Ro R, R2 R3 RL-, 0 0 0 0 0 R3 Ri RH Ro Ri R2 R3 RL-1 0 0 0 0 RL 1 R3 Rz RH Ro Rl R2 R3 RL_1 0 0 0 0 RL 1 R3 Rz RH Ro R, R2 R3 RL-1 0 0 L 1 3 2 1 0 I 2 3 L_1 0 0 0 RL , R3 RZ RH Ro Rl R2 R3 RL_1 0 0 0 0 RL, R3 RZ RH Ro R1 R2 R3 0 0 0 0 0 RL_, R3 RZ RH Ro R, RZ
0 0 0 0 0 0 RL 1 R3 RH RH Ro Rl Ro Equation 15 [00045] As shown in Equation 15, the R matrix is block-banded and Toeplitz. As a result, solving either Equation 11 or 13 for d can be readily implemented using a block Cholesky or approximate Cholesky decomposition, (step 104). Alternately, using a circulant approximation of the R matrix, a block fast Fourier transform approach can be used to solve for d, (step 104).
* * *
matrix of either Equation 12 or 14 is per Equation 15.
Ro R, R2 R3 RL_, 0 0 0 0 0 0 0 RH Ro Rl R2 R3 RL-1 0 0 0 0 0 0 R? RH Ro R, R2 R3 RL-, 0 0 0 0 0 R3 Ri RH Ro Ri R2 R3 RL-1 0 0 0 0 RL 1 R3 Rz RH Ro Rl R2 R3 RL_1 0 0 0 0 RL 1 R3 Rz RH Ro R, R2 R3 RL-1 0 0 L 1 3 2 1 0 I 2 3 L_1 0 0 0 RL , R3 RZ RH Ro Rl R2 R3 RL_1 0 0 0 0 RL, R3 RZ RH Ro R1 R2 R3 0 0 0 0 0 RL_, R3 RZ RH Ro R, RZ
0 0 0 0 0 0 RL 1 R3 RH RH Ro Rl Ro Equation 15 [00045] As shown in Equation 15, the R matrix is block-banded and Toeplitz. As a result, solving either Equation 11 or 13 for d can be readily implemented using a block Cholesky or approximate Cholesky decomposition, (step 104). Alternately, using a circulant approximation of the R matrix, a block fast Fourier transform approach can be used to solve for d, (step 104).
* * *
Claims (40)
1. A method for simultaneously estimating data transmitted in spread spectrum communications using different spreading factors, the method comprising:
receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M
and the spreading factor of each communication, M is based on the scrambling code period; and using the constructed system response matrix to estimate data of the received plurality of communication signals.
receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M
and the spreading factor of each communication, M is based on the scrambling code period; and using the constructed system response matrix to estimate data of the received plurality of communication signals.
2. The method of claim 1 wherein M is the scrambling code period.
3. The method of claim 1 wherein M is a multiple of the scrambling code period.
4. The method of claim 1 wherein the another dimension is a sum of dividing M by each communication's spreading factor.
5. The method of claim 1 further comprising constructing super columns, each super column having for each communication, a number of sequential columns from a system response matrix of that communication, the number of sequential columns being M
divided by a spreading factor of that communication.
divided by a spreading factor of that communication.
6. The method of claim 5 wherein each subsequent super column having non-zero elements is one block lower in the matrix than a previous column.
7. The method of claim 1 wherein the total system response matrix is A and the data estimating uses A H A in a zero forcing solution, where A H is a complex conjugate transpose of A.
8. The method of claim 1 wherein the total system response matrix is A and the data estimating uses A H A+.sigma.2I in a minimum mean square error solution, where AH is a complex conjugate transpose of A, .sigma.Z is the noise variance and I is an identity matrix.
9. A user equipment comprising:
means for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
means for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and means for using the constructed system response matrix to estimate data of the received plurality of communication signals.
means for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
means for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and means for using the constructed system response matrix to estimate data of the received plurality of communication signals.
10. ~The user equipment of claim 9 wherein M is the scrambling code period.
11. ~The user equipment of claim 9 wherein M is a multiple of the scrambling code period.
12. ~The user equipment of claim 9 wherein the another dimension is a sum of dividing M by each communication's spreading factor.
13. ~The user equipment of claim 9 further comprising means for constructing super columns, each super column having for each communication, a number of sequential columns from a system response matrix of that communication, the number of sequential columns being M divided by a spreading factor of that communication.
14. ~The user equipment of claim 13 wherein each subsequent super column having non-zero elements is one block lower in the matrix than a previous column.
15. ~The user equipment of claim 9 wherein the total system response matrix is A and the data estimating uses A H A in a zero forcing solution, where A H is a complex conjugate transpose of A.
16. ~The user equipment of claim 9 wherein the total system response matrix is A and the data estimating uses A H A+.sigma.2I in a minimum mean square error solution, where A H is a complex conjugate transpose of A, .sigma.2 is the noise variance and I is an identity matrix.
17. ~A user equipment comprising:
an antenna for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
a data detection device for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and for using the constructed system response matrix to estimate data of the received plurality of communication signals.
an antenna for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
a data detection device for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and for using the constructed system response matrix to estimate data of the received plurality of communication signals.
18. ~The user equipment of claim 17 wherein M is the scrambling code period.
19. ~The user equipment of claim 17 wherein M is a multiple of the scrambling code period.
20. ~The user equipment of claim 17 wherein the another dimension is a sum of dividing M by each communication's spreading factor.
21. ~The user equipment of claim 17 wherein the data detection device for constructing super columns, each super column having for each communication, a number of sequential columns from a system response matrix of that communication, the number of sequential columns being M divided by a spreading factor of that communication.
22. ~The user equipment of claim 21 wherein each subsequent super column having non-zero elements is one block lower in the matrix than a previous column.
23. ~The user equipment of claim 17 wherein the total system response matrix is A and the data estimating uses A H A in a zero forcing solution, where A H is a complex conjugate transpose of A.
24. ~The user equipment of claim 17 wherein the total system response matrix is A and the data estimating uses A H A+.sigma.2I in a minimum mean square error solution, where A H is a complex conjugate transpose of A, .sigma.2 is the noise variance and I is an identity matrix.
25. ~A base station comprising:
means for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
means for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and means for using the constructed system response matrix to estimate data of the received plurality of communication signals.
means for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
means for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and means for using the constructed system response matrix to estimate data of the received plurality of communication signals.
26. ~The base station of claim 25 wherein M is the scrambling code period.
27. ~The base station of claim 25 wherein M is a multiple of the scrambling code period.
28. ~The base station of claim 25 wherein the another dimension is a sum of dividing M by each communication's spreading factor.
29. ~The base station of claim 25 further comprising means for constructing super columns, each super column having for each communication, a number of sequential columns from a system response matrix of that communication, the number of sequential columns being M divided by a spreading factor of that communication.
30. ~The base station of claim 29 wherein each subsequent super column having non-zero elements is one block lower in the matrix than a previous column.
31. ~The base station of claim 25 wherein the total system response matrix is A
and the data estimating uses A H A in a zero forcing solution, where A H is a complex conjugate transpose of A.
and the data estimating uses A H A in a zero forcing solution, where A H is a complex conjugate transpose of A.
32. ~The base station of claim 25 wherein the total system response matrix is A
and the data estimating uses A H A+.sigma.2I in a minimum mean square error solution, where A H
is a complex conjugate transpose of A, .sigma.2 is the noise variance and I is an identity matrix.
and the data estimating uses A H A+.sigma.2I in a minimum mean square error solution, where A H
is a complex conjugate transpose of A, .sigma.2 is the noise variance and I is an identity matrix.
33. ~A base station comprising:
an antenna for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
a data detection device for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and for using the constructed system response matrix to estimate data of the received plurality of communication signals.
an antenna for receiving a plurality of communication signals, each communication signal having an associated code, at least two of the communication signals having a different spreading factor, the associated codes having a scrambling code period;
a data detection device for constructing a total system response matrix having blocks, each block having one dimension of a length M and another dimension of a length based on in part M and the spreading factor of each communication, M is based on the scrambling code period; and for using the constructed system response matrix to estimate data of the received plurality of communication signals.
34. ~The base station of claim 33 wherein M is the scrambling code period.
35. ~The base station of claim 33 wherein M is a multiple of the scrambling code period.
36. ~The base station of claim 33 wherein the another dimension is a sum of dividing M by each communication's spreading factor.
37. ~The base station of claim 33 wherein the data detection device for constructing super columns, each super column having for each communication, a number of sequential columns from a system response matrix of that communication, the number of sequential columns being M divided by a spreading factor of that communication.
38. ~The base station of claim 37 wherein each subsequent super column having non-zero elements is one block lower in the matrix than a previous column.
39. ~The base station of claim 33 wherein the total system response matrix is A
and the data estimating uses A H A in a zero forcing solution, where A H is a complex conjugate transpose of A.
and the data estimating uses A H A in a zero forcing solution, where A H is a complex conjugate transpose of A.
40. ~The base station of claim 33 wherein the total system response matrix is A
and the data estimating uses A H A+.sigma.2I in a minimum mean square error solution, where A H
is a complex conjugate transpose of A, .sigma.2 is the noise variance and I is an identity matrix.
and the data estimating uses A H A+.sigma.2I in a minimum mean square error solution, where A H
is a complex conjugate transpose of A, .sigma.2 is the noise variance and I is an identity matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA2625599A CA2625599C (en) | 2002-07-01 | 2003-06-23 | Data detection for codes with non-uniform spreading factors |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10/064,307 | 2002-07-01 | ||
| US10/064,307 US6741653B2 (en) | 2002-07-01 | 2002-07-01 | Data detection for codes with non-uniform spreading factors |
| PCT/US2003/019858 WO2004004151A2 (en) | 2002-07-01 | 2003-06-23 | Data detection for codes with non-uniform spreading factors |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2625599A Division CA2625599C (en) | 2002-07-01 | 2003-06-23 | Data detection for codes with non-uniform spreading factors |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2491443A1 CA2491443A1 (en) | 2004-01-08 |
| CA2491443C true CA2491443C (en) | 2008-07-29 |
Family
ID=29778418
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2625599A Expired - Fee Related CA2625599C (en) | 2002-07-01 | 2003-06-23 | Data detection for codes with non-uniform spreading factors |
| CA002491443A Expired - Fee Related CA2491443C (en) | 2002-07-01 | 2003-06-23 | Data detection for codes with non-uniform spreading factors |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2625599A Expired - Fee Related CA2625599C (en) | 2002-07-01 | 2003-06-23 | Data detection for codes with non-uniform spreading factors |
Country Status (16)
| Country | Link |
|---|---|
| US (5) | US6741653B2 (en) |
| EP (2) | EP1780900A3 (en) |
| JP (3) | JP4134034B2 (en) |
| KR (3) | KR20100085165A (en) |
| CN (2) | CN101651468B (en) |
| AT (1) | ATE353493T1 (en) |
| AU (1) | AU2003245655A1 (en) |
| CA (2) | CA2625599C (en) |
| DE (1) | DE60311657T2 (en) |
| DK (1) | DK1529348T3 (en) |
| ES (1) | ES2279128T3 (en) |
| HK (1) | HK1075549A1 (en) |
| MX (1) | MXPA05000077A (en) |
| NO (1) | NO20050213L (en) |
| TW (4) | TWI257778B (en) |
| WO (1) | WO2004004151A2 (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7027489B2 (en) * | 2001-04-06 | 2006-04-11 | Interdigital Technology Corporation | Iterative fast fourier transform error correction |
| KR100557102B1 (en) * | 2002-09-07 | 2006-03-03 | 삼성전자주식회사 | Device and method for joint detection receiver which use orthogonal codes with a variable in communication system |
| US7408978B2 (en) * | 2002-09-09 | 2008-08-05 | Interdigital Technology Corporation | Extended algorithm data estimator |
| CN1170389C (en) * | 2002-11-13 | 2004-10-06 | 大唐移动通信设备有限公司 | Method for using long subzone codes in combined detection system |
| US7437135B2 (en) * | 2003-10-30 | 2008-10-14 | Interdigital Technology Corporation | Joint channel equalizer interference canceller advanced receiver |
| US8300574B2 (en) * | 2005-07-06 | 2012-10-30 | Zte Corporation | Method of uplink synchronization establishment based on the united transmission technology |
| EP1940041B1 (en) * | 2005-09-15 | 2016-04-13 | ZTE Corporation | Baseband processing method for improving signal-to-noise ratio based on multiple sampling |
| US20120269175A1 (en) * | 2011-04-21 | 2012-10-25 | Aiguo Yan | Efficient implementation of joint detection based tdscdma receivers |
| WO2013013407A1 (en) * | 2011-07-28 | 2013-01-31 | Empire Technology Development Llc | User-focusing technique for wireless communication systems |
| CN107979455B (en) | 2013-08-07 | 2020-11-27 | 华为技术有限公司 | System and method for scalable digital communication with adaptive system parameters |
| CN105634544B (en) * | 2016-01-07 | 2018-11-09 | 电子科技大学 | A kind of blind despread method of synchronous long code DS-CDMA signals |
| US10046566B2 (en) | 2016-08-02 | 2018-08-14 | Xerox Corporation | System for cleaning components used to clean inkjet printheads in inkjet printers |
| WO2018192669A1 (en) * | 2017-04-21 | 2018-10-25 | Huawei Technologies Co., Ltd. | Data locking method based on alternating row and column locks |
| CN110581719A (en) * | 2018-06-11 | 2019-12-17 | 中兴通讯股份有限公司 | Scheduling method, device and computer storage medium |
| CN110071886B (en) * | 2019-05-08 | 2022-01-14 | 哈尔滨海能达科技有限公司 | Signal processing method, related equipment and LoRa wireless system |
| CN111953380B (en) * | 2020-07-02 | 2021-11-23 | 中国人民解放军战略支援部队信息工程大学 | Non-periodic long code direct sequence spread spectrum signal time delay estimation method and system based on norm fitting |
Family Cites Families (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0767543A3 (en) | 1995-10-06 | 2000-07-26 | Siemens Aktiengesellschaft | Code division multiplex communication with interference suppression |
| WO1999014870A2 (en) | 1997-09-15 | 1999-03-25 | Adaptive Telecom, Inc. | Practical space-time radio method for cdma communication capacity enhancement |
| US6307867B1 (en) * | 1998-05-14 | 2001-10-23 | Telefonaktiebolaget Lm Ericsson (Publ) | Data transmission over a communications link with variable transmission rates |
| FR2782426B1 (en) | 1998-08-12 | 2000-09-15 | Alsthom Cge Alcatel | SPECTRUM SPREADING OR DESSETTING DEVICE, ESPECIALLY FOR TRANSMISSION IN A MOBILE RADIOCOMMUNICATION CELL SYSTEM OF THE MULTIPLE ACCESS TYPE BY CODES DISTRIBUTION |
| FR2782428B1 (en) | 1998-08-12 | 2000-09-15 | Alsthom Cge Alcatel | DEVICE FOR ALLOWING DIFFERENT SPREADING FACTORS WHILE PRESERVING A COMMON JAMMING CODE, PARTICULARLY FOR CELLULAR MULTIPLE ACCESS RADIO COMMUNICATION SYSTEM BY CODES DISTRIBUTION |
| US6463097B1 (en) * | 1998-10-16 | 2002-10-08 | Koninklijke Philips Electronics N.V. | Rate detection in direct sequence code division multiple access systems |
| EP1142161A1 (en) * | 1998-12-15 | 2001-10-10 | Nokia Corporation | A receiver |
| JP3485498B2 (en) | 1999-06-28 | 2004-01-13 | 株式会社ケンウッド | CDMA receiver and path search method therefor |
| CN1893297A (en) | 1999-09-14 | 2007-01-10 | 美商内数位科技公司 | Method and device for reduced computation in joint detection |
| US6714527B2 (en) * | 1999-09-21 | 2004-03-30 | Interdigital Techology Corporation | Multiuser detector for variable spreading factors |
| IL148607A0 (en) * | 1999-09-21 | 2002-09-12 | Interdigital Tech Corp | Multiuser detector for variable spreading factors |
| JP2001111456A (en) | 1999-10-06 | 2001-04-20 | Nec Corp | Cdma receiver and cdma receiving method |
| KR100407942B1 (en) | 1999-11-19 | 2003-12-01 | 엘지전자 주식회사 | method for improving transmission performance of Transport Format Combination Indicato in a mobile communication system |
| US6810073B1 (en) | 1999-12-09 | 2004-10-26 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and system for interference cancellation using multiple filter sets and normalized filter adaptation |
| IT1314346B1 (en) | 1999-12-30 | 2002-12-09 | Telit Mobile Terminals Spa | METHOD AND DEVICE FOR THE GENERATION OF ORTHOGONAL CODES WITH VARIABLE SPREADING FACTOR OR RULES OF HADAMARD MATRICIDES FOR |
| GB2359966A (en) | 2000-03-01 | 2001-09-05 | Roke Manor Research | Post processing of spreading codes in a mobile telecommunications system |
| CN1108071C (en) * | 2000-04-11 | 2003-05-07 | 信息产业部电信科学技术研究院 | Signal processing method for terminal in CDMA mobile communication system |
| JP3424748B2 (en) | 2000-05-25 | 2003-07-07 | 日本電気株式会社 | CDMA receiver and rate matching processing method |
| JP2001358613A (en) * | 2000-06-14 | 2001-12-26 | Fujitsu Ltd | Cdma receiver |
| JP3595493B2 (en) * | 2000-07-10 | 2004-12-02 | 三菱電機株式会社 | Wireless receiver |
| WO2002013395A2 (en) * | 2000-08-04 | 2002-02-14 | Telefonaktiebolaget Lm Ericsson (Publ) | Spreading factor detector |
| US7386076B2 (en) * | 2001-03-29 | 2008-06-10 | Texas Instruments Incorporated | Space time encoded wireless communication system with multipath resolution receivers |
| JP3921389B2 (en) | 2002-01-23 | 2007-05-30 | 松下電器産業株式会社 | CDMA radio communication apparatus and method |
| US7099377B2 (en) * | 2002-04-03 | 2006-08-29 | Stmicroelectronics N.V. | Method and device for interference cancellation in a CDMA wireless communication system |
| US7003019B2 (en) | 2002-05-22 | 2006-02-21 | Interdigital Technology Corporation | Data detection for codes with non-uniform spreading factors |
-
2002
- 2002-07-01 US US10/064,307 patent/US6741653B2/en not_active Expired - Lifetime
-
2003
- 2003-06-23 AT AT03739284T patent/ATE353493T1/en not_active IP Right Cessation
- 2003-06-23 KR KR1020107012544A patent/KR20100085165A/en not_active Application Discontinuation
- 2003-06-23 TW TW092117036A patent/TWI257778B/en not_active IP Right Cessation
- 2003-06-23 KR KR1020057017514A patent/KR101119427B1/en not_active IP Right Cessation
- 2003-06-23 DE DE60311657T patent/DE60311657T2/en not_active Expired - Lifetime
- 2003-06-23 JP JP2004517768A patent/JP4134034B2/en not_active Expired - Fee Related
- 2003-06-23 WO PCT/US2003/019858 patent/WO2004004151A2/en active IP Right Grant
- 2003-06-23 KR KR1020047021597A patent/KR100681284B1/en not_active IP Right Cessation
- 2003-06-23 EP EP07101345A patent/EP1780900A3/en not_active Withdrawn
- 2003-06-23 CA CA2625599A patent/CA2625599C/en not_active Expired - Fee Related
- 2003-06-23 MX MXPA05000077A patent/MXPA05000077A/en active IP Right Grant
- 2003-06-23 TW TW098138174A patent/TW201032495A/en unknown
- 2003-06-23 TW TW093105327A patent/TWI317214B/en not_active IP Right Cessation
- 2003-06-23 TW TW095118174A patent/TWI326535B/en not_active IP Right Cessation
- 2003-06-23 DK DK03739284T patent/DK1529348T3/en active
- 2003-06-23 CN CN2009101690094A patent/CN101651468B/en not_active Expired - Fee Related
- 2003-06-23 AU AU2003245655A patent/AU2003245655A1/en not_active Abandoned
- 2003-06-23 EP EP03739284A patent/EP1529348B8/en not_active Expired - Lifetime
- 2003-06-23 CN CNB038158531A patent/CN100536358C/en not_active Expired - Fee Related
- 2003-06-23 CA CA002491443A patent/CA2491443C/en not_active Expired - Fee Related
- 2003-06-23 ES ES03739284T patent/ES2279128T3/en not_active Expired - Lifetime
-
2004
- 2004-04-28 US US10/834,321 patent/US7313165B2/en not_active Expired - Fee Related
-
2005
- 2005-01-13 NO NO20050213A patent/NO20050213L/en not_active Application Discontinuation
- 2005-10-27 HK HK05109551.7A patent/HK1075549A1/en not_active IP Right Cessation
-
2006
- 2006-01-13 JP JP2006006280A patent/JP4213162B2/en not_active Expired - Fee Related
-
2007
- 2007-12-21 US US11/962,779 patent/US7596171B2/en not_active Expired - Fee Related
-
2008
- 2008-08-18 JP JP2008210132A patent/JP4944072B2/en not_active Expired - Fee Related
-
2009
- 2009-08-28 US US12/549,959 patent/US8218607B2/en not_active Expired - Fee Related
-
2012
- 2012-07-09 US US13/544,771 patent/US20120269237A1/en not_active Abandoned
Also Published As
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4944072B2 (en) | Data detection of non-uniform spreading code | |
| US6690660B2 (en) | Adaptive algorithm for a Cholesky approximation | |
| KR100803682B1 (en) | Efficient multiple input multiple output system for multi-path fading channels | |
| JP4362504B2 (en) | Single user detection | |
| KR100959325B1 (en) | Multiuser detector for variable spreading factors | |
| De | Computationally-Efficient Algorithms for Multiuser Detection in Short Code Wideband CDMA (TDD) Systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |
Effective date: 20180626 |