US20100067620A1 - Reduced complexity sliding window based equalizer - Google Patents

Reduced complexity sliding window based equalizer Download PDF

Info

Publication number
US20100067620A1
US20100067620A1 US12565284 US56528409A US2010067620A1 US 20100067620 A1 US20100067620 A1 US 20100067620A1 US 12565284 US12565284 US 12565284 US 56528409 A US56528409 A US 56528409A US 2010067620 A1 US2010067620 A1 US 2010067620A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
equation
over
vector
matrix
data
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
US12565284
Inventor
Alexander Reznik
Rui Yang
Bin Li
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
    • 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
    • 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
    • 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/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03012Arrangements for removing intersymbol interference operating in the time domain
    • H04L25/03019Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception
    • H04L25/03057Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception with a recursive structure
    • 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/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03178Arrangements involving sequence estimation techniques
    • H04L25/03248Arrangements for operating in conjunction with other apparatus
    • H04L25/03292Arrangements for operating in conjunction with other apparatus with channel estimation circuitry
    • 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/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/0335Arrangements for removing intersymbol interference characterised by the type of transmission
    • H04L2025/03426Arrangements for removing intersymbol interference characterised by the type of transmission transmission using multiple-input and multiple-output 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/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/03433Arrangements for removing intersymbol interference characterised by equaliser structure
    • H04L2025/03439Fixed structures
    • H04L2025/03445Time domain
    • H04L2025/03471Tapped delay lines
    • H04L2025/03509Tapped delay lines fractionally spaced
    • 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/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/03592Adaptation methods
    • H04L2025/03598Algorithms
    • H04L2025/03605Block algorithms
    • 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/0212Channel estimation of impulse response

Abstract

A method and apparatus for use in data estimation in wireless communication are provided. A wireless communications signal is received and transformed to produce a received vector. The received vector is processed using a sliding window based approach that includes processing each of a plurality of windows. For each window, an approximate circulant channel response matrix is produced for use in estimating a data vector corresponding to the window.

Description

    CROSS REFERENCE TO RELATED APPLICATIONS
  • [0001]
    This application is a continuation of U.S. patent application Ser. No. 12/191,702 filed on Aug. 14, 2008, which was a continuation of U.S. patent application Ser. No. 11/265,932, filed on Nov. 3, 2005, which was a continuation of U.S. patent application Ser. No. 10/875,900, filed on Jun. 24, 2004, now U.S. Pat. No. 7,042,967, which claims priority from U.S. Provisional Application No. 60/482,333, filed on Jun. 25, 2003. U.S. patent Ser. No. 10/875,900 was also a continuation-in-part of U.S. patent application Ser. No. 10/791,244, filed Mar. 2, 2004, which claims priority from 60/452,165, filed on Mar. 3, 2003. All of the above applications are incorporated by reference as if fully set forth.
  • FIELD OF INVENTION
  • [0002]
    The invention generally relates to wireless communication systems, In particular, the invention relates to data detection in such systems.
  • BACKGROUND
  • [0003]
    Due to the increased demands for improved receiver performance, many advanced receivers use zero forcing (ZF) block linear equalizers and minimum mean square error (MMSE) equalizers.
  • [0004]
    In both these approaches, the received signal is typically modeled per Equation 1.
  • [0000]

    r=Hd+n  Equation 1
  • [0005]
    r is the received vector, comprising samples of the received signal. H is the channel response matrix. d is the data vector to be estimated. In spread spectrum systems, such as code division multiple access (CDMA) systems, d may be represented as data symbols or a composite spread data vector. For a composite spread data vector, the data symbols for each individual code are produced by despreading the estimated data vector d with that code. n is the noise vector.
  • [0006]
    In a ZF block linear equalizer, the data vector is estimated, such as per Equation 2.
  • [0000]

    d=(H H H)−1 H H r  Equation 2
  • [0007]
    (·)H is the complex conjugate transpose (or Hermitian) operation. In a MMSE block linear equalizer, the data vector is estimated, such as per Equation 3.
  • [0000]

    d=(H H H+σ 2 I)−1 H H r  Equation 3
  • [0008]
    In wireless channels experiencing multipath propagation, to accurately detect the data using these approaches requires that an infinite number of received samples be used, which is not practical. Therefore, it is desirable to use an approximation technique. One of the approaches is a sliding window approach. In the sliding window approach, a predetermined window of received samples and channel responses are used in the data detection. After the initial detection, the window is slid down to a next window of samples. This process continues until the communication ceases.
  • [0009]
    By not using an infinite number of samples, an error is introduced into the symbol model shown in Equation 1 and, therefore causes inaccurate data detection. The error is most prominent at the beginning and end of the window, where the effectively truncated portions of the infinite sequence have the largest impact. One approach to reduce these errors is to use a large window size and truncate the results at the beginning and the end of the window. The truncated portions of the window are determined in previous and subsequent windows. This approach has considerable complexity, especially when the channel delay spread is large. The large window size leads to large dimensions on the matrices and vectors used in the data estimation. Additionally, this approach is not computationally efficient by detection data at the beginning and at the ends of the window and then discarding that data.
  • [0010]
    Accordingly, it is desirable to have alternate approaches to data detection.
  • SUMMARY
  • [0011]
    A method and apparatus for use in data estimation in wireless communication are provided. A wireless communications signal is received and transformed to produce a received vector. The received vector is processed using a sliding window based approach that includes processing each of a plurality of windows. For each window, an approximate circulant channel response matrix is produced for use in estimating a data vector corresponding to the window.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0012]
    FIG. 1 is an illustration of a banded channel response matrix.
  • [0013]
    FIG. 2 is an illustration of a center portion of the banded channel response matrix.
  • [0014]
    FIG. 3 is an illustration of a data vector window with one possible partitioning.
  • [0015]
    FIG. 4 is an illustration of a partitioned signal model.
  • [0016]
    FIG. 5 is a flow diagram of sliding window data detection using a past correction factor.
  • [0017]
    FIG. 6 is a receiver using sliding window data detection using a past correction factor.
  • [0018]
    FIG. 7 is a flow diagram of sliding window data detection using a noise auto-correlation correction factor.
  • [0019]
    FIG. 8 is a receiver using sliding window data detection using a noise auto-correlation correction factor.
  • [0020]
    FIG. 9 is a graphical representation of the sliding window process.
  • [0021]
    FIG. 10 is a graphical representation of the sliding window process using a circulant approximation.
  • [0022]
    FIG. 11 is a circuit for an embodiment for detecting data using discrete Fourier transforms (DFTs).
  • DETAILED DESCRIPTION
  • [0023]
    Although the features and elements of the present invention are described in the preferred embodiments in particular combinations, each feature or element can be used alone (without the other features and elements of the preferred embodiments) or in various combinations with or without other features and elements of the present invention.
  • [0024]
    Hereafter, a wireless transmit/receive unit (WTRU) includes but is not limited to a user equipment, mobile station, fixed or mobile subscriber unit, pager, or any other type of device capable of operating in a wireless environment. When referred to hereafter, a base station includes but is not limited to a Node-B, site controller, access point or any other type of interfacing device in a wireless environment.
  • [0025]
    Although reduced complexity sliding window equalizer is described in conjunction with a preferred wireless code division multiple access communication system, such as CDMA2000 and universal mobile terrestrial system (UMTS) frequency division duplex (FDD), time division duplex (TDD) modes and time division synchronous CDMA (TD-SCDMA), it can be applied to various communication system and, in particular, various wireless communication systems. In a wireless communication system, it can be applied to transmissions received by a WTRU from a base station, received by a base station from one or multiple WTRUs or received by one WTRU from another WTRU, such as in an ad hoc mode of operation.
  • [0026]
    The following describes the implementation of a reduced complexity sliding window based equalizer using a preferred MMSE algorithm. However, other algorithms can be used, such as a zero forcing algorithm. h(·) is the impulse response of a channel. d(k) is the kth transmitted sample that is generated by spreading a symbol using a spreading code. It can also be sum of the chips that are generated by spreading a set of symbols using a set of codes, such as orthogonal codes. r(·) is the received signal. The model of the system can expressed as per Equation 4.
  • [0000]
    r ( t ) = k = - d ( k ) h ( t - kT c ) + n ( t ) - < t < Equation 4
  • [0027]
    n(t) is the sum of additive noise and interference (intra-cell and inter-cell). For simplicity, the following is described assuming chip rate sampling is used at the receiver, although other sampling rates may be used, such as a multiple of the chip rate. The sampled received signal can be expressed as per Equation 5.
  • [0000]
    r ( j ) = k = - d ( k ) h ( j - k ) + n ( j ) = k = - d ( j - k ) h ( k ) + n ( j ) , j { , - 2 , - 1 , 0 , 1 , 2 , } Equation 5
  • [0000]
    Tc is being dropped for simplicity in the notations.
  • [0028]
    Assuming h(·) has a finite support and is time invariant. This means that in the discrete-time domain, index L exists such that h(i)=0 for i<0 and i≧L. As a result, Equation 5 can be re-written as Equation 6.
  • [0000]
    r ( j ) = k = 0 L - 1 h ( k ) d ( j - k ) + n ( j ) , j { , - 2 , - 1 , 0 , 1 , 2 , } Equation 6
  • [0029]
    Considering that the received signal has M received signals r(0), . . . , r(M−1), Equation 7 results.
  • [0000]

    r=Hd+n
  • [0000]
    where,
  • [0030]
    r=[r(0), . . . , r(M−1)]TεCM,
  • [0031]
    d=[d(−L+1), d(−L+2), . . . , d(0), d(1), . . . , d(M−1)]TεCM+L−1
  • [0032]
    n=[n(0), . . . , n(M−1)]TεCM
  • [0000]
    Equation 7 H = [ h ( L - 1 ) h ( L - 2 ) h ( 1 ) h ( 0 ) 0 0 h ( L - 1 ) h ( L - 2 ) h ( 1 ) h ( 0 ) 0 0 h ( L - 1 ) h ( L - 2 ) h ( 1 ) h ( 0 ) ] C M × ( M + L - 1 )
  • [0033]
    In Equation 7, CM represents the space of all complex vectors with dimension M.
  • [0034]
    Part of the vector d can be determined using an approximate equation. Assuming M>L and defining N=M−L+1, vector d is per Equation 8.
  • [0000]
    d = [ d ( - L + 1 ) , d ( - L + 2 ) , , d ( - 1 ) , L - 1 d ( 0 ) , d ( 1 ) , , d ( N - 1 ) , N d ( N ) , , d ( N + L - 2 ) L - 1 ] T C N + 2 L - 2 Equation 8
  • [0035]
    The H matrix in Equation 7 is a banded matrix, which can be represented as the diagram in FIG. 1. In FIG. 1, each row in the shaded area represents the vector [h(L−1), h(L−2), . . . , h(1), h(0)], as shown in Equation 7.
  • [0036]
    Instead of estimating all of the elements in d, only the middle N elements of d are estimated. {tilde over (d)} is the middle N elements as per Equation 9.
  • [0000]

    {tilde over (d)}=[d(0), . . . , d(N−1)]T  Equation 9
  • [0037]
    Using the same observation for r, an approximate linear relation between r and {tilde over (d)} is per Equation 10.
  • [0000]

    r={tilde over (H)}{tilde over (d)}+n Equation 10
  • [0038]
    Matrix {tilde over (H)} can be represented as the diagram in FIG. 2 or as per Equation 11.
  • [0000]
    H ~ = [ h ( 0 ) 0 h ( 1 ) h ( 0 ) h ( 1 ) 0 h ( L - 1 ) h ( 0 ) 0 h ( L - 1 ) h ( 1 ) 0 h ( L - 1 ) ] Equation 11
  • [0039]
    As shown, the first L−1 and the last L−1 elements of r are not equal to the right hand side of the Equation 10. As a result, the elements at the two ends of vector {tilde over (d)} will be estimated less accurately than those near the center. Due to this property, a sliding window approach, as described subsequently, is preferably used for estimation of transmitted samples, such as chips.
  • [0040]
    In each kth step of the sliding window approach, a certain number of the received samples are kept in r [k] with dimension N+L−1. They are used to estimate a set of transmitted data {tilde over (d)}[k] with dimension N using equation 10. After vector {tilde over (d)}[k] is estimated, only the “middle” part of the estimated vector {tilde over ({circumflex over (d)}[k] is used for the further data processing, such as by despreading. The “lower” part (or the later in-time part) of {tilde over (d)}[k] is estimated again in the next step of the sliding window process in which r [k+1] has some of the elements r [k] and some new received samples, i.e. it is a shift (slide) version of r [k].
  • [0041]
    Although, preferably, the window size N and the sliding step size are design parameters, (based on delay spread of the channel (L), the accuracy requirement for the data estimation and the complexity limitation for implementation), the following using the window size of Equation 12 for illustrative purposes.
  • [0000]

    N=4N s×SF  Equation 12
  • [0000]
    SF is the spreading factor. Typical window sizes are 5 to 20 times larger than the channel impulse response, although other sizes may be used.
  • [0042]
    The sliding step size based on the window size of Equation 12 is, preferably, 2Ns×SF. Nsε{1, 2, . . . } is, preferably, left as a design parameter. In addition, in each sliding step, the estimated chips that are sent to the despreader are 2Ns×SF elements in the middle of the estimated {circumflex over (d)}[k]. This procedure is illustrated in FIG. 3.
  • [0043]
    In the sliding window approach described above, the system model is approximated by throwing away some terms in the model. In the following, a technique is described where terms are kept by either using the information estimated in previous sliding step or characterizing the terms as noise in the model. The system model is corrected using the kept/characterized terms.
  • [0044]
    One algorithm of data detection uses an MMSE algorithm with model error correction uses a sliding window based approach and the system model of Equation 10.
  • [0045]
    Due to the approximation, the estimation of the data, such as chips, has error, especially, at the two ends of the data vector in each sliding step (the beginning and end). To correct this error, the H matrix in Equation 7 is partitioned into a block row matrix, as per Equation 13, (step 50).
  • [0000]

    H=[H p |{tilde over (H)}|H f]  Equation 13
  • [0046]
    Subscript “p” stands for “past”, and “f” stands for “future”. {tilde over (H)} is as per Equation 10. Hp is per Equation 14.
  • [0000]
    H p = [ h ( L - 1 ) h ( L - 2 ) h ( 1 ) 0 h ( L - 1 ) h ( 2 ) 0 0 h ( L - 1 ) 0 0 0 0 ] C ( N + L - 1 ) × ( L - 1 ) Equation 14
  • [0047]
    Hf is per Equation 15.
  • [0000]
    H f = [ 0 0 0 0 h ( 0 ) 0 0 0 h ( L - 3 ) h ( 0 ) 0 h ( L - 2 ) h ( L - 3 ) h ( 0 ) ] C ( N + L - 1 ) × ( L - 1 ) Equation 15
  • [0048]
    The vector d is also partitioned into blocks as per Equation 16.
  • [0000]

    d=[d p T |{tilde over (d)} T |d f T]T  Equation 16
  • [0049]
    {tilde over (d)} is the same as per Equation 8 and dp is per Equation 17.
  • [0000]

    d p =[d(−L+1)d(−L+2) . . . d(−1)]T εC L-1  Equation 17
  • [0050]
    df is per Equation 18.
  • [0000]

    d f =[d(N)d(N+1) . . . d(N+L−2)]T εC L-1  Equation 18
  • [0051]
    The original system model is then per Equation 19 and is illustrated in FIG. 4.
  • [0000]

    r=H p d p +{tilde over (H)}{tilde over (d)}+H f d f +n  Equation 19
  • [0052]
    One approach to model Equation 19 is per Equation 20.
  • [0000]

    {tilde over (r)}={tilde over (H)}{tilde over (d)}+ñ 1  Equation 20
  • [0000]
    where {tilde over (r)}=r−Hpdp and ñ1=Hfdf+n
  • [0053]
    Using an MMSE algorithm, the estimated data vector {tilde over ({circumflex over (d)} is per Equation 21.
  • [0000]

    {tilde over ({circumflex over (d)}=g d {tilde over (H)} H(g d {tilde over (H)}{tilde over (H)} H1)−1 {tilde over ({circumflex over (r)}  Equation 21
  • [0054]
    In Equation 21, gd is chip energy per Equation 22.
  • [0000]

    E{d(i)d*(j)}=g dδij  Equation 22
  • [0055]
    {tilde over ({circumflex over (r)} is per Equation 23.
  • [0000]

    {tilde over ({circumflex over (r)}=r−H p {circumflex over (d)} p  Equation 23
  • [0056]
    {circumflex over (d)}p, is part of the estimation of {tilde over (d)} in the previous sliding window step. Σ1 is the autocorrelation matrix of ñ1, i.e., Σ1=E{ñ1ñ1 H}. If assuming Hfdf and n are uncorrelated, Equation 24 results.
  • [0000]

    Σ1 =g d H f H f H +E{nn H}  Equation 24
  • [0057]
    The reliability of depends on the sliding window size (relative to the channel delay span L) and sliding step size.
  • [0058]
    This approach is also described in conjunction with the flow diagram of FIG. 5 and preferred receiver components of FIG. 6, which can be implemented in a WTRU or base station. The circuit of FIG. 6 can be implemented on a single integrated circuit (IC), such as an application specific integrated circuit (ASIC), on multiple IC's, as discrete components or as a combination of IC('s) and discrete components.
  • [0059]
    A channel estimation device 20 processes the received vector r producing the channel estimate matrix portions, Hp, {tilde over (H)} and Hf, (step 50). A future noise auto-correlation device 24 determines a future noise auto-correlation factor, gdHfHf H, (step 52). A noise auto-correlation device 22 determines a noise auto-correlation factor, E{nnH}, (step 54). A summer 26 sums the two factors together to produce Σ1, (step 56).
  • [0060]
    A past input correction device 28 takes the past portion of the channel response matrix, Hp, and a past determined portion of the data vector, {circumflex over (d)}p, to produce a past correction factor, Hp{circumflex over (d)}p, (step 58). A subtractor 30 subtracts the past correction factor from the received vector producing a modified received vector, {tilde over ({circumflex over (r)}, (step 60). An MMSE device 34 uses Σ1, {tilde over (H)}, and {tilde over ({circumflex over (r)} to determine the received data vector center portion {tilde over ({circumflex over (d)}, such as per Equation 21, (step 62). The next window is determined in the same manner using a portion of {tilde over ({circumflex over (d)} as {circumflex over (d)}p in the next window determination, (step 64). As illustrated in this approach, only data for the portion of interest, {tilde over ({circumflex over (d)}, is determined reducing the complexity involved in the data detection and the truncating of unwanted portions of the data vector.
  • [0061]
    In another approach to data detection, only the noise term is corrected. In this approach, the system model is per Equation 25.
  • [0000]

    r={tilde over (H)}{tilde over (d)}+ñ 2, where ñ2=Hpdp+Hfdf+n  Equation 25
  • [0062]
    Using an MMSE algorithm, the estimated data vector {tilde over ({circumflex over (d)} is per Equation 26.
  • [0000]

    {tilde over ({circumflex over (d)}=g d {tilde over (H)} H(g d {tilde over (H)}{tilde over (H)} H2)−1 r  Equation 26
  • [0063]
    Assuming Hpdp, Hfdf and n are uncorrelated, Equation 27 results.
  • [0000]

    Σ2 =g d H p H p H +g d H f H f H +E{nn H}  Equation 27
  • [0064]
    To reduce the complexity in solving Equation 26 using Equation 27, a full matrix multiplication for HpHp H and HfHf H are not necessary, since only the upper and lower corner of Hp and Hf, respectively, are non-zero, in general.
  • [0065]
    This approach is also described in conjunction with the flow diagram of FIG. 7 and preferred receiver components of FIG. 8, which can be implemented in a WTRU or base station. The circuit of FIG. 8 can be implemented on a single integrated circuit (IC), such as an application specific integrated circuit (ASIC), on multiple IC's, as discrete components or as a combination of IC('s) and discrete components.
  • [0066]
    A channel estimation device 36 processes the received vector producing the channel estimate matrix portions, Hp, {tilde over (H)} and Hf, (step 70). A noise auto-correlation correction device 38 determines a noise auto-correlation correction factor, gdHpHp H+gdHfHf H, using the future and past portions of the channel response matrix, (step 72). A noise auto correlation device 40 determines a noise auto-correlation factor, E{nnH}, (step 74). A summer 42 adds the noise auto-correlation correction factor to the noise auto-correlation factor to produce Σ2 (step 76). An MMSE device 44 uses the center portion or the channel response matrix, {tilde over (H)}, the received vector, r, and Σ2 to estimate the center portion of the data vector, {tilde over ({circumflex over (d)}, (step 78). One advantage to this approach is that a feedback loop using the detected data is not required. As a result, the different slided window version can be determined in parallel and not sequentially.
  • [0067]
    Discrete Fourier Transform Based Equalization
  • [0068]
    The sliding window approach described above requires a matrix inversion, which is a complex process. One embodiment for implementing a sliding window utilizes discrete Fourier transforms (DFTs), as follows. Although the preferred implementation of the DFT based approach is with a MMSE algorithm, it can be applied to other algorithms, such as a zero forcing (ZF) based algorithm.
  • [0069]
    A matrix AcirεCN×N, for some integer N, is a circulant matrix if it has the following form per Equation 28.
  • [0000]
    A cir = [ a 1 a N a N - 1 a 2 a 2 a 1 a N a 2 a 1 a N - 1 a 2 a N a N a N - 1 a 1 ] Equation 28
  • [0070]
    This kind of matrix is expressed using the DFT and the IDFT operators, such as per Equation 29.
  • [0000]

    A cir =F N −1Λ(A cir[:,1])F N  Equation 29
  • [0000]
    where, Acir[:,1]=(a0, a1, . . . , aN)TεCN, i.e. it is the first column of matrix Acir
    Columns other than the first column can be used if properly permuted. FN is the N-point DFT matrix which is defined as, for any xεCN, as per Equation 30.
  • [0000]
    ( F N x ) k = n = 0 N - 1 x ( n ) j 2 π kn N k = 0 , , N - 1 Equation 30
  • [0000]
    FN −1 is the N-point inverse DFT matrix which is defined as, for any xεCN, as per Equation 31.
  • [0000]
    ( F N - 1 x ) k = 1 N ( F N * x ) k = 1 N n = 0 N - 1 x ( n ) - j 2 π kn N k = 0 , , N - 1 Equation 31
  • [0000]
    ΛN(·) is a diagonal matrix, which is defined as, for any xεCN, as per Equation 32.
  • [0000]

    ΛN(x)=diag(F N x)  Equation 32
  • [0071]
    The inverse of matrix Acir is expressed, such as per Equation 33.
  • [0000]

    A cir −1 =F N −1ΛN −1(A cir[:,1])F N  Equation 33
  • [0072]
    The following is an application of a DFT based approach to the data estimation process using the sliding window based chip level equalizer. The first embodiment uses a single receiving antenna. Subsequent embodiments use multiple receiving antennas.
  • [0073]
    The receiver system is modeled as per Equation 34.
  • [0000]
    r ( t ) = k = - d ( k ) h ( t - kT c ) + n ( t ) - < t < Equation 34
  • [0000]
    h(·) is the impulse response of the channel. d(k) is the kth transmitted chip samples that is generated by spreading symbols using a spreading code. r(·) is the received signal. n(·) is the sum of additive noise and interference (intra-cell and inter-cell).
  • [0074]
    Using chip rate sampling and h(·) having a finite support, which means, in discrete-time domain, there is an integer L such that h(i)=0 for i<0 and i≧L, the sampled received signal can be expressed (Tc is dropped for simplicity of the notations), as per Equation 35.
  • [0000]
    r ( j ) = k = 0 L - 1 h ( k ) d ( j - k ) + n ( j ) j { , - 2 , - 1 , 0 , 1 , 2 , } Equation 35
  • [0075]
    Based on M (M>L) received signals r(0), . . . , r(M−1), Equation 36 results.
  • [0000]
    r = Hd + n where r = [ r ( 0 ) , , r ( M - 1 ) ] T C M , d = [ d ( - L + 1 ) , d ( - L + 2 ) , , d ( 0 ) , d ( 1 ) , , d ( M - 1 ) ] T C M + L = 1 n = [ n ( 0 ) , , n ( M - 1 ) ] T C M Equation 36 H = [ h ( L - 1 ) h ( L - 2 ) h ( 1 ) h ( 0 ) 0 0 h ( L - 1 ) h ( L - 2 ) h ( 1 ) h ( 0 ) 0 0 h ( L - 1 ) h ( L - 2 ) h ( 1 ) h ( 0 ) ] C M × ( M + L - 1 )
  • [0076]
    As illustrated by Equation 36, the H matrix is Toeplitz. As described subsequently in the application for multiple chip rate sampling and/or multiple receive antennas, the H matrix is block Toeplitz. Using the block Toeplitz property, discrete Fourier transform techniques can be applied. The Toeplitz/block Toeplitz nature is produced as a result of the convolution with one channel or the convolution of the input signal with a finite number of effective parallel channels. The effective parallel channels appear as a result of either oversampling or multiple receive antennas. For one channel, a single row is essentially slide down and to the right producing a Toeplitz matrix.
  • [0077]
    The statistics of the noise vector are treated as having the autocorrelation property, per Equation 37.
  • [0000]

    E{nnH}=σ2I  Equation 37
  • [0078]
    The left hand side of equation (5) can be viewed as a “window” of continuous input signal stream. To estimate the data, an approximated model is used. In this approximated model, the first L−1 and the last L−1 elements of vector d are assumed to be zero before applying the MMSE algorithm and the reset M−L+1 elements of d forms a new vector {tilde over (d)}=[d(0), . . . , d(M−L+1)]T. The approximated model can be expressed explicitly as per Equation 38.
  • [0000]
    r = H ~ d ~ + n where H ~ = [ h ( 0 ) 0 h ( 1 ) h ( 0 ) h ( 1 ) 0 h ( L - 1 ) h ( 0 ) 0 h ( L - 1 ) h ( 1 ) 0 h ( L - 1 ) ] . Equation 38
  • [0079]
    After the vector {tilde over (d)} is estimated, only the middle part of it is taken for de-spreading. Subsequently, the window of observation (i.e. the received signal) is slid by (M−L+1)/2 elements and the process is repeated. FIG. 9 is a graphical representation of the sliding window process, as described above.
  • [0080]
    Using MMSE algorithm, the estimated data is expressed per Equation 39.
  • [0000]

    {tilde over ({circumflex over (d)}=R−1{tilde over (H)}Hr  Equation 39
  • [0000]
    where R={tilde over (H)}H{tilde over (H)}+σ2I
  • [0081]
    In Equation 39, neither the matrix R nor the matrix {tilde over (H)} is circulant to facilitate a DFT implementation. To facilitate a DFT implementation, for each sliding step, the approximated system model per Equation 40 is used.
  • [0000]
    r = H d + n where H = [ h ( 0 ) 0 h ( 1 ) h ( 0 ) h ( 1 ) 0 h ( L - 1 ) h ( 0 ) 0 0 h ( L - 1 ) h ( 1 ) h ( 0 ) 0 0 h ( L - 1 ) h ( L - 2 ) h ( 0 ) ] C M × M d = [ d ( 0 ) , , d ( M - 1 ) ] T C M × 1 Equation 40
  • [0000]
    In Equation 40, only the first L−1 elements (equations) are approximations of those of Equation 36.
  • [0082]
    The matrix {hacek over (H)} is replaces by a circulant matrix, such as per Equation 41.
  • [0000]
    Equation 41 H cir = [ h ( 0 ) 0 0 h ( L - 1 ) h ( 1 ) h ( 1 ) h ( 0 ) 0 h ( 1 ) 0 h ( L - 1 ) h ( L - 1 ) h ( 0 ) 0 0 0 h ( L - 1 ) h ( 1 ) h ( 0 ) 0 0 0 h ( L - 1 ) h ( L - 2 ) h ( 0 ) ]
  • [0083]
    The system model, for each sliding step, is per Equation 42.
  • [0000]

    r=H cir d+n  Equation 42
  • [0000]
    with d=[d(0), . . . , d(M−1)]TεCM×1
    The vector d in Equation 42, due to the new model, is different than the vector d in Equation 36. Equation 42 adds additional distortion to the first L−1 element of Equation 39. This distortion makes the two ends of the estimated vector d inaccurate. FIG. 10 is a graphical representation of the model construction process.
  • [0084]
    Using approximated model per Equation 42, the MMSE algorithm yields the estimated data as per Equation 43.
  • [0000]

    {circumflex over (d)}=Rcir −1Hcir Hr  Equation 43
  • [0000]
    where Rcir=Hcir HHcir2I
    Both Hcir H and Rcir are circulant and Rcir is of the form per Equation 44.
  • [0000]
    R cir = Equation 44 [ R 0 R 1 R L - 1 0 0 R 2 * R 1 * R 1 * R 0 R L - 1 0 R 1 * R 1 R L - 1 0 R L - 1 * R L - 1 * R 0 R 1 0 0 0 R L - 1 * 0 R L - 1 * R 1 * R 0 R L - 1 0 0 0 R 1 * R L - 1 0 0 R L - 1 * R 1 0 0 R L - 1 0 0 R L - 1 * R 0 R 1 R L - 1 0 R L - 1 0 R L - 1 * R 1 * R 0 R L - 1 0 0 R 1 * R 1 0 R L - 1 * R 0 R 1 R 1 R 2 0 0 0 R L - 1 * R 1 * R 0 ]
  • [0085]
    Applying the properties of circulant matrices, the estimated data is per Equation 45.
  • [0000]

    {circumflex over (d)}=F M −1ΛM −1(R cir[:,1])ΛM(H cir H[:,1])F M r  Equation 45
  • [0086]
    FIG. 11 is a diagram of a circuit for estimating the data per Equation 45. The circuit of FIG. 11 can be implemented on a single integrated circuit (IC), such as an application specific integrated circuit (ASIC), on multiple IC's, as discrete components or as a combination of IC('s) and discrete components.
  • [0087]
    The estimated channel response {tilde over (H)} is processed by an {hacek over (H)} determination device 80 to determine the Toeplitz matrix {hacek over (H)}. A circulant approximation device 82 processes {hacek over (H)} to produce a circulant matrix Hcir. A Hermitian device 84 produces the Hermitian of Hcir, Hcir H. Using Hcir, Hcir H and the noise variance σ2, Rcir is determined by a Rcir determining device 86. Using a first column of Hcir H, a diagonal matrix is determined by a ΛM(Hcir H[:,1]) determining device 88. Using a first column of Rcir, an inverse diagonal matrix is determined by a ΛM −1(Rcir[:,1]) determination device 90. A discrete Fourier transform device 92 performs a transform on the received vector, r. The diagonal, inverse diagonal and Fourier transform result are multiplied together by a multiplier 96. An inverse Fourier transform device 94 takes an inverse transform of the result of the multiplication to produce the data vector {tilde over (d)}.
  • [0088]
    The sliding window approach is based on an assumption that the channel is invariant within each sliding window. The channel impulse response near the beginning of the sliding window may be used for each sliding step.
  • [0089]
    One preferred approach for determining the window step size Nss and window size M is per Equation 46, although others may be used.
  • [0000]

    N ss=2N symbol×SF and M=4N symbol×SF  Equation 46
  • [0000]
    Nsymbolε{1, 2, . . . } is the number of symbols and is a design parameter which should be selected, such that M>L. Since M is also the parameter for DFT which may be implemented using FFT algorithm. M may be made large enough such that the radix-2 FFT or a prime factor algorithm (PFA) FFT can be applied. After the data is estimated, 2Nsymbol×SF samples are taken to process despreading starting from Nsymbol×SFth sample. FIG. 11 is an illustration of taking the samples for despreading.
  • [0090]
    Multiple Receive Antenna Equalization
  • [0091]
    The following is an embodiment using multiple receive antennas, such as K receive antennas. Samples of the received vector and estimates of the channel impulse response are taken for each antenna independently. Following the same process as for the single antenna embodiment, each antenna input, rk, is approximated per Equation 47.
  • [0000]

    r k =H cir,k d+n k for k=1, . . . , K  Equation 47
  • [0000]
    or in block matrix form per Equation 48
  • [0000]
    [ r 1 r 2 r K ] = [ H cir , 1 H cir , 2 H cir , K ] d + [ n 1 n 2 n K ] Equation 48
  • [0092]
    Equations 49 and 50 are estimates of the auto-correlation and cross-correlation properties of the noise terms.
  • [0000]

    E{nknk H}=σ2I for k=1, . . . , K  Equation 49
  • [0000]

    and
  • [0000]

    E{nknj H}=0 for k≠j  Equation 50
  • [0093]
    Applying MMSE algorithm, the estimated data can be expressed as per Equation 51.
  • [0000]
    d ^ = R cir - 1 k = 1 K H cir , k H r k where R cir = k = 1 K H cir , k H H cir , k + σ 2 I Equation 51
  • [0000]
    Rcir is still a circulant matrix and the estimated data can be determined per Equation 52.
  • [0000]
    d ^ = F M - 1 Λ M - 1 ( R cir [ : , 1 ] ) k = 1 K Λ M ( H cir , k H [ : , 1 ] ) F M r k Equation 52
  • [0094]
    If the receive antennas are positioned close to each other, the noise terms may be correlated in both time and space. As a result, some degradation in the performance may result.
  • [0095]
    Multiple Chip Rate Sampling (Oversampling) Equalization
  • [0096]
    The following describes embodiments using a sliding window based equalization approach with multiple chip rate sampling. Multiple chip rate sampling is when the channel is sampled at a sampling rate which is an integer multiple of the chip rate, such as two times, three times, etc. Although the following concentrates on two times per chip sampling, these approaches can be applied to other multiples.
  • [0097]
    Using a sliding window of width of N chips and two time chip rate sampling, our received vector is r=[r0, r1, . . . , r2N−1]T. This vector may be rearranged and separated into an even received vector re=[r0, r2, . . . , r2N−2]T and an odd received vector ro=[r1, r3, . . . , r2N−1]T, with r=[re, ro]T. Without loss of generality, the data transmission model is per Equation 53.
  • [0000]
    [ r e r o ] = [ H e H o ] d + [ n e n o ] Equation 53
  • [0000]
    Equation 53 separates the effective 2-sample-per-chip discrete-time channel into two chip-rate discrete-time channels.
  • [0098]
    The matrices He and Ho in Equation 53 are, correspondingly, the even and odd channel response matrices. These matrices are constructed from the even and odd channel response vectors he and ho, which are obtained by sampling the channel response at 2 samples per chip and separating it into the even and odd channel response vectors.
  • [0099]
    The channel noise is modeled as white with a variance σ2, as per Equation 54.
  • [0000]

    E[nene H]=E[nono H]=σ2I  Equation 54
  • [0100]
    If the channel is an additive white Gaussian noise (AWGN) channel and the received data is provided directly from the sampled channel, then Equation 55 results.
  • [0000]

    E[neno H]=0  Equation 55
  • [0101]
    As a result, the problem is mathematically similar to the case of the chip-rate equalizer for 2 receive antennas with uncorrelated noise, as previously described. However, the received antenna signals in many implementations are processed by a receive-side root-raised cosine (RRC) filter before being provided to the digital receiver logic for further processing. Following such processing, the received noise vector is no longer white, but has a raised-cosine (RC) autocorrelation function. RC is the frequency-domain square of a RRC response. Since the RC pulse is a Nyquist pulse, Equation 54 holds, however Equation 55 does not. The (i,j)th element of the matrix
  • [0000]
    Λ cross = def 1 σ 2 E [ n e n o H ]
  • is per Equation 56.
  • [0102]
    1 σ 2 E [ n e n o H ] ( i , j ) = x RC ( i - j + 0.5 ) Equation 56
  • [0000]
    xRC is the unity-symbol-time normalized RC pulse shape.
  • [0103]
    Properties of Λcross are it is real, symmetric and Toeplitz; it is not banded and has no zero entries and its entries do get smaller and tend to 0 as they get farther and farther away from the main diagonal.
  • [0104]
    Σn represent the cross-correlation matrix of the total noise vector and is per Equation 57.
  • [0000]
    Σ n = σ 2 [ I Σ cross Σ cross I ] Equation 57
  • [0105]
    Exact Solution
  • [0106]
    The exact solution to the problem of linear minimum mean-square estimation of d from the observation of r is per Equation 58.
  • [0000]

    {circumflex over (d)} MMSE=(H HΣn −1 H+I)−1 H HΣn −1 r  Equation 58
  • [0000]
    where y=HHΣn −1r is the whitening matched filtering (WMF)
  • [0107]
    {circumflex over (d)}MMSE=(HHΣn −1H+I)−1y is the linear MMSE equalization
  • [0108]
    Neither HHΣn −1 nor HHΣn −1H+I are Toeplitz and neither can be made Toeplitz through elemental unitary operations (e.g. row/column re-arrangements), due to the structure of Σn. Accordingly, DFT-based methods based on circulant approximations of Toeplitz matrices cannot be applied here and an exact solution is highly complex.
  • [0109]
    Two embodiments for deriving an efficient algorithm for solving this problem are described. The first embodiment uses a simple approximation and the second embodiment uses an almost-exact solution.
  • [0110]
    Simple Approximation
  • [0111]
    The simple approximation ignores the correlation between ne and no, Σcross=0. As a result, the same approach as multiple chip-rate receive antennas is used.
  • [0112]
    The complexity of this simple approximation approach is as follows. N-chip data blocks are considered. For rough approximation, an N-point DFT complexity, given by N log N operations per second (ops), is assumed. Additionally, N-point vector multiplications are assumed to take N ops and vector additions are ignored.
  • [0113]
    The complexity of the DFT-based approach can be roughly partitioned into 2 components: the processing which has to be performed on every received data set and the processing which is performed when the channel estimate is updated, which is typically done one to two orders of magnitude less frequently then the former operation.
  • [0114]
    For processing performed on each received data set, the following operations are performed: 2 N-point DFTs to transform the received vector into the frequency domain; 2 N-point vector multiplications (multiply each received vector by the appropriate “state” vector”); and one more DFT to transform the result back into time domain. Thus, the approximate complexity is per Equation 59.
  • [0000]

    C 1,r=3N log N+2N  Equation 59
  • [0115]
    For processing performed when the channel response is updated, the following operations are performed: 2 DFT operations, 6 N-point vector multiplies and a vector division, which need to be taken 10 times the operations of a vector multiply. Thus, the complexity of this step is roughly given per Equation 60.
  • [0000]

    C 1,r=2N log N+16N  Equation 60
  • [0116]
    Almost Exact Solution
  • [0117]
    For the almost-exact solution which uses a block-Toeplitz solution, the vector and matrices are rearranged in their natural order, i.e., the natural order being an order that elements of the received vector and channel response matrix were actually received, such that the vector r is given by r=[r0, r1, . . . , r2N−1]T. Equation 61 is the natural order model.
  • [0000]

    r=H bT d+n
  • [0000]
    where HbT is defined as
  • [0000]
    H bT = [ h e , 1 h o , 1 h o , N ] = [ G 1 G 2 G N ] Equation 61
  • [0000]
    he,i is the ith row of He and ho,i is the ith row of Ho. Gi is a 2×N matrix whose 1st row is he,i and whose 2nd row is ho,i. Using Gi [x,y] as the row-x, column-y element of HbT is block-Toeplitz as illustrated in Equation 62.
  • [0000]

    G i [x,y]=G j [x,y+(i−j)]  Equation 62
  • [0000]
    provided that 1≦y+(i−j)≦N
  • [0118]
    The block-Toeplitz structure of HbT follows immediately from the Toeplitz structure of He and Ho and the row-rearrangement. From the Toeplitz structure of I and Σcross, the autocorrelation matrix of the noise in the re-defined problem is also block Toeplitz. Because this matrix is also symmetric, it can be rewritten per Equation 63.
  • [0000]

    ΣbT=[Σi,j]1≦i,j≦N  Equation 63
  • [0000]
    where Σi,j are 2×2 matrices with the property that Σi,j|i−j|
  • [0119]
    Subsequently, block-circulant approximations to the block-Toeplitz matrices are produced. Since the HbT matrix is also banded, the block circulant approximation of HbT is then obtained directly. However, ΣbT is not banded and therefore it is not possible to produce a block-circulant approximation directly from it. Since the elements of ΛbT tend to 0 as they get farther away from the main diagonal, a banded approximation to ΣbT is per Equation 64.
  • [0000]

    ΣbT≈{tilde over (Σ)}bT=[{tilde over (Σ)}i,j]1≦i,j≦N  Equation 64
  • [0000]
    where {tilde over (Σ)}i,j are 2×2 matrices with the property that
  • [0120]
    {tilde over (Σ)}i,j|i−j| if |i−j|≦Bn and {tilde over (Σ)}i,j=0 otherwise
  • [0000]
    The noise-covariance-bandwidth, Bn, is a design parameters that is selected. Due to the decay properties of the RC pulse shape, it is likely to be only several chip. Now {tilde over (Σ)}bT is banded block-Toeplitz and a circulant approximation to it is produced.
  • [0121]
    The circulant approximations of HbT and {tilde over (Σ)}bT are HbC and ΣbC, respectively. Wn denotes the n-point DFT matrix, that is if x is an n-vector, then xf=Wnx is the DFT of x. A block-circulant matrix C is of the form of Equation 65.
  • [0000]
    C = [ C 1 C 2 C M C 2 C 3 C 1 C M C 1 C M - 1 ]
  • [0000]
    where Ci is an N×N matrix and therefore C is an MN×MN matrix
  • [0122]
    C can also be written as Equation 66.
  • [0000]

    C=W M×N −1ΛM×N(C)W M×N  Equation 66
  • [0000]
    where WM×N is the block-N-DFT matrix defined as WM×N=WM{circle around (x)}IN
    ΛM×N(C) is a block diagonal matrix that depends on C and is given by Equation 67.
  • [0000]
    Λ M × N ( C ) = [ Λ 1 ( C ) Λ 2 ( C ) Λ M ( C ) ] Equation 67
  • [0000]
    Λi(C) is an N×N matrix. To completely specify Λi(C), λi,(k,l) denotes the (k,l)th element of Λi(C) and is defined as
  • [0000]
    λ ( k , l ) = def [ λ 1 , ( k , l ) , λ 2 , ( k , l ) , , λ M , ( k , l ) ] T · c i , ( k , l )
  • [0000]
    denotes the (k,l)th element of C and is defined as
  • [0000]
    c ( k , l ) = def [ c 1 , ( k , l ) , c 2 , ( k , l ) , , c M , ( k , l ) ] T · λ ( k , l )
  • [0000]
    is the M-point DFT of c(k,l) and is per Equation 68.
  • [0000]

    λ(k,l)=WM c (k,l)  Equation 68
  • [0123]
    Equations 66-68 specify the block-DFT representation of square block circulant matrices. N2 DFTs are required to compute ΛM×N(C).
  • [0124]
    The MMSE estimator is rewritten per Equation 69.
  • [0000]

    {circumflex over (d)} MMSE =H Hn +HH H)−1 r  Equation 69
  • [0125]
    The MMSE estimator form as per Equation 68 has several advantages. It requires only a single inverse matrix computation and thus in the DFT domain only a single vector division. This provides a potentially significant savings as divisions are highly complex.
  • [0126]
    The almost-exact solution has two steps in the most preferred embodiment, although other approaches may be used. Every time a new channel estimate is obtained, the channel filter is updated, (HHn+HHH)−1 is determined). For every data block, this filter is applied to the received data block. This partition is utilized because the channel is updated very infrequently compared to the received data block processing and therefore significant complexity reduction can achieved by separating the overall process into these two steps.
  • [0127]
    The DFT of Σn is the DFT of the pulse shaping filter multiplied by the noise variance σ2. Since the pulse shaping filter is typically a fixed feature of the system, its DFT can be precomputed and stored in memory and thus only the value σ2 is updated. Since the pulse-shaping filter is likely to be close to the “ideal” (IIR) pulse shape, the DFT of the ideal pulse shape can be used for Σn, reducing the complexity and is also far away from the carrier.
  • [0128]
    To channel update step, the following is performed:
      • 1. The “block-DFT” of H needs to be computed. Since the block is of width 2, it requires 2 DFTs. The result is a N×2 matrix whose rows are the DFTs of he and ho.
      • 2. The “block-DFT” of HHH is computed by finding element-by-element autocorrelations and the crosscorrelation of he and ho. This required 6N complex multiplies and 2N complex adds: the products of N 2×2 matrices are computed with there own Hermitian transposes.
      • 3. The block-DFT of Σn is added, which requires 3N multiplies (scale the stored block-DFT of the RRC filter by σ2) and 3N adds to add the block-DFT of the two matrices.
      • 4. An inverse of Σn+HHH is taken in the block-DFT domain. To do this an inverse of each of the N 2×2 matrices is taken in the block-DFT domain. To estimate the total number of operations, consider a Hermitian matrix
  • [0000]
    M = [ a b b * a ] .
  • [0000]
    The inverse of this matrix is given per Equation 70.
  • [0000]
    M - 1 = 1 a 2 - b 2 [ a - b - b * a ] Equation 70
      • Accordingly, the complexity of computing each inverse involves 3 real multiplications and 1 real subtraction (roughly 1 complex multiply) and 1 real division.
      • 5. The result are block-multiplied by the block-DFT of HH, which, takes a total of 8N multiplies+4N adds (since HH is not Hermitian).
  • [0135]
    To summarize, the following computation are required: 2 N-point DFTs; 18N complex multiplies (17 N-point vector multiplies+N stand-alone multiplies); 11N complex adds (11 N-point vector adds); and 1N real divisions.
  • [0136]
    The complexity of processing a data block r of 2N values (N chips long) involves: 2 N-point DFTs; one product of the N-point block-DFTs (filter and data), which required 8N complex multiplies and 4N complex adds; and 1 N-point inverse DFTs.
  • [0137]
    To summarize, the following is required: 3 N-point DFTs; 8N complex multiplies (8 N-point vector multiplies); and 4N complex adds (4 N-point vector adds).
  • [0138]
    Multiple Chip Rate Sampling and Multiple Receive Antenna Equalization
  • [0139]
    The following are embodiments using multiple chip rate sampling and multiple receive antennas. For L receive antennas, 2L channel matrices—one “even” and one “odd” matrix for each antenna result. The channel matrices for lth antenna are denoted as Hl,e and Hl,o and hl,e,n and hl,o,n denote the nth row of such matrix. Each channel matrix is Toeplitz and with the appropriate re-arrangement of rows the joint channel matrix is a block-Toeplitz matrix, per Equation 71.
  • [0000]
    H bT = [ h 1 , e , 1 h 1 , o , 1 h L , o , N ] = [ G 1 G 2 G N ] Equation 71
  • [0000]
    The matrices Gi are the Toeplitz blocks of HbT. Each Gi is a 2L×N matrix.
  • [0140]
    Estimating the vector d from the received observations r can be modeled per Equation 72.
  • [0000]

    r=H bT d+n  Equation 72
  • [0141]
    The MMSE estimation formulation is per Equation 73.
  • [0000]

    {circumflex over (d)} MMSE =H bT Hn +H bT H bT H)−1 r  Equation 73
  • [0000]
    Σn is the covariance of the noise vector n. The form that the solution of Equation 73 depends on the assumptions that are made for Σn. The introduction of the multiple receive antenna introduces an additional spatial dimension. Although the interplay of temporal and spatial correlations can be extremely complex, it can be assumed that the spatial correlation properties of the noise do not interplay with the temporal correlation properties, except as a direct product of the two, as per Equation 74.
  • [0000]

    Σnn,1ant
    Figure US20100067620A1-20100318-P00001
    Σsp  Equation 74
  • [0000]
    En,1ant is the noise covariance matrix of the noise observed at a single antenna as per Equation 57. Σn,1ant is of dimension 2N×2N. Σsp is the normalized synchronous spatial covariance matrix, i.e. it is the covariance matrix between the L noise samples observed at the L antennas at the same time normalized to have 1's on the main diagonal.
    Figure US20100067620A1-20100318-P00001
    denotes the Kroenecker product.
  • [0142]
    Σn is a 2LN×2LN Hermitian positive semi-definite matrix, which is block-Toeplitz with 2L×2L blocks. To estimate the data, four preferred embodiments are described: an exact solution; a simplification by assuming that the L receive antenna have uncorrelated noise; a simplification by ignoring the temporal correlation of the noise in the odd and even streams from the same antenna; and a simplification by assuming that all 2L chip-rate noise streams are uncorrelated.
  • [0143]
    The complexity of DFT-based processing using the circulant approximation may be partitioned into two components: the processing of channel estimation which need not be done for every new data block and the processing of data itself which is performed for every data block. In all four embodiments, the complexity of processing data involves: 2L forward N-point DFTs; 2LN complex multiplies; and 1 inverse N-point DFT. The complexity of processing the channel estimate varies for each embodiment.
  • [0144]
    In the case of the exact MMSE solution, the complexity of computing the “MMSE filter” from the channel estimate is as follows: 2L N-point DFT's; N 2L×2L matrix products+N 2L×2L matrix additions to compute (Σn+HbTHbT H); N 2L×2L matrix inverses to compute the inverse of (Σn+HbTHbT H); and N 2L×2L matrix products to produce the actual filter.
  • [0145]
    A major contributor to the overall complexity of this process is the matrix inverse step in which an inverse of 2L×2L matrices has to be taken. It is precisely this complexity that can be reduced by various assumptions on the uncorrelated nature of the noise, as follows:
      • 1. If it is assumed that the noise is uncorrelated both temporally (odd/even samples) and spatially (across antennas), then Σn reduces to a diagonal matrix and the problem is identical to single-sample-per-chip sampling with 2L antennas with spatially uncorrelated noise. As a result, the operation of matrix inverse simply reduces to a division since all the matrices involved are Toeplitz.
      • 2. If it is assumed that the noise is spatially uncorrelated, then the matrix inverses involved are those of 2×2 matrices.
      • 3. If it is assumed that a temporal uncorrelation of odd/even streams but a spatial noise correlation is retained, the matrix inverses involved are L×L.

Claims (20)

  1. 1. An apparatus for use in wireless communication comprising:
    a receiver configured to transform a received wireless communications signal to produce a received vector by sampling at a multiple of a data signal chip rate; and
    a processor configured to process the received vector using a sliding window based approach, such that for each processing window in a plurality of processing windows an approximate circulant channel response matrix is produced and used to estimate a data vector corresponding to the window.
  2. 2. (canceled)
  3. 3. The apparatus of claim 1, further comprising:
    a root-raised cosine filtering unit configured to apply a root-raised cosine filter to the received vector.
  4. 4. The apparatus of claim 1, wherein the processor is configured to ignore noise cross correlation.
  5. 5. The apparatus of claim 1, wherein the processor is configured to use the received vector and the approximate circulant channel response matrix arranged in a natural order.
  6. 6. The apparatus of claim 1, wherein the receiver is configured to transform a plurality of received wireless communications signals from a plurality of antennas to produce a received vector.
  7. 7. The apparatus of claim 1, wherein the processor is configured to multiply a discrete Fourier transform of a pulse shaping filter by a measured noise variance to produce a discrete Fourier transform of the noise vector cross correlation.
  8. 8. The apparatus of claim 1, wherein the processor is configured to multiply a discrete Fourier transform of an ideal pulse shape by a measured noise variance to produce a discrete Fourier transform of the noise vector cross correlation.
  9. 9. The apparatus of claim 1, further comprising:
    a summer, configured to combine the data vector corresponding to each window to form a combined data vector.
  10. 10. The apparatus of claim 1 configured as a wireless transmit/receive unit (WTRU).
  11. 11. The apparatus of claim 1 configured as a base station.
  12. 12. A method for use in wireless communications, the method comprising:
    transforming a received wireless communications signal to produce a received vector by sampling at a multiple of a data signal chip rate; and
    processing the received vector using a sliding window based approach, such that for each processing window in a plurality of processing windows an approximate circulant channel response matrix is produced and used to estimate a data vector corresponding to the window.
  13. 13. (canceled)
  14. 14. The method of claim 12, further comprising:
    applying a root-raised cosine filter to the received vector.
  15. 15. The method of claim 12, wherein the processing includes ignoring noise cross correlation.
  16. 16. The method of claim 12, wherein the processing includes using the received vector and the approximate circulant channel response matrix arranged in a natural order.
  17. 17. The method of claim 12, wherein the transforming includes producing a plurality of received vectors corresponding to a plurality of received wireless communications signals from a plurality of antennas.
  18. 18. The method of claim 12, wherein the processing includes multiplying a discrete Fourier transform of the pulse shaping filter by a measured noise variance to produce a discrete Fourier transform of the noise vector cross correlation.
  19. 19. The method of claim 12, wherein the processing includes multiplying a discrete Fourier transform of an ideal pulse shape by a measured noise variance to produce a discrete Fourier transform of the noise vector cross correlation.
  20. 20. The method of claim 12, further comprising:
    combining the data vector corresponding to each window to form a combined data vector.
US12565284 2003-03-03 2009-09-23 Reduced complexity sliding window based equalizer Abandoned US20100067620A1 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
US45216503 true 2003-03-03 2003-03-03
US48233303 true 2003-06-25 2003-06-25
US10791244 US7428279B2 (en) 2003-03-03 2004-03-02 Reduced complexity sliding window based equalizer
US10875900 US7042967B2 (en) 2003-03-03 2004-06-24 Reduced complexity sliding window based equalizer
US11265932 US20060034398A1 (en) 2003-03-03 2005-11-03 Reduced complexity sliding window based equalizer
US12191702 US7609794B2 (en) 2003-03-03 2008-08-14 Reduced complexity sliding window based equalizer
US12565284 US20100067620A1 (en) 2003-03-03 2009-09-23 Reduced complexity sliding window based equalizer

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US12565284 US20100067620A1 (en) 2003-03-03 2009-09-23 Reduced complexity sliding window based equalizer

Publications (1)

Publication Number Publication Date
US20100067620A1 true true US20100067620A1 (en) 2010-03-18

Family

ID=46302237

Family Applications (4)

Application Number Title Priority Date Filing Date
US10875900 Expired - Fee Related US7042967B2 (en) 2003-03-03 2004-06-24 Reduced complexity sliding window based equalizer
US11265932 Abandoned US20060034398A1 (en) 2003-03-03 2005-11-03 Reduced complexity sliding window based equalizer
US12191702 Expired - Fee Related US7609794B2 (en) 2003-03-03 2008-08-14 Reduced complexity sliding window based equalizer
US12565284 Abandoned US20100067620A1 (en) 2003-03-03 2009-09-23 Reduced complexity sliding window based equalizer

Family Applications Before (3)

Application Number Title Priority Date Filing Date
US10875900 Expired - Fee Related US7042967B2 (en) 2003-03-03 2004-06-24 Reduced complexity sliding window based equalizer
US11265932 Abandoned US20060034398A1 (en) 2003-03-03 2005-11-03 Reduced complexity sliding window based equalizer
US12191702 Expired - Fee Related US7609794B2 (en) 2003-03-03 2008-08-14 Reduced complexity sliding window based equalizer

Country Status (1)

Country Link
US (4) US7042967B2 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120069914A1 (en) * 2010-09-22 2012-03-22 Qualcomm Incorporated Efficient compressed sensing channel estimation for single-carrier communication systems
US20120219050A1 (en) * 2009-11-10 2012-08-30 Zte Corporation Method and apparatus for noise estimation in orthogonal frequency division multiplexing (ofdm) system
US20130170842A1 (en) * 2012-01-04 2013-07-04 Toshiaki Koike-Akino Method and System for Equalization and Decoding Received Signals Based on High-Order Statistics in Optical Communication Networks
US8483641B1 (en) 2010-07-28 2013-07-09 Marvell International Ltd. Validation and stabilization of noise matrices
US8526552B1 (en) * 2009-08-25 2013-09-03 Marvell International Ltd. Noise estimation in communication receivers

Families Citing this family (20)

* Cited by examiner, † Cited by third party
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
WO2003047032A1 (en) * 2001-11-29 2003-06-05 Interdigital Technology Corporation Efficient multiple input multiple output system for multi-path fading channels
GB0214729D0 (en) * 2002-06-26 2002-08-07 Koninkl Philips Electronics Nv Digital receiver arrangement and related method
US7218693B2 (en) * 2003-05-08 2007-05-15 Texas Instruments Incorporated Method and apparatus for channel estimation in a packet based transmission system having reduced complexity
KR100994198B1 (en) * 2003-07-14 2010-11-12 인터디지탈 테크날러지 코포레이션 High performance wireless receiver with cluster multipath interference suppression circuit
GB2404822B (en) * 2003-08-07 2007-07-11 Ipwireless Inc Method and arrangement for noise variance and sir estimation
US7388935B2 (en) * 2004-06-15 2008-06-17 Telefonktiebolaget Lm Ericsson (Publ) Method of inverting nearly Toeplitz or block Toeplitz matrices
US7443909B2 (en) * 2004-12-21 2008-10-28 Nokia Corporation Weighted autocorrelation method for downlink CDMA LMMSE equalizers
US7570689B2 (en) * 2005-02-14 2009-08-04 Interdigital Technology Corporation Advanced receiver with sliding window block linear equalizer
US8085733B2 (en) * 2005-02-23 2011-12-27 Interdigital Technology Corporation Wireless communication method and apparatus for dynamically adapting packet transmission rates
US8111742B2 (en) * 2005-04-07 2012-02-07 Nokia Corporation Data processing method, equalizer, receiver, communication system, network element, and terminal using simplified channel matrix inversion
CN101379721B (en) * 2006-02-03 2012-08-29 Nxp股份有限公司 A symbol-level adaptation method for equalizer coefficients, memory, equalizer and receiver for implementing the method
US20070230546A1 (en) * 2006-03-30 2007-10-04 Shimon Moshavi Equalizer with reduced complexity with application to long delay spread channels
US20070230638A1 (en) * 2006-03-30 2007-10-04 Meir Griniasty Method and apparatus to efficiently configure multi-antenna equalizers
US7986673B2 (en) * 2008-05-30 2011-07-26 Sharp Laboratories Of America, Inc. Systems and methods for reducing feedback overhead in wireless networks using channel characteristics
US20100011045A1 (en) * 2008-07-11 2010-01-14 James Vannucci Device and method for applying signal weights to signals
US20100011041A1 (en) * 2008-07-11 2010-01-14 James Vannucci Device and method for determining signals
US7733975B1 (en) * 2008-12-31 2010-06-08 Mediatek Inc. Method for estimating phase error in MIMO OFDM communications system
CN102271025B (en) 2011-07-25 2014-02-26 上海华为技术有限公司 Method and device for reconstructing data
EP2984801A1 (en) * 2013-04-09 2016-02-17 Interdigital Patent Holdings, Inc. Joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks

Citations (98)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6181714B2 (en) *
US3666554A (en) * 1970-12-10 1972-05-30 Ibm Manufacture of electrophotographic plate
US5412620A (en) * 1993-03-24 1995-05-02 Micrilor, Inc. Hydroacoustic communications system robust to multipath
US5487069A (en) * 1992-11-27 1996-01-23 Commonwealth Scientific And Industrial Research Organization Wireless LAN
US5559757A (en) * 1991-12-18 1996-09-24 Catipovic; Josko A. Spatial diversity processing for underwater acoustic telemetry
US5612978A (en) * 1995-05-30 1997-03-18 Motorola, Inc. Method and apparatus for real-time adaptive interference cancellation in dynamic environments
US5796814A (en) * 1995-03-22 1998-08-18 U.S. Philips Corporation Digital transmission system comprising a receiver with cascaded equalizers
US5805638A (en) * 1995-12-04 1998-09-08 Lucent Technologies Inc. Systems and methods of digital wireless communication using equalization
US5818868A (en) * 1995-04-14 1998-10-06 Agence Spatiale Europeenne Direct-sequence spread-spectrum receiver including code acquisition and detection using an autoadaptive threshold
US5828658A (en) * 1991-12-12 1998-10-27 Arraycomm, Inc. Spectrally efficient high capacity wireless communication systems with spatio-temporal processing
US5930248A (en) * 1997-03-04 1999-07-27 Telefonaktiebolaget Lm Ericsson Radio communication system selectively using multicast with variable offset time
US5930369A (en) * 1995-09-28 1999-07-27 Nec Research Institute, Inc. Secure spread spectrum watermarking for multimedia data
US5970060A (en) * 1995-10-06 1999-10-19 Siemens Aktiengesellschaft Method and system for radio transmission of digital signals
US6047020A (en) * 1996-03-19 2000-04-04 Nokia Telecommunications Oy Receiving method and a receiver
US6097753A (en) * 1997-09-23 2000-08-01 Paradyne Corporation System and method for simultaneous voice and data with adaptive gain based on short term audio energy
US6128276A (en) * 1997-02-24 2000-10-03 Radix Wireless, Inc. Stacked-carrier discrete multiple tone communication technology and combinations with code nulling, interference cancellation, retrodirective communication and adaptive antenna arrays
US6137848A (en) * 1997-11-03 2000-10-24 At&T Corp. Method and system for joint timing recovery and channel estimation for DMT modems
US6141393A (en) * 1999-03-03 2000-10-31 Motorola, Inc. Method and device for channel estimation, equalization, and interference suppression
US6175588B1 (en) * 1997-12-30 2001-01-16 Motorola, Inc. Communication device and method for interference suppression using adaptive equalization in a spread spectrum communication system
US6181714B1 (en) * 1996-09-02 2001-01-30 Telia Ab Multi-carrier transmission systems
US6188717B1 (en) * 1996-11-19 2001-02-13 Deutsche Forschungsanstalt Fur Luft-Und Raumfahrt E.V. Method of simultaneous radio transmission of digital data between a plurality of subscriber stations and a base station
US6219561B1 (en) * 1996-10-18 2001-04-17 Cisco Systems, Inc. Wireless communication network using time-varying vector channel equalization for adaptive spatial equalization
US6289005B1 (en) * 1997-02-13 2001-09-11 Nokia Telecommunications Oy Method and apparatus for directional radio communication
US6307868B1 (en) * 1995-08-25 2001-10-23 Terayon Communication Systems, Inc. Apparatus and method for SCDMA digital data transmission using orthogonal codes and a head end modem with no tracking loops
US20010033614A1 (en) * 2000-01-20 2001-10-25 Hudson John E. Equaliser for digital communications systems and method of equalisation
US6359926B1 (en) * 1996-09-02 2002-03-19 Stmicroelectronics N.V. Multi-carrier transmission systems
US6359938B1 (en) * 1996-10-31 2002-03-19 Discovision Associates Single chip VLSI implementation of a digital receiver employing orthogonal frequency division multiplexing
US6359826B1 (en) * 2000-11-20 2002-03-19 Silicon Access Technology, Inc. Method and a system for controlling a data sense amplifier for a memory chip
US6363128B1 (en) * 1996-09-02 2002-03-26 Stmicroelectronics N.V. Multi-carrier transmission systems
US6366554B1 (en) * 1996-09-02 2002-04-02 Stmicroelectronics N.V. Multi-carrier transmission systems
US6377632B1 (en) * 2000-01-24 2002-04-23 Iospan Wireless, Inc. Wireless communication system and method using stochastic space-time/frequency division multiplexing
US6392595B1 (en) * 1998-11-04 2002-05-21 Nokia Network Oy Method and apparatus for directional radio communication
US6396801B1 (en) * 1998-03-17 2002-05-28 Trw Inc. Arbitrary waveform modem
US6426983B1 (en) * 1998-09-14 2002-07-30 Terayon Communication Systems, Inc. Method and apparatus of using a bank of filters for excision of narrow band interference signal from CDMA signal
US6438174B1 (en) * 1996-09-02 2002-08-20 Stmicroelectronics N.V. Multi-carrier transmission systems
US6445342B1 (en) * 2000-06-30 2002-09-03 Motorola, Inc. Method and device for multi-user frequency-domain channel estimation
US6456649B1 (en) * 1996-09-02 2002-09-24 Stmicroelectronics N.V. Multi-carrier transmission systems
US20020136158A1 (en) * 2000-09-21 2002-09-26 Motorola, Inc. MMSE reception of DS-CDMA with transmit diversity
US20020145989A1 (en) * 2000-11-09 2002-10-10 Interdigital Technology Corporation Single user detection
US6466629B1 (en) * 1996-09-02 2002-10-15 Stmicroelectronics N.V. Multi-carrier transmission systems
US6505053B1 (en) * 1999-11-05 2003-01-07 At&T Corp. Method for sinusoidal modeling and prediction of fast fading processes
US20030026201A1 (en) * 2001-06-18 2003-02-06 Arnesen David M. Sliding-window transform with integrated windowing
US6522489B1 (en) * 1999-12-21 2003-02-18 Texas Instruments Incorporated Efficient analog-to-digital converter for digital systems
US20030035491A1 (en) * 2001-05-11 2003-02-20 Walton Jay R. Method and apparatus for processing data in a multiple-input multiple-output (MIMO) communication system utilizing channel state information
US20030043925A1 (en) * 2001-05-29 2003-03-06 Tioga Technologies, Ltd. Method and system for detecting, timing, and correcting impulse noise
US20030043732A1 (en) * 2001-05-17 2003-03-06 Walton Jay R. Method and apparatus for processing data for transmission in a multi-channel communication system using selective channel transmission
US20030043767A1 (en) * 2001-02-06 2003-03-06 Interdigital Technology Corporation Single user detection user equipment
US20030043887A1 (en) * 2001-04-03 2003-03-06 Hudson John E. Communication system and methods of estimating channel impulse responses therein
US20030048856A1 (en) * 2001-05-17 2003-03-13 Ketchum John W. Method and apparatus for processing data for transmission in a multi-channel communication system using selective channel inversion
US6538986B2 (en) * 1996-09-02 2003-03-25 Stmicroelectronics N.V. Data transmission system and method using nQAM constellation with a control channel superimposed on a user data channel
US20030058952A1 (en) * 2001-09-26 2003-03-27 Webster Mark A. Single-carrier to multi-carrier wireless architecture
US20030063557A1 (en) * 2001-07-13 2003-04-03 Mitsubishi Denki Kabushiki Kaisha Multi-user detection in an MC-CDMA telecommunication system
US20030072291A1 (en) * 2001-10-04 2003-04-17 Mitsubishi Denki Kabushiki Kaisha Multi-user detection method for a receiver in a MC-CDMA telecommunication system
US6553012B1 (en) * 1997-02-13 2003-04-22 Nokia Telecommunications Oy Method and apparatus for directional radio communication
US20030076908A1 (en) * 2001-08-24 2003-04-24 Huang Howard C. Signal detection by a receiver in a multiple antenna time-dispersive system
US20030076900A1 (en) * 2001-10-24 2003-04-24 Magee David Patrick Decimated noise estimation and/or beamforming for wireless communications
US20030081781A1 (en) * 1994-03-31 2003-05-01 Jensen James M. Apparatus and methods for including codes in audio signals
US20030086366A1 (en) * 2001-03-06 2003-05-08 Branlund Dale A. Adaptive communications methods for multiple user packet radio wireless networks
US20030099216A1 (en) * 2001-11-28 2003-05-29 Johan Nilsson Method and apparatus for estimation of phase offset between communication channels
US20030103584A1 (en) * 2001-12-03 2003-06-05 Bjerke Bjorn A. Iterative detection and decoding for a MIMO-OFDM system
US20030108117A1 (en) * 2001-12-07 2003-06-12 Ketchum John W. Time-domain transmit and receive processing with channel eigen-mode decompositon for MIMO systems
US20030112880A1 (en) * 2001-05-17 2003-06-19 Walton Jay R. Method and apparatus for processing data for transmission in a multi-channel communication system using selective channel inversion
US20030125040A1 (en) * 2001-11-06 2003-07-03 Walton Jay R. Multiple-access multiple-input multiple-output (MIMO) communication system
US20030129984A1 (en) * 2002-01-08 2003-07-10 Dent Paul W. Distributed wireless architecture using microcast
US20030128658A1 (en) * 2002-01-08 2003-07-10 Walton Jay Rod Resource allocation for MIMO-OFDM communication systems
US20030133403A1 (en) * 2002-01-11 2003-07-17 Mitsubishi Denki Kabushiki Kaisha Pre-distortion method for telecommunication system and transmitter for mobile terminal of MC-CDMA telecommunication system
US20030147655A1 (en) * 1999-11-02 2003-08-07 Shattil Steve J. Unified multi-carrier framework for multiple-access technologies
US20030152021A1 (en) * 2001-09-24 2003-08-14 Yi-Hsiu Wang Post-fft scaling to reduce multiple effects
US6611855B1 (en) * 1999-06-21 2003-08-26 Telefonaktiebolaget Lm Ericsson (Publ) Flexible and efficient channelizer architecture
US20030165131A1 (en) * 2002-03-04 2003-09-04 The National University Of Singapore CDMA system with frequency domain equalization
US6618431B1 (en) * 1998-12-31 2003-09-09 Texas Instruments Incorporated Processor-based method for the acquisition and despreading of spread-spectrum/CDMA signals
US6674795B1 (en) * 2000-04-04 2004-01-06 Nortel Networks Limited System, device and method for time-domain equalizer training using an auto-regressive moving average model
US6680969B1 (en) * 1999-03-22 2004-01-20 Ericsson, Inc. Methods for estimating doppler spreads including autocorrelation function hypotheses and related systems and receivers
US6684065B2 (en) * 1999-12-20 2004-01-27 Broadcom Corporation Variable gain amplifier for low voltage applications
US6693953B2 (en) * 1998-09-30 2004-02-17 Skyworks Solutions, Inc. Adaptive wireless communication receiver
US20040032354A1 (en) * 2002-08-16 2004-02-19 Yaron Knobel Multi-band ultra-wide band communication method and system
US20040032918A1 (en) * 2002-08-16 2004-02-19 Gadi Shor Communication method, system and apparatus utilizing burst symbol cycles
US6700919B1 (en) * 1999-11-30 2004-03-02 Texas Instruments Incorporated Channel estimation for communication system using weighted estimates based on pilot data and information data
US20040052236A1 (en) * 2002-09-07 2004-03-18 Samsung Electronics Co., Ltd. Apparatus and method for joint detection receiving irrespective of orthogonal code length in mobile communication system
US6724743B1 (en) * 1999-05-04 2004-04-20 France Telecom Method of conjoint detection of a set of CDMA codes
US6729929B1 (en) * 1999-03-17 2004-05-04 Cisco Systems, Inc. Method and apparatus for controlling wireless networks
US6731682B1 (en) * 2000-04-07 2004-05-04 Zenith Electronics Corporation Multipath ghost eliminating equalizer with optimum noise enhancement
US20040087275A1 (en) * 2002-03-01 2004-05-06 Sugar Gary L. System and method for antenna diversity using joint maximal ratio combining
US20040086027A1 (en) * 2002-10-31 2004-05-06 Shattil Steve J. Orthogonal superposition coding for direct-sequence communications
US20040086035A1 (en) * 2002-10-31 2004-05-06 Upton Eric L. EHF equalizer implemented with MEMs tap weight controls
US20040095907A1 (en) * 2000-06-13 2004-05-20 Agee Brian G. Method and apparatus for optimization of wireless multipoint electromagnetic communication networks
US20040100897A1 (en) * 1998-02-12 2004-05-27 Shattil Steve J. Carrier interferometry coding with aplications to cellular and local area networks
US20040101046A1 (en) * 2000-08-25 2004-05-27 Lin Yang Terrestrial digital multimedia/television broadcasting system
US6745352B2 (en) * 2000-12-13 2004-06-01 Ericsson Inc. Methods of estimating error rates for communications received using iterative processing and related receivers
US6744320B2 (en) * 2000-02-15 2004-06-01 Broadcom Corporation Variable transconductane variable gain amplifier utilizing a degenerated differential pair
US20040116077A1 (en) * 2002-08-08 2004-06-17 Kddi Corporation Transmitter device and receiver device adopting space time transmit diversity multicarrier CDMA, and wireless communication system with the transmitter device and the receiver device
US20040120424A1 (en) * 2002-02-20 2004-06-24 Roberts Richard D. Method for making a clear channel assessment in a wireless network
US20040120274A1 (en) * 2002-04-25 2004-06-24 Frederik Petre CDMA transceiver techniques for wireless communications
US20040136399A1 (en) * 2002-02-20 2004-07-15 Roberts Richard D. Method for operating multiple overlapping wireless networks
US20040141548A1 (en) * 2000-07-19 2004-07-22 Shattil Steve J. Software adaptable high performance multicarrier transmission protocol
US20040142663A1 (en) * 2002-02-20 2004-07-22 Roberts Richard D. Method for operating multiple overlapping wireless networks
US20040146024A1 (en) * 2003-01-28 2004-07-29 Navini Networks, Inc. Method and system for interference reduction in a wireless communication network using a joint detector
US7110465B2 (en) * 2000-11-27 2006-09-19 Fujitsu Limited Noise canceling method and apparatus

Family Cites Families (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB8909051D0 (en) 1989-04-21 2001-04-11 Secr Defence A high data rate multiplexed multichannel high frequency broadcast system
US6137843A (en) 1995-02-24 2000-10-24 Ericsson Inc. Methods and apparatus for canceling adjacent channel signals in digital communications systems
CA2176401C (en) 1994-02-17 2003-07-08 John H. Cafarella A high-data-rate wireless local-area network
US5577066A (en) 1994-05-13 1996-11-19 Stanford Telecommunications, Inc. Charge-coupled-device based data-in-voice modem
DE69725995T2 (en) 1996-08-29 2004-11-11 Cisco Technology, Inc., San Jose Spatio-temporal signal processing for transmission systems
DE69723563D1 (en) 1996-09-02 2003-08-21 St Microelectronics Nv Improvements in or relating to multi-carrier transmission systems
WO1998010548A3 (en) 1996-09-02 1998-06-04 Telia Ab Improvements in, or relating to, multi-carrier transmission systems
JP2000509238A (en) 1997-02-13 2000-07-18 ノキア テレコミュニカシオンス オサケ ユキチュア Directional radio communication method and apparatus
US6321082B1 (en) 1997-02-13 2001-11-20 Nokia Telecommunications Oy Method and apparatus for directional radio communication
US6584144B2 (en) 1997-02-24 2003-06-24 At&T Wireless Services, Inc. Vertical adaptive antenna array for a discrete multitone spread spectrum communications system
US6359923B1 (en) 1997-12-18 2002-03-19 At&T Wireless Services, Inc. Highly bandwidth efficient communications
US6686879B2 (en) 1998-02-12 2004-02-03 Genghiscomm, Llc Method and apparatus for transmitting and receiving signals having a carrier interferometry architecture
EP1125398B1 (en) 1998-10-30 2008-10-22 Broadcom Corporation Cable modem system
US6671334B1 (en) 1998-11-03 2003-12-30 Tektronix, Inc. Measurement receiver demodulator
US6852057B2 (en) * 1999-12-17 2005-02-08 Teodoro R. Borbolla Gonzalez Self-contained continuously-variable transmission with mechanical integral torque converter having automatic drive control
DE19961777A1 (en) 1999-12-21 2001-07-12 Rudolf Bannasch Methods and apparatus for transmitting information
JP3872953B2 (en) 1999-12-27 2007-01-24 株式会社東芝 Wireless communication device using an adaptive antenna
US20030008684A1 (en) 2000-01-24 2003-01-09 Ferris Gavin Robert Digital wireless basestation
GB0001585D0 (en) 2000-01-24 2000-03-15 Radioscape Ltd Method of designing,modelling or fabricating a communications baseband stack
US6658619B1 (en) 2000-10-06 2003-12-02 Ericsson Inc. Systems and methods for implementing hierarchical acknowledgement bitmaps in an ARQ protocol
FR2818057B1 (en) 2000-12-13 2006-07-07 Mitsubishi Electric Inf Tech Method and multiuser detection device
US7433683B2 (en) 2000-12-28 2008-10-07 Northstar Acquisitions, Llc System for fast macrodiversity switching in mobile wireless networks
US7218666B2 (en) 2000-12-29 2007-05-15 Motorola, Inc. Method and system for transmission and frequency domain equalization for wideband CDMA system
EP1410513A4 (en) 2000-12-29 2005-06-29 Infineon Technologies Ag Channel codec processor configurable for multiple wireless communications standards
US7139237B2 (en) 2000-12-29 2006-11-21 Motorola, Inc. Method and system for multirate multiuser modulation
US6807305B2 (en) * 2001-01-12 2004-10-19 National Instruments Corporation System and method for image pattern matching using a unified signal transform
US6771706B2 (en) 2001-03-23 2004-08-03 Qualcomm Incorporated Method and apparatus for utilizing channel state information in a wireless communication system
US7177369B2 (en) 2001-04-27 2007-02-13 Vivato, Inc. Multipath communication methods and apparatuses
US6662024B2 (en) 2001-05-16 2003-12-09 Qualcomm Incorporated Method and apparatus for allocating downlink resources in a multiple-input multiple-output (MIMO) communication system
FR2825860B1 (en) 2001-06-06 2005-03-18 St Microelectronics Sa data transmission in master-slave division multiplexing orthogonal frequencies
WO2002101939A3 (en) 2001-06-08 2003-02-20 Broadcom Corp Robust burst detection and acquisition system and method
US6609414B2 (en) * 2001-07-19 2003-08-26 Mocon, Inc. Apparatus for conducting leakage tests on sealed packages
US6963727B2 (en) 2001-07-26 2005-11-08 Time Domain Corporation Direct-path-signal detection apparatus and associated methods
US6595472B1 (en) * 2001-12-28 2003-07-22 Preformed Line Products Company Cable clamp
US7197084B2 (en) * 2002-03-27 2007-03-27 Qualcomm Incorporated Precoding for a multipath channel in a MIMO system
EP1359700A1 (en) 2002-05-02 2003-11-05 Mitsubishi Electric Information Technology Centre Europe B.V. MC-CDMA receiver with an equalisation per subcarrier
US7305050B2 (en) 2002-05-13 2007-12-04 Marvell Dspc Ltd. Method and apparatus for processing signals received from a channel having a variable channel length
DE10222115B4 (en) 2002-05-17 2018-02-15 Advanced Micro Devices, Inc. Shared circuits for functional units of a wireless receiver
US6757321B2 (en) 2002-05-22 2004-06-29 Interdigital Technology Corporation Segment-wise channel equalization based data estimation
US7099270B2 (en) 2002-06-06 2006-08-29 Texas Instruments Incorporated Multi-path equalization for orthogonal frequency division multiplexing communication system
US7613248B2 (en) 2002-06-24 2009-11-03 Qualcomm Incorporated Signal processing with channel eigenmode decomposition and channel inversion for MIMO systems

Patent Citations (100)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6181714B2 (en) *
US3666554A (en) * 1970-12-10 1972-05-30 Ibm Manufacture of electrophotographic plate
US5828658A (en) * 1991-12-12 1998-10-27 Arraycomm, Inc. Spectrally efficient high capacity wireless communication systems with spatio-temporal processing
US5559757A (en) * 1991-12-18 1996-09-24 Catipovic; Josko A. Spatial diversity processing for underwater acoustic telemetry
US5487069A (en) * 1992-11-27 1996-01-23 Commonwealth Scientific And Industrial Research Organization Wireless LAN
US5412620A (en) * 1993-03-24 1995-05-02 Micrilor, Inc. Hydroacoustic communications system robust to multipath
US20030081781A1 (en) * 1994-03-31 2003-05-01 Jensen James M. Apparatus and methods for including codes in audio signals
US5796814A (en) * 1995-03-22 1998-08-18 U.S. Philips Corporation Digital transmission system comprising a receiver with cascaded equalizers
US5818868A (en) * 1995-04-14 1998-10-06 Agence Spatiale Europeenne Direct-sequence spread-spectrum receiver including code acquisition and detection using an autoadaptive threshold
US5612978A (en) * 1995-05-30 1997-03-18 Motorola, Inc. Method and apparatus for real-time adaptive interference cancellation in dynamic environments
US6307868B1 (en) * 1995-08-25 2001-10-23 Terayon Communication Systems, Inc. Apparatus and method for SCDMA digital data transmission using orthogonal codes and a head end modem with no tracking loops
US5930369A (en) * 1995-09-28 1999-07-27 Nec Research Institute, Inc. Secure spread spectrum watermarking for multimedia data
US5970060A (en) * 1995-10-06 1999-10-19 Siemens Aktiengesellschaft Method and system for radio transmission of digital signals
US5805638A (en) * 1995-12-04 1998-09-08 Lucent Technologies Inc. Systems and methods of digital wireless communication using equalization
US6047020A (en) * 1996-03-19 2000-04-04 Nokia Telecommunications Oy Receiving method and a receiver
US6538986B2 (en) * 1996-09-02 2003-03-25 Stmicroelectronics N.V. Data transmission system and method using nQAM constellation with a control channel superimposed on a user data channel
US6456649B1 (en) * 1996-09-02 2002-09-24 Stmicroelectronics N.V. Multi-carrier transmission systems
US6438174B1 (en) * 1996-09-02 2002-08-20 Stmicroelectronics N.V. Multi-carrier transmission systems
US6366554B1 (en) * 1996-09-02 2002-04-02 Stmicroelectronics N.V. Multi-carrier transmission systems
US6181714B1 (en) * 1996-09-02 2001-01-30 Telia Ab Multi-carrier transmission systems
US6466629B1 (en) * 1996-09-02 2002-10-15 Stmicroelectronics N.V. Multi-carrier transmission systems
US6363128B1 (en) * 1996-09-02 2002-03-26 Stmicroelectronics N.V. Multi-carrier transmission systems
US6359926B1 (en) * 1996-09-02 2002-03-19 Stmicroelectronics N.V. Multi-carrier transmission systems
US6219561B1 (en) * 1996-10-18 2001-04-17 Cisco Systems, Inc. Wireless communication network using time-varying vector channel equalization for adaptive spatial equalization
US6359938B1 (en) * 1996-10-31 2002-03-19 Discovision Associates Single chip VLSI implementation of a digital receiver employing orthogonal frequency division multiplexing
US6188717B1 (en) * 1996-11-19 2001-02-13 Deutsche Forschungsanstalt Fur Luft-Und Raumfahrt E.V. Method of simultaneous radio transmission of digital data between a plurality of subscriber stations and a base station
US6289005B1 (en) * 1997-02-13 2001-09-11 Nokia Telecommunications Oy Method and apparatus for directional radio communication
US6553012B1 (en) * 1997-02-13 2003-04-22 Nokia Telecommunications Oy Method and apparatus for directional radio communication
US20030123384A1 (en) * 1997-02-24 2003-07-03 Agee Brian G. Stacked-carrier discrete multiple tone communication technology and combinations with code nulling, interference cancellation, retrodirective communication and adaptive antenna arrays
US6512737B1 (en) * 1997-02-24 2003-01-28 Beamreach Networks, Inc. Stacked carrier discrete multiple tone communication system
US6128276A (en) * 1997-02-24 2000-10-03 Radix Wireless, Inc. Stacked-carrier discrete multiple tone communication technology and combinations with code nulling, interference cancellation, retrodirective communication and adaptive antenna arrays
US5930248A (en) * 1997-03-04 1999-07-27 Telefonaktiebolaget Lm Ericsson Radio communication system selectively using multicast with variable offset time
US6097753A (en) * 1997-09-23 2000-08-01 Paradyne Corporation System and method for simultaneous voice and data with adaptive gain based on short term audio energy
US6137848A (en) * 1997-11-03 2000-10-24 At&T Corp. Method and system for joint timing recovery and channel estimation for DMT modems
US6175588B1 (en) * 1997-12-30 2001-01-16 Motorola, Inc. Communication device and method for interference suppression using adaptive equalization in a spread spectrum communication system
US20040100897A1 (en) * 1998-02-12 2004-05-27 Shattil Steve J. Carrier interferometry coding with aplications to cellular and local area networks
US6396801B1 (en) * 1998-03-17 2002-05-28 Trw Inc. Arbitrary waveform modem
US6426983B1 (en) * 1998-09-14 2002-07-30 Terayon Communication Systems, Inc. Method and apparatus of using a bank of filters for excision of narrow band interference signal from CDMA signal
US6693953B2 (en) * 1998-09-30 2004-02-17 Skyworks Solutions, Inc. Adaptive wireless communication receiver
US6392595B1 (en) * 1998-11-04 2002-05-21 Nokia Network Oy Method and apparatus for directional radio communication
US6618431B1 (en) * 1998-12-31 2003-09-09 Texas Instruments Incorporated Processor-based method for the acquisition and despreading of spread-spectrum/CDMA signals
US6141393A (en) * 1999-03-03 2000-10-31 Motorola, Inc. Method and device for channel estimation, equalization, and interference suppression
US6729929B1 (en) * 1999-03-17 2004-05-04 Cisco Systems, Inc. Method and apparatus for controlling wireless networks
US6680969B1 (en) * 1999-03-22 2004-01-20 Ericsson, Inc. Methods for estimating doppler spreads including autocorrelation function hypotheses and related systems and receivers
US6724743B1 (en) * 1999-05-04 2004-04-20 France Telecom Method of conjoint detection of a set of CDMA codes
US6611855B1 (en) * 1999-06-21 2003-08-26 Telefonaktiebolaget Lm Ericsson (Publ) Flexible and efficient channelizer architecture
US20030147655A1 (en) * 1999-11-02 2003-08-07 Shattil Steve J. Unified multi-carrier framework for multiple-access technologies
US6505053B1 (en) * 1999-11-05 2003-01-07 At&T Corp. Method for sinusoidal modeling and prediction of fast fading processes
US6700919B1 (en) * 1999-11-30 2004-03-02 Texas Instruments Incorporated Channel estimation for communication system using weighted estimates based on pilot data and information data
US6684065B2 (en) * 1999-12-20 2004-01-27 Broadcom Corporation Variable gain amplifier for low voltage applications
US6522489B1 (en) * 1999-12-21 2003-02-18 Texas Instruments Incorporated Efficient analog-to-digital converter for digital systems
US20010033614A1 (en) * 2000-01-20 2001-10-25 Hudson John E. Equaliser for digital communications systems and method of equalisation
US6377632B1 (en) * 2000-01-24 2002-04-23 Iospan Wireless, Inc. Wireless communication system and method using stochastic space-time/frequency division multiplexing
US6744320B2 (en) * 2000-02-15 2004-06-01 Broadcom Corporation Variable transconductane variable gain amplifier utilizing a degenerated differential pair
US6674795B1 (en) * 2000-04-04 2004-01-06 Nortel Networks Limited System, device and method for time-domain equalizer training using an auto-regressive moving average model
US6731682B1 (en) * 2000-04-07 2004-05-04 Zenith Electronics Corporation Multipath ghost eliminating equalizer with optimum noise enhancement
US20040095907A1 (en) * 2000-06-13 2004-05-20 Agee Brian G. Method and apparatus for optimization of wireless multipoint electromagnetic communication networks
US6445342B1 (en) * 2000-06-30 2002-09-03 Motorola, Inc. Method and device for multi-user frequency-domain channel estimation
US20040141548A1 (en) * 2000-07-19 2004-07-22 Shattil Steve J. Software adaptable high performance multicarrier transmission protocol
US20040101046A1 (en) * 2000-08-25 2004-05-27 Lin Yang Terrestrial digital multimedia/television broadcasting system
US20020136158A1 (en) * 2000-09-21 2002-09-26 Motorola, Inc. MMSE reception of DS-CDMA with transmit diversity
US20020145989A1 (en) * 2000-11-09 2002-10-10 Interdigital Technology Corporation Single user detection
US6359826B1 (en) * 2000-11-20 2002-03-19 Silicon Access Technology, Inc. Method and a system for controlling a data sense amplifier for a memory chip
US7110465B2 (en) * 2000-11-27 2006-09-19 Fujitsu Limited Noise canceling method and apparatus
US6745352B2 (en) * 2000-12-13 2004-06-01 Ericsson Inc. Methods of estimating error rates for communications received using iterative processing and related receivers
US20030043767A1 (en) * 2001-02-06 2003-03-06 Interdigital Technology Corporation Single user detection user equipment
US20030086366A1 (en) * 2001-03-06 2003-05-08 Branlund Dale A. Adaptive communications methods for multiple user packet radio wireless networks
US20030043887A1 (en) * 2001-04-03 2003-03-06 Hudson John E. Communication system and methods of estimating channel impulse responses therein
US20030035491A1 (en) * 2001-05-11 2003-02-20 Walton Jay R. Method and apparatus for processing data in a multiple-input multiple-output (MIMO) communication system utilizing channel state information
US20030043732A1 (en) * 2001-05-17 2003-03-06 Walton Jay R. Method and apparatus for processing data for transmission in a multi-channel communication system using selective channel transmission
US20030112880A1 (en) * 2001-05-17 2003-06-19 Walton Jay R. Method and apparatus for processing data for transmission in a multi-channel communication system using selective channel inversion
US20030048856A1 (en) * 2001-05-17 2003-03-13 Ketchum John W. Method and apparatus for processing data for transmission in a multi-channel communication system using selective channel inversion
US20030043925A1 (en) * 2001-05-29 2003-03-06 Tioga Technologies, Ltd. Method and system for detecting, timing, and correcting impulse noise
US20030026201A1 (en) * 2001-06-18 2003-02-06 Arnesen David M. Sliding-window transform with integrated windowing
US20030063557A1 (en) * 2001-07-13 2003-04-03 Mitsubishi Denki Kabushiki Kaisha Multi-user detection in an MC-CDMA telecommunication system
US20030076908A1 (en) * 2001-08-24 2003-04-24 Huang Howard C. Signal detection by a receiver in a multiple antenna time-dispersive system
US20030152021A1 (en) * 2001-09-24 2003-08-14 Yi-Hsiu Wang Post-fft scaling to reduce multiple effects
US20030058952A1 (en) * 2001-09-26 2003-03-27 Webster Mark A. Single-carrier to multi-carrier wireless architecture
US20030072291A1 (en) * 2001-10-04 2003-04-17 Mitsubishi Denki Kabushiki Kaisha Multi-user detection method for a receiver in a MC-CDMA telecommunication system
US20030076900A1 (en) * 2001-10-24 2003-04-24 Magee David Patrick Decimated noise estimation and/or beamforming for wireless communications
US20030125040A1 (en) * 2001-11-06 2003-07-03 Walton Jay R. Multiple-access multiple-input multiple-output (MIMO) communication system
US20030099216A1 (en) * 2001-11-28 2003-05-29 Johan Nilsson Method and apparatus for estimation of phase offset between communication channels
US20030103584A1 (en) * 2001-12-03 2003-06-05 Bjerke Bjorn A. Iterative detection and decoding for a MIMO-OFDM system
US20030108117A1 (en) * 2001-12-07 2003-06-12 Ketchum John W. Time-domain transmit and receive processing with channel eigen-mode decompositon for MIMO systems
US20030128658A1 (en) * 2002-01-08 2003-07-10 Walton Jay Rod Resource allocation for MIMO-OFDM communication systems
US20030129984A1 (en) * 2002-01-08 2003-07-10 Dent Paul W. Distributed wireless architecture using microcast
US20030133403A1 (en) * 2002-01-11 2003-07-17 Mitsubishi Denki Kabushiki Kaisha Pre-distortion method for telecommunication system and transmitter for mobile terminal of MC-CDMA telecommunication system
US20040120424A1 (en) * 2002-02-20 2004-06-24 Roberts Richard D. Method for making a clear channel assessment in a wireless network
US20040136399A1 (en) * 2002-02-20 2004-07-15 Roberts Richard D. Method for operating multiple overlapping wireless networks
US20040142663A1 (en) * 2002-02-20 2004-07-22 Roberts Richard D. Method for operating multiple overlapping wireless networks
US20040087275A1 (en) * 2002-03-01 2004-05-06 Sugar Gary L. System and method for antenna diversity using joint maximal ratio combining
US20030165131A1 (en) * 2002-03-04 2003-09-04 The National University Of Singapore CDMA system with frequency domain equalization
US20040120274A1 (en) * 2002-04-25 2004-06-24 Frederik Petre CDMA transceiver techniques for wireless communications
US20040116077A1 (en) * 2002-08-08 2004-06-17 Kddi Corporation Transmitter device and receiver device adopting space time transmit diversity multicarrier CDMA, and wireless communication system with the transmitter device and the receiver device
US20040032354A1 (en) * 2002-08-16 2004-02-19 Yaron Knobel Multi-band ultra-wide band communication method and system
US20040032918A1 (en) * 2002-08-16 2004-02-19 Gadi Shor Communication method, system and apparatus utilizing burst symbol cycles
US20040052236A1 (en) * 2002-09-07 2004-03-18 Samsung Electronics Co., Ltd. Apparatus and method for joint detection receiving irrespective of orthogonal code length in mobile communication system
US20040086027A1 (en) * 2002-10-31 2004-05-06 Shattil Steve J. Orthogonal superposition coding for direct-sequence communications
US20040086035A1 (en) * 2002-10-31 2004-05-06 Upton Eric L. EHF equalizer implemented with MEMs tap weight controls
US20040146024A1 (en) * 2003-01-28 2004-07-29 Navini Networks, Inc. Method and system for interference reduction in a wireless communication network using a joint detector

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8526552B1 (en) * 2009-08-25 2013-09-03 Marvell International Ltd. Noise estimation in communication receivers
US8750440B1 (en) * 2009-08-25 2014-06-10 Marvell International Ltd Noise estimation in communication receivers
US8787473B2 (en) * 2009-11-10 2014-07-22 Zte Corporation Method and apparatus for noise estimation in orthogonal frequency division multiplexing (OFDM) system
US20120219050A1 (en) * 2009-11-10 2012-08-30 Zte Corporation Method and apparatus for noise estimation in orthogonal frequency division multiplexing (ofdm) system
US9077422B1 (en) 2010-07-28 2015-07-07 Marvell International Ltd Validation and stabilization of noise matrices
US8483641B1 (en) 2010-07-28 2013-07-09 Marvell International Ltd. Validation and stabilization of noise matrices
US20120069914A1 (en) * 2010-09-22 2012-03-22 Qualcomm Incorporated Efficient compressed sensing channel estimation for single-carrier communication systems
US8942321B2 (en) * 2010-09-22 2015-01-27 Qualcomm Incorporated Efficient compressed sensing channel estimation for single-carrier communication systems
US20130170842A1 (en) * 2012-01-04 2013-07-04 Toshiaki Koike-Akino Method and System for Equalization and Decoding Received Signals Based on High-Order Statistics in Optical Communication Networks

Also Published As

Publication number Publication date Type
US20060034398A1 (en) 2006-02-16 application
US7042967B2 (en) 2006-05-09 grant
US7609794B2 (en) 2009-10-27 grant
US20050025267A1 (en) 2005-02-03 application
US20080298523A1 (en) 2008-12-04 application

Similar Documents

Publication Publication Date Title
Vollmer et al. Comparative study of joint-detection techniques for TD-CDMA based mobile radio systems
US5648983A (en) CDMA rake receiver with sub-chip resolution
Fawer et al. A multiuser receiver for code division multiple access communications over multipath channels
US20050259757A1 (en) Frequency domain equalization in communications systems with scrambling
US20050111528A1 (en) Method and apparatus for DS-CDMA interference suppression using code-specific combining
US6879578B2 (en) Single user detection user equipment
US6724743B1 (en) Method of conjoint detection of a set of CDMA codes
US6707864B2 (en) Simplified block linear equalizer with block space time transmit diversity
US7035354B2 (en) CDMA multi-user detection with a real symbol constellation
US6928104B2 (en) Scaling using gain factors for use in data detection for wireless code division multiple access communication systems
US20040223538A1 (en) Multi user detection using equalization and successive interference cancellation
US6466611B1 (en) Multi-user detection using a finite-impulse-response matrix filter
US7170926B2 (en) Efficient multiple input multiple output system for multi-path fading channels
US6947502B2 (en) Parameter estimator for a multiuser detection receiver
US7869546B2 (en) Multicode transmission using Walsh Hadamard transform
US20040223480A1 (en) Kalman filter based method and apparatus for linear equalization of CDMA downlink channels
WO1996011534A2 (en) Interference cancellation method, and receiver
US20020006122A1 (en) Channel estimation for time division duplex communication systems
US20030091100A1 (en) Method and device for radio signal reception
US6625203B2 (en) Fast joint detection
US20040136316A1 (en) Efficient joint detection
Bhashyam et al. Multiuser channel estimation and tracking for long-code CDMA systems
US20020145989A1 (en) Single user detection
US20080063033A1 (en) Method for Covariance Matrix Update
Benvenuto et al. Joint detection with low computational complexity for hybrid TD-CDMA systems