US20080043875A1 - Reduced computation in joint detection - Google Patents

Reduced computation in joint detection Download PDF

Info

Publication number
US20080043875A1
US20080043875A1 US11974994 US97499407A US2008043875A1 US 20080043875 A1 US20080043875 A1 US 20080043875A1 US 11974994 US11974994 US 11974994 US 97499407 A US97499407 A US 97499407A US 2008043875 A1 US2008043875 A1 US 2008043875A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
channel
circuit
exp
system response
equation
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.)
Abandoned
Application number
US11974994
Inventor
Raj Misra
Ariela Zeira
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
InterDigital Technology Corp
Original Assignee
InterDigital Technology Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details 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/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • H04B1/7097Interference-related aspects
    • H04B1/7103Interference-related aspects the interference being multiple access interference
    • H04B1/7105Joint detection techniques, e.g. linear detectors
    • H04B1/71052Joint detection techniques, e.g. linear detectors using decorrelation matrix
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/16Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details 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/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • H04B1/7097Interference-related aspects
    • H04B1/7103Interference-related aspects the interference being multiple access interference
    • H04B1/7105Joint detection techniques, e.g. linear detectors
    • H04B1/71055Joint detection techniques, e.g. linear detectors using minimum mean squared error [MMSE] detector
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B2201/00Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
    • H04B2201/69Orthogonal indexing scheme relating to spread spectrum techniques in general
    • H04B2201/707Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
    • H04B2201/70707Efficiency-related aspects
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; Arrangements for supplying electrical power along data transmission lines
    • H04L25/0202Channel estimation
    • H04L25/0204Channel estimation of multiple channels
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; Arrangements for supplying electrical power along data transmission lines
    • H04L25/0202Channel estimation
    • H04L25/024Channel estimation channel estimation algorithms
    • H04L25/0242Channel estimation channel estimation algorithms using matrix methods

Abstract

A user equipment receives a plurality of transmitted data signals in a communication system. The transmitted data are received. A channel response is determined for each received data signal. A system response is determined based on in part the channel signals. The system response is expanded to be piecewise orthogonal. Data from the received data signals is retrieved based on in part the expanded system response.

Description

    CROSS REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation of U.S. patent application Ser. No. 11/010/703, filed Dec. 13, 2004, which is a continuation of U.S. patent application Ser. No. 09/662,404 filed Sep. 14, 2000, now U.S. Pat. No. 6,831,944, issued Dec. 14, 2004, which in turn claims priority to U.S. Provisional Patent Application No. 60/153,801, filed on Sep. 14, 1999.
  • BACKGROUND
  • The invention generally relates to wireless communication systems. In particular, the invention relates to joint detection of multiple user signals in a wireless communication system.
  • FIG. 1 is an illustration of a wireless communication system 10. The communication system 10 has base stations 12 1 to 12 5 which communicate with user equipments (UEs) 14 1 to 14 3. Each base station 12 1 has an associated operational area where it communicates with UEs 14 1 to 14 3 in its operational area.
  • In some communication systems, such as code division multiple access (CDMA) and time division duplex using code division multiple access (TDD/CDMA), multiple communications are sent over the same frequency spectrum. These communications are typically differentiated by their chip code sequences. To more efficiently use the frequency spectrum, TDD/CDMA communication systems use repeating frames divided into time slots for communication. A communication sent in such a system will have one or multiple associated chip codes and time slots assigned to it based on the communication's bandwidth.
  • Since multiple communications may be sent in the same frequency spectrum and at the same time, a receiver in such a system must distinguish between the multiple communications. One approach to detecting such signals is single user detection. In single user detection, a receiver detects only the communication from a desired transmitter using a code associated with the desired transmitter, and treats signals of other transmitters as interference.
  • In some situations, it is desirable to be able to detect multiple communications simultaneously in order to improve performance. Detecting multiple communications simultaneously is referred to as joint detection. Some joint detectors use Cholesky decomposition to perform a minimum mean square error (MMSE) detection and zero-forcing block equalizers (ZF-BLEs). These detectors have a high complexity requiring extensive receiver resources.
  • Accordingly, it is desirable to have alternate approaches to joint detection.
  • SUMMARY
  • A user equipment receives a plurality of transmitted data signals in a communication system. The transmitted data signals are received. A channel response is determined for each received data signal. A system response is determined based on in part the channel signals. The system response is expanded to be piecewise orthogonal. Data from the received data signals is retrieved based on in part the expanded system response.
  • BRIEF DESCRIPTION OF THE DRAWING(S)
  • FIG. 1 is a wireless communication system.
  • FIG. 2 is a simplified transmitter and a receiver using joint detection.
  • FIG. 3 is an illustration of a communication burst.
  • FIG. 4 is an illustration of reduced computation joint detection.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)
  • FIG. 2 illustrates a simplified transmitter 26 and receiver 28 using joint detection in a TDD/CDMA communication system. In a typical system, a transmitter 26 is in each UE 14 1 to 14 3 and multiple transmitting circuits 26 sending multiple communications are in each base station 12 1 to 12 5. A base station 12 1 will typically require at least one transmitting circuit 26 for each actively communicating UE 14 1 to 14 3. The joint detection receiver 28 may be at a base station 12 1, UEs 14 1 to 14 3 or both. The joint detection receiver 28 receives communications from multiple transmitters 26 or transmitting circuits 26.
  • Each transmitter 26 sends data over a wireless communication channel 30. A data generator 32 in the transmitter 26 generates data to be communicated over a reference channel to a receiver 28. Reference data is assigned to one or multiple codes and/or time slots based on the communications bandwidth requirements. A spreading and training sequence insertion device 34 spreads the reference channel data and makes the spread reference data time-multiplexed with a training sequence in the appropriate assigned time slots and codes. The resulting sequence is referred to as a communication burst. The communication burst is modulated by a modulator 36 to radio frequency. An antenna 38 radiates the RF signal through the wireless radio channel 30 to an antenna 40 of the receiver 28. The type of modulation used for the transmitted communication can be any of those known to those skilled in the art, such as direct phase shift keying (DPSK) or quadrature phase shift keying (QPSK).
  • A typical communication burst 16 has a midamble 20, a guard period 18 and two data bursts 22, 24, as shown in FIG. 3. The midamble 20 separates the two data bursts 22, 24 and the guard period 18 separates the communication bursts to allow for the difference in arrival times of bursts transmitted from different transmitters. The two data bursts 22, 24 contain the communication burst's data and are typically the same symbol length.
  • The antenna 40 of the receiver 28 receives various radio frequency signals. The received signals are demodulated by a demodulator 42 to produce a baseband signal. The baseband signal is processed, such as by a channel estimation device 44 and a joint detection device 46, in the time slots and with the appropriate codes assigned to the communication bursts of the corresponding transmitters 26. The channel estimation device 44 uses the training sequence component in the baseband signal to provide channel information, such as channel impulse responses. The channel information is used by the joint detection device 46 to estimate the transmitted data of the received communication bursts as soft symbols.
  • The joint detection device 46 uses the channel information provided by the channel estimation device 44 and the known spreading codes used by the transmitters 26 to estimate the data of the various received communication bursts. Although joint detection is described in conjunction with a TDD/CDMA communication system, the same approach is applicable to other communication systems, such as CDMA.
  • One approach to joint detection in a particular time slot in a TDD/CDMA communication system is illustrated in FIG. 4. A number of communication bursts are superimposed on each other in the particular time slot, such as K communication bursts. The K bursts may be from K different transmitters. If certain transmitters are using multiple codes in the particular time slot, the K bursts may be from less than K transmitters.
  • Each data burst 22, 24 of the communication burst 16 has a predefined number of transmitted symbols, such as Ns. Each symbol is transmitted using a predetermined number of chips of the spreading code, which is the spreading factor (SF). In a typical TDD communication system, each base station 12 1 to 12 5 has an associated scrambling code mixed with its communicated data. The scrambling code distinguishes the base stations from one another. Typically, the scrambling code does not affect the spreading factor. Although the terms spreading code and factor are used hereafter, for systems using scrambling codes, the spreading code for the following is the combined scrambling and spreading codes. Each data burst 22, 24 has Ns×SF chips.
  • The joint detection device 46 estimates the value that each data burst symbol was originally transmitted. Equation 1 is used to determine the unknown transmitted symbols.
    r =A d + n   Equation 1
  • In Equation 1, the known received combined chips, r, is a product of the system response, A, and the unknown transmitted symbols, d. The term, n represents the noise in the wireless radio channel.
  • For K data bursts, the number of data burst symbols to be recovered is Ns×K. For analysis purposes, the unknown data burst symbols are arranged into a column matrix, d. The d matrix has column blocks, d 1 to d Ns, of unknown data symbols. Each data symbol block, d i, has the ith unknown transmitted data symbol in each of the K data bursts. As a result, each column block, d i, has K unknown transmitted symbols stacked on top of each other. The blocks are also stacked in a column on top of each other, such that d 1 is on top of d 2 and so on.
  • The joint detection device 46 receives a value for each chip as received. Each received chip is a composite of all K communication bursts. For analysis purposes, the composite chips are arranged into a column matrix, r. The matrix r has a value of each composite chip, totaling Ns*SF chips.
  • A is the system response matrix. The system response matrix, A, is formed by convolving the impulse responses with each communication burst chip code. The convolved result is rearranged to form the system response matrix, A (step 48).
  • The joint detection device 46 receives the channel impulse response, h i, for each ith one of the K communication bursts from the channel estimation device 44. Each h i has a chip length of W. The joint detection device convolves the channel impulse responses with the known spreading codes of the K communication bursts to determine the symbol responses, s 1 to s K, of the K communication bursts. A common support sub-block, S, which is common to all of the symbol responses is of length K×(SF+W−1).
  • The A matrix is arranged to have Ns blocks, B1 to BNs. Each block has all of the symbol responses, s1 to sK arranged to be multiplied with the corresponding unknown data block in the d matrix, d 1 to d Ns. For example, d 1 is multiplied with B. The symbol responses, S 1 to S K, form a column in each block matrix, Bi, with the rest of the block being padded with zeros. In the first block, B1, the symbol response row starts at the first row. In the second block, the symbol response row is SF rows lower in the block and so on. As a result, each block has a width of K and a height of Ns×SF. Equation 2 illustrates an A block matrix A = [ s 1 s 2 s K 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s 1 s 2 s K 0 0 0 0 0 0 0 0 s 1 s 2 s K 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ] = [ B 1 B 2 B N s ] Equation 2
  • The n matrix has a noise value corresponding to each received combined chip, totaling Ns×SF chips. For analysis purposes, the n matrix is implicit in the received combined chip matrix, r.
  • Using the block notation, Equation 1 can be rewritten as Equation 3. r = [ B 1 B 2 B 3 B N s ] × [ d 1 d 2 d 3 d N s ] + n = i = 1 N s B i d i + n Equation 3
  • Using a noisy version of the r matrix, the value for each unknown symbol can be determined by solving the equation. However, a brute force approach to solving Equation 1 requires extensive processing. To reduce the processing, the system response matrix, A, is repartitioned. Each block, Bi is divided into Ns blocks having a width of K and a height of SF. These new blocks are referred to as A1 to AL and 0. L is the length of the common support S, as divided by the height of the new blocks, A1 to AL, per Equation 4. L = SF + W - 1 SF Equation 4
  • Blocks A1 to AL are determined by the supports, s 1 to s K, and the common support, S. A 0 block having all zeros. A repartitioned matrix for a system having a W of 57, SF of 16 and an L of 5 is shown in Equation 5. A = [ A 1 0 0 0 0 0 0 0 0 0 0 A 2 A 1 0 0 0 0 0 0 0 0 0 A 3 A 2 A 1 0 0 0 0 0 0 0 0 A 4 A 3 A 2 A 1 0 0 0 0 0 0 0 A 5 A 4 A 3 A 2 A 1 0 0 0 0 0 0 0 A 5 A 4 A 3 A 2 A 1 0 0 0 0 0 0 0 A 5 A 4 A 3 A 2 A 1 0 0 0 0 0 0 0 A 5 A 4 A 3 A 2 0 0 0 0 0 0 0 0 A 5 A 4 A 3 A 1 0 0 0 0 0 0 0 0 A 5 A 4 A 2 A 1 0 0 0 0 0 0 0 0 A 5 A 3 A 2 A 1 0 0 0 0 0 0 0 0 A 4 A 3 A 2 A 1 ] Equation 5
  • To reduce the complexity of the matrix, a piecewise orthogonalization approach is used. Any of the blocks Bi for i being L or greater is non-orthogonal to any of the preceding L blocks and orthogonal to any blocks preceding by more than L. Each 0 in the repartitioned A matrix is an all zero block. As a result to use a piecewise orthogonalization, the A matrix is expanded (step 50).
  • The A matrix is expanded by padding L−1 zero blocks to the right of each block of the A matrix and shifting each row in the A matrix by its row number less one. To illustrate for the A1 block in row 2 of FIG. 2, four (L−1) zeros are inserted between A2 and A1 in row 2. Additionally, block A1 (as well as A2) is shifted to the right by one column (row 2-1). As a result, Equation 5 after expansion would become Equation 6. A exp = [ A 1 0 0 0 0 0 0 0 0 0 0 0 A 2 0 0 0 A 1 0 0 0 0 0 0 0 A 3 0 0 0 A 2 0 0 0 A 1 0 0 0 A 4 0 0 0 A 3 0 0 0 0 0 0 0 A 5 0 0 0 A 4 0 0 0 0 0 0 0 0 0 0 0 A 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ] Equation 6
  • To accommodate the expanded A matrix, the d matrix must also be expanded, d exp. Each block, d 1 to d Ns, is expanded to a new block, d exp1 to d expNs. Each expanded block, d exp1 to d expNs, is formed by repeating the original block L times. For example for d exp1 a first block row would be created having L versions of d1, stacked one below the other.
  • As a result, Equation 1 can be rewritten as Equation 7. r = A exp · d exp + n = [ B exp 1 B exp 2 B exp 3 B exp N s ] × [ d exp 1 d exp 2 d exp 3 d exp N s ] + n = i = 1 N s B exp i d exp i + n , Equation 7
    Equation 7 can be rewritten to partition each Bexpi orthogonally in L partitions, Uj (I), j=1 to L, as in Equation 8. r = A exp · d exp + n = i = 1 N s [ U 1 ( i ) U 2 ( i ) U L ( i ) ] × [ d i d i d i d i ] + n = i = 1 N s j = 1 L U j ( i ) d i = i = 1 N s B i d i + n Equation 8
  • To reduce computational complexity, a QR decomposition of the Aexp matrix is performed (step 52). Equation 9 illustrates the QR decomposition of Aexp.
    Aexp=QexpRexp  Equation 9
    Due to the orthogonal partitioning of Aexp, the QR decomposition of Aexp is less complex. The resulting Qexp and Rexp matrices are periodic with an initial transient extending over L blocks. Accordingly, Qexp and Rexp can be determined by calculating the initial transient and one period of the periodic portion. Furthermore, the periodic portion of the matrices is effectively determined by orthogonalizing A1 to AL. One approach to QR decomposition is a Gramm-Schmidt orthogonalization.
  • To orthogonalize Aexp as in Equation 6, Bexp1 is orthogonalized by independently orthogonalizing each of its orthogonal partitions, {Uj (i)}, j=1 . . . L. Each {Aj}, j=1 . . . L is independently orthogonalized, and the set is zero-padded appropriately. {Qj} are the orthonormal sets obtained by orthogonalizing {Uj (i)}. To determine Bexp2, its U1 (2) needs to be orthogonalized with respect to only Q2 of Bexp1 formed previously. U2 (2), U2 (2) and U4 (2) only need to be orthogonalized with respect to only Q3, Q4 and Q5, respectively. U5 (2) needs to be orthogonalized to all previous Qs and its orthogonalized result is simply a shifted version of Q5 obtained from orthogonalizing Bexp1.
  • As the orthogonalizing continues, beyond the initial transient, there emerges a periodicity which can be summarized as follows. The result of orthogonalizing Bexpi, i≧6 can be obtained simply by a periodic extension of the result of orthogonalizing Bexp5.
  • The orthogonalization of Bexp5, is accomplished as follows. Its Q5 is obtained by orthogonalizing A5, and then zero padding. Its Q4 is obtained by orthogonalizing the support of Q5 and A4, [sup(Q5) A4], and then zero padding. Since sup(Q5) is already an orthogonal set, only A4 needs to be orthogonalized with respect to sup(Q5) and itself. Its Q3 is obtained by orthogonalizing [sup(Q5) sup(Q4) A3] and then zero padding. Its Q2 is obtained by orthogonalizing [sup(Q5) sup(Q4) sup(Q3) A2] and then zero padding. Its Q. is obtained by orthogonalizing [sup(Q5) sup(Q4) sup(Q3) sup(Q2) A1] and then zero padding. Apart from the initial transient, the entire Aexp can be efficiently orthogonalized, by just orthogonalizing Ap per Equation 10.
    Ap=[A5A4A3A2A1]  Equation 10
    By effectively orthogonalizing the periodic portion of Aexp by using only Ap, computational efficiency is achieved. Using a more compact notation, Qi s,for sup (Qi), this orthogonalization of Ap results in the orthonormal matrix, Qp, of Equation 11.
    Qp=[Q5 SQ4 SQ3 SQ2 SQ1 S]  Equation 11
    The periodic part of Qexp is per Equation 12. PeriodicPartofQ exp = [ 0 0 0 0 0 0 0 0 0 0 Q 1 S 0 0 0 0 0 0 0 0 0 Q 2 S 0 0 0 Q 1 S 0 0 0 0 0 0 Q 3 S 0 0 0 Q 2 S 0 0 0 0 0 0 Q 4 S 0 0 0 Q 3 S 0 0 0 0 0 0 Q 5 S 0 0 0 Q 4 S 0 0 0 0 0 0 0 0 0 0 Q 5 S 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ] Equation 12
  • To constructing the upper triangular matrix Rexp,
    Figure US20080043875A1-20080221-P00900
    Ai
    Figure US20080043875A1-20080221-P00901
    j is a block of size K×K representing the projections of each column of Ai onto all the columns of Qj s. For example, the first column of
    Figure US20080043875A1-20080221-P00900
    A4
    Figure US20080043875A1-20080221-P00901
    5 represents the projections of the first column of A4 on each of the K columns of Q5 s. Similarly,
    Figure US20080043875A1-20080221-P00900
    A4
    Figure US20080043875A1-20080221-P00901
    4 represents the projections of the first column of A4 on each of the K columns of Q4 S. However, this block will be upper triangular, because the kth column of A4 belongs to the space spanned by the orthonormal vectors of Q5 S and the first k vectors of Q4 S. This block is also orthogonal to subsequent vectors in Q4 S, leading to an upper triangular
    Figure US20080043875A1-20080221-P00900
    A4
    Figure US20080043875A1-20080221-P00901
    4. Any
    Figure US20080043875A1-20080221-P00900
    Ai
    Figure US20080043875A1-20080221-P00901
    j with i=j will be upper triangular. To orthogonalize other blocks, the following results.
  • The first block of Bexp5, viz., U1 (5) is formed by a linear combination of {Qj S}, j=1 . . . 5, with coefficients given by
    Figure US20080043875A1-20080221-P00900
    A1
    Figure US20080043875A1-20080221-P00901
    j, j=1 . . . 5. The second block, U2 (5), is formed by a linear combination of {Qj S}, j=2 . . . 5, with coefficients given by
    Figure US20080043875A1-20080221-P00900
    A2
    Figure US20080043875A1-20080221-P00901
    j, j=2 . . . 5. The third block, U3 (5), is formed by a linear combination of {Qj S}, j=3 . . . 5, with coefficients given by
    Figure US20080043875A1-20080221-P00900
    A2
    Figure US20080043875A1-20080221-P00901
    j, j=3 . . . 5. The fourth block, U4 (5),is formed by a linear combination of {Qj S}, j=4, 5, with coefficients given by
    Figure US20080043875A1-20080221-P00900
    A2
    Figure US20080043875A1-20080221-P00901
    j, j=4, 5. The fifth block, U5 (5), is formed by Q5 S×
    Figure US20080043875A1-20080221-P00900
    A5
    Figure US20080043875A1-20080221-P00901
    5.
  • Accordingly, the coefficients in the expansion of subsequent Bexpi, i≧6 are simply periodic extensions of the above. Since the Rexp entries are computed during the orthogonalization of Aexp, no additional computations are needed to construct Rexp. Disregarding the initial transient, the remainder of Rexp is periodic, and two periods of it are shown in Equation 13. R exp = [ 0 0 0 0 0 0 0 0 0 0 0 A 1 5 0 0 0 A 1 4 0 0 0 0 0 0 0 0 0 A 2 5 0 0 0 A 1 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 A 1 3 0 0 0 0 0 0 0 0 0 A 2 4 0 0 0 A 1 4 0 0 0 0 0 A 3 5 0 0 0 A 2 5 0 0 0 0 0 0 0 0 0 0 0 A 1 2 0 0 0 0 0 0 0 0 0 0 A 2 3 0 0 0 A 1 3 0 0 0 0 0 A 3 4 0 0 0 A 2 4 0 0 0 0 0 A 4 5 0 0 0 A 3 5 0 A 1 1 0 0 0 0 0 0 0 0 0 A 2 2 0 0 0 A 1 2 0 0 0 0 0 A 3 3 0 0 0 A 2 3 0 0 0 0 0 A 4 4 0 0 0 A 3 4 0 0 0 0 0 A 5 5 0 0 0 A 4 5 0 0 0 0 0 A 1 1 0 0 0 0 0 0 0 0 0 A 2 2 0 0 0 0 0 0 0 0 0 A 3 3 0 0 0 0 0 0 0 0 0 A 4 4 0 0 0 0 0 0 0 0 0 A 5 5 0 0 0 0 0 0 0 0 0 0 A 1 1 ] Equation 16
    The least squares approach to solving Qexp and Rexp is shown in Equation 14.
    Q exp ·R exp ·d exp= r   Equation 14
    By pre-multiplying both sides of Equation 14 by the transpose of Qexp, Qexp T, and using Qexp T·Qexp=ILKN s , Equation 14 becomes Equation 15.
    R exp ·dexp = Q exp T r   Equation 15
    Equation 15 represents a triangular system whose solution also solves the LS problem of Equation 14.
  • Due to the expansion, the number of unknowns is increased by a factor of L. Since the unknowns are repeated by a factor of L, to reduce the complexity, the repeated unknowns can be collected to collapse the system. Rexp is collapsed using L coefficient blocks, CF1 to CFL, each having a width and a height of K. For a system having an L of 5, CF1 to CF5 can be determined as in Equation 16.
    CF 1=
    Figure US20080043875A1-20080221-P00900
    A 1
    Figure US20080043875A1-20080221-P00901
    1+
    Figure US20080043875A1-20080221-P00900
    A 2
    Figure US20080043875A1-20080221-P00901
    2+
    Figure US20080043875A1-20080221-P00900
    A 3
    Figure US20080043875A1-20080221-P00901
    3+
    Figure US20080043875A1-20080221-P00900
    A 4
    Figure US20080043875A1-20080221-P00901
    4+
    Figure US20080043875A1-20080221-P00900
    A 5
    Figure US20080043875A1-20080221-P00901
    5
    CF 2=
    Figure US20080043875A1-20080221-P00900
    A 1
    Figure US20080043875A1-20080221-P00901
    2+
    Figure US20080043875A1-20080221-P00900
    A 2
    Figure US20080043875A1-20080221-P00901
    3+
    Figure US20080043875A1-20080221-P00900
    A 3
    Figure US20080043875A1-20080221-P00901
    4+
    Figure US20080043875A1-20080221-P00900
    A 4
    Figure US20080043875A1-20080221-P00901
    5
    CF 3=
    Figure US20080043875A1-20080221-P00900
    A 1
    Figure US20080043875A1-20080221-P00901
    3+
    Figure US20080043875A1-20080221-P00900
    A 2
    Figure US20080043875A1-20080221-P00901
    4+
    Figure US20080043875A1-20080221-P00900
    A 3
    Figure US20080043875A1-20080221-P00901
    5
    CF 4=
    Figure US20080043875A1-20080221-P00900
    A 1
    Figure US20080043875A1-20080221-P00901
    4+
    Figure US20080043875A1-20080221-P00900
    A 2
    Figure US20080043875A1-20080221-P00901
    5
    CF5=
    Figure US20080043875A1-20080221-P00900
    A1
    Figure US20080043875A1-20080221-P00901
    5  Equation 16
    Collapsing Rexp using the coefficient blocks produces a Cholesky like factor, Ĝ (step 54). By performing analogous operations on the right hand side of Equation 15 results in a banded upper triangular system of height and width of K×Ns as in Equation 17. [ Tr 1 Tr 2 Tr 3 Tr 4 CF 5 0 0 0 0 0 0 Tr 1 Tr 2 CF 3 CF 4 CF 5 0 0 0 0 0 0 CF 1 CF 2 CF 3 CF 4 CF 5 0 0 0 0 0 0 CF 1 CF 2 CF 3 CF 4 CF 5 0 0 0 0 0 0 CF 1 CF 2 CF 3 CF 4 CF 5 0 0 0 ] × [ d 1 d 2 d 3 d N s ] = r ^ Equation 17
    Tr1 to Tr4 are the transient terms and {circumflex over (r)}. By solving the upper triangle via back substitution, Equation 17 can be solved to determine d (step 56). As a result, the transmitted data symbols of the K data bursts is determined.
  • Using the piecewise orthogonalization and QR decomposition, the complexity of solving the least square problem when compared with a banded Cholesky decomposition is reduced by a factor of 6.5.

Claims (6)

  1. 1. A circuit for receiving a plurality of transmitted data signals, the circuit comprising:
    an antenna for receiving the transmitted data signals;
    a channel estimation device for determining a channel response for each received data signal; and
    a joint detection device having an input configured to receive the channel responses and the received data signals for determining a system response based on in part the channel signals, expanding the system response to be piecewise orthogonal, and retrieving data from the received data signals based on in part the expanded system response.
  2. 2. The circuit of claim 1 for use in a time division duplex using code division multiple access communication system.
  3. 3. The circuit of claim 2 wherein each of the transmitted data signals has an associate code and is transmitted in a shared frequency spectrum and the system response is determined by convolving associated chip codes with the channel response.
  4. 4. The circuit of claim 2 wherein the channel estimation device measures the channel response using a received training sequence associated with the data signals.
  5. 5. The circuit of claim 1 wherein the system response is a system response matrix, further comprising dividing the system response matrix into blocks of columns prior to the expanding.
  6. 6. The circuit of claim 5 wherein the expanding is by padding zeros in the column blocks such that each column block is orthogonal.
US11974994 1999-09-14 2007-10-17 Reduced computation in joint detection Abandoned US20080043875A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US15380199 true 1999-09-14 1999-09-14
US09662404 US6831944B1 (en) 1999-09-14 2000-09-14 Reduced computation in joint detection
US11010703 US7295596B2 (en) 1999-09-14 2004-12-13 Reduced computation in joint detection
US11974994 US20080043875A1 (en) 1999-09-14 2007-10-17 Reduced computation in joint detection

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US11974994 US20080043875A1 (en) 1999-09-14 2007-10-17 Reduced computation in joint detection

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US11010703 Continuation US7295596B2 (en) 1999-09-14 2004-12-13 Reduced computation in joint detection

Publications (1)

Publication Number Publication Date
US20080043875A1 true true US20080043875A1 (en) 2008-02-21

Family

ID=33492662

Family Applications (3)

Application Number Title Priority Date Filing Date
US09662404 Expired - Fee Related US6831944B1 (en) 1999-09-14 2000-09-14 Reduced computation in joint detection
US11010703 Expired - Fee Related US7295596B2 (en) 1999-09-14 2004-12-13 Reduced computation in joint detection
US11974994 Abandoned US20080043875A1 (en) 1999-09-14 2007-10-17 Reduced computation in joint detection

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US09662404 Expired - Fee Related US6831944B1 (en) 1999-09-14 2000-09-14 Reduced computation in joint detection
US11010703 Expired - Fee Related US7295596B2 (en) 1999-09-14 2004-12-13 Reduced computation in joint detection

Country Status (1)

Country Link
US (3) US6831944B1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080198828A1 (en) * 1999-09-21 2008-08-21 Interdigital Technology Corporation Multiuser detector for variable spreading factors
US20090046692A1 (en) * 1999-09-21 2009-02-19 Interdigital Technology Corporation Method for receiving communication signals having differing spreading factors

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10123333A1 (en) * 2001-05-14 2002-11-28 Infineon Technologies Ag Method of multi-user detection using RAKE receiver structure, deactivates one or more RAKE fingers to reduce power consumption during operation
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
US7609788B2 (en) * 2004-02-25 2009-10-27 Mitsubishi Denki Kabushiki Kaisha Receiver apparatus using maximum-likelihood-determination
US7433430B2 (en) * 2005-02-09 2008-10-07 Harris Corporation Wireless communications device providing enhanced block equalization and related methods
US7916841B2 (en) * 2006-09-29 2011-03-29 Mediatek Inc. Method and apparatus for joint detection
US8861423B2 (en) * 2008-01-18 2014-10-14 Intel Corporation Interference mitigation by overhearing
CN102694587B (en) * 2012-05-14 2014-10-15 电子科技大学 A non-coherent detection method sm-ofdm system for
US9855376B2 (en) 2014-07-25 2018-01-02 Minnetronix, Inc. Power scaling
US10014926B1 (en) 2017-10-25 2018-07-03 Northrop Grumman Systems Corporation Symbol quality estimation for adaptive beam-forming

Citations (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4658225A (en) * 1984-07-05 1987-04-14 Hewlett-Packard Company Amplitude insensitive delay lines in a transversal filter
US5727032A (en) * 1993-06-24 1998-03-10 Telefonaktiebolaget Lm Ericsson Method and device for estimating transmitted signals in a receiver in digital signal transmission operations
US5880644A (en) * 1997-11-04 1999-03-09 Texas Instruments Incorporated N-bit pulse width modulated signal generator
US6175587B1 (en) * 1997-12-30 2001-01-16 Motorola, Inc. Communication device and method for interference suppression in a DS-CDMA system
US6304618B1 (en) * 1998-08-31 2001-10-16 Ericsson Inc. Methods and systems for reducing co-channel interference using multiple timings for a received signal
US6314147B1 (en) * 1997-11-04 2001-11-06 The Board Of Trustees Of The Leland Stanford Junior University Two-stage CCI/ISI reduction with space-time processing in TDMA cellular networks
US6327314B1 (en) * 1998-04-01 2001-12-04 At&T Corp. Method and apparatus for channel estimation for multicarrier systems
US6339612B1 (en) * 1998-02-09 2002-01-15 Motorola, Inc. Method and apparatus for joint detection of data in a direct sequence spread spectrum communications system
US6442154B1 (en) * 1999-04-15 2002-08-27 Ericsson Inc. Method and apparatus for successive cancellation using multiple signal timings
US6442193B1 (en) * 1999-03-30 2002-08-27 Koninklijke Philips Electronics N.V. Combining sub-chip resolution samples in arms of a spread-spectrum rake receiver
US6477210B2 (en) * 2000-02-07 2002-11-05 At&T Corp. System for near optimal joint channel estimation and data detection for COFDM systems
US6512534B2 (en) * 2000-02-08 2003-01-28 Canon Kabushiki Kaisha Clock control apparatus and method and image forming apparatus using clock control apparatus
US6594487B1 (en) * 1996-11-26 2003-07-15 Siemens Aktiengesellschaft Reception device for a radio communication system for receiving subscriber signals via a radio interface
US6600776B1 (en) * 1997-02-24 2003-07-29 At&T Wireless Services, Inc. Vertical adaptive antenna array for a discrete multitone spread spectrum communications system
US6603801B1 (en) * 1998-01-16 2003-08-05 Intersil Americas Inc. Spread spectrum transceiver for use in wireless local area network and having multipath mitigation
US6647077B1 (en) * 2000-07-31 2003-11-11 Rf Micro Devices, Inc. Multipath parameter estimation in spread-spectrum communications systems
US6697633B1 (en) * 1995-06-02 2004-02-24 Northrop Grummar Corporation Method permitting increased frequency re-use in a communication network, by recovery of transmitted information from multiple cochannel signals
US6775260B1 (en) * 1999-02-25 2004-08-10 Texas Instruments Incorporated Space time transmit diversity for TDD/WCDMA systems

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19820761C1 (en) 1998-05-08 1999-06-24 Siemens Ag Channel estimation e.g. GSM system

Patent Citations (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4658225A (en) * 1984-07-05 1987-04-14 Hewlett-Packard Company Amplitude insensitive delay lines in a transversal filter
US5727032A (en) * 1993-06-24 1998-03-10 Telefonaktiebolaget Lm Ericsson Method and device for estimating transmitted signals in a receiver in digital signal transmission operations
US6697633B1 (en) * 1995-06-02 2004-02-24 Northrop Grummar Corporation Method permitting increased frequency re-use in a communication network, by recovery of transmitted information from multiple cochannel signals
US6594487B1 (en) * 1996-11-26 2003-07-15 Siemens Aktiengesellschaft Reception device for a radio communication system for receiving subscriber signals via a radio interface
US6600776B1 (en) * 1997-02-24 2003-07-29 At&T Wireless Services, Inc. Vertical adaptive antenna array for a discrete multitone spread spectrum communications system
US5880644A (en) * 1997-11-04 1999-03-09 Texas Instruments Incorporated N-bit pulse width modulated signal generator
US6314147B1 (en) * 1997-11-04 2001-11-06 The Board Of Trustees Of The Leland Stanford Junior University Two-stage CCI/ISI reduction with space-time processing in TDMA cellular networks
US6175587B1 (en) * 1997-12-30 2001-01-16 Motorola, Inc. Communication device and method for interference suppression in a DS-CDMA system
US6603801B1 (en) * 1998-01-16 2003-08-05 Intersil Americas Inc. Spread spectrum transceiver for use in wireless local area network and having multipath mitigation
US6339612B1 (en) * 1998-02-09 2002-01-15 Motorola, Inc. Method and apparatus for joint detection of data in a direct sequence spread spectrum communications system
US6327314B1 (en) * 1998-04-01 2001-12-04 At&T Corp. Method and apparatus for channel estimation for multicarrier systems
US6304618B1 (en) * 1998-08-31 2001-10-16 Ericsson Inc. Methods and systems for reducing co-channel interference using multiple timings for a received signal
US6775260B1 (en) * 1999-02-25 2004-08-10 Texas Instruments Incorporated Space time transmit diversity for TDD/WCDMA systems
US6442193B1 (en) * 1999-03-30 2002-08-27 Koninklijke Philips Electronics N.V. Combining sub-chip resolution samples in arms of a spread-spectrum rake receiver
US6442154B1 (en) * 1999-04-15 2002-08-27 Ericsson Inc. Method and apparatus for successive cancellation using multiple signal timings
US6477210B2 (en) * 2000-02-07 2002-11-05 At&T Corp. System for near optimal joint channel estimation and data detection for COFDM systems
US6512534B2 (en) * 2000-02-08 2003-01-28 Canon Kabushiki Kaisha Clock control apparatus and method and image forming apparatus using clock control apparatus
US6647077B1 (en) * 2000-07-31 2003-11-11 Rf Micro Devices, Inc. Multipath parameter estimation in spread-spectrum communications systems

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080198828A1 (en) * 1999-09-21 2008-08-21 Interdigital Technology Corporation Multiuser detector for variable spreading factors
US20090046692A1 (en) * 1999-09-21 2009-02-19 Interdigital Technology Corporation Method for receiving communication signals having differing spreading factors
US7778232B2 (en) * 1999-09-21 2010-08-17 Interdigital Technology Corporation Multiuser detector for variable spreading factors
US8116220B2 (en) 1999-09-21 2012-02-14 Interdigital Technology Corporation Method for receiving communication signals having differing spreading factors

Also Published As

Publication number Publication date Type
US6831944B1 (en) 2004-12-14 grant
US20050094712A1 (en) 2005-05-05 application
US7295596B2 (en) 2007-11-13 grant

Similar Documents

Publication Publication Date Title
US7133459B2 (en) Space-time transmit diversity
US6798737B1 (en) Use of Walsh-Hadamard transform for forward link multiuser detection in CDMA systems
US6724743B1 (en) Method of conjoint detection of a set of CDMA codes
US6963546B2 (en) Multi-user detection using an adaptive combination of joint detection and successive interface cancellation
US7035354B2 (en) CDMA multi-user detection with a real symbol constellation
EP0993127A1 (en) Method and apparatus using Walsh-Hadamard transformation for forward link multiuser detection in CDMA systems
US6816541B1 (en) Spread spectrum interference cancellation
US20040052236A1 (en) Apparatus and method for joint detection receiving irrespective of orthogonal code length in mobile communication system
US20040141565A1 (en) Groupwise successive interference cancellation for block transmission with reception diversity
US7430253B2 (en) Method and apparatus for interference suppression with efficient matrix inversion in a DS-CDMA system
US20050111528A1 (en) Method and apparatus for DS-CDMA interference suppression using code-specific combining
US6324160B1 (en) Adaptive receiver for CDMA base stations
Lim et al. An asynchronous multiuser CDMA detector based on the Kalman filter
US6928104B2 (en) Scaling using gain factors for use in data detection for wireless code division multiple access communication systems
US7292623B2 (en) Parallel interference cancellation receiver for multiuser detection CDMA signals
US6947502B2 (en) Parameter estimator for a multiuser detection receiver
US6925131B2 (en) Determining channel characteristics in a wireless communication system that uses multi-element antenna
US20030043893A1 (en) Signal processing method and apparatus for a spread spectrum radio communication receiver
WO1996011534A2 (en) Interference cancellation method, and receiver
US6714527B2 (en) Multiuser detector for variable spreading factors
US20050025267A1 (en) Reduced complexity sliding window based equalizer
US20030125090A1 (en) Efficient multiple input multiple output system for multi-path fading channels
US6690660B2 (en) Adaptive algorithm for a Cholesky approximation
US7200183B2 (en) Construction of an interference matrix for a coded signal processing engine
US20030189972A1 (en) Method and device for interference cancellation in a CDMA wireless communication system