Method and Apparatus for Detecting Data in Wireless Communication Networks

Abstract

An apparatus including a processor configured to receive a digital communication signal having a plurality of transmitted layers. The processor is configured to determine an estimated channel matrix based on the digital communication signal, determine a first estimated transmitted symbol vector and a mean square error matrix based on a linear analysis of the received digital communication signal. A first set of bit LLR are determined based on a LMMSE type detector and a second set of bit LLR are determined based on a novel simplified tree search process. The two sets of bit LLR are then combined and used to detect the data in the received communication signal. The simplified tree search process uses a specially formed channel shortening process to determine a set of shortened channel correlation matrices that allow the second set of bit LLR to be determined using an alternative marginalized tree search process.

Claims

1. An apparatus comprising: a memory comprising computer program instructions; and a processor configured to execute the computer program instructions to cause the apparatus to: receive a digital communication signal, the digital communication signal comprising a plurality of transmitted layers; determine an estimated channel matrix based on the digital communication signal; determine a first estimated transmitted symbol vector and a mean square error matrix based on a linear analysis of the received digital communication signal; determine a first set of bit log likelihood ratios by performing linear minimum mean square error detection based on the first estimated transmitted symbol vector; determine a second set of bit log likelihood ratios by performing a tree search for one or more layers in the plurality of transmitted layers in the digital communication signal based on the first estimated transmitted symbol vector and the mean square error matrix; determine a refined set of bit log likelihood ratios based on the first set of bit log likelihood ratios and the second set of bit log likelihood ratios; and determine a second estimated transmitted symbol vector based on the refined set of bit log likelihood ratios, wherein the tree search comprises: select a set of parent layers from the plurality of transmitted layers, wherein a number of layers in the set of parent layers is less than or equal to a number of layers in the plurality of transmitted layers; determine a shortened channel correlation matrix for each layer in the set of parent layers based on the mean square error matrix; determine an optimal shortened channel matrix based on each determined shortened channel correlation matrix and the estimated channel matrix; and select a single child node for each parent node in the tree search based on evaluation of a branch metric.

2. The apparatus of claim 1, wherein the processor being configured to execute computer program instructions to cause the apparatus to determine the first set of bit log likelihood ratios is based on an output of a detector comprising one or more of: a linear minimum mean square error detector, successive interference cancellation, and parallel interference cancellation.

3. The apparatus of claim 1, wherein the processor is further configured to execute the computer program instructions to cause the apparatus to evaluate the branch metric based on the shortened channel correlation matrix and a single parent node.

4. The apparatus of claim 1, wherein the processor is further configured to execute the computer program instructions to cause the apparatus to select the single child node as the node having a maximum value of the branch metric.

5. The apparatus of claim 1, wherein the processor is further configured to execute the computer program instructions to cause the apparatus to perform the tree search for each parent layer in the set of parent layers in parallel.

6. The apparatus of claim 1, wherein the processor is further configured to execute the computer program instructions to cause the apparatus to: select the child node having a peak value of the branch metric when the corresponding element of the shortened channel correlation matrix is positive; and select the child node based on a quadrant of a residual value when the corresponding element of the shortened channel correlation matrix is negative.

7. The apparatus of claim 1, wherein the number of parent layers is smaller than the number of transmitted layers, and wherein the processor is further configured to execute the computer program instructions to cause the apparatus to select the parent layers in the set of parent layers based on an amount of energy or a channel capacity of the plurality of transmitted layers.

8. The apparatus of claim 1, wherein the processor being configured to determine the refined set of the bit log likelihood ratios comprises the processor further configured to execute computer program instructions to further cause the apparatus to: determine a sign of the bit log likelihood ratio corresponding to a missing bit hypothesis when the second set of bit log likelihood ratios is missing a bit hypothesis; and determine the refined set of bit log likelihood ratios based on the sign and the first set of log likelihood ratios.

9. The apparatus of claim 1, wherein the processor is further configured to execute the computer program instructions to cause the apparatus to determine the shortened channel correlation matrix based on a mismatched received signal probability density function.

10. The apparatus of claim 1, wherein the processor is further configured to execute the computer program instructions to cause the apparatus to determine the shortened channel correlation matrix based on a factorization matrix, wherein the factorization matrix comprises non-zero elements on a main diagonal of the factorization matrix, non-zero elements in a last column of the factorization matrix, and the remaining elements of the factorization matrix have a zero value.

11. The apparatus of claim 1, wherein the processor is further configured to execute the computer program instructions to cause the apparatus to use a permutation matrix to switch a layer in the set of parent layers to be a parent layer for the tree search, wherein elements of the permutation matrix have a value of zero or one, pre or post multiplication of the permutation matrix by a transpose of the permutation matrix yields an identity matrix, and the permutation matrix is configured to switch a layer in the set of parent layers to be the parent layer and to leave the remaining layers unchanged.

12. The apparatus of claim 1, wherein the processor being configured to select the set of parent layers from the plurality of transmitted layers comprises the processor being configured to execute computer program instructions to further cause the apparatus to select the set of parent layers based on an amount of energy or a channel capacity of each layer in the plurality of transmitted layers.

13. The apparatus of claim 1, wherein the processor is further configured to execute the computer program instructions to cause the apparatus to determine the shortened channel correlation matrix for a second layer in the set of parent layers based on computation results obtained from determining the shortened channel correlation matrix for a first layer in the set of parent layers.

14. A method for detecting data in a wireless communication system, the method comprising: receiving a digital communication signal, the digital communication signal comprising a plurality of transmitted layers; determining an estimated channel matrix based on the digital communication signal; determining a first estimated transmitted symbol vector and a mean square error matrix based on a linear analysis of the received digital communication signal; determining a first set of bit log likelihood ratios by performing linear minimum mean square error detection based on the first estimated transmitted symbol vector; determining a second set of bit log likelihood ratios by performing a tree search for one or more layers in the plurality of transmitted layers in the digital communication signal, based on the first estimated transmitted symbol vector and the mean square error matrix; determining a refined set of bit log likelihood ratios based on the first set of bit log likelihood ratios and the second set of bit log likelihood ratios; and determining a second estimated transmitted symbol vector based on the refined set of bit log likelihood ratios, wherein the tree search comprises: selecting a set of parent layers from the plurality of transmitted layers, wherein a number of layers in the set of parent layers is less than or equal to a number of layers in the plurality of transmitted layers; determining a shortened channel correlation matrix for each layer in the set of parent layers, based on the mean square error matrix; determining an optimal shortened channel matrix, based on each determined shortened channel correlation matrix and the estimated channel matrix; and selecting a single child node for each parent node in the tree search based on evaluation of a branch metric.

15. A computer program for detecting data in a wireless communication system, the computer program comprising a non-transitory computer program storage medium comprising instructions that when executed by a processor cause the processor to: receive a digital communication signal, the digital communication signal comprising a plurality of transmitted layers; determine an estimated channel matrix based on the digital communication signal; determine a first estimated transmitted symbol vector and a mean square error matrix based on a linear analysis of the received digital communication signal; determine a first set of bit log likelihood ratios by performing linear minimum mean square error detection based on the first estimated transmitted symbol vector; determine a second set of bit log likelihood ratios by performing a tree search for one or more layers in the plurality of transmitted layers in the digital communication signal, based on the first estimated transmitted symbol vector and the mean square error matrix; determine a refined set of bit log likelihood ratios based on the first set of bit log likelihood ratios and the second set of bit log likelihood ratios; and determine a second estimated transmitted symbol vector based on the refined set of bit log likelihood ratios, wherein the tree search comprises instructions that when executed by a processor cause the processor to: select a set of parent layers from the plurality of transmitted layers, wherein a number of layers in the set of parent layers is less than or equal to a number of layers in the plurality of transmitted layers; determine a shortened channel correlation matrix for each layer in the set of parent layers, based on the mean square error matrix; determine an optimal shortened channel matrix, based on each determined shortened channel correlation matrix and the estimated channel matrix; and select a single child node for each parent node in the tree search based on evaluation of a branch metric.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In the following detailed portion of the present disclosure, embodiment of the disclosure will be explained in more detail with reference to the example embodiments shown in the drawings, in which:

[0027] FIG. 1 illustrates a tree diagram depicting a maximum likelihood type detector incorporating aspects of the disclosed embodiments;

[0028] FIG. 2 illustrates a tree diagram depicting a reduced complexity detector incorporating aspects of the disclosed embodiments;

[0029] FIG. 3 illustrates a tree diagram for an alternative marginalized tree search incorporating aspects of the disclosed embodiments;

[0030] FIG. 4 illustrates a constellation mapping diagram incorporating aspects of the present disclosure;

[0031] FIG. 5 illustrates a block diagram of an alternative marginalized tree search (AMTS) detector incorporating aspects of the disclosed embodiments;

[0032] FIG. 6 illustrates a flow chart of an AMTS process incorporating aspects of the disclosed embodiments;

[0033] FIG. 7 illustrates a graph of normalized throughput incorporating aspects of the present disclosure;

[0034] FIG. 8 illustrates a block diagram of a mobile device incorporating aspects of the disclosed embodiments.

DETAILED DESCRIPTION OF THE DISCLOSED EMBODIMENTS

[0035] In wireless receivers such as those used in UE employed as mobile devices, it is desirable to use detectors with low or reduced complexity to provide accurate symbol detection in lower cost UE. This goal can be achieved by using a technique employing a device according to an embodiment of the present disclosure which is configured to receive a digital communication signal that includes a plurality of layers. A channel matrix is estimated based on the digital communication signal and a first estimated transmitted symbol vector and mean square error vector is determined based on a linear analysis of the received digital communication signal. A first set of bit log likelihood ratios is determined using a linear minimum mean square error type detector based on the first estimated symbol vector and the mean square error matrix, and a second set of bit log likelihood ratios is determined by performing a tree search for one or more of the transmitted layers based on the first estimated symbol vector and the mean square error matrix. A refined set of bit log likelihood ratios is determined based on both the first and second bit log likelihood ratios. A final estimated transmitted symbol vector is determined based on the refined set of bit log likelihood ratios.

[0036] A second set of bit log likelihood ratios is determined using a tree search that begins by selecting a set of parent layers from the set of transmitted layers. The set of selected parent layers may include all of the transmitted layers or a subset of the transmitted layers. A special shortened channel correlation matrix is determined for each of the selected parent layers and an optimal shortened channel matrix is determined from each shortened channel correlation matrix. A tree search is performed for each layer in the set of parent layers where each tree search is performed by selecting a single child node for each parent node based on evaluation of a branch metric and the second set of bit log likelihood ratios is determined based on the tree search.

[0037] As an aid to understanding the reduced complexity detector according to an embodiment described above, begin with a conventional model for the received signal in a wireless MIMO communication system as shown in Equation 1:

Y=hx+W.  Eq. 1

The model of Equation 1 represents a MIMO system where the number of receive antennas is represented by an integer M and the number of transmit antennas is represented by an integer N. The transmitted signal X is a N×1 column vector, X (x.sub.1,x.sub.2, . . . x.sub.N).sup.T, where x.sub.i(1≦i≦N) represents the symbol transmitted on the i.sup.th antenna. The received signal Y is an M×1 column vector: Y=(y.sub.1,y.sub.2, . . . ,y.sub.M).sup.T, where y.sub.i (1≦i≦M) represents the symbol received on the i.sup.th antenna. The MIMO channel matrix H is an M×N matrix made up of N column vectors: H=(h.sub.1,h.sub.2, . . . ,h.sub.N), where h.sub.i(1≦i≦N) represents the i.sup.th column vector in the channel matrix H. Thermal noise is represented in the system model illustrated in Equation 1 as a column vector W=(w.sub.1,w.sub.2, . . . w.sub.N).sup.T with dimension M×1.

[0038] The bit log likelihood ratio (bit LLR) may be calculated as shown in Equation 2:

[00001]$\begin{array}{cc}L\left(b_k\right)=\log \left(\frac{\underset{x\in {}_{b_k=1}}{.Math.}.Math.p\left(X|Y,H\right)}{\underset{x\in {}_{b_k=0}}{.Math.}.Math.p\left(s|Y,H\right)}\right)=\log \left(\frac{\underset{x\in {}_{b_k=1}}{.Math.}.Math.p\left(Y|X,H\right).Math.p\left(X\right)}{\underset{x\in {}_{b_k=0}}{.Math.}.Math.p\left(Y|s,H\right).Math.p\left(X\right)}\right).Math.\underset{\mathrm{Jacobian}.Math..Math.\mathrm{approximation}}{\approx }.Math.\underset{\begin{array}{c}\\ x\in {}_{b_k=1}\end{array}}{\max }.Math.\left\{p\left(Y|X,H\right).Math.p\left(X\right)\right\}-\underset{\begin{array}{c}\\ x\in {}_{b_k=0}\end{array}}{\max }.Math.\left\{p\left(Y|X,H\right).Math.p\left(X\right)\right\},\underset{\mathrm{Uniform}.Math..Math.\mathrm{distribution}.Math..Math.\mathrm{of}.Math..Math.X}{\approx }.Math.\underset{\begin{array}{c}\\ x\in {}_{b_k=1}\end{array}}{\max }.Math.\left\{p\left(Y|X,H\right)\right\}-\underset{\begin{array}{c}\\ x\in {}_{b_k=0}\end{array}}{\max }.Math.\left\{p\left(Y|X,H\right)\right\}& \mathrm{Eq}..Math.2\end{array}$

where S.sub.b.sub.k.sub.-1 is the set of all possible transmitted symbol vectors with the k.sup.th bit b.sub.k=1, and S.sub.b.sub.k.sub.-0 is the set of all possible transmitted symbol vectors with the k.sup.th bit b.sub.k=0. The posterior probability of the transmitted signal Xafter observing both the channel H and the received signal Y is represented as: p(X|Y, H) and the a priori probability with channel H and transmitted symbol vector X is represented as: p(Y|X, H). The a priori probability of transmitted signal X, p(X), is assumed to be equally distributed. A Jacobian approximation may be used to reduce the complexity by replacing the logarithm of the sum of probability terms:

[00002]$\log \left(\underset{x\in {}_{b_k=1}}{.Math.}.Math.p\left(Y|X,H\right).Math.p\left(X\right)\right),$

i=0,1, with the maximum of the probability terms:

[00003]$\underset{\begin{array}{c}\\ x\in {}_{b_k=1}\end{array}}{\max }.Math.\left\{p\left(Y|X,H\right).Math.p\left(X\right)\right\}.$

Even with the Jacobian approximation the complexity in large MIMO systems remains prohibitively high for implementation in many UE designs. For example in a MIMO system where there are 4 transmit antennas and the data is modulated using a 64 symbol alphabet such as with 64QAM, the set of symbol vectors with the kth bit equal to one, S.sub.b.sub.k.sub.=1 and the set of symbol vectors with the kth bit equal to zero S.sub.b.sub.k.sub.=0 each contain 64.sup.4/2=8388608 possible transmitted symbol vectors.

[0039] MLD methods may be formulated as tree search problems as illustrated by the search tree 100 depicted in FIG. 1. The search tree 100 includes a root node 106 representing a starting point for searching all possible transmitted symbol vectors X. Below the root node is a parent layer or set of parent nodes 108 where each parent node such as parent node 114 in the parent layer 108 represents a symbol in the transmitted symbol alphabet or codebook. The first level 108 includes a node for each symbol in the alphabet used for transmitting the first symbol x.sub.N. For example when the first layer is transmitted using 64QAM there will be 64 nodes in the first layer 108. Below the parent layer 108, the search tree 100 includes a child layer 110, 112 corresponding to each additional layer in the transmitted signal. For example, when there are three (3) layers in the transmitted signal, the search tree 100 includes one parent layer 108 and two child layers 110, 112 as illustrated in FIG. 3. When there are four layers in the transmitted signal the search tree will have one parent layer and three child layers, etc. The first child layer 110 includes a node for each possible combination of symbols in the first two layers (x.sub.N-1,x.sub.N).

[0040] For example when both the first 108 and second 110 layer are transmitted using 64QAM, the second level 110 will include 64.sup.2 or 4096 nodes. For clarity, some of the nodes in each layer have been left out of the tree diagram 100 and replaced with dashed lines 120, where the dashed lines 120 are used to indicate a continuation of the adjacent pattern. In a full complexity design the MLD search pattern includes the entire tree 100. Each path from root node 106 to lowest level 112 child node represents a candidate path corresponding to a particular symbol vector (x.sub.N-2,x.sub.N-1,x.sub.N). For example nodes 106, 114, 116, 118 represent a candidate path from the root node to the lowest level child node. In a full complexity MLD search all candidate paths are evaluated using a branch metric also referred to herein as a path metric to determine the best candidate path or symbol vector.

[0041] A number of conventional methods may be used to reduce the complexity of maximum likelihood symbol detection while keeping performance close to that of MLD. One conventional approach, often referred to as the QR-M algorithm, begins by performing QR decomposition on the channel matrix H=QR and transforming the received signal model as shown in Equation 3:

Z=RX+V.  Eq. 3

where the transformed received symbol vector Z is formed from the Hermitian transpose of a matrix Q times the received symbol vector Y: Z=Q.sup.HY. The Hermitian transpose, also known as the conjugate transpose, is denoted by a superscript .sup.H. The thermal noise W is transformed to a noise vector V where V=Q.sup.HW, and the matrix R is an upper triangular matrix. The search process is based on the transposed system model illustrated in Equation 3 and starts from the bottom layer of the transmitted symbol vector X. The modified search tree 200 resulting from the QR-M algorithm is illustrated in FIG. 2.

[0042] For each layer 208, 210, 212 in the search tree 200, a number of candidate nodes are preserved and subtracted from the transformed received signal Z when detecting the next layer. In the search tree 200 preserved candidate nodes are indicated by dark colored nodes, such as the dark color used to shade node 202, while light color nodes, such as the light color used to shade node 216, are pruned or removed from the search tree. In a typical implementation of the QR-M algorithm it is often necessary to retain a fairly large number of nodes in each layer in order to preserve near MLD performance. Therefore, because the total number of retained nodes remains relatively large, the total complexity is often still prohibitively high for implementation in many UE designs.

[0043] An exemplary embodiment of a detection method as used by a detector according to an embodiment of the present disclosure significantly reduces the complexity of symbol detection through the use of an optimal channel shortening procedure followed by a simplified tree search process. The optimal channel shortening procedure is used to determine an optimal shortened channel matrix H.sub.r and corresponding shortened channel correlation matrix G.sub.r based on the mismatched received signal probability density function (PDF) shown in Equation 4:

{tilde over (p)}.sub.Y|X∝exp(2Re{Y.sup.HH.sub.rX}−X.sup.HG.sub.rX).  Eq. 4

The transmitted data X and received data Y may be assumed to be jointly Gaussian. Using Eigen value decomposition allows a shortened channel correlation matrix G.sub.r to be decomposed into a unitary matrix U and a diagonal Eigen value matrix Λ.sup.g as G.sub.r=UΛ.sup.g U.sup.H. Λ.sup.g is a diagonal Eigenvalue matrix: Λ.sup.g=diag(λ.sub.1.sup.g,λ.sub.2.sup.g, . . . λ.sub.N.sup.g) where λ.sub.i.sup.g are the Eigen values of the shortened channel correlation matrix G.sub.r.

[0044] Let the transformed received symbol vector Z=U.sup.HX=(z.sub.1,z.sub.2, . . . ,z.sub.N).sup.T denote the received data after preprocessing with the unitary matrix U, then the probability function of the received data Y can be described as shown in Equation 5:

[00004]$\begin{array}{cc}\begin{array}{c}{\tilde{p}}_Y=\underset{X}{\int }.Math.{\tilde{p}}_{Y|X}.Math.p_X.Math.\mathrm{dX}=\frac{1}{{\pi }^N}.Math.\underset{X}{\int }.Math.\exp \left(2.Math..Math.\mathrm{Re}.Math.\left\{Y^H.Math.H_r.Math.X\right\}-Z^H.Math.{\Lambda }^g.Math.Z\right).Math.\exp \left(-Z^H.Math.Z\right).Math.\mathrm{dZ}\\ =\frac{1}{{\pi }^N}.Math.\underset{X}{\int }.Math.\exp \left(2.Math..Math.\mathrm{Re}.Math.\left\{Z^H.Math.D\right\}-Z^H\left({\Lambda }^g+I\right).Math.Z\right).Math.\mathrm{dZ}\\ =\frac{1}{{\pi }^N}.Math.\underset{X}{\int }.Math.\underset{k=1}{\overset{N}{\Pi }}.Math.\exp \left(2.Math..Math.\mathrm{Re}.Math.\left\{z_k^{*}.Math.d_k\right\}-|z_k.Math.{|}^2.Math.\left({\lambda }_k^g+1\right)\right).Math.{\mathrm{dz}}_k\\ =\frac{1}{{\pi }^{N.Math.\text{/}.Math.2}}.Math.\underset{k=1}{\overset{N}{\Pi }}.Math.\frac{1}{\left({\lambda }_k^g+1\right)}.Math.\exp \left(\frac{|d_k.Math.{|}^2}{{\lambda }_k^g+1}\right)\propto \underset{k=1}{\overset{N}{\Pi }}.Math.\frac{1}{\left({\lambda }_k^g+1\right)}.Math.\exp \left(\frac{|d_k.Math.{|}^2}{{\lambda }_k^g+1}\right)\end{array}.& \mathrm{Eq}..Math.5\end{array}$

where the vector D=(Y.sup.HH.sub.rU).sup.H=(d.sub.1,d.sub.2, . . . ,d.sub.N).sup.T is a column vector.

[0045] The expected value of the probability with respect to the received signal Y, denoted by E.sub.Y, is shown in Equation 6:

[00005]$\begin{array}{cc}-E_Y\left({\log }_2\left({\tilde{p}}_Y\right)\right)=\underset{k=1}{\overset{N}{.Math.}}.Math..Math.\left({\log }_2\left({\lambda }_k^g+1\right)+\frac{E_Y\left(|d_k.Math.{|}^2\right)}{{\lambda }_k^g+1}\right).& \mathrm{Eq}..Math.6\end{array}$

[0046] By defining an upper triangular matrix R as shown in Equation 7:

R=E(DD.sup.H)=U.sup.HH.sub.r.sup.HE(YY.sup.H)H.sub.rU=U.sup.HH.sub.r.sup.H(HH.sup.H+σ.sup.2I)H.sub.rU,  Eq. 7

the expected value E.sub.Y can be re-written as shown in Equation 8:

[00006]$\begin{array}{cc}-E_Y\left({\log }_2\left({\tilde{p}}_Y\right)\right)=\underset{k=1}{\overset{N}{.Math.}}.Math..Math.\left({\log }_2\left({\lambda }_k^g+1\right)+\frac{R_{\mathrm{kk}}}{{\lambda }_k^g+1}\right).& \mathrm{Eq}..Math.8\end{array}$

[0047] It can be shown that the expected value relationship illustrated below in Equation 9 holds for the above described system:

E.sub.X,Y(log.sub.2({tilde over (p)}.sub.Y|X))=E.sub.X,Y(2Re{Y.sup.HH.sub.rX}−X.sup.HG.sub.rX)=2Re{tr(H.sub.r.sup.HH)}−tr(G.sub.r).  Eq. 9

[0048] The lower bound of the achievable information rate can be found as shown in Equation 10:

[00007]$\begin{array}{cc}\tilde{I}=-E_Y\left({\log }_2\left({\tilde{p}}_Y\right)\right)+E_{X,Y}\left({\log }_2\left({\tilde{p}}_{Y|X}\right)\right)=\underset{k=1}{\overset{N}{.Math.}}.Math..Math.\left({\log }_2\left({\lambda }_k^g+1\right)+\frac{R_{\mathrm{kk}}}{{\lambda }_k^g+1}-{\lambda }_k^g\right)+2.Math..Math.\mathrm{Re}.Math.\left\{\mathrm{tr}\left(H_r^H.Math.H\right)\right\}& \mathrm{Eq}..Math.10\end{array}$

[0049] Applying the above definitions leads to the relationship shown in Equation 11:

[00008]$\begin{array}{cc}\begin{array}{c}\underset{k=1}{\overset{N}{.Math.}}.Math..Math.\left(\frac{R_{\mathrm{kk}}}{{\lambda }_k^g+1}\right)=\mathrm{tr}\left({R\left({\Lambda }^g+I\right)}^{-1}\right)=\mathrm{tr}\left(U^H.Math.H_r^H\left({\mathrm{HH}}^H+\stackrel{2}{\sigma }.Math.U\right).Math.H_r.Math.{U\left({\Lambda }^g+I\right)}^{-1}\right)\\ =\mathrm{tr}\left(H_r^H\left({\mathrm{HH}}^H+{\sigma }^2.Math.I\right).Math.{H_r\left(G_r+I\right)}^{-1}\right)\end{array}.& \mathrm{Eq}..Math.11\end{array}$

[0050] The optimal shortened channel matrix H.sub.r can be found by taking the partial derivative of the lower bound of the achievable information rate Ĩ with respect to the Hermitian transpose of the shortened channel matrix H.sub.r.sup.H, and setting the result to zero as shown in Equation 12:

[00009]$\begin{array}{cc}\begin{array}{c}\frac{\partial \tilde{I}}{\partial H_r^H}=\frac{\partial \left(\mathrm{tr}\left(2.Math..Math.\mathrm{Re}.Math.\left\{H_r^H.Math.H\right\}-H_r^H\left({\mathrm{HH}}^H+{\sigma }^2.Math.I\right).Math.{H_r\left(G_r+I\right)}^{-1}\right)\right)}{\partial H_r^H}\\ ={\left(H-\left({\mathrm{HH}}^H+{\sigma }^2.Math.I\right).Math.{H_r\left(G_r+I\right)}^{-1}\right)}^H=0\end{array}& \mathrm{Eq}..Math.12\end{array}$

[0051] The optimal shortened channel matrix H.sub.r can now be obtained as shown in Equation 13:

H.sub.r=(HH.sup.H+σ.sup.2I).sup.−1H(G.sub.r+I).  Eq. 13

[0052] Putting the optimal shortened channel matrix H.sub.r, illustrated in Equation 13, back into the expression for the lower bound of the achievable information rate Ĩ, shown above in Equation 10, yields an expression for the lower bound of the achievable information rate Ĩ as shown in Equation 14:

{tilde over (I)}=log.sub.2(det(G.sub.r+I))+tr((G.sub.r+I)H.sup.H(HH.sup.H+σ.sup.2I).sup.−1H)−tr(G.sub.r).  Eq. 14

[0053] Equation 14 can be solved to find the shortened channel correlation matrix G.sub.r by assuming a decomposition of the shortened channel correlation matrix G.sub.r based on a factorization matrix F as shown in Equation 15:

G.sub.r=F.sup.HF−I.  Eq. 15

where the sum of the shortened channel correlation matrix G.sub.r and the identity matrix I, (G.sub.r+I) is positive definite.

[0054] A reduced complexity tree search, referred to herein as an alternative marginalized tree search (AMTS) may be facilitated by using a specially formed factorization matrix F where the factorization matrix F is an N×N upper triangular matrix having the form illustrated in Equation 16 where there are non-zero elements on the main diagonal and in the last column and all other elements are zero:

[00010]$\begin{array}{cc}{F}_{N\times N}=\left(\begin{array}{cccccc}{f}_{11}& 0& \mathrm{.Math.}& \mathrm{.Math.}& 0& f_{1.Math.N}\\ 0& f_{22}& \ddots & \mathrm{.Math.}& 0& f_{2.Math.N}\\ \mathrm{.Math.}& \ddots & \ddots & \ddots & 0& \mathrm{.Math.}\\ \mathrm{.Math.}& \mathrm{.Math.}& \ddots & \ddots & 0& \mathrm{.Math.}\\ \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& \ddots & f_{\left(N-1\right).Math.\left(N-1\right)}& f_{\left(N-1\right).Math.N}\\ 0& \mathrm{.Math.}& \mathrm{.Math.}& \mathrm{.Math.}& 0& f_{\mathrm{NN}}\end{array}\right).& \mathrm{Eq}..Math.16\end{array}$

[0055] The lower bound of the achievable information rate Ĩ can be re-written based on the factorization matrix F as shown in Equation 17:

[00011]$\begin{array}{cc}\begin{array}{c}\tilde{I}={\log }_2\left(\det \left(F^H.Math.F\right)\right)+\mathrm{tr}\left(F^H.Math.{{\mathrm{FH}}^H\left({\mathrm{HH}}^H+{\sigma }^2.Math.I\right)}^{-1}.Math.H\right)-\mathrm{tr}\left(F^H.Math.F-I\right)\\ ={\log }_2\left(\det \left(F^H.Math.f\right)\right)+\mathrm{tr}\left(F\left({H^H\left({\mathrm{HH}}^H+{\sigma }^2.Math.I\right)}^{-1}.Math.H-I\right).Math.F^H\right)+\mathrm{tr}\left(I\right)\end{array}.& \mathrm{Eq}..Math.17\end{array}$

[0056] A mean square error (MSE) matrix B can be derived from the channel matrix H as shown in Equation 18:

B=I−H.sup.H(HH.sup.H+σ.sup.2I)H.  Eq. 18

[0057] Because the factorization matrix F is an upper triangular matrix a relationship between the lower bound of the achievable information rate Ĩ and the MSE matrix B can be written as shown in Equation 19:

[00012]$\begin{array}{cc}\tilde{I}=\underset{k=1}{\overset{N}{.Math.}}.Math..Math.{\log }_2\left(f_{\mathrm{kk}},f_{\mathrm{kk}}^{*}\right)-\mathrm{tr}\left({\mathrm{FBF}}^H\right)+N.& \mathrm{Eq}..Math.19\end{array}$

[0058] The k.sup.th diagonal element (FBF.sup.H).sub.k of matrix FBF.sup.H can be calculated as shown in Equation 20:

[00013]$\begin{array}{cc}{\left({\mathrm{FBF}}^H\right)}_k=\left(f_{\mathrm{kk}}.Math..Math.f_{\mathrm{kN}}\right).Math.\left(\begin{array}{cc}{b}_{\mathrm{kk}}& b_{\mathrm{kN}}\\ b_{\mathrm{kN}}^{*}& b_{\mathrm{NN}}\end{array}\right).Math.\left(\begin{array}{c}{f}_{\mathrm{kk}}^{*}\\ f_{\mathrm{kN}}^{*}\end{array}\right),& \mathrm{Eq}..Math.20\end{array}$

were b.sub.kj represent the k.sup.th row and j.sup.th column element of the MSE matrix B, and f.sub.kj represents the k.sup.th row and j.sup.th column element of the factorization matrix F.

[0059] Taking the partial derivative of the lower bound of the achievable information rate Ĩ with respect to the complex conjugate of the elements of the last column of factorization matrix f*.sub.kN and setting the result equal to zero as shown in Equation 21:

[00014]$\begin{array}{cc}\frac{\partial \tilde{I}}{\partial f_{\mathrm{kN}}^{*}}=-\left(f_{\mathrm{kk}}.Math.b_{\mathrm{kN}}+f_{\mathrm{kN}}.Math.b_{\mathrm{NN}}\right)=0.& \mathrm{Eq}..Math.21\end{array}$

yields a relationship between the elements of the factorization matrix F and the elements of the MSE matrix B as shown in Equation 22:

[00015]$\begin{array}{cc}{f}_{\mathrm{kN}}=-\frac{f_{\mathrm{kk}}.Math.b_{\mathrm{kN}}}{b_{\mathrm{NN}}}.& \mathrm{Eq}..Math.22\end{array}$

[0060] Using the result found in Equation 22 in the lower bound of the achievable information rate Ĩ, i.e. putting f.sub.kN from Equation 22 into Equation 19, and taking the partial derivative of the lower bound of the achievable information rate Ĩ with respect to the complex conjugate of the elements of the last column of the factorization matrix f*.sub.kN and setting the result equal to zero as shown in Equation 23:

[00016]$\begin{array}{cc}\frac{\partial \tilde{I}}{\partial f_{\mathrm{kN}}^{*}}=-\left(f_{\mathrm{kk}}.Math.b_{\mathrm{kN}}+f_{\mathrm{kN}}.Math.b_{\mathrm{NN}}\right)=0,& \mathrm{Eq}..Math.23\end{array}$

provides a relationship between the elements of the factorization matrix f.sub.kj and the elements of the MSE matrix b.sub.kj shown in Equation 24:

[00017]$\begin{array}{cc}{f}_{\mathrm{kk}}=\frac{1}{\sqrt{b_{\mathrm{kk}}-|b_{\mathrm{kN}}.Math.{|}^2.Math.\text{/}.Math.b_{\mathrm{NN}}}}.& \mathrm{Eq}..Math.24\end{array}$

[0061] The factorization matrix F may be uniquely obtained from the MSE matrix B according to Equation 24. The shortened channel correlation matrix G.sub.r may then be obtained using Equation 15, and the optimal shortened channel matrix H.sub.r may be obtained using Equation 13. Thus once the special form of the factorization matrix F has been specified as illustrated in Equation 16, the shortened channel correlation matrix G.sub.r can be derived from the MSE matrix B where the elements of the shortened channel correlation matrix G.sub.r are calculated according to Equation 25:

[00018]$\begin{array}{cc}{g}_{\mathrm{kl}}=\{\begin{array}{cc}\frac{b_{\mathrm{NN}}}{b_{\mathrm{kk}}.Math.b_{\mathrm{NN}}-b_{\mathrm{kN}}.Math.{|}^2}-1& i=k\ne N\\ \frac{1}{b_{\mathrm{NN}}}-1& i=k=N\\ \frac{-b_{\mathrm{kL}}}{b_{\mathrm{kk}}.Math.b_{\mathrm{NN}}-|b_{\mathrm{kN}}.Math.{|}^2}& i=N,k\ne N\\ g_{\mathrm{ik}}^{*}& i\ne N,k=N\\ 0& \mathrm{else}\end{array},& \mathrm{Eq}..Math.25\end{array}$

where b.sub.ij is the element of the MSE matrix B at the i.sup.th row and j.sup.th column and as before N is the number of transmitted layers.

[0062] Using the shortened channel correlation matrix G.sub.r obtained from Equation 25, the a priori probability can be rewritten as shown in Equation 26:

[00019]$\begin{array}{cc}\mathrm{In}\left({\tilde{p}}_{Y|X}\right)\propto 2.Math..Math.\mathrm{Re}.Math.\left\{{Y^H\left({\mathrm{HH}}^H+{\sigma }^2.Math.I\right)}^{-1}.Math.H\left(G_r+I\right).Math.X\right\}-X^H.Math.G_r.Math.X=2.Math..Math.\mathrm{Re}.Math.\left\{{\left[{H^H\left({\mathrm{HH}}^H+{\sigma }^2.Math.I\right)}^{-1}.Math.Y\right]}^H.Math.\left(G_r+I\right).Math.X\right\}-X^H.Math.G_r.Math.X=2.Math..Math.\mathrm{Re}.Math.\left\{Z^H\left(G_r+I\right).Math.X\right\}-X^H.Math.G_r.Math.X& \mathrm{Eq}..Math.26\end{array}$

[0063] The pre-processed symbol vector Z.sup.H=(z(1),z(2), . . . z(N)) is equal to the LMMSE estimation of the transformed received symbol vector Z and may be defined as shown in Equation 27:

Z=H.sup.H(HH.sup.H+σ.sup.2I).sup.−1Y.  Eq. 27

[0064] Once the optimal shortened channel matrix H.sub.r and corresponding shortened channel correlation matrix G.sub.r have been obtained, a low complexity AMTS may be used to find the transmitted symbols. Based on the a priori probability shown in Equation 26 a path metric for each candidate path X=(x(1),x(2), . . . x(N)) may be defined as shown in Equation 28:

[00020]$\begin{array}{cc}\gamma \left(x\left(1\right),x\left(2\right),\mathrm{.Math.}.Math..Math.x\left(N\right)\right)=2.Math..Math.\mathrm{Re}.Math.\left\{Z^H\left(G_r+I\right).Math.X\right\}-X^H.Math.G_r.Math.X=\underset{k=N}{\overset{1}{.Math.}}.Math..Math.{\gamma }_k\left(z\left(k\right),x\left(k\right),x\left(N\right)\right).& \mathrm{Eq}..Math.28\end{array}$

[0065] A path metric for the kth layer can be defined as in Equation 29:

[00021]$\begin{array}{cc}{\gamma }_k\left(z\left(k\right),x\left(k\right),x\left(N\right)\right)=\{\begin{array}{cc}\mathrm{Re}.Math.\left\{\left(2.Math.\left(z\left(k\right)-g_{\mathrm{Nk}}.Math.{x\left(N\right)}^{*}\right)-g_{\mathrm{kk}}.Math.{x\left(k\right)}^{*}\right).Math.x\left(k\right)\right\}& k\ne N\\ \mathrm{Re}.Math.\left\{\left(2.Math.z\left(N\right)-g_{\mathrm{NN}}.Math.{x\left(N\right)}^{*}\right).Math.x\left(N\right)\right\}& k=N\end{array}.& \mathrm{Eq}..Math.29\end{array}$

[0066] From the a priori probability shown in Equation 26 it can be seen that the best path is the one that maximizes the accumulated path metric γ. However, because of the special form of the shortened channel correlation matrix G.sub.r, maximizing the accumulated path metric γ is equivalent to maximizing each path metric γ.sub.k at the k.sup.th layer separately as illustrated in Equation 30:

[00022]$\begin{array}{cc}\arg .Math..Math.\max .Math.\left\{\gamma \left(x\left(1\right),x\left(2\right),\mathrm{.Math.}.Math..Math.x\left(M\right)\right)\right\}=\arg .Math..Math.\max .Math.\left\{\underset{k=N}{\overset{1}{.Math.}}.Math..Math.{\gamma }_k\left(z\left(k\right),x\left(k\right),x\left(N\right)\right)\right\}=\underset{k=N}{\overset{1}{.Math.}}.Math..Math.\arg .Math..Math.\max .Math.\left\{{\gamma }_k\left(z\left(k\right),x\left(k\right),x\left(N\right)\right)\right\}.& \mathrm{Eq}..Math.30\end{array}$

The relationship illustrated in Equation 30 shows that the search of the optimal candidate x(k) for each layer may be done by independently maximizing an individual layer branch metric γ.sub.k for each layer. This allows the selection of each candidate to be handled in parallel. The parallel structure of the AMTS is illustrated by the search tree 300 shown in FIG. 3. The search tree 300 includes a root node 302 corresponding to layer being searched. Below the root node 302 is the parent layer 304 which includes one parent node, such as node 306, for each symbol x(N) in the coding scheme used to transmit the parent layer 304.

[0067] For example when the parent layer 304 is transmitted using 256QAM there will be 256 parent nodes in the parent layer 304. For clarity, some of the parent nodes and their associated child nodes have been omitted from the tree diagram 300 and replaced with dashed lines 310 indicating where tree branches have been omitted. As used herein, the term “branch” or “tree branch” refers to a node and its associated child nodes. For example the AMTS search tree 300 includes a plurality of parallel branches such as the branch made up of nodes 306, 312, 314, 318. In accordance with certain embodiments of the AMTS method described above, each parent node, such as parent node 306, in the parent layer 304 has a single child node, such as child node 312 and each child node, such as child nodes 312, 314, also has a single child node. As the search progresses a child node 312 is selected for the parent node 306. This child node 312 then becomes the parent node for selection of the child node in the next lower level. This process continues until a node has been selected for all layers in the tree search. Including only a single child node in each child layer significantly reduces the overall complexity of the AMTS as compared to MLD or the QR-M algorithm. While only three child layers 308 are illustrated in the search tree 300 it is understood that when the transmitted signal has more than four layers the search tree 300 will include additional child layers where each child layer 308 corresponds to a layer in the transmitted signal.

[0068] In alternate embodiments several candidate nodes may be selected at each child layer by selecting candidate nodes having the highest values of the individual branch metric γ.sub.k. However, in embodiments designed to have the lowest possible complexity, a single best node is chosen under each parent node as illustrated in FIG. 3.

[0069] To find the best candidate node in each child layer 308 the maximum value of the individual layer branch metric γ.sub.k needs to be found. The maximum value can be found by taking the partial derivative of the individual branch metric γ.sub.k with respect to each candidate and setting the result equal to zero as shown in Equation 31:

[00023]$\begin{array}{cc}\frac{\partial {\gamma }_k\left(z\left(k\right),x\left(k\right),x\left(N\right)\right)}{\partial {x\left(k\right)}^{*}}=\left(z^{*}\left(k\right)-g_{\mathrm{kN}}\left(N\right)\right)-g_{\mathrm{kk}}.Math.x\left(k\right)=0.& \mathrm{Eq}..Math.31\end{array}$

[0070] The maximum value can then be found as shown in Equation 32:

[00024]$\begin{array}{cc}\hat{x}\left(k\right)=\frac{z^{*}\left(k\right)-g_{\mathrm{kN}}.Math.x\left(N\right)}{g_{\mathrm{kk}}}.& \mathrm{Eq}..Math.32\end{array}$

When the diagonal value of the shortened channel correlation metric g.sub.kk is positive, the individual branch metric γ.sub.k describes a concave surface for the candidate symbol x(k), and the peak value {circumflex over (x)}(k) is the maximum point on the surface. In the case of a concave surface the best estimation is provided by Equation 32 and quantizing the peak value {circumflex over (x)}(k) to the nearest constellation point in a QAM alphabet provides the best estimate of the candidate symbol x(k).

[0071] For example, FIG. 4 illustrates an embodiment showing the above described mapping when the modulation scheme is 16QAM. Graph 400 illustrates a real versus imaginary plot of the 16 constellation points of a 16QAM encoding scheme. In the graph 400 real values are represented along the horizontal axis, imaginary values are represented along the vertical axis, and the constellation points are represented by shaded circles, for example shaded circle 404. In the illustrated graph 400 the peak value {circumflex over (x)}(k) falls between four constellation points 406, 408, 410, 412. The closest constellation point 410 is then selected as the best candidate symbol x(k).

[0072] When the diagonal value of the shortened channel correlation matrix g is non-positive, the individual branch metric γ.sub.k is a convex function and the maximal value is located along the boundaries so the corners of the constellation map need to be considered. Further when the modulus correspond to Equation 33:

[00025]$\begin{array}{cc}{\gamma }_k\left(z\left(k\right),x\left(k\right),x\left(N\right)\right)=\mathrm{Re}.Math.\left\{\left(2.Math.\left(z\left(k\right)-g_{\mathrm{Nk}}.Math.{x\left(N\right)}^{*}\right)-g_{\mathrm{kk}}.Math.{x\left(k\right)}^{*}\right).Math.x\left(k\right)\right\};\propto \mathrm{Re}.Math.\left\{\left(z\left(k\right)-g_{\mathrm{Nk}}.Math.{x\left(N\right)}^{*}\right).Math.x\left(k\right)\right\}& \mathrm{Eq}..Math.33\end{array}$

the best candidate depends on the quadrant in which the residual signal z*(k)−g.sub.kN×(N) is located.

[0073] As described above, a single best candidate is selected under each parent node for each layer resulting in significantly lower complexity than MLD. However, preserving only a single candidate node at each layer is essentially sub-optimal. To compensate for this, each layer, or at least portions of the weaker layers are switched to be the parent node and the AMTS process is repeated with each layer as the parent layer. The results of each AMTS leg are then combined to obtain a more reliable result.

[0074] Switching of a layer to become the parent layer may be accomplished using a permutation matrix. In an exemplary embodiment, to switch a layer, designated as the j.sup.th layer in the following equation, to be the parent layer, a permutation matrix P.sub.j is defined as shown in Equation 34:

[00026]$\begin{array}{cc}{P}_j=\left(\begin{array}{ccccccc}1& & & & & & \\ 0& \ddots & & & & & \\ & \ddots & 1& & & & \\ & & 0& 0& & & 1\\ & & & 1& \ddots & & \\ & & & & \ddots & \ddots & \\ & & & & & 1& 0\end{array}\right).fwdarw.j.Math.\text{-}.Math.\mathrm{th}.Math..Math.\mathrm{row},& \mathrm{Eq}..Math.34\end{array}$

where the 1 in the last column to the right corresponds to the j.sup.th element and the remaining elements in the last column are zero. The permutation matrix P.sub.j may be used to permute the j.sup.th column of a matrix to the last column while keeping the rest of the columns in the same order.

[0075] The permutation matrix P.sub.j also has a useful property where pre or post multiplying by its transpose yields the identity matrix: P.sub.j.sup.TP.sub.j=P.sub.jP.sub.j.sup.T=1. The permutation matrix P.sub.j can be used to switch the j.sup.th layer of the received signal model by rewriting Equation 1 as shown in Equation 35:

Y=HP.sub.jP.sub.j.sup.TX+N=H.sub.jX.sub.j+N,  Eq. 35

Where H.sub.j is a permuted channel matrix and X.sub.j is the permuted transmitted symbol vector permuted according to the permutation matrix P.sub.j.

[0076] After post-multiplying with the permutation matrix P.sub.j the column vectors of the permuted channel matrix H.sub.j are re-ordered as shown in Equation 36:

H.sub.j=HP.sub.j=(h.sub.1,h.sub.2, . . . h.sub.j−1,h.sub.j+1, . . . h.sub.N,h.sub.j),  Eq. 36

and after pre-multiplying the elements of the transmitted symbol vector X, with the transpose of the permutation matrix P.sub.j.sup.T the elements are re-ordered as shown in Equation 37:

X.sub.j=P.sub.j.sup.TX=(x(1),x(2), . . . ,x(j−1),x(j+1), . . . ,x(N−1),x(j)).sup.T.  Eq. 37

An embodiment of the AMTS process can then be implemented for the j.sup.th layer based on the permuted channel matrix H.sub.j and the permuted symbol vector X.sub.j.

[0077] Much of the complexity of the channel shortening process can be shared by all the parallel searches of the AMTS. Sharing of portions of the channel shortening process reduces the overall complexity and provides significant complexity savings. With the permuted received signal model described above in equation Eq. 35, the permuted MSE matrix B.sub.j is updated as shown in Equation 38:

B.sub.j=I−H.sub.j.sup.H(H.sub.jH.sub.j.sup.H+σ.sup.2I).sup.−1H.sub.j=I−P.sub.j.sup.TH.sup.H(HP.sub.jP.sub.j.sup.TH.sup.H+σ.sup.2I).sup.−1HP.sub.j=P.sub.j.sup.T(I−H.sup.H(HH.sup.H+σ.sup.2I).sup.−1H)P.sub.j=P.sub.j.sup.TBP.sub.j  Eq. 38

The MSE matrix is the original non-permuted MSE matrix defined above. Thus, since P is a permutation matrix, the permuted MSE matrix B.sub.j may be obtained from the MSE matrix B with a negligible increase in complexity.

[0078] Similarly the transformed received symbol vector shown in Equation 27 may be permuted to obtain a permuted transformed received symbol vector Z.sub.j as shown in Equation 39:

Z.sub.j=P.sub.j.sup.TH.sup.H(HH.sup.H+σ.sup.2I).sup.−1Y=P.sub.j.sup.TZ.  Eq. 39

The transformed received symbol vector Z and the corresponding MSE matrix B may be obtained from the initial LMMSE step. Therefore only the shortened channel correlation matrix G.sub.r.sup.j needs to be re-calculated based on the permuted MSE matrix B.sub.j after the j.sup.th layer is switched to be the parent node.

[0079] After application of the permutation, the updated branch metric may be defined as shown in Equation 40:

γ(X.sub.j)=2Re{Z.sub.j.sup.H(G.sub.r.sup.j+I)X.sub.j}−X.sub.j.sup.HG.sub.r.sup.jX.sub.j.  Eq. 40

The remainder of the AMTS process described above remains unchanged for the permuted layer.

[0080] FIG. 5 illustrates a block diagram of an embodiment of an AMTS detector generally indicated by numeral 500. The illustrated embodiment shown in FIG. 5 can be understood by viewing it as implementing a two-step process: a LMMSE based detector step 502 and a parallel marginalized tree search (MTS) process 504. The output from the two steps is combined with an LLR post process 506 to obtain a final set of bit LLR values 508. The illustrated embodiment adopts a linear detector step 502 based on LMMSE with successive and parallel interference cancellation (LMMSE-SPIC). Alternatively the linear detector step 502 may be based on any type of LMMSE detector and may include successive interference cancellation (SIC) and or parallel interference cancellation (PIC).

[0081] The illustrated embodiment of the AMTS detector 500 begins by inputting the estimated channel matrix H and received signal Y to an initial LMMSE based step 514 which assumes the noise component to be white. The LMMSE step 514 produces a MSE matrix B and an estimated transformed received symbol vector Z. When PIC is included in the LMMSE step 514 the symbol estimation is input to a soft symbol regeneration module 516 that produces a soft symbol estimation {circumflex over (X)}.sup.u-1 and a corresponding covariance matrix C.sup.u-1. Since the estimation process is iterative the superscript u is used to indicate the current iteration number and the superscript u−1 is used to indicate that these estimations are for the u minus 1 or previous iteration. The soft symbol estimation {circumflex over (X)}.sup.u-1 and a corresponding covariance matrix C.sup.u-1 are input to a LMMSE-PIC process 518 to produce a first set of bit-LLR 510 which is fed back 520 to the soft symbol regeneration module 516. Once a desired number of iterations has been completed the final first set of bit-LLR 510 is provided to the LLR post process 506. The self-iterative LMMSE-PIC detector 518 may be summarized as shown in Equation 41:

[00027]$\begin{array}{cc}{\hat{X}}^u={\hat{X}}^{u-1}+\frac{{H^H\left({\mathrm{HC}}^{u-1}.Math.H^H+{\sigma }^2.Math.I\right)}^{-1}}{\mathrm{diag}\left({H^H\left({\mathrm{HC}}^{u-1}.Math.H^H+{\sigma }^2.Math.I\right)}^{-1}.Math.H\right)}.Math.\left(Y-H.Math.{\hat{x}}^{u-1}\right).& \mathrm{Eq}..Math.41\end{array}$

The bit-LLR can be calculated based on the symbol estimation {circumflex over (X)}.sup.u for a specific modulation type. The bit-LLR can then be used by the soft symbol regeneration process to create a soft symbol estimation {circumflex over (X)} and covariance matrix C for the next iteration.

[0082] The parallel marginalized tree search (MTS) process 504 has a number of parallel legs 526 where each leg (wherein each leg can be processed in parallel by the detector 500), labeled as leg 1 through T, includes a channel shortening process 532 and an AMTS process 534. The channel shortening process 532 and AMTS process 534 for each parallel leg 526 share the same processes with a different transmitted layer switched to be the parent layer. Selection of the parent layers is described in more detail below. The outputs 528 from each parallel MTS leg 526 are combined in a candidate set combination and bit LLR calculation process 530 to produce a single output 512.

[0083] The estimated channel matrix H and MSE matrix B of FIG. 5 are provided to a parent layer selection module 524 to select which layers will be used as parent layers in the parallel MTS process 504. In certain embodiments it is desirable to reduce the complexity of the MTS process by having fewer parallel searches or legs than there are layers in the received signal. This can be expressed as: T<=N, where N is the number of layers in the received signal and T is the number of parent layers selected or the number of parallel legs in the search process 504. When T is less than N the layers to be used as parent layers need to be selected from the full set of transmitted layers. In certain embodiments selection of the parent layers 524 may be based on energy or mean square error. Let the channel matrix be represented as shown in Equation 42:

H=(h.sub.1,h.sub.2, . . . ,h.sub.j−1,h.sub.j,h.sub.j+1, . . . h.sub.N),  Eq. 42

where h.sub.i(1≦i≦N) represents the i.sup.th column vector.

[0084] For energy based parent layer selection the layers chosen to be the parent layers of each parallel leg correspond to the channel vectors h.sub.K.sub.i (1≦i≦T) that satisfy the condition shown in Equation 43:

∥h.sub.K.sub.i∥≦∥h.sub.j∥, where 1≦i≦T, and 1≦j≠K.sub.i≦N.  Eq. 43

Alternatively, parent layer selection 524 may be based on the MSE matrix B obtained from the first LMMSE module 514. This approach is equivalent to basing selection on channel capacity. With channel capacity selection, the layers chosen to be parent layers correspond to the maximal diagonal elements of the MSE matrix B. Since the MSE matrix B is a square N by N matrix let its elements be represented by a lower case b as B=(b.sub.ij).sub.N×N where the subscripts i and j represent the row and column position of the element b respectively.

[0085] The layers chosen to be the parent layers correspond to the elements from the main diagonal of the MSE matrix B, b.sub.K.sub.i.sub.K.sub.i(1≦i≦T), that satisfy the condition shown in Equation 44:

b.sub.K.sub.i.sub.K.sub.i≧b.sub.jj, where 1≦i≦T, and 1≦j≠K.sub.i≦N.  Eq. 44

[0086] Once the parent layers have been selected 524 a permutation matrix P.sub.j is used as described above to switch each selected layer to be the parent layer of one parallel leg 526. A channel shortening process 532 creates a shortened channel correlation matrix G.sub.r corresponding to the parent layer selected for each parallel leg 526. As described above the channel shortening processes 532 all use the same process for creating the shortened channel correlation matrix G.sub.r which allows a large portion of the computational complexity to be shared. The shortened channel correlation matrix G.sub.r is then used in an AMTS 534 to obtain a candidate set of bit-LLR 528. The candidate sets of bit-LLR 528 are then combined 530 and a final set of bit-LLR 512 is calculated.

[0087] In certain embodiments the number of parallel legs is less than the total number of layers that need to be detected. In these embodiments, since not all layers have a chance to be a parent node, no bit combination assumptions will occur in as candidate paths in one of the parallel legs 526 and not all bit-LLR values will be calculated by the AMTS 528. This may be referred to as the missing bit problem.

[0088] For the layers that have been chosen to be a parent node of one of the parallel AMTS legs 526, the bit-LLR calculation is simply based on the corresponding AMTS leg and since all assumptions for the parent node have been preserved there is no missing bit problem. For example, assume the layer chosen to be the parent node is modulated with 64QAM, the bit-LLR calculation will be calculated among the final 64 surviving paths as illustrated in the tree diagram of FIG. 3. Each bit will have 32 surviving paths corresponding to a bit hypothesis of 0 and 32 surviving paths corresponding to a bit hypothesis of 1 as illustrated by Equation 45:

[00028]$\begin{array}{cc}\mathrm{LLR}\left(b_i\right)=\underset{b_i=1,b_i\in x\left(N\right)}{\arg .Math..Math.\max }.Math.\left\{\gamma \left(x\left(1\right),x\left(2\right),\mathrm{.Math.}.Math..Math.x\left(N\right)\right)\right\}-\underset{b_i=0,b_i\in x\left(N\right)}{\arg .Math..Math.\max }.Math.\left\{\gamma \left(x\left(1\right),x\left(2\right),\mathrm{.Math.}.Math..Math.x\left(N\right)\right)\right\},& \mathrm{Eq}..Math.45\end{array}$

where b.sub.i is the i-th bit of the parent node x(N).

[0089] It is often the case that an embodiment will use a number of parallel AMTS legs T that is less than the number of layers, N, in the transmitted signal, i.e the number of AMTS legs T is less than the number of layers N that needs to be detected. In embodiments where the number of parallel legs T is less than the number of received layers N not all the possible bit combinations are to be included in the search process and the missing bit problem needs to be solved. There are a number of alternatives for solving the missing bit problem which will be presented in the following.

[0090] For example, in certain embodiments the sign of the bit-LLR output from the AMTS 534 may be used. Although the bit-LLR for the missing bit combinations cannot be calculated, the sign of the bit-LLR is known. Thus the sign of the bit-LLR may be used to reconstruct the missing bit-LLR values as follows, when the sign of the bit-LLR output from the AMTS 534 is the same as the sign of the bit-LLR 510 output from the SPIC module, the bit-LLR 510 output from the SPIC module is used as the final output; and when the sign of the bit-LLR 510 output from the AMTS 534 is different than the sign of the bit-LLR 510 output from the SPIC module, the negative of the bit-LLR 510 output from the SPIC module is used as the final output.

[0091] Finally the bit-LLR 512 of bits that do not have the “missing bit” issue from AMTS detection module 504 are combined with the bit-LLR 510 from the LMMSE or LMMSE-SPIC detector 502 in an LLR post process 506. In certain embodiments the LLR post process 506 combines the bit-LLR 510 from the linear detector 502 with the bit LLR outputs 512 from the AMTS detector 504 based on a simple linear averaging. Alternatively, embodiments of the LLR post process 506 can use adaptive averaging where the averaging factor can be based on the measured signal to noise ratio (SNR).

[0092] FIG. 6 illustrates a flow chart of a method 600 according to an embodiment for detecting data in a MIMO communication signal. The communication signal is a MIMO type communication signal as is received at a UE where the communication signal may be down converted and appropriately conditioned before being sampled to create a digital data signal. The exemplary embodiment of a method 600 for detecting data begins with step 602 where a digital communication signal is received. Portions of the received digital signal are then used in a channel estimation step 604 to determine an estimated channel matrix H. The estimated channel matrix H and the received digital signal Y are passed through a linear equalizer step 606, for example an LMMSE type equalizer, to determine an estimated transformed received symbol vector Z and a MSE matrix B. The estimated transformed received symbol vector Z and the MSE matrix B are then used in a pair of detection steps 608, 626 to produce a first 616 and second 624 set of bit LLR estimates. As indicated in the exemplary method 600 the two detection steps, 608 and 626, may be performed in parallel or when desired they may be performed serially in either order. One of the detection steps 608 uses linear techniques to estimate the first set of bit LLR 616. The linear detection step 608 may use any appropriate linear estimation technique such as for example a LMMSE detector, LMMSE-SIC, LMMSE-PIC, or a combination of LMMSE with both PIC and SIC as discussed above and with reference to FIG. 5.

[0093] The detection step 626 is based on a novel simplified tree search process described above. This novel simplified tree search process used in the detector step 626 begins with a parent layer selection process 610 where the layers in the received digital signal that are to be used as parent layers in the parallel legs, depicted as parallel legs 628-1 through 628-T in FIG. 6, of a novel simplified MTS referred to herein as AMTS are selected. As described above, the sub-optimal nature of the AMTS is mitigated by performing multiple AMTS searches in parallel 628-1 through 628-T, where T represents the number layers selected to be parent layers, which is also the number of legs or AMTS searches being performed in parallel. The number of parallel legs T selected may be less than or equal to the number of layers N in the received digital signal. A special channel shortening process is used to obtain a shortened channel correlation matrix G.sub.r for each leg 628-1 to 628-T. A significant portion of the processing necessary to obtain the shortened channel correlation matrices is common to all the legs 628-1 through 628-T and therefore may be performed only once in a common computation step 610 and shared among all the AMTS legs 628-1 through 628-T. Each leg 628-1 through 628-T then switches a layer to be the parent layer for that leg in a parent layer switching step 614-1 to 614-T and completes generation of the corresponding shortened channel correlation matrix G.sub.r. Switching of the parent layer performed in step 614 is done using a permutation matrix P.sub.j as described above thereby preventing switching of the parent layers from adversely impacting the computational complexity. Once the special form of the shortened channel correlation matrix G.sub.r has been obtained, a set of AMTS steps 618-1 to 618-T may be performed in parallel using a branch metric based on the shortened channel correlation matrix G.sub.r as described above. The AMTS steps 618-1 to 618-T may be configured to select one or more child nodes below each node in the parent layer, however the minimal complexity case will select only a single node below each parent node and each child node will itself have only a single child node selected. Selection of the child nodes, as described above is based on the branch metric for each parallel leg 628-1 through 628-T. The property of the legs 628-1 through 628-T to be processed in parallel provides the advantage of using multiple processors or processing cores to reduce the amount of time required to determine the second 624 set of bit log likelihood estimates. A bit LLR post processing step 622 then uses the two sets of bit LLR estimates 616 and 624 to produce a refined set of bit LLR values 630 to be used for detecting the data. The LLR post processing step 622 may combine the first 616 and second 624 sets of bit LLR values based on a simple linear averaging or alternatively it may use adaptive averaging where the averaging factor can be based on measured SNR values.

[0094] Improved throughput obtained with the above described embodiments can be seen through simulations based on industry standard transmission modes, such as transmission mode 3 (TM3) of a LTE system as defined by the 3GPP. FIG. 7 illustrates a graph 700 of normalized throughput, represented as a percentage plotted along the vertical axis 702, versus SNR represented in decibels (dB) plotted along the horizontal axis 704. The graph 700 illustrates throughput 702 for a 4×4 MIMO system where all layers use 64QAM modulation with a coding rate of 0.72. The simulations are for an Extended Pedestrian-A channel with a UE speed of 3 Km/h (EPA3). The correlation is use-defined with alpha=beta=0.1 and the bandwidth is set to 1.4 megahertz (MHz). A lower bound for the throughput 706 is obtained with a simple linear detector designated SPIC×2 in FIG. 7. SPIC×2 represents a LMMSE-SPIC detector with two iterations including an LMMSE step followed by a single SPIC iteration. A second simulation result shows the throughput 708 obtained using an optimal mixed logical dynamic (MLD) model, designated as MLM, and an upper bound for throughput 710, designated SPIC×2_MLM, is obtained by averaging the output from a pair of detectors, a MLD and a SPIC×2 detector. The throughput obtained with an embodiment of the above described dual detector 712 is labeled as “SPIC×2_AMTS”. The throughput 712 is based on a dual AMTS and linear detector as illustrated in FIG. 5. The simulation results in graph 700 show that the newly disclosed dual detector SPIC×2_AMTS 712 provides throughput performance nearly as good as the optimal MLD based approaches with much lower complexity.

[0095] FIG. 8 illustrates a block diagram of an apparatus or mobile device 800 incorporating aspects of the disclosed embodiments. The mobile device 800 is appropriate for implementing the detection techniques described above. The illustrated mobile device 800 includes a processor 802 (e.g. implementing the detector 500) coupled to a memory 804, a radio frequency (RF) unit 806, a user interface (UI) 808, and a display 810. The apparatus 800 is appropriate for use as a mobile device which may be any of various types of wireless communications user equipment such as cell phones, smart phones, or tablet devices.

[0096] The processor 802 may be a single processing device or may comprise a plurality of processing devices including special purpose devices such as for example it may include digital signal processing (DSP) devices, microprocessors, or other specialized processing devices as well as one or more general purpose computer processors. The processor 802 is configured to perform the before mentioned processes. The processor 802 is coupled to a memory 804 which may be a combination of various types of volatile and/or non-volatile computer memory such as for example read only memory (ROM), random access memory (RAM), magnetic or optical disk, or other types of computer memory. The memory 804 stores computer program instructions that may be accessed and executed by the processor 802 to cause the processor 802 to perform a variety of desirable computer implemented processes or methods such as the detection methods described above. The program instructions stored in memory 804 may be organized as groups or sets of program instructions referred to by those skilled in the art with various terms such as programs, software components, software modules, units, etc., where each software component may be of a recognized type such as an operating system, an application, a device driver, or other conventionally recognized type of software component. Also included in the memory 804 are program data and data files which are stored and processed by the computer program instructions.

[0097] The RF Unit 806 is coupled to the processor 802 and configured to transmit and receive RF signals based on digital data 812 exchanged with the processor 802. The RF Unit 806 is configured to transmit and receive radio signals that may conform to one or more of the wireless communication standards in use today, such as for example LTE, LTE-A, Wi-fi, as well as many others. The RF Unit 806 may receive radio signals from one or more antennas, down-convert the received RF signal, perform appropriate filtering and other signal conditioning operations, then convert the resulting baseband signal to a digital signal by sampling with an analog to digital converter. The digitized baseband signal also referred to herein as a digital communication signal is then sent 812 to the processor 802.

[0098] The UI 808 may include one or more user interface elements such as a touch screen, keypad, buttons, voice command processor, as well as other elements adapted for exchanging information with a user. The UI 808 may also include a display unit 810 configured to display a variety of information appropriate for a mobile device or apparatus 800 and may be implemented using any appropriate display type such as for example organic light emitting diodes (OLED), liquid crystal display (LCD), as well as less complex elements such as LEDs or indicator lamps, etc. In certain embodiments the display unit 810 incorporates a touch screen for receiving information from the user of the mobile device 800. In certain embodiments the UI 808 may be omitted. The mobile device 800 is appropriate for implementing embodiments of the apparatus and methods disclosed herein.

[0099] Thus, while there have been shown, described and pointed out, fundamental novel features of the disclosure as applied to the exemplary embodiments thereof, it will be understood that various omissions, substitutions and changes in the form and details of devices and methods illustrated, and in their operation, may be made by those skilled in the art without departing from the spirit and scope of the disclosure. Further, it is expressly intended that all combinations of those elements, which perform substantially the same function in substantially the same way to achieve the same results, are within the scope of the disclosure. Moreover, it should be recognized that structures and/or elements shown and/or described in connection with any disclosed form or embodiment of the disclosure may be incorporated in any other disclosed or described or suggested form or embodiment as a general matter of design choice. It is the intention, therefore, to be limited only as indicated by the scope of the claims appended hereto.