Reduced complexity sliding window based equalizer
Download PDFInfo
 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
Links
Images
Classifications

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
 H04L25/0202—Channel estimation
 H04L25/024—Channel estimation channel estimation algorithms
 H04L25/0242—Channel estimation channel estimation algorithms using matrix methods

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04B—TRANSMISSION
 H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00  H04B13/00; Details of transmission systems not characterised by the medium used for transmission
 H04B1/69—Spread spectrum techniques
 H04B1/707—Spread spectrum techniques using direct sequence modulation
 H04B1/7097—Interferencerelated aspects
 H04B1/7103—Interferencerelated aspects the interference being multiple access interference
 H04B1/7105—Joint detection techniques, e.g. linear detectors
 H04B1/71052—Joint detection techniques, e.g. linear detectors using decorrelation matrix

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
 H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
 H04L25/03006—Arrangements for removing intersymbol interference
 H04L25/03012—Arrangements for removing intersymbol interference operating in the time domain
 H04L25/03019—Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception
 H04L25/03057—Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception with a recursive structure

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
 H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
 H04L25/03006—Arrangements for removing intersymbol interference
 H04L25/03178—Arrangements involving sequence estimation techniques
 H04L25/03248—Arrangements for operating in conjunction with other apparatus
 H04L25/03292—Arrangements for operating in conjunction with other apparatus with channel estimation circuitry

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
 H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
 H04L25/03006—Arrangements for removing intersymbol interference
 H04L2025/0335—Arrangements for removing intersymbol interference characterised by the type of transmission
 H04L2025/03426—Arrangements for removing intersymbol interference characterised by the type of transmission transmission using multipleinput and multipleoutput channels

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
 H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
 H04L25/03006—Arrangements for removing intersymbol interference
 H04L2025/03433—Arrangements for removing intersymbol interference characterised by equaliser structure
 H04L2025/03439—Fixed structures
 H04L2025/03445—Time domain
 H04L2025/03471—Tapped delay lines
 H04L2025/03509—Tapped delay lines fractionally spaced

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
 H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks ; Receiver end arrangements for processing baseband signals
 H04L25/03006—Arrangements for removing intersymbol interference
 H04L2025/03592—Adaptation methods
 H04L2025/03598—Algorithms
 H04L2025/03605—Block algorithms

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
 H04L25/00—Baseband systems
 H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
 H04L25/0202—Channel estimation
 H04L25/0212—Channel 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
 [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 continuationinpart 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.
 [0002]The invention generally relates to wireless communication systems, In particular, the invention relates to data detection in such systems.
 [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.
 [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.
 [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 autocorrelation correction factor.  [0019]
FIG. 8 is a receiver using sliding window data detection using a noise autocorrelation 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).  [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 NodeB, 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 (TDSCDMA), 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 k^{th }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]
$\begin{array}{cc}r\ue8a0\left(t\right)=\sum _{k=\infty}^{\infty}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89ed\ue8a0\left(k\right)\ue89eh\ue8a0\left(t{\mathrm{kT}}_{c}\right)+n\ue8a0\left(t\right)\ue89e\phantom{\rule{1.7em}{1.7ex}}\infty <t<\infty & \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e4\end{array}$  [0027]n(t) is the sum of additive noise and interference (intracell and intercell). 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]
$\begin{array}{cc}\phantom{\rule{1.1em}{1.1ex}}\ue89er\ue8a0\left(j\right)=\sum _{k=\infty}^{\infty}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89ed\ue8a0\left(k\right)\ue89eh\ue8a0\left(jk\right)+n\ue8a0\left(j\right)=\sum _{k=\infty}^{\infty}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89ed\ue8a0\left(jk\right)\ue89eh\ue8a0\left(k\right)+n\ue8a0\left(j\right),\text{}\ue89e\phantom{\rule{4.4em}{4.4ex}}\ue89ej\in \{\dots \ue89e\phantom{\rule{0.3em}{0.3ex}},2,1,0,1,2,\dots \ue89e\phantom{\rule{0.3em}{0.3ex}}\}& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e5\end{array}$  [0000]T_{c }is being dropped for simplicity in the notations.
 [0028]Assuming h(·) has a finite support and is time invariant. This means that in the discretetime domain, index L exists such that h(i)=0 for i<0 and i≧L. As a result, Equation 5 can be rewritten as Equation 6.
 [0000]
$\begin{array}{cc}r\ue8a0\left(j\right)=\sum _{k=0}^{L1}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89eh\ue8a0\left(k\right)\ue89ed\ue8a0\left(jk\right)+n\ue8a0\left(j\right),\text{}\ue89ej\in \{\dots \ue89e\phantom{\rule{0.3em}{0.3ex}},2,1,0,1,2,\dots \ue89e\phantom{\rule{0.3em}{0.3ex}}\}& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e6\end{array}$  [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}εC^{M},
 [0031]d=[d(−L+1), d(−L+2), . . . , d(0), d(1), . . . , d(M−1)]^{T}εC^{M+L−1 }
 [0032]n=[n(0), . . . , n(M−1)]^{T}εC^{M}
 [0000]
$\begin{array}{cc}\phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{35.6em}{35.6ex}}\ue89e\mathrm{Equation}\ue89e\phantom{\rule{0.8em}{0.8ex}}\ue89e7\end{array}$ $H=[\phantom{\rule{0.em}{0.ex}}\ue89e\begin{array}{cccccccc}h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& 0& \cdots & \cdots \\ 0& h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& 0& \cdots \\ \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots \\ \cdots & \cdots & 0& h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(1\right)& h\ue8a0\left(0\right)\end{array}]\ue89e\phantom{\rule{0.em}{0.ex}}\in {C}^{M\times \left(M+L1\right)}$  [0033]In Equation 7, C^{M }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]
$\begin{array}{cc}d={\left[\begin{array}{c}\underset{L1}{\underset{\uf613}{d\ue8a0\left(L+1\right),d\ue8a0\left(L+2\right),\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},d\ue89e\left(1\right)},}\\ \underset{N}{\underset{\uf613}{d\ue8a0\left(0\right),d\ue8a0\left(1\right),\dots \ue89e\phantom{\rule{0.6em}{0.6ex}},d\ue89e\left(N1\right)},}\\ \underset{\underset{L1}{\uf613}}{d\ue8a0\left(N\right),\dots \ue89e\phantom{\rule{0.6em}{0.6ex}},d\ue8a0\left(N+L2\right)}\end{array}\right]}^{T}\in {C}^{N+2\ue89eL2}& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e8\end{array}$  [0035]The H matrix in Equation 7 is a banded matrix, which can be represented as the diagram in
FIG. 1 . InFIG. 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]
$\begin{array}{cc}\stackrel{~}{H}=\left[\begin{array}{cccc}h\ue8a0\left(0\right)& 0& \cdots & \phantom{\rule{0.3em}{0.3ex}}\\ h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& \ddots & \phantom{\rule{0.3em}{0.3ex}}\\ \vdots & h\ue8a0\left(1\right)& \ddots & 0\\ h\ue8a0\left(L1\right)& \vdots & \ddots & h\ue8a0\left(0\right)\\ 0& h\ue8a0\left(L1\right)& \ddots & h\ue8a0\left(1\right)\\ \vdots & 0& \ddots & \vdots \\ \phantom{\rule{0.3em}{0.3ex}}& \vdots & \ddots & h\ue8a0\left(L1\right)\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e11\end{array}$  [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 k^{th }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 intime 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, 2N_{s}×SF. N_{s}ε{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 2N_{s}×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. H_{p }is per Equation 14.
 [0000]
$\begin{array}{cc}{H}_{p}=\left[\begin{array}{cccc}h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(1\right)\\ 0& h\ue8a0\left(L1\right)& \cdots & h\ue8a0\left(2\right)\\ \vdots & \ddots & \ddots & \vdots \\ 0& \cdots & 0& h\ue8a0\left(L1\right)\\ 0& \cdots & \cdots & 0\\ \vdots & \vdots & \vdots & \vdots \\ 0& \cdots & \cdots & 0\end{array}\right]\in {C}^{\left(N+L1\right)\times \left(L1\right)}& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e14\end{array}$  [0047]H_{f }is per Equation 15.
 [0000]
$\begin{array}{cc}{H}_{f}=\left[\begin{array}{cccc}0& \cdots & \cdots & 0\\ \vdots & \vdots & \vdots & \vdots \\ 0& \cdots & \cdots & 0\\ h\ue8a0\left(0\right)& 0& \cdots & 0\\ \vdots & \ddots & \ddots & 0\\ h\ue8a0\left(L3\right)& \cdots & h\ue8a0\left(0\right)& 0\\ h\ue8a0\left(L2\right)& h\ue8a0\left(L3\right)& \cdots & h\ue8a0\left(0\right)\end{array}\right]\in {C}^{\left(N+L1\right)\times \left(L1\right)}& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e15\end{array}$  [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 d_{p }is per Equation 17.
 [0000]
d _{p} =[d(−L+1)d(−L+2) . . . d(−1)]^{T} εC ^{L1} Equation 17  [0050]d_{f }is per Equation 18.
 [0000]
d _{f} =[d(N)d(N+1) . . . d(N+L−2)]^{T} εC ^{L1} 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−H_{p}d_{p }and ñ_{1}=H_{f}d_{f}+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)} ^{H}+Σ_{1})^{−1} {tilde over ({circumflex over (r)} Equation 21  [0054]In Equation 21, g_{d }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 H_{f}d_{f }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 ofFIG. 6 , which can be implemented in a WTRU or base station. The circuit ofFIG. 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, H_{p}, {tilde over (H)} and H_{f}, (step 50). A future noise autocorrelation device 24 determines a future noise autocorrelation factor, g_{d}H_{f}H_{f} ^{H}, (step 52). A noise autocorrelation device 22 determines a noise autocorrelation factor, E{nn^{H}}, (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, H_{p}, and a past determined portion of the data vector, {circumflex over (d)}_{p}, to produce a past correction factor, H_{p}{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}=H_{p}d_{p}+H_{f}d_{f}+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)} ^{H}+Σ_{2})^{−1} r Equation 26  [0063]Assuming H_{p}d_{p}, H_{f}d_{f }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 H_{p}H_{p} ^{H }and H_{f}H_{f} ^{H }are not necessary, since only the upper and lower corner of H_{p }and H_{f}, respectively, are nonzero, in general.
 [0065]This approach is also described in conjunction with the flow diagram of
FIG. 7 and preferred receiver components ofFIG. 8 , which can be implemented in a WTRU or base station. The circuit ofFIG. 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, H_{p}, {tilde over (H)} and H_{f}, (step 70). A noise autocorrelation correction device 38 determines a noise autocorrelation correction factor, g_{d}H_{p}H_{p} ^{H}+g_{d}H_{f}H_{f} ^{H}, using the future and past portions of the channel response matrix, (step 72). A noise auto correlation device 40 determines a noise autocorrelation factor, E{nn^{H}}, (step 74). A summer 42 adds the noise autocorrelation correction factor to the noise autocorrelation 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 A_{cir}εC^{N×N}, for some integer N, is a circulant matrix if it has the following form per Equation 28.
 [0000]
$\begin{array}{cc}{A}_{\mathrm{cir}}=\left[\begin{array}{ccccc}{a}_{1}& {a}_{N}& {a}_{N1}& \phantom{\rule{0.3em}{0.3ex}}& {a}_{2}\\ {a}_{2}& {a}_{1}& {a}_{N}& \ddots & \vdots \\ \vdots & {a}_{2}& {a}_{1}& \ddots & {a}_{N1}\\ \vdots & \vdots & {a}_{2}& \ddots & {a}_{N}\\ {a}_{N}& {a}_{N1}& \vdots & \phantom{\rule{0.3em}{0.3ex}}& {a}_{1}\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e28\end{array}$  [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, A_{cir}[:,1]=(a_{0}, a_{1}, . . . , a_{N})^{T}εC^{N}, i.e. it is the first column of matrix A_{cir }
Columns other than the first column can be used if properly permuted. F_{N }is the Npoint DFT matrix which is defined as, for any xεC^{N}, as per Equation 30.  [0000]
$\begin{array}{cc}{\left({F}_{N}\ue89ex\right)}_{k}=\sum _{n=0}^{N1}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89ex\ue8a0\left(n\right)\ue89e{\uf74d}^{j\ue89e\frac{2\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89e\pi \ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89e\mathrm{kn}}{N}}\ue89e\text{}\ue89ek=0,\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},N1& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e30\end{array}$  [0000]F_{N} ^{−1 }is the Npoint inverse DFT matrix which is defined as, for any xεC^{N}, as per Equation 31.
 [0000]
$\begin{array}{cc}{\left({F}_{N}^{1}\ue89ex\right)}_{k}=\frac{1}{N}\ue89e{\left({F}_{N}^{*}\ue89ex\right)}_{k}=\frac{1}{N}\ue89e\sum _{n=0}^{N1}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89ex\ue8a0\left(n\right)\ue89e{\uf74d}^{j\ue89e\frac{2\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89e\pi \ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89e\mathrm{kn}}{N}}\ue89e\text{}\ue89ek=0,\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},N1& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e31\end{array}$  [0000]Λ_{N}(·) is a diagonal matrix, which is defined as, for any xεC^{N}, as per Equation 32.
 [0000]
Λ_{N}(x)=diag(F _{N} x) Equation 32  [0071]The inverse of matrix A_{cir }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]
$\begin{array}{cc}r\ue8a0\left(t\right)=\sum _{k=\infty}^{\infty}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89ed\ue8a0\left(k\right)\ue89eh\ue8a0\left(t{\mathrm{kT}}_{c}\right)+n\ue8a0\left(t\right)\ue89e\text{}\infty <t<\infty & \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e34\end{array}$  [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 (intracell and intercell).
 [0074]Using chip rate sampling and h(·) having a finite support, which means, in discretetime domain, there is an integer L such that h(i)=0 for i<0 and i≧L, the sampled received signal can be expressed (T_{c }is dropped for simplicity of the notations), as per Equation 35.
 [0000]
$\begin{array}{cc}r\ue8a0\left(j\right)=\sum _{k=0}^{L1}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89eh\ue8a0\left(k\right)\ue89ed\ue8a0\left(jk\right)+n\ue8a0\left(j\right)\ue89e\text{}\ue89ej\in \{\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},2,1,0,1,2,\dots \ue89e\phantom{\rule{0.8em}{0.8ex}}\}& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e35\end{array}$  [0075]Based on M (M>L) received signals r(0), . . . , r(M−1), Equation 36 results.
 [0000]
$\phantom{\rule{4.4em}{4.4ex}}\ue89er=\mathrm{Hd}+n$ $\phantom{\rule{4.4em}{4.4ex}}\ue89e\mathrm{where}$ $\phantom{\rule{4.4em}{4.4ex}}\ue89er={\left[r\ue8a0\left(0\right),\dots \ue89e\phantom{\rule{0.6em}{0.6ex}},r\ue8a0\left(M1\right)\right]}^{T}\in {C}^{M},\text{}\ue89e\phantom{\rule{4.4em}{4.4ex}}\ue89ed={\left[\begin{array}{c}d\ue8a0\left(L+1\right),d\ue8a0\left(L+2\right),\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},\\ d\ue8a0\left(0\right),d\ue8a0\left(1\right),\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},d\ue8a0\left(M1\right)\end{array}\right]}^{T}\in {C}^{M+L=1}$ $\phantom{\rule{4.4em}{4.4ex}}\ue89en={\left[n\ue8a0\left(0\right),\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},n\ue8a0\left(M1\right)\right]}^{T}\in {C}^{M}$ $\phantom{\rule{36.4em}{36.4ex}}\ue89e\mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e36$ $H=[\phantom{\rule{0.em}{0.ex}}\ue89e\begin{array}{cccccccc}h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& 0& \cdots & \cdots \\ 0& h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& 0& \cdots \\ \vdots & \ddots & \ddots & \ddots & \ddots & \ddots & \ddots & \vdots \\ \cdots & \cdots & 0& h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(1\right)& h\ue8a0\left(0\right)\end{array}]\ue89e\phantom{\rule{0.em}{0.ex}}\in {C}^{M\times \left(M+L1\right)}$  [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{nn^{H}}=σ^{2}I 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]
$\begin{array}{cc}r=\stackrel{~}{H}\ue89e\stackrel{~}{d}+n\ue89e\text{}\ue89e\mathrm{where}\ue89e\text{}\ue89e\stackrel{~}{H}=\left[\begin{array}{cccc}h\ue8a0\left(0\right)& 0& \cdots & \phantom{\rule{0.3em}{0.3ex}}\\ h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& \ddots & \phantom{\rule{0.3em}{0.3ex}}\\ \vdots & h\ue8a0\left(1\right)& \ddots & 0\\ h\ue8a0\left(L1\right)& \vdots & \ddots & h\ue8a0\left(0\right)\\ 0& h\ue8a0\left(L1\right)& \ddots & h\ue8a0\left(1\right)\\ \vdots & 0& \ddots & \vdots \\ \phantom{\rule{0.3em}{0.3ex}}& \vdots & \ddots & h\ue8a0\left(L1\right)\end{array}\right].& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e38\end{array}$  [0079]After the vector {tilde over (d)} is estimated, only the middle part of it is taken for despreading. 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)}^{H}r Equation 39  [0000]where R={tilde over (H)}^{H}{tilde over (H)}+σ^{2}I
 [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]
$\begin{array}{cc}\phantom{\rule{4.2em}{4.2ex}}\ue89er=\stackrel{\u22d3}{H}\ue89e\stackrel{\u22d3}{d}+n\ue89e\text{}\ue89e\phantom{\rule{4.2em}{4.2ex}}\ue89e\mathrm{where}\ue89e\text{}\ue89e\stackrel{\u22d3}{H}=[\phantom{\rule{0.em}{0.ex}}\ue89e\begin{array}{ccccccc}h\ue8a0\left(0\right)& 0& \cdots & \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}\\ h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& \ddots & \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}\\ \vdots & h\ue8a0\left(1\right)& \ddots & 0& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}\\ h\ue8a0\left(L1\right)& \vdots & \ddots & h\ue8a0\left(0\right)& 0& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}\\ 0& h\ue8a0\left(L1\right)& \ddots & h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& \ddots & \phantom{\rule{0.3em}{0.3ex}}\\ \vdots & 0& \ddots & \vdots & \vdots & \ddots & 0\\ \phantom{\rule{0.3em}{0.3ex}}& \vdots & \ddots & h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(0\right)\end{array}\ue89e\phantom{\rule{0.em}{0.ex}}]\ue89e\phantom{\rule{0.em}{0.ex}}\in {C}^{M\times M}\ue89e\text{}\ue89e\phantom{\rule{4.4em}{4.4ex}}\ue89e\stackrel{\u22d3}{d}={\left[d\ue8a0\left(0\right),\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},d\ue8a0\left(M1\right)\right]}^{T}\in {C}^{M\times 1}& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e40\end{array}$  [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]
$\begin{array}{cc}\phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{34.7em}{34.7ex}}\ue89e\mathrm{Equation}\ue89e\phantom{\rule{0.8em}{0.8ex}}\ue89e41\end{array}$ $\phantom{\rule{4.4em}{4.4ex}}\ue89e{H}_{\mathrm{cir}}=\left[\begin{array}{ccccccc}h\ue8a0\left(0\right)& 0& \cdots & 0& h\ue8a0\left(L1\right)& \cdots & h\ue8a0\left(1\right)\\ h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& \ddots & \vdots & 0& \ddots & \vdots \\ \vdots & h\ue8a0\left(1\right)& \ddots & 0& \vdots & \phantom{\rule{0.3em}{0.3ex}}& h\ue8a0\left(L1\right)\\ h\ue8a0\left(L1\right)& \vdots & \ddots & h\ue8a0\left(0\right)& 0& \ddots & 0\\ 0& h\ue8a0\left(L1\right)& \ddots & h\ue8a0\left(1\right)& h\ue8a0\left(0\right)& \ddots & \vdots \\ \vdots & 0& \ddots & \vdots & \vdots & \ddots & 0\\ 0& \vdots & \ddots & h\ue8a0\left(L1\right)& h\ue8a0\left(L2\right)& \cdots & h\ue8a0\left(0\right)\end{array}\right]$  [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}εC^{M×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)}=R_{cir} ^{−1}H_{cir} ^{H}r Equation 43  [0000]where R_{cir}=H_{cir} ^{H}H_{cir}+σ^{2}I
Both H_{cir} ^{H }and R_{cir }are circulant and R_{cir }is of the form per Equation 44.  [0000]
$\begin{array}{cc}{R}_{\mathrm{cir}}=& \phantom{\rule{31.4em}{31.4ex}}\ue89e\mathrm{Equation}\ue89e\phantom{\rule{0.8em}{0.8ex}}\ue89e44\end{array}\ue89e\text{}[\phantom{\rule{0.em}{0.ex}}\ue89e\begin{array}{cccccccccccc}{R}_{0}& {R}_{1}& \cdots & {R}_{L1}& 0& 0& \cdots & \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& {R}_{2}^{*}& {R}_{1}^{*}\\ {R}_{1}^{*}& {R}_{0}& \ddots & \phantom{\rule{0.3em}{0.3ex}}& {R}_{L1}& 0& \ddots & \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \vdots & \phantom{\rule{0.3em}{0.3ex}}\\ \vdots & {R}_{1}^{*}& \ddots & {R}_{1}& \phantom{\rule{0.3em}{0.3ex}}& {R}_{L1}& \ddots & 0& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& {R}_{L1}^{*}& \vdots \\ {R}_{L1}^{*}& \phantom{\rule{0.3em}{0.3ex}}& \ddots & {R}_{0}& {R}_{1}& \phantom{\rule{0.3em}{0.3ex}}& \ddots & 0& 0& \phantom{\rule{0.3em}{0.3ex}}& 0& {R}_{L1}^{*}\\ 0& {R}_{L1}^{*}& \phantom{\rule{0.3em}{0.3ex}}& {R}_{1}^{*}& {R}_{0}& \ddots & \phantom{\rule{0.3em}{0.3ex}}& {R}_{L1}& 0& \phantom{\rule{0.3em}{0.3ex}}& \vdots & 0\\ \vdots & 0& \ddots & \phantom{\rule{0.3em}{0.3ex}}& {R}_{1}^{*}& \ddots & \ddots & \phantom{\rule{0.3em}{0.3ex}}& {R}_{L1}& \ddots & 0& \vdots \\ 0& \vdots & \ddots & {R}_{L1}^{*}& \phantom{\rule{0.3em}{0.3ex}}& \ddots & \ddots & {R}_{1}& \phantom{\rule{0.3em}{0.3ex}}& \ddots & 0& 0\\ {R}_{L1}& 0& \ddots & 0& {R}_{L1}^{*}& \phantom{\rule{0.3em}{0.3ex}}& \ddots & {R}_{0}& {R}_{1}& \phantom{\rule{0.3em}{0.3ex}}& {R}_{L1}& 0\\ \vdots & {R}_{L1}& \phantom{\rule{0.3em}{0.3ex}}& \vdots & 0& {R}_{L1}^{*}& \phantom{\rule{0.3em}{0.3ex}}& {R}_{1}^{*}& {R}_{0}& \ddots & \phantom{\rule{0.3em}{0.3ex}}& {R}_{L1}\\ \vdots & \vdots & \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& 0& 0& \ddots & \phantom{\rule{0.3em}{0.3ex}}& {R}_{1}^{*}& \ddots & {R}_{1}& \phantom{\rule{0.3em}{0.3ex}}\\ \vdots & \vdots & \ddots & \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& 0& \ddots & {R}_{L1}^{*}& \phantom{\rule{0.3em}{0.3ex}}& \ddots & {R}_{0}& {R}_{1}\\ {R}_{1}& {R}_{2}& \cdots & 0& \phantom{\rule{0.3em}{0.3ex}}& \cdots & 0& 0& {R}_{L1}^{*}& \cdots & {R}_{1}^{*}& {R}_{0}\end{array}\ue89e\phantom{\rule{0.em}{0.ex}}]$  [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 ofFIG. 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 H_{cir}. A Hermitian device 84 produces the Hermitian of H_{cir}, H_{cir} ^{H}. Using H_{cir}, H_{cir} ^{H }and the noise variance σ^{2}, R_{cir }is determined by a R_{cir }determining device 86. Using a first column of H_{cir} ^{H}, a diagonal matrix is determined by a Λ_{M}(H_{cir} ^{H}[:,1]) determining device 88. Using a first column of R_{cir}, an inverse diagonal matrix is determined by a Λ_{M} ^{−1}(R_{cir}[:,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 N_{ss }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]N_{symbol}ε{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 radix2 FFT or a prime factor algorithm (PFA) FFT can be applied. After the data is estimated, 2N_{symbol}×SF samples are taken to process despreading starting from N_{symbol}×SF^{th }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, r_{k}, 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]
$\begin{array}{cc}\left[\begin{array}{c}{r}_{1}\\ {r}_{2}\\ \vdots \\ {r}_{K}\end{array}\right]=\left[\begin{array}{c}{H}_{\mathrm{cir},1}\\ {H}_{\mathrm{cir},2}\\ \vdots \\ {H}_{\mathrm{cir},K}\end{array}\right]\ue89ed+\left[\begin{array}{c}{n}_{1}\\ {n}_{2}\\ \vdots \\ {n}_{K}\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e48\end{array}$  [0092]Equations 49 and 50 are estimates of the autocorrelation and crosscorrelation properties of the noise terms.
 [0000]
E{n_{k}n_{k} ^{H}}=σ^{2}I for k=1, . . . , K Equation 49  [0000]
and  [0000]
E{n_{k}n_{j} ^{H}}=0 for k≠j Equation 50  [0093]Applying MMSE algorithm, the estimated data can be expressed as per Equation 51.
 [0000]
$\begin{array}{cc}\hat{d}={R}_{\mathrm{cir}}^{1}\ue89e\sum _{k=1}^{K}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89e{H}_{\mathrm{cir},k}^{H}\ue89e{r}_{k}\ue89e\text{}\ue89e\mathrm{where}\ue89e\text{}\ue89e{R}_{\mathrm{cir}}=\sum _{k=1}^{K}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89e{H}_{\mathrm{cir},k}^{H}\ue89e{H}_{\mathrm{cir},k}+{\sigma}^{2}\ue89eI& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e51\end{array}$  [0000]R_{cir }is still a circulant matrix and the estimated data can be determined per Equation 52.
 [0000]
$\begin{array}{cc}\hat{d}={F}_{M}^{1}\ue89e{\Lambda}_{M}^{1}\ue8a0\left({R}_{\mathrm{cir}}\ue8a0\left[:,1\right]\right)\ue89e\sum _{k=1}^{K}\ue89e\phantom{\rule{0.3em}{0.3ex}}\ue89e{\Lambda}_{M}\ue8a0\left({H}_{\mathrm{cir},k}^{H}\ue8a0\left[:,1\right]\right)\ue89e{F}_{M}\ue89e{r}_{k}& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e52\end{array}$  [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=[r_{0}, r_{1}, . . . , r_{2N−1}]^{T}. This vector may be rearranged and separated into an even received vector r_{e}=[r_{0}, r_{2}, . . . , r_{2N−2}]^{T }and an odd received vector r_{o}=[r_{1}, r_{3}, . . . , r_{2N−1}]^{T}, with r=[r_{e}, r_{o}]^{T}. Without loss of generality, the data transmission model is per Equation 53.
 [0000]
$\begin{array}{cc}\left[\begin{array}{c}{r}_{e}\\ {r}_{o}\end{array}\right]=\left[\begin{array}{c}{H}_{e}\\ {H}_{o}\end{array}\right]\ue89ed+\left[\begin{array}{c}{n}_{e}\\ {n}_{o}\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e53\end{array}$  [0000]Equation 53 separates the effective 2sampleperchip discretetime channel into two chiprate discretetime channels.
 [0098]The matrices H_{e }and H_{o }in Equation 53 are, correspondingly, the even and odd channel response matrices. These matrices are constructed from the even and odd channel response vectors h_{e }and h_{o}, 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[n_{e}n_{e} ^{H}]=E[n_{o}n_{o} ^{H}]=σ^{2}I 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[n_{e}n_{o} ^{H}]=0 Equation 55  [0101]As a result, the problem is mathematically similar to the case of the chiprate equalizer for 2 receive antennas with uncorrelated noise, as previously described. However, the received antenna signals in many implementations are processed by a receiveside rootraised 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 raisedcosine (RC) autocorrelation function. RC is the frequencydomain 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]
${\Lambda}_{\mathrm{cross}}\ue89e\stackrel{\mathrm{def}}{=}\ue89e\frac{1}{{\sigma}^{2}}\ue89eE\ue8a0\left[{n}_{e}\ue89e{n}_{o}^{H}\right]$  [0102]
$\begin{array}{cc}\frac{1}{{\sigma}^{2}}\ue89e{E\ue8a0\left[{n}_{e}\ue89e{n}_{o}^{H}\right]}_{\left(i,j\right)}={x}_{\mathrm{RC}}\ue8a0\left(\uf603ij\uf604+0.5\right)& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e56\end{array}$  [0000]x_{RC }is the unitysymboltime 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 crosscorrelation matrix of the total noise vector and is per Equation 57.
 [0000]
$\begin{array}{cc}{\Sigma}_{n}={\sigma}^{2}\ue8a0\left[\begin{array}{cc}I& {\Sigma}_{\mathrm{cross}}\\ {\Sigma}_{\mathrm{cross}}& I\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e57\end{array}$  [0105]Exact Solution
 [0106]The exact solution to the problem of linear minimum meansquare 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=H^{H}Σ_{n} ^{−1}r is the whitening matched filtering (WMF)
 [0107]{circumflex over (d)}_{MMSE}=(H^{H}Σ_{n} ^{−1}H+I)^{−1}y is the linear MMSE equalization
 [0108]Neither H^{H}Σ_{n} ^{−1 }nor H^{H}Σ_{n} ^{−1}H+I are Toeplitz and neither can be made Toeplitz through elemental unitary operations (e.g. row/column rearrangements), due to the structure of Σ_{n}. Accordingly, DFTbased 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 almostexact solution.
 [0110]Simple Approximation
 [0111]The simple approximation ignores the correlation between n_{e }and n_{o}, Σ_{cross}=0. As a result, the same approach as multiple chiprate receive antennas is used.
 [0112]The complexity of this simple approximation approach is as follows. Nchip data blocks are considered. For rough approximation, an Npoint DFT complexity, given by N log N operations per second (ops), is assumed. Additionally, Npoint vector multiplications are assumed to take N ops and vector additions are ignored.
 [0113]The complexity of the DFTbased 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 Npoint DFTs to transform the received vector into the frequency domain; 2 Npoint 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 Npoint 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 almostexact solution which uses a blockToeplitz 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=[r_{0}, r_{1}, . . . , r_{2N−1}]^{T}. Equation 61 is the natural order model.
 [0000]
r=H _{bT} d+n  [0000]where H_{bT }is defined as
 [0000]
$\begin{array}{cc}{H}_{\mathrm{bT}}=\left[\begin{array}{c}{h}_{e,1}\\ {h}_{o,1}\\ \vdots \\ {h}_{o,N}\end{array}\right]=\left[\begin{array}{c}{G}_{1}\\ {G}_{2}\\ \vdots \\ {G}_{N}\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e61\end{array}$  [0000]h_{e,i }is the i^{th }row of H_{e }and h_{o,i }is the i^{th }row of H_{o}. G_{i }is a 2×N matrix whose 1^{st }row is h_{e,i }and whose 2^{nd }row is h_{o,i}. Using G_{i }[x,y] as the rowx, columny element of H_{bT }is blockToeplitz 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 blockToeplitz structure of H_{bT }follows immediately from the Toeplitz structure of H_{e }and H_{o }and the rowrearrangement. From the Toeplitz structure of I and Σ_{cross}, the autocorrelation matrix of the noise in the redefined 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, blockcirculant approximations to the blockToeplitz matrices are produced. Since the H_{bT }matrix is also banded, the block circulant approximation of H_{bT }is then obtained directly. However, Σ_{bT }is not banded and therefore it is not possible to produce a blockcirculant 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≦B_{n }and {tilde over (Σ)}_{i,j}=0 otherwise
 [0000]The noisecovariancebandwidth, B_{n}, 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 blockToeplitz and a circulant approximation to it is produced.
 [0121]The circulant approximations of H_{bT }and {tilde over (Σ)}_{bT }are H_{bC }and Σ_{bC}, respectively. W_{n }denotes the npoint DFT matrix, that is if x is an nvector, then x_{f}=W_{n}x is the DFT of x. A blockcirculant matrix C is of the form of Equation 65.
 [0000]
$C=\left[\begin{array}{cccc}{C}_{1}& {C}_{2}& \cdots & {C}_{M}\\ {C}_{2}& {C}_{3}& \cdots & {C}_{1}\\ \vdots & \vdots & \u22f0& \vdots \\ {C}_{M}& {C}_{1}& \cdots & {C}_{M1}\end{array}\right]$  [0000]where C_{i }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 W_{M×N }is the blockNDFT matrix defined as W_{M×N}=W_{M}{circle around (x)}I_{N }
Λ_{M×N}(C) is a block diagonal matrix that depends on C and is given by Equation 67.  [0000]
$\begin{array}{cc}{\Lambda}_{M\times N}\ue8a0\left(C\right)=\left[\begin{array}{cccc}{\Lambda}_{1}\ue8a0\left(C\right)& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}\\ \phantom{\rule{0.3em}{0.3ex}}& {\Lambda}_{2}\ue8a0\left(C\right)& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}\\ \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \u22f0& \phantom{\rule{0.3em}{0.3ex}}\\ \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& \phantom{\rule{0.3em}{0.3ex}}& {\Lambda}_{M}\ue8a0\left(C\right)\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e67\end{array}$  [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]
${\lambda}_{\left(k,l\right)}\ue89e\stackrel{\mathrm{def}}{=}\ue89e{\left[{\lambda}_{1,\left(k,l\right)},{\lambda}_{2,\left(k,l\right)},\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},{\lambda}_{M,\left(k,l\right)}\right]}^{T}\xb7{c}_{i,\left(k,l\right)}$  [0000]denotes the (k,l)^{th }element of C and is defined as
 [0000]
${c}_{\left(k,l\right)}\ue89e\stackrel{\mathrm{def}}{=}\ue89e{\left[{c}_{1,\left(k,l\right)},{c}_{2,\left(k,l\right)},\dots \ue89e\phantom{\rule{0.8em}{0.8ex}},{c}_{M,\left(k,l\right)}\right]}^{T}\xb7{\lambda}_{\left(k,l\right)}$  [0000]is the Mpoint DFT of c_{(k,l) }and is per Equation 68.
 [0000]
λ_{(k,l)}=W_{M} ^{c} _{(k,l)} Equation 68  [0123]Equations 6668 specify the blockDFT representation of square block circulant matrices. N^{2 }DFTs are required to compute Λ_{M×N}(C).
 [0124]The MMSE estimator is rewritten per Equation 69.
 [0000]
{circumflex over (d)} _{MMSE} =H ^{H}(Σ_{n} +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 almostexact 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, (H^{H}(Σ_{n}+HH^{H})^{−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 pulseshaping 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 “blockDFT” 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 h_{e }and h_{o}.
 2. The “blockDFT” of HH^{H }is computed by finding elementbyelement autocorrelations and the crosscorrelation of h_{e }and h_{o}. 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 blockDFT of Σ_{n }is added, which requires 3N multiplies (scale the stored blockDFT of the RRC filter by σ^{2}) and 3N adds to add the blockDFT of the two matrices.
 4. An inverse of Σ_{n}+HH^{H }is taken in the blockDFT domain. To do this an inverse of each of the N 2×2 matrices is taken in the blockDFT domain. To estimate the total number of operations, consider a Hermitian matrix

 [0000]
$M=\left[\begin{array}{cc}a& b\\ {b}^{*}& a\end{array}\right].$  [0000]The inverse of this matrix is given per Equation 70.
 [0000]
$\begin{array}{cc}{M}^{1}=\frac{1}{{a}^{2}{\uf603b\uf604}^{2}}\ue8a0\left[\begin{array}{cc}a& b\\ {b}^{*}& a\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e70\end{array}$ 
 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 blockmultiplied by the blockDFT of H^{H}, which, takes a total of 8N multiplies+4N adds (since H^{H }is not Hermitian).

 [0135]To summarize, the following computation are required: 2 Npoint DFTs; 18N complex multiplies (17 Npoint vector multiplies+N standalone multiplies); 11N complex adds (11 Npoint vector adds); and 1N real divisions.
 [0136]The complexity of processing a data block r of 2N values (N chips long) involves: 2 Npoint DFTs; one product of the Npoint blockDFTs (filter and data), which required 8N complex multiplies and 4N complex adds; and 1 Npoint inverse DFTs.
 [0137]To summarize, the following is required: 3 Npoint DFTs; 8N complex multiplies (8 Npoint vector multiplies); and 4N complex adds (4 Npoint 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 l^{th }antenna are denoted as H_{l,e }and H_{l,o }and h_{l,e,n }and h_{l,o,n }denote the n^{th }row of such matrix. Each channel matrix is Toeplitz and with the appropriate rearrangement of rows the joint channel matrix is a blockToeplitz matrix, per Equation 71.
 [0000]
$\begin{array}{cc}{H}_{\mathrm{bT}}=\left[\begin{array}{c}{h}_{1,e,1}\\ {h}_{1,o,1}\\ \vdots \\ {h}_{L,o,N}\end{array}\right]=\left[\begin{array}{c}{G}_{1}\\ {G}_{2}\\ \vdots \\ {G}_{N}\end{array}\right]& \mathrm{Equation}\ue89e\phantom{\rule{1.1em}{1.1ex}}\ue89e71\end{array}$  [0000]The matrices G_{i }are the Toeplitz blocks of H_{bT}. Each G_{i }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} ^{H}(Σ_{n} +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]
 [0000]E_{n,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. denotes the Kroenecker product.
 [0142]Σ_{n }is a 2LN×2LN Hermitian positive semidefinite matrix, which is blockToeplitz 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 chiprate noise streams are uncorrelated.
 [0143]The complexity of DFTbased 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 Npoint DFTs; 2LN complex multiplies; and 1 inverse Npoint 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 Npoint DFT's; N 2L×2L matrix products+N 2L×2L matrix additions to compute (Σ_{n}+H_{bT}H_{bT} ^{H}); N 2L×2L matrix inverses to compute the inverse of (Σ_{n}+H_{bT}H_{bT} ^{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 singlesampleperchip 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. 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. (canceled)
3. The apparatus of claim 1 , further comprising:
a rootraised cosine filtering unit configured to apply a rootraised cosine filter to the received vector.
4. The apparatus of claim 1 , wherein the processor is configured to ignore noise cross correlation.
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. 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. 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. 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. 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. The apparatus of claim 1 configured as a wireless transmit/receive unit (WTRU).
11. The apparatus of claim 1 configured as a base station.
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. (canceled)
14. The method of claim 12 , further comprising:
applying a rootraised cosine filter to the received vector.
15. The method of claim 12 , wherein the processing includes ignoring noise cross correlation.
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. 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. 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. 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. The method of claim 12 , further comprising:
combining the data vector corresponding to each window to form a combined data vector.
Priority Applications (7)
Application Number  Priority Date  Filing Date  Title 

US45216503 true  20030303  20030303  
US48233303 true  20030625  20030625  
US10791244 US7428279B2 (en)  20030303  20040302  Reduced complexity sliding window based equalizer 
US10875900 US7042967B2 (en)  20030303  20040624  Reduced complexity sliding window based equalizer 
US11265932 US20060034398A1 (en)  20030303  20051103  Reduced complexity sliding window based equalizer 
US12191702 US7609794B2 (en)  20030303  20080814  Reduced complexity sliding window based equalizer 
US12565284 US20100067620A1 (en)  20030303  20090923  Reduced complexity sliding window based equalizer 
Applications Claiming Priority (1)
Application Number  Priority Date  Filing Date  Title 

US12565284 US20100067620A1 (en)  20030303  20090923  Reduced complexity sliding window based equalizer 
Publications (1)
Publication Number  Publication Date 

US20100067620A1 true true US20100067620A1 (en)  20100318 
Family
ID=46302237
Family Applications (4)
Application Number  Title  Priority Date  Filing Date 

US10875900 Active 20240517 US7042967B2 (en)  20030303  20040624  Reduced complexity sliding window based equalizer 
US11265932 Abandoned US20060034398A1 (en)  20030303  20051103  Reduced complexity sliding window based equalizer 
US12191702 Expired  Fee Related US7609794B2 (en)  20030303  20080814  Reduced complexity sliding window based equalizer 
US12565284 Abandoned US20100067620A1 (en)  20030303  20090923  Reduced complexity sliding window based equalizer 
Family Applications Before (3)
Application Number  Title  Priority Date  Filing Date 

US10875900 Active 20240517 US7042967B2 (en)  20030303  20040624  Reduced complexity sliding window based equalizer 
US11265932 Abandoned US20060034398A1 (en)  20030303  20051103  Reduced complexity sliding window based equalizer 
US12191702 Expired  Fee Related US7609794B2 (en)  20030303  20080814  Reduced complexity sliding window based equalizer 
Country Status (1)
Country  Link 

US (4)  US7042967B2 (en) 
Cited By (5)
Publication number  Priority date  Publication date  Assignee  Title 

US20120069914A1 (en) *  20100922  20120322  Qualcomm Incorporated  Efficient compressed sensing channel estimation for singlecarrier communication systems 
US20120219050A1 (en) *  20091110  20120830  Zte Corporation  Method and apparatus for noise estimation in orthogonal frequency division multiplexing (ofdm) system 
US20130170842A1 (en) *  20120104  20130704  Toshiaki KoikeAkino  Method and System for Equalization and Decoding Received Signals Based on HighOrder Statistics in Optical Communication Networks 
US8483641B1 (en)  20100728  20130709  Marvell International Ltd.  Validation and stabilization of noise matrices 
US8526552B1 (en) *  20090825  20130903  Marvell International Ltd.  Noise estimation in communication receivers 
Families Citing this family (20)
Publication number  Priority date  Publication date  Assignee  Title 

US7027489B2 (en) *  20010406  20060411  Interdigital Technology Corporation  Iterative fast fourier transform error correction 
WO2003047032A1 (en) *  20011129  20030605  Interdigital Technology Corporation  Efficient multiple input multiple output system for multipath fading channels 
GB0214729D0 (en) *  20020626  20020807  Koninkl Philips Electronics Nv  Digital receiver arrangement and related method 
US7218693B2 (en) *  20030508  20070515  Texas Instruments Incorporated  Method and apparatus for channel estimation in a packet based transmission system having reduced complexity 
KR100994198B1 (en) *  20030714  20101112  인터디지탈 테크날러지 코포레이션  High performance wireless receiver with cluster multipath interference suppression circuit 
GB2404822B (en) *  20030807  20070711  Ipwireless Inc  Method and arrangement for noise variance and sir estimation 
US7388935B2 (en) *  20040615  20080617  Telefonktiebolaget Lm Ericsson (Publ)  Method of inverting nearly Toeplitz or block Toeplitz matrices 
US7443909B2 (en) *  20041221  20081028  Nokia Corporation  Weighted autocorrelation method for downlink CDMA LMMSE equalizers 
US7570689B2 (en) *  20050214  20090804  Interdigital Technology Corporation  Advanced receiver with sliding window block linear equalizer 
US8085733B2 (en) *  20050223  20111227  Interdigital Technology Corporation  Wireless communication method and apparatus for dynamically adapting packet transmission rates 
US8111742B2 (en) *  20050407  20120207  Nokia Corporation  Data processing method, equalizer, receiver, communication system, network element, and terminal using simplified channel matrix inversion 
CN101379721B (en) *  20060203  20120829  Nxp股份有限公司  A symbollevel adaptation method for equalizer coefficients, memory, equalizer and receiver for implementing the method 
US20070230546A1 (en) *  20060330  20071004  Shimon Moshavi  Equalizer with reduced complexity with application to long delay spread channels 
US20070230638A1 (en) *  20060330  20071004  Meir Griniasty  Method and apparatus to efficiently configure multiantenna equalizers 
US7986673B2 (en) *  20080530  20110726  Sharp Laboratories Of America, Inc.  Systems and methods for reducing feedback overhead in wireless networks using channel characteristics 
US20100011045A1 (en) *  20080711  20100114  James Vannucci  Device and method for applying signal weights to signals 
US20100011041A1 (en) *  20080711  20100114  James Vannucci  Device and method for determining signals 
US7733975B1 (en) *  20081231  20100608  Mediatek Inc.  Method for estimating phase error in MIMO OFDM communications system 
CN102271025B (en)  20110725  20140226  上海华为技术有限公司  Method and device for reconstructing data 
EP2984801A1 (en) *  20130409  20160217  Interdigital Patent Holdings, Inc.  Joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks 
Citations (98)
Publication number  Priority date  Publication date  Assignee  Title 

US6181714B2 (en) *  
US3666554A (en) *  19701210  19720530  Ibm  Manufacture of electrophotographic plate 
US5412620A (en) *  19930324  19950502  Micrilor, Inc.  Hydroacoustic communications system robust to multipath 
US5487069A (en) *  19921127  19960123  Commonwealth Scientific And Industrial Research Organization  Wireless LAN 
US5559757A (en) *  19911218  19960924  Catipovic; Josko A.  Spatial diversity processing for underwater acoustic telemetry 
US5612978A (en) *  19950530  19970318  Motorola, Inc.  Method and apparatus for realtime adaptive interference cancellation in dynamic environments 
US5796814A (en) *  19950322  19980818  U.S. Philips Corporation  Digital transmission system comprising a receiver with cascaded equalizers 
US5805638A (en) *  19951204  19980908  Lucent Technologies Inc.  Systems and methods of digital wireless communication using equalization 
US5818868A (en) *  19950414  19981006  Agence Spatiale Europeenne  Directsequence spreadspectrum receiver including code acquisition and detection using an autoadaptive threshold 
US5828658A (en) *  19911212  19981027  Arraycomm, Inc.  Spectrally efficient high capacity wireless communication systems with spatiotemporal processing 
US5930248A (en) *  19970304  19990727  Telefonaktiebolaget Lm Ericsson  Radio communication system selectively using multicast with variable offset time 
US5930369A (en) *  19950928  19990727  Nec Research Institute, Inc.  Secure spread spectrum watermarking for multimedia data 
US5970060A (en) *  19951006  19991019  Siemens Aktiengesellschaft  Method and system for radio transmission of digital signals 
US6047020A (en) *  19960319  20000404  Nokia Telecommunications Oy  Receiving method and a receiver 
US6097753A (en) *  19970923  20000801  Paradyne Corporation  System and method for simultaneous voice and data with adaptive gain based on short term audio energy 
US6128276A (en) *  19970224  20001003  Radix Wireless, Inc.  Stackedcarrier discrete multiple tone communication technology and combinations with code nulling, interference cancellation, retrodirective communication and adaptive antenna arrays 
US6137848A (en) *  19971103  20001024  At&T Corp.  Method and system for joint timing recovery and channel estimation for DMT modems 
US6141393A (en) *  19990303  20001031  Motorola, Inc.  Method and device for channel estimation, equalization, and interference suppression 
US6175588B1 (en) *  19971230  20010116  Motorola, Inc.  Communication device and method for interference suppression using adaptive equalization in a spread spectrum communication system 
US6181714B1 (en) *  19960902  20010130  Telia Ab  Multicarrier transmission systems 
US6188717B1 (en) *  19961119  20010213  Deutsche Forschungsanstalt Fur LuftUnd Raumfahrt E.V.  Method of simultaneous radio transmission of digital data between a plurality of subscriber stations and a base station 
US6219561B1 (en) *  19961018  20010417  Cisco Systems, Inc.  Wireless communication network using timevarying vector channel equalization for adaptive spatial equalization 
US6289005B1 (en) *  19970213  20010911  Nokia Telecommunications Oy  Method and apparatus for directional radio communication 
US6307868B1 (en) *  19950825  20011023  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) *  20000120  20011025  Hudson John E.  Equaliser for digital communications systems and method of equalisation 
US6359926B1 (en) *  19960902  20020319  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6359938B1 (en) *  19961031  20020319  Discovision Associates  Single chip VLSI implementation of a digital receiver employing orthogonal frequency division multiplexing 
US6359826B1 (en) *  20001120  20020319  Silicon Access Technology, Inc.  Method and a system for controlling a data sense amplifier for a memory chip 
US6363128B1 (en) *  19960902  20020326  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6366554B1 (en) *  19960902  20020402  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6377632B1 (en) *  20000124  20020423  Iospan Wireless, Inc.  Wireless communication system and method using stochastic spacetime/frequency division multiplexing 
US6392595B1 (en) *  19981104  20020521  Nokia Network Oy  Method and apparatus for directional radio communication 
US6396801B1 (en) *  19980317  20020528  Trw Inc.  Arbitrary waveform modem 
US6426983B1 (en) *  19980914  20020730  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) *  19960902  20020820  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6445342B1 (en) *  20000630  20020903  Motorola, Inc.  Method and device for multiuser frequencydomain channel estimation 
US6456649B1 (en) *  19960902  20020924  Stmicroelectronics N.V.  Multicarrier transmission systems 
US20020136158A1 (en) *  20000921  20020926  Motorola, Inc.  MMSE reception of DSCDMA with transmit diversity 
US20020145989A1 (en) *  20001109  20021010  Interdigital Technology Corporation  Single user detection 
US6466629B1 (en) *  19960902  20021015  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6505053B1 (en) *  19991105  20030107  At&T Corp.  Method for sinusoidal modeling and prediction of fast fading processes 
US20030026201A1 (en) *  20010618  20030206  Arnesen David M.  Slidingwindow transform with integrated windowing 
US6522489B1 (en) *  19991221  20030218  Texas Instruments Incorporated  Efficient analogtodigital converter for digital systems 
US20030035491A1 (en) *  20010511  20030220  Walton Jay R.  Method and apparatus for processing data in a multipleinput multipleoutput (MIMO) communication system utilizing channel state information 
US20030043925A1 (en) *  20010529  20030306  Tioga Technologies, Ltd.  Method and system for detecting, timing, and correcting impulse noise 
US20030043732A1 (en) *  20010517  20030306  Walton Jay R.  Method and apparatus for processing data for transmission in a multichannel communication system using selective channel transmission 
US20030043767A1 (en) *  20010206  20030306  Interdigital Technology Corporation  Single user detection user equipment 
US20030043887A1 (en) *  20010403  20030306  Hudson John E.  Communication system and methods of estimating channel impulse responses therein 
US20030048856A1 (en) *  20010517  20030313  Ketchum John W.  Method and apparatus for processing data for transmission in a multichannel communication system using selective channel inversion 
US6538986B2 (en) *  19960902  20030325  Stmicroelectronics N.V.  Data transmission system and method using nQAM constellation with a control channel superimposed on a user data channel 
US20030058952A1 (en) *  20010926  20030327  Webster Mark A.  Singlecarrier to multicarrier wireless architecture 
US20030063557A1 (en) *  20010713  20030403  Mitsubishi Denki Kabushiki Kaisha  Multiuser detection in an MCCDMA telecommunication system 
US20030072291A1 (en) *  20011004  20030417  Mitsubishi Denki Kabushiki Kaisha  Multiuser detection method for a receiver in a MCCDMA telecommunication system 
US6553012B1 (en) *  19970213  20030422  Nokia Telecommunications Oy  Method and apparatus for directional radio communication 
US20030076908A1 (en) *  20010824  20030424  Huang Howard C.  Signal detection by a receiver in a multiple antenna timedispersive system 
US20030076900A1 (en) *  20011024  20030424  Magee David Patrick  Decimated noise estimation and/or beamforming for wireless communications 
US20030081781A1 (en) *  19940331  20030501  Jensen James M.  Apparatus and methods for including codes in audio signals 
US20030086366A1 (en) *  20010306  20030508  Branlund Dale A.  Adaptive communications methods for multiple user packet radio wireless networks 
US20030099216A1 (en) *  20011128  20030529  Johan Nilsson  Method and apparatus for estimation of phase offset between communication channels 
US20030103584A1 (en) *  20011203  20030605  Bjerke Bjorn A.  Iterative detection and decoding for a MIMOOFDM system 
US20030108117A1 (en) *  20011207  20030612  Ketchum John W.  Timedomain transmit and receive processing with channel eigenmode decompositon for MIMO systems 
US20030112880A1 (en) *  20010517  20030619  Walton Jay R.  Method and apparatus for processing data for transmission in a multichannel communication system using selective channel inversion 
US20030125040A1 (en) *  20011106  20030703  Walton Jay R.  Multipleaccess multipleinput multipleoutput (MIMO) communication system 
US20030129984A1 (en) *  20020108  20030710  Dent Paul W.  Distributed wireless architecture using microcast 
US20030128658A1 (en) *  20020108  20030710  Walton Jay Rod  Resource allocation for MIMOOFDM communication systems 
US20030133403A1 (en) *  20020111  20030717  Mitsubishi Denki Kabushiki Kaisha  Predistortion method for telecommunication system and transmitter for mobile terminal of MCCDMA telecommunication system 
US20030147655A1 (en) *  19991102  20030807  Shattil Steve J.  Unified multicarrier framework for multipleaccess technologies 
US20030152021A1 (en) *  20010924  20030814  YiHsiu Wang  Postfft scaling to reduce multiple effects 
US6611855B1 (en) *  19990621  20030826  Telefonaktiebolaget Lm Ericsson (Publ)  Flexible and efficient channelizer architecture 
US20030165131A1 (en) *  20020304  20030904  The National University Of Singapore  CDMA system with frequency domain equalization 
US6618431B1 (en) *  19981231  20030909  Texas Instruments Incorporated  Processorbased method for the acquisition and despreading of spreadspectrum/CDMA signals 
US6674795B1 (en) *  20000404  20040106  Nortel Networks Limited  System, device and method for timedomain equalizer training using an autoregressive moving average model 
US6680969B1 (en) *  19990322  20040120  Ericsson, Inc.  Methods for estimating doppler spreads including autocorrelation function hypotheses and related systems and receivers 
US6684065B2 (en) *  19991220  20040127  Broadcom Corporation  Variable gain amplifier for low voltage applications 
US6693953B2 (en) *  19980930  20040217  Skyworks Solutions, Inc.  Adaptive wireless communication receiver 
US20040032354A1 (en) *  20020816  20040219  Yaron Knobel  Multiband ultrawide band communication method and system 
US20040032918A1 (en) *  20020816  20040219  Gadi Shor  Communication method, system and apparatus utilizing burst symbol cycles 
US6700919B1 (en) *  19991130  20040302  Texas Instruments Incorporated  Channel estimation for communication system using weighted estimates based on pilot data and information data 
US20040052236A1 (en) *  20020907  20040318  Samsung Electronics Co., Ltd.  Apparatus and method for joint detection receiving irrespective of orthogonal code length in mobile communication system 
US6724743B1 (en) *  19990504  20040420  France Telecom  Method of conjoint detection of a set of CDMA codes 
US6729929B1 (en) *  19990317  20040504  Cisco Systems, Inc.  Method and apparatus for controlling wireless networks 
US6731682B1 (en) *  20000407  20040504  Zenith Electronics Corporation  Multipath ghost eliminating equalizer with optimum noise enhancement 
US20040087275A1 (en) *  20020301  20040506  Sugar Gary L.  System and method for antenna diversity using joint maximal ratio combining 
US20040086027A1 (en) *  20021031  20040506  Shattil Steve J.  Orthogonal superposition coding for directsequence communications 
US20040086035A1 (en) *  20021031  20040506  Upton Eric L.  EHF equalizer implemented with MEMs tap weight controls 
US20040095907A1 (en) *  20000613  20040520  Agee Brian G.  Method and apparatus for optimization of wireless multipoint electromagnetic communication networks 
US20040100897A1 (en) *  19980212  20040527  Shattil Steve J.  Carrier interferometry coding with aplications to cellular and local area networks 
US20040101046A1 (en) *  20000825  20040527  Lin Yang  Terrestrial digital multimedia/television broadcasting system 
US6745352B2 (en) *  20001213  20040601  Ericsson Inc.  Methods of estimating error rates for communications received using iterative processing and related receivers 
US6744320B2 (en) *  20000215  20040601  Broadcom Corporation  Variable transconductane variable gain amplifier utilizing a degenerated differential pair 
US20040116077A1 (en) *  20020808  20040617  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) *  20020220  20040624  Roberts Richard D.  Method for making a clear channel assessment in a wireless network 
US20040120274A1 (en) *  20020425  20040624  Frederik Petre  CDMA transceiver techniques for wireless communications 
US20040136399A1 (en) *  20020220  20040715  Roberts Richard D.  Method for operating multiple overlapping wireless networks 
US20040141548A1 (en) *  20000719  20040722  Shattil Steve J.  Software adaptable high performance multicarrier transmission protocol 
US20040142663A1 (en) *  20020220  20040722  Roberts Richard D.  Method for operating multiple overlapping wireless networks 
US20040146024A1 (en) *  20030128  20040729  Navini Networks, Inc.  Method and system for interference reduction in a wireless communication network using a joint detector 
US7110465B2 (en) *  20001127  20060919  Fujitsu Limited  Noise canceling method and apparatus 
Family Cites Families (41)
Publication number  Priority date  Publication date  Assignee  Title 

GB8909051D0 (en)  19890421  20010411  Secr Defence  A high data rate multiplexed multichannel high frequency broadcast system 
US6137843A (en)  19950224  20001024  Ericsson Inc.  Methods and apparatus for canceling adjacent channel signals in digital communications systems 
CA2176401C (en)  19940217  20030708  John H. Cafarella  A highdatarate wireless localarea network 
US5577066A (en)  19940513  19961119  Stanford Telecommunications, Inc.  Chargecoupleddevice based datainvoice modem 
DE69725995T2 (en)  19960829  20041111  Cisco Technology, Inc., San Jose  Spatiotemporal signal processing for transmission systems 
DE69723563D1 (en)  19960902  20030821  St Microelectronics Nv  Improvements in or relating to multicarrier transmission systems 
WO1998010548A3 (en)  19960902  19980604  Telia Ab  Improvements in, or relating to, multicarrier transmission systems 
JP2000509238A (en)  19970213  20000718  ノキア テレコミュニカシオンス オサケ ユキチュア  Directional radio communication method and apparatus 
US6321082B1 (en)  19970213  20011120  Nokia Telecommunications Oy  Method and apparatus for directional radio communication 
US6584144B2 (en)  19970224  20030624  At&T Wireless Services, Inc.  Vertical adaptive antenna array for a discrete multitone spread spectrum communications system 
US6359923B1 (en)  19971218  20020319  At&T Wireless Services, Inc.  Highly bandwidth efficient communications 
US6686879B2 (en)  19980212  20040203  Genghiscomm, Llc  Method and apparatus for transmitting and receiving signals having a carrier interferometry architecture 
EP1125398B1 (en)  19981030  20081022  Broadcom Corporation  Cable modem system 
US6671334B1 (en)  19981103  20031230  Tektronix, Inc.  Measurement receiver demodulator 
US6852057B2 (en) *  19991217  20050208  Teodoro R. Borbolla Gonzalez  Selfcontained continuouslyvariable transmission with mechanical integral torque converter having automatic drive control 
DE19961777A1 (en)  19991221  20010712  Rudolf Bannasch  Methods and apparatus for transmitting information 
JP3872953B2 (en)  19991227  20070124  株式会社東芝  Wireless communication device using an adaptive antenna 
US20030008684A1 (en)  20000124  20030109  Ferris Gavin Robert  Digital wireless basestation 
GB0001585D0 (en)  20000124  20000315  Radioscape Ltd  Method of designing,modelling or fabricating a communications baseband stack 
US6658619B1 (en)  20001006  20031202  Ericsson Inc.  Systems and methods for implementing hierarchical acknowledgement bitmaps in an ARQ protocol 
FR2818057B1 (en)  20001213  20060707  Mitsubishi Electric Inf Tech  Method and multiuser detection device 
US7433683B2 (en)  20001228  20081007  Northstar Acquisitions, Llc  System for fast macrodiversity switching in mobile wireless networks 
US7218666B2 (en)  20001229  20070515  Motorola, Inc.  Method and system for transmission and frequency domain equalization for wideband CDMA system 
EP1410513A4 (en)  20001229  20050629  Infineon Technologies Ag  Channel codec processor configurable for multiple wireless communications standards 
US7139237B2 (en)  20001229  20061121  Motorola, Inc.  Method and system for multirate multiuser modulation 
US6807305B2 (en) *  20010112  20041019  National Instruments Corporation  System and method for image pattern matching using a unified signal transform 
US6771706B2 (en)  20010323  20040803  Qualcomm Incorporated  Method and apparatus for utilizing channel state information in a wireless communication system 
US7177369B2 (en)  20010427  20070213  Vivato, Inc.  Multipath communication methods and apparatuses 
US6662024B2 (en)  20010516  20031209  Qualcomm Incorporated  Method and apparatus for allocating downlink resources in a multipleinput multipleoutput (MIMO) communication system 
FR2825860B1 (en)  20010606  20050318  St Microelectronics Sa  data transmission in masterslave division multiplexing orthogonal frequencies 
WO2002101939A3 (en)  20010608  20030220  Broadcom Corp  Robust burst detection and acquisition system and method 
US6609414B2 (en) *  20010719  20030826  Mocon, Inc.  Apparatus for conducting leakage tests on sealed packages 
US6963727B2 (en)  20010726  20051108  Time Domain Corporation  Directpathsignal detection apparatus and associated methods 
US6595472B1 (en) *  20011228  20030722  Preformed Line Products Company  Cable clamp 
US7197084B2 (en) *  20020327  20070327  Qualcomm Incorporated  Precoding for a multipath channel in a MIMO system 
EP1359700A1 (en)  20020502  20031105  Mitsubishi Electric Information Technology Centre Europe B.V.  MCCDMA receiver with an equalisation per subcarrier 
US7305050B2 (en)  20020513  20071204  Marvell Dspc Ltd.  Method and apparatus for processing signals received from a channel having a variable channel length 
DE10222115B4 (en)  20020517  20180215  Advanced Micro Devices, Inc.  Shared circuits for functional units of a wireless receiver 
US6757321B2 (en)  20020522  20040629  Interdigital Technology Corporation  Segmentwise channel equalization based data estimation 
US7099270B2 (en)  20020606  20060829  Texas Instruments Incorporated  Multipath equalization for orthogonal frequency division multiplexing communication system 
US7613248B2 (en)  20020624  20091103  Qualcomm Incorporated  Signal processing with channel eigenmode decomposition and channel inversion for MIMO systems 
Patent Citations (100)
Publication number  Priority date  Publication date  Assignee  Title 

US6181714B2 (en) *  
US3666554A (en) *  19701210  19720530  Ibm  Manufacture of electrophotographic plate 
US5828658A (en) *  19911212  19981027  Arraycomm, Inc.  Spectrally efficient high capacity wireless communication systems with spatiotemporal processing 
US5559757A (en) *  19911218  19960924  Catipovic; Josko A.  Spatial diversity processing for underwater acoustic telemetry 
US5487069A (en) *  19921127  19960123  Commonwealth Scientific And Industrial Research Organization  Wireless LAN 
US5412620A (en) *  19930324  19950502  Micrilor, Inc.  Hydroacoustic communications system robust to multipath 
US20030081781A1 (en) *  19940331  20030501  Jensen James M.  Apparatus and methods for including codes in audio signals 
US5796814A (en) *  19950322  19980818  U.S. Philips Corporation  Digital transmission system comprising a receiver with cascaded equalizers 
US5818868A (en) *  19950414  19981006  Agence Spatiale Europeenne  Directsequence spreadspectrum receiver including code acquisition and detection using an autoadaptive threshold 
US5612978A (en) *  19950530  19970318  Motorola, Inc.  Method and apparatus for realtime adaptive interference cancellation in dynamic environments 
US6307868B1 (en) *  19950825  20011023  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) *  19950928  19990727  Nec Research Institute, Inc.  Secure spread spectrum watermarking for multimedia data 
US5970060A (en) *  19951006  19991019  Siemens Aktiengesellschaft  Method and system for radio transmission of digital signals 
US5805638A (en) *  19951204  19980908  Lucent Technologies Inc.  Systems and methods of digital wireless communication using equalization 
US6047020A (en) *  19960319  20000404  Nokia Telecommunications Oy  Receiving method and a receiver 
US6538986B2 (en) *  19960902  20030325  Stmicroelectronics N.V.  Data transmission system and method using nQAM constellation with a control channel superimposed on a user data channel 
US6456649B1 (en) *  19960902  20020924  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6438174B1 (en) *  19960902  20020820  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6366554B1 (en) *  19960902  20020402  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6181714B1 (en) *  19960902  20010130  Telia Ab  Multicarrier transmission systems 
US6466629B1 (en) *  19960902  20021015  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6363128B1 (en) *  19960902  20020326  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6359926B1 (en) *  19960902  20020319  Stmicroelectronics N.V.  Multicarrier transmission systems 
US6219561B1 (en) *  19961018  20010417  Cisco Systems, Inc.  Wireless communication network using timevarying vector channel equalization for adaptive spatial equalization 
US6359938B1 (en) *  19961031  20020319  Discovision Associates  Single chip VLSI implementation of a digital receiver employing orthogonal frequency division multiplexing 
US6188717B1 (en) *  19961119  20010213  Deutsche Forschungsanstalt Fur LuftUnd Raumfahrt E.V.  Method of simultaneous radio transmission of digital data between a plurality of subscriber stations and a base station 
US6289005B1 (en) *  19970213  20010911  Nokia Telecommunications Oy  Method and apparatus for directional radio communication 
US6553012B1 (en) *  19970213  20030422  Nokia Telecommunications Oy  Method and apparatus for directional radio communication 
US20030123384A1 (en) *  19970224  20030703  Agee Brian G.  Stackedcarrier discrete multiple tone communication technology and combinations with code nulling, interference cancellation, retrodirective communication and adaptive antenna arrays 
US6512737B1 (en) *  19970224  20030128  Beamreach Networks, Inc.  Stacked carrier discrete multiple tone communication system 
US6128276A (en) *  19970224  20001003  Radix Wireless, Inc.  Stackedcarrier discrete multiple tone communication technology and combinations with code nulling, interference cancellation, retrodirective communication and adaptive antenna arrays 
US5930248A (en) *  19970304  19990727  Telefonaktiebolaget Lm Ericsson  Radio communication system selectively using multicast with variable offset time 
US6097753A (en) *  19970923  20000801  Paradyne Corporation  System and method for simultaneous voice and data with adaptive gain based on short term audio energy 
US6137848A (en) *  19971103  20001024  At&T Corp.  Method and system for joint timing recovery and channel estimation for DMT modems 
US6175588B1 (en) *  19971230  20010116  Motorola, Inc.  Communication device and method for interference suppression using adaptive equalization in a spread spectrum communication system 
US20040100897A1 (en) *  19980212  20040527  Shattil Steve J.  Carrier interferometry coding with aplications to cellular and local area networks 
US6396801B1 (en) *  19980317  20020528  Trw Inc.  Arbitrary waveform modem 
US6426983B1 (en) *  19980914  20020730  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) *  19980930  20040217  Skyworks Solutions, Inc.  Adaptive wireless communication receiver 
US6392595B1 (en) *  19981104  20020521  Nokia Network Oy  Method and apparatus for directional radio communication 
US6618431B1 (en) *  19981231  20030909  Texas Instruments Incorporated  Processorbased method for the acquisition and despreading of spreadspectrum/CDMA signals 
US6141393A (en) *  19990303  20001031  Motorola, Inc.  Method and device for channel estimation, equalization, and interference suppression 
US6729929B1 (en) *  19990317  20040504  Cisco Systems, Inc.  Method and apparatus for controlling wireless networks 
US6680969B1 (en) *  19990322  20040120  Ericsson, Inc.  Methods for estimating doppler spreads including autocorrelation function hypotheses and related systems and receivers 
US6724743B1 (en) *  19990504  20040420  France Telecom  Method of conjoint detection of a set of CDMA codes 
US6611855B1 (en) *  19990621  20030826  Telefonaktiebolaget Lm Ericsson (Publ)  Flexible and efficient channelizer architecture 
US20030147655A1 (en) *  19991102  20030807  Shattil Steve J.  Unified multicarrier framework for multipleaccess technologies 
US6505053B1 (en) *  19991105  20030107  At&T Corp.  Method for sinusoidal modeling and prediction of fast fading processes 
US6700919B1 (en) *  19991130  20040302  Texas Instruments Incorporated  Channel estimation for communication system using weighted estimates based on pilot data and information data 
US6684065B2 (en) *  19991220  20040127  Broadcom Corporation  Variable gain amplifier for low voltage applications 
US6522489B1 (en) *  19991221  20030218  Texas Instruments Incorporated  Efficient analogtodigital converter for digital systems 
US20010033614A1 (en) *  20000120  20011025  Hudson John E.  Equaliser for digital communications systems and method of equalisation 
US6377632B1 (en) *  20000124  20020423  Iospan Wireless, Inc.  Wireless communication system and method using stochastic spacetime/frequency division multiplexing 
US6744320B2 (en) *  20000215  20040601  Broadcom Corporation  Variable transconductane variable gain amplifier utilizing a degenerated differential pair 
US6674795B1 (en) *  20000404  20040106  Nortel Networks Limited  System, device and method for timedomain equalizer training using an autoregressive moving average model 
US6731682B1 (en) *  20000407  20040504  Zenith Electronics Corporation  Multipath ghost eliminating equalizer with optimum noise enhancement 
US20040095907A1 (en) *  20000613  20040520  Agee Brian G.  Method and apparatus for optimization of wireless multipoint electromagnetic communication networks 
US6445342B1 (en) *  20000630  20020903  Motorola, Inc.  Method and device for multiuser frequencydomain channel estimation 
US20040141548A1 (en) *  20000719  20040722  Shattil Steve J.  Software adaptable high performance multicarrier transmission protocol 
US20040101046A1 (en) *  20000825  20040527  Lin Yang  Terrestrial digital multimedia/television broadcasting system 
US20020136158A1 (en) *  20000921  20020926  Motorola, Inc.  MMSE reception of DSCDMA with transmit diversity 
US20020145989A1 (en) *  20001109  20021010  Interdigital Technology Corporation  Single user detection 
US6359826B1 (en) *  20001120  20020319  Silicon Access Technology, Inc.  Method and a system for controlling a data sense amplifier for a memory chip 
US7110465B2 (en) *  20001127  20060919  Fujitsu Limited  Noise canceling method and apparatus 
US6745352B2 (en) *  20001213  20040601  Ericsson Inc.  Methods of estimating error rates for communications received using iterative processing and related receivers 
US20030043767A1 (en) *  20010206  20030306  Interdigital Technology Corporation  Single user detection user equipment 
US20030086366A1 (en) *  20010306  20030508  Branlund Dale A.  Adaptive communications methods for multiple user packet radio wireless networks 
US20030043887A1 (en) *  20010403  20030306  Hudson John E.  Communication system and methods of estimating channel impulse responses therein 
US20030035491A1 (en) *  20010511  20030220  Walton Jay R.  Method and apparatus for processing data in a multipleinput multipleoutput (MIMO) communication system utilizing channel state information 
US20030043732A1 (en) *  20010517  20030306  Walton Jay R.  Method and apparatus for processing data for transmission in a multichannel communication system using selective channel transmission 
US20030112880A1 (en) *  20010517  20030619  Walton Jay R.  Method and apparatus for processing data for transmission in a multichannel communication system using selective channel inversion 
US20030048856A1 (en) *  20010517  20030313  Ketchum John W.  Method and apparatus for processing data for transmission in a multichannel communication system using selective channel inversion 
US20030043925A1 (en) *  20010529  20030306  Tioga Technologies, Ltd.  Method and system for detecting, timing, and correcting impulse noise 
US20030026201A1 (en) *  20010618  20030206  Arnesen David M.  Slidingwindow transform with integrated windowing 
US20030063557A1 (en) *  20010713  20030403  Mitsubishi Denki Kabushiki Kaisha  Multiuser detection in an MCCDMA telecommunication system 
US20030076908A1 (en) *  20010824  20030424  Huang Howard C.  Signal detection by a receiver in a multiple antenna timedispersive system 
US20030152021A1 (en) *  20010924  20030814  YiHsiu Wang  Postfft scaling to reduce multiple effects 
US20030058952A1 (en) *  20010926  20030327  Webster Mark A.  Singlecarrier to multicarrier wireless architecture 
US20030072291A1 (en) *  20011004  20030417  Mitsubishi Denki Kabushiki Kaisha  Multiuser detection method for a receiver in a MCCDMA telecommunication system 
US20030076900A1 (en) *  20011024  20030424  Magee David Patrick  Decimated noise estimation and/or beamforming for wireless communications 
US20030125040A1 (en) *  20011106  20030703  Walton Jay R.  Multipleaccess multipleinput multipleoutput (MIMO) communication system 
US20030099216A1 (en) *  20011128  20030529  Johan Nilsson  Method and apparatus for estimation of phase offset between communication channels 
US20030103584A1 (en) *  20011203  20030605  Bjerke Bjorn A.  Iterative detection and decoding for a MIMOOFDM system 
US20030108117A1 (en) *  20011207  20030612  Ketchum John W.  Timedomain transmit and receive processing with channel eigenmode decompositon for MIMO systems 
US20030128658A1 (en) *  20020108  20030710  Walton Jay Rod  Resource allocation for MIMOOFDM communication systems 
US20030129984A1 (en) *  20020108  20030710  Dent Paul W.  Distributed wireless architecture using microcast 
US20030133403A1 (en) *  20020111  20030717  Mitsubishi Denki Kabushiki Kaisha  Predistortion method for telecommunication system and transmitter for mobile terminal of MCCDMA telecommunication system 
US20040120424A1 (en) *  20020220  20040624  Roberts Richard D.  Method for making a clear channel assessment in a wireless network 
US20040136399A1 (en) *  20020220  20040715  Roberts Richard D.  Method for operating multiple overlapping wireless networks 
US20040142663A1 (en) *  20020220  20040722  Roberts Richard D.  Method for operating multiple overlapping wireless networks 
US20040087275A1 (en) *  20020301  20040506  Sugar Gary L.  System and method for antenna diversity using joint maximal ratio combining 
US20030165131A1 (en) *  20020304  20030904  The National University Of Singapore  CDMA system with frequency domain equalization 
US20040120274A1 (en) *  20020425  20040624  Frederik Petre  CDMA transceiver techniques for wireless communications 
US20040116077A1 (en) *  20020808  20040617  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) *  20020816  20040219  Yaron Knobel  Multiband ultrawide band communication method and system 
US20040032918A1 (en) *  20020816  20040219  Gadi Shor  Communication method, system and apparatus utilizing burst symbol cycles 
US20040052236A1 (en) *  20020907  20040318  Samsung Electronics Co., Ltd.  Apparatus and method for joint detection receiving irrespective of orthogonal code length in mobile communication system 
US20040086027A1 (en) *  20021031  20040506  Shattil Steve J.  Orthogonal superposition coding for directsequence communications 
US20040086035A1 (en) *  20021031  20040506  Upton Eric L.  EHF equalizer implemented with MEMs tap weight controls 
US20040146024A1 (en) *  20030128  20040729  Navini Networks, Inc.  Method and system for interference reduction in a wireless communication network using a joint detector 
Cited By (9)
Publication number  Priority date  Publication date  Assignee  Title 

US8526552B1 (en) *  20090825  20130903  Marvell International Ltd.  Noise estimation in communication receivers 
US8750440B1 (en) *  20090825  20140610  Marvell International Ltd  Noise estimation in communication receivers 
US8787473B2 (en) *  20091110  20140722  Zte Corporation  Method and apparatus for noise estimation in orthogonal frequency division multiplexing (OFDM) system 
US20120219050A1 (en) *  20091110  20120830  Zte Corporation  Method and apparatus for noise estimation in orthogonal frequency division multiplexing (ofdm) system 
US9077422B1 (en)  20100728  20150707  Marvell International Ltd  Validation and stabilization of noise matrices 
US8483641B1 (en)  20100728  20130709  Marvell International Ltd.  Validation and stabilization of noise matrices 
US20120069914A1 (en) *  20100922  20120322  Qualcomm Incorporated  Efficient compressed sensing channel estimation for singlecarrier communication systems 
US8942321B2 (en) *  20100922  20150127  Qualcomm Incorporated  Efficient compressed sensing channel estimation for singlecarrier communication systems 
US20130170842A1 (en) *  20120104  20130704  Toshiaki KoikeAkino  Method and System for Equalization and Decoding Received Signals Based on HighOrder Statistics in Optical Communication Networks 
Also Published As
Publication number  Publication date  Type 

US20060034398A1 (en)  20060216  application 
US7042967B2 (en)  20060509  grant 
US7609794B2 (en)  20091027  grant 
US20050025267A1 (en)  20050203  application 
US20080298523A1 (en)  20081204  application 
Similar Documents
Publication  Publication Date  Title 

US20050259757A1 (en)  Frequency domain equalization in communications systems with scrambling  
Vollmer et al.  Comparative study of jointdetection techniques for TDCDMA based mobile radio systems  
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  
US20050111528A1 (en)  Method and apparatus for DSCDMA interference suppression using codespecific combining  
US20030053524A1 (en)  Interference cancellation in a CDMA receiving system  
US7035354B2 (en)  CDMA multiuser detection with a real symbol constellation  
US20040223538A1 (en)  Multi user detection using equalization and successive interference cancellation  
US20040223480A1 (en)  Kalman filter based method and apparatus for linear equalization of CDMA downlink channels  
US20040013171A1 (en)  Scaling using gain factors for use in data detection for wireless code division multiple access communication systems  
US20020006122A1 (en)  Channel estimation for time division duplex communication systems  
WO1996011534A2 (en)  Interference cancellation method, and receiver  
US20030125090A1 (en)  Efficient multiple input multiple output system for multipath fading channels  
US20080130674A1 (en)  Method and System For MultiUser Channel Estimation in DsCdma Systems  
US7869546B2 (en)  Multicode transmission using Walsh Hadamard transform  
US20030091100A1 (en)  Method and device for radio signal reception  
US6625203B2 (en)  Fast joint detection  
US20020145989A1 (en)  Single user detection  
US20040136316A1 (en)  Efficient joint detection  
Karimi et al.  A novel and efficient solution to blockbased jointdetection using approximate Cholesky factorization  
Nion et al.  A block component modelbased blind DSCDMA receiver  
US20040228392A1 (en)  Fouriertransform based linear equalization for MIMO CDMA downlink  
US20080063033A1 (en)  Method for Covariance Matrix Update  
CN1604512A (en)  United detecting method and apparatus 