초록 ▼

The present invention relates to improved multiple access communications. In one form, the invention relates to an improved signal processing method and apparatus for an iterative method of determining the reception of a signal in a multi user packet based wireless OFDM (Orthogonal Frequency Divisio

The present invention relates to improved multiple access communications. In one form, the invention relates to an improved signal processing method and apparatus for an iterative method of determining the reception of a signal in a multi user packet based wireless OFDM (Orthogonal Frequency Division Multiplexing) communication system. In other forms the present invention provides recursive filtering for joint iterative decoding in a variety of systems and functions such as linear multiple access channel decoders, iterative equalisation, iterative joint channel estimation and detection/decoding, iterative space-time processing, iterative multi user interference cancellation and iterative demodulation. In one particular form the present invention provides an iterative decoding circuit for a wireless multiuser communications receiver comprising a first signal processing means for receiving at least one received signal, said first signal processing means comprising at least two linear iterative filters such that the first linear iterative filter provides an estimate of a selected received signal to an estimated signal output and a second linear iterative filter provides estimates of at least one other received signal, delayed by one iteration cycle, to an input of said first linear iterative filter, a second signal processing means for receiving the estimated signal output of the first linear iterative filter and providing a further received signal estimate to the input of the first signal processing means in a succeeding iteration cycle of the decoding circuit.

대표청구항 ▼

The invention claimed is: 1. An iterative signal processing arrangement having: one or more pairs of first and second signal processing components, the pairs of components being in iterative configuration, each of the first signal processing components having as input one or more received signals d

The invention claimed is: 1. An iterative signal processing arrangement having: one or more pairs of first and second signal processing components, the pairs of components being in iterative configuration, each of the first signal processing components having as input one or more received signals dependent upon one or more transmitted signals, wherein for each said signal processing component pair the output of said first signal processing component is an estimate of a characteristic of a selected transmitted signal based on the current and one or more previous input signals received by said first signal processing component, which is input to said corresponding second signal processing component that provides a further estimate of said selected transmitted signal to the output of said second signal processing component, the outputs of all said second signal processing components of respective pairs are input to each said first signal processing components of all said pairs in a succeeding iteration cycle, wherein said first signal processing components consists of: at least two linear iterative filters wherein a first of said linear iterative filters outputs an estimate of a selected characteristic of a selected one of said transmitted signals to said second signal processing component, and a second of said iterative filters having the same inputs as said first linear iterative filter provides an estimate of a characteristic of a selected of one or more transmitted signals and then delays by one iteration cycle said estimate and outputs said delayed estimate to an input of said first linear iterative filter. 2. An iterative signal processing arrangement according to claim 1, wherein said first linear iterative filter provides a minimum least squared estimate of said selected transmitted signal subject to predetermined statistical models of said signals. 3. An iterative signal processing arrangement according to claim 1, wherein said second linear iterative filter provides a minimum least squared estimate of said selected transmitted signal subject to predetermined statistical models of said signals. 4. An iterative signal processing arrangement according to claim 1, a wherein said first and second linear iterative filters provide a minimum least squared estimate of said selected transmitted signal subject to predetermined statistical models of said signals. 5. An iterative signal processing arrangement according to claim 4, wherein said first and second linear iterative filters further consist of a switch the input of which at a first iteration is all received signals, and the input for subsequent iterations is the output of all second signal processing components wherein the output of said switch is input to a first summing device, and said first linear iterative filter receives as input the output of said first summing device which is input to a filter having taps that are recursively updated based on receiving one or more said received signals, the output of said first linear iterative filter is input to a second summing device the output of which becomes the output of said first signal processing component as well as being input to a first single iteration delay device the output of which is input to said second summing device, while said second linear iterative filter receives as input the output of said first summing device which is input to a second linear iterative filter having taps which are recursively updated based on receiving one or more said received signals the output of said second linear iterative filter is input to a third summing device the output of which is input to a second single iteration delay device, the output of which is input to said third summing device, the output of which is negated and input to said first summing device. 6. An iterative signal processing arrangement according to claim 5, wherein said filters in said first and a second linear iterative filters are of the type that conform to the following mathematical expression using the following assumptions, A1: The received signal is described as r=Sx+n, where S is the constraint matrix, containing all the linear channel constraints, x is a vector containing all transmitted information symbols and n is circularly symmetric complex Gaussian with covariance matrix cov n=σ2I, and where the noise variance σ2 and the constraint matrix S are known, A2: The interleaved code symbol estimates of the interfering users {circumflex over (x)}k(n) which is a vector containing all the signal estimates at iteration n for all users except user k, coming out of said corresponding signal processing component 2 can be modelled as {circumflex over (x)}k(n)=xk+{circumflex over (v)}k(n) where xk is the transmitted symbol for user k and {circumflex over (v)}k(n) is the corresponding estimated noise sample which is uncorrelated with x, which is a vector containing the transmitted symbols for all users, and also uncorrelated over time and iterations, but not over users at a given iteration, that is k(n)>=0, k(n), {circumflex over (v)}k(n)>=0 for n≠m, where n and m denote different iteration numbers, and the estimated noise correlation for user k and j at iteration n is defined as k(n), {circumflex over (v)}j(n)>=qkj, Define the estimated noise covariance matrix Qk(n)=k(n), {circumflex over (v)} k(n)>, with elements determined as shown above, Let ck(n) be the auxiliary vector that contains all signals received from user k at iteration n and all previous iterations, according to the following recursively defined vector of observables as input to the said linear iterative filter denoted by Λk(n), Under A1 and A2, the linear minimum mean square error estimate of said signal xk given said signal ck(n) is given by the output xk(n) of the recursive filter which is an updated estimate of the transmitted signal for user k at iteration n, defined as follows: description="In-line Formulae" end="lead"mk(n)=-wk(n) (I+Qk(n-1)-Wk(n))-1 description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Mk(n)=(I-Wk(n) )(I+Qk(n-1)-Wk(n)) -1description="In-line Formulae" end="tail" where for user k at iteration n mk(n) is the said first linear iterative filter, Mk(n) is the said second linear iterative filter, I is an identity matrix with ones on the diagonal and zeros everywhere else, wk(n) is a recursive, complex auxiliary vector and Wk(n) is a first recursive, complex auxiliary matrix, respectively, the recursive update equations for n=3,4, . . . are as follows: description="In-line Formulae" end="lead"wk(n)=wk(n-1) [I-(Hk(n-1)-1(I-W k(n-1))]-1description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Wk(n)=Wk(n-1) +(I-Wk(n-1))(Hk(n-1) )-1(I-Wk(n-1))description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Hk(n-1)-I+Qk(n-2) -Wk(n-1)description="In-line Formulae" end="tail" where Hk(n-1) is a second recursive, complex auxiliary matrix; the initial conditions with xk(0)=0 and xk(0)=0 are mk(1)=skt(SSt+σ2 I)-1, Mk(1)=S kt(SSt+σ2I)-1 for n=1 and wk(2)=skt(SSt+I)-1S k, Wk(2)=S kt(SSt+σ2I)-1S k for n=2, where sk is the linear constraint for user k, skt denotes the complex conjugate transpose of said vector sk,S k is the constraint matrix with column k deleted and S k denotes the complex conjugate transpose of vector S k. 7. An iterative filter signal processing arrangement according to claim 1, wherein the output of said first signal processing component is de-interleaved and the output of said second signal processing component is interleaved. 8. An iterative signal processing arrangement according to claim 1, wherein the characteristic of a selected transmitted signal is a discrete time series representation of a said selected transmitted signal and where the output of said first signal processing component is a minimum least squared estimate of said selected transmitted signal subject to predetermined statistical models of said signals. 9. An iterative signal processing arrangement according to claim 1, wherein said first and second linear iterative filters provide a minimum least squared estimate of said selected transmitted signal subject to different predetermined statistical models of said signals. 10. An iterative decoding circuit for a wireless multiuser communications receiver comprising: a first signal processing means for receiving at least one received signal, said first signal processing means comprising at least two linear iterative filters such that: the first linear iterative filter provides an estimate of a selected received signal to an estimated signal output and; a second linear iterative filter provides estimates of at least one other received signal, delayed by one iteration cycle, to an input of said first linear iterative filter; a second signal processing means for receiving the estimated signal output of the first linear iterative filter and providing a further received signal estimate to the input of the first signal processing means in a succeeding iteration cycle of the decoding circuit. 11. An iterative decoding circuit according to claim 10 wherein the linear filters function in accordance with at least one predetermined recursive Bayesian expression. 12. An iterative decoding circuit according to claim 11 wherein the predetermined recursive expression comprises the following recursive Bayesian estimation using the following assumptions: A1: The received signal is described as r=Sx+n, where S is the constraint matrix, containing all the linear channel constraints, x is a vector containing all transmitted information symbols and n is circularly symmetric complex Gaussian with covariance matrix cov n=σ2I, and where the noise variance σ2 and the constraint matrix S are known, A2: The interleaved code symbol estimates of the interfering users {circumflex over (x)} k(n) which is a vector containing all the signal estimates at iteration n for all users except user k, coming out of said corresponding signal processing component 2 can be modelled as {circumflex over (x)}k(n)=xk+{circumflex over (v)}k(n) where xk is the transmitted symbol for user k and {circumflex over (v)}k(n) is the corresponding estimated noise sample which is uncorrelated with x, which is a vector containing the transmitted symbols for all users, and also uncorrelated over time and iterations, but not over users at a given iteration, that is k(n)>=0, k(n), {circumflex over (v)}k(m)>=0 for n≠m, where n and m denote different iteration numbers, and the estimated noise correlation for user k and j at iteration n is defined as k(n), {circumflex over (v)}j(n)>=qkj; define the estimated noise covariance matrix Qk(n)= k(n), {circumflex over (v)} k(n)>, with elements determined as shown above; let ck(n) be the auxiliary vector that contains all signals received from user k at iteration n and all previous iterations, according to the following recursively defined vector of observables as input to the said linear iterative filter denoted by Λk(n), Under A1 and A2, the linear minimum mean square error estimate of said signal xk given said signal ck(n) is given by the output {tilde over (x)}k(n) of the recursive filter which is an updated estimate of the transmitted signal for user k at iteration n, defined as follows: description="In-line Formulae" end="lead"{tilde over (x)}k(n)={tilde over (x)}k(n-1)+mk(n)( {circumflex over (x)} k(n-1)-{tilde over (x)} k(n-1))description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"{tilde over (x)} k(n)={tilde over (x)} k(n-1)+Mk(n)({circumflex over (x)} k(n-1)-{tilde over (x)} k(n-1))description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"mk(n)=-wk(n) (I+Qk(n-1)-Wk(n))-1 description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Mk(n)=(I-Wk(n) )(I+Qk(n-1)-Wk(n)) -1description="In-line Formulae" end="tail" where for user k at iteration n mk(n) is the said first linear iterative filter, Mk(n) is the said second linear iterative filter, I is an identity matrix with ones on the diagonal and zeros everywhere else, wk(n) is a recursive, complex auxiliary vector and Wk(n) is a first recursive, complex auxiliary matrix, respectively, the recursive update equations for n=3,4, . . . are as follows: description="In-line Formulae" end="lead"wk(n)=wk(n-1) [I-(Hk(n-1)-1(I-W k(n-1))]-1description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Wk(n)=Wk(n-1) +(I-Wk(n-1))(Hk(n-1) )-1(I-Wk(n-1))description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Hk(n-1)-I+Qk(n-2) -Wk(n-1)description="In-line Formulae" end="tail" where Hk(n-1) is a second recursive, complex auxiliary matrix; the initial conditions with {tilde over (x)}k(0)=0 and x k(0)=0 are mk(1)=skt(SSt+σ2 I)-1, Mk(1)=S kt(SSt+σ2I)-1 for n=1 and wk(2)=skt(SSt+I)-1S k, Wk(2)=S kt(SSt+σ2I)-1S k for n=2, where sk is the linear constraint for user k, skt denotes the complex conjugate transpose of said vector sk, S k is the constraint matrix with column k deleted and S k denotes the complex conjugate transpose of vector S k. 13. A computer program product comprising: a computer usable medium having computer readable program code and computer readable system code embodied on said medium for communicating in a multiple access communication network, said computer program product comprising: computer readable code within said computer usable medium for performing the method steps of a method of communicating in a multiple access network by iteratively receiving OFDM packets, the method comprising the following steps: a) sample a receiver input signal consisting of signals from one or more antenna; b) add the input signal with one of a plurality of prior stored received packet sample estimates to determine a packet sample hypothesis; c) determine an information bit estimate from the sample hypothesis for storage in an information bit estimates list; d) determine an updated received packet sample estimate from the sample hypothesis for updating the plurality of prior stored estimates; e) subtract the updated sample estimate from the sample hypothesis to determine a noise hypothesis and provide the noise hypothesis as the receiver input signal; f) repeat steps a) to e) until at least one or more complete packets are accumulated in the information bit estimates list. 14. An iterative signal processing arrangement having: one or more pairs of first and second signal processing components, the pairs of components being in iterative configuration, each of the first signal processing components having as input one or more received signals dependent upon one or more transmitted signals, wherein for each said signal processing component pair the output of said first signal processing component is an estimate of a characteristic of a selected transmitted signal based on the current and one or more previous input signals received by said first signal processing component, which is input to said corresponding second signal processing component that provides a further estimate of said selected transmitted signal to the output of said second signal processing component, the outputs of all said second signal processing components of respective pairs are input to each said first signal processing components of all said pairs in a succeeding iteration cycle, wherein said first signal processing components consists of: at least two linear iterative filters wherein a first of said linear iterative filters outputs an estimate of a selected characteristic of a selected one of said transmitted signals to said second signal processing component, and a second of said iterative filters having the same inputs as said first linear iterative filter provides an estimate of a characteristic of a selected of one or more transmitted signals and then delays by one iteration cycle said estimate and outputs said delayed estimate to an input of said first linear iterative filter, wherein said first and second linear iterative filters provide a minimum least squared estimate of said selected transmitted signal subject to predetermined statistical models of said signals, and wherein said first and second linear iterative filters further consist of a switch the input of which at a first iteration is all received signals, and the input for subsequent iterations is the output of all second signal processing components wherein the output of said switch is input to a first summing device, and said first linear iterative filter receives as input the output of said first summing device which is input to a filter having taps that are recursively updated based on receiving one or more said received signals, the output of said first linear iterative filter is input to a second summing device the output of which becomes the output of said first signal processing component as well as being input to a first single iteration delay device the output of which is input to said second summing device, while said second linear iterative filter receives as input the output of said first summing device which is input to a second linear iterative filter having taps which are recursively updated based on receiving one or more said received signals the output of said second linear iterative filter is input to a third summing device the output of which is input to a second single iteration delay device, the output of which is input to said third summing device, the output of which is negated and input to said first summing device. 15. An iterative signal processing arrangement according to claim 14, wherein said first linear iterative filter provides a minimum least squared estimate of said selected transmitted signal subject to predetermined statistical models of said signals. 16. An iterative signal processing arrangement according to claim 14, wherein said second linear iterative filter provides a minimum least squared estimate of said selected transmitted signal subject to predetermined statistical models of said signals. 17. An iterative signal processing arrangement according to claim 14, wherein said filters in said first and a second linear iterative filters are of the type that conform to the following mathematical expression using the following assumptions, A1: The received signal is described as r=Sx+n, where S is the constraint matrix, containing all the linear channel constraints, x is a vector containing all transmitted information symbols and n is circularly symmetric complex Gaussian with covariance matrix cov n=σ2I, and where the noise variance σ2 and the constraint matrix S are known, A2: The interleaved code symbol estimates of the interfering users {circumflex over (x)}k(n) which is a vector containing all the signal estimates at iteration n for all users except user k , coming out of said corresponding signal processing component 2 can be modelled as {circumflex over (x)}k(n)=k+{circumflex over (v)}k(n) where xk is the transmitted symbol for user k and {circumflex over (v)}k(n) is the corresponding estimated noise sample which is uncorrelated with x, which is a vector containing the transmitted symbols for all users, and also uncorrelated over time and iterations, but not over users at a given iteration, that is k(n)>=0, k(n), {circumflex over (v)}k(n)>=0 for n≠m, where n and m denote different iteration numbers, and the estimated noise correlation for user k and j at iteration n is defined as k(n), {circumflex over (v)}j(n)>=qkj; define the estimated noise covariance matrix Qk(n)=k(n), {circumflex over (v)} k(n)>, with elements determined as shown above; let ck(n) be the auxiliary vector that contains all signals received from user k at iteration n and all previous iterations, according to the following recursively defined vector of observables as input to the said linear iterative filter denoted by Λk(n), Under A1 and A2, the linear minimum mean square error estimate of said signal xk given said signal ck(n) is given by the output xk(n) of the recursive filter which is an updated estimate of the transmitted signal for user k at iteration n, defined as follows. description="In-line Formulae" end="lead"mk(n)=-wk(n) (I+Qk(n-1)-Wk(n))-1 description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Mk(n)=(I-Wk(n) )(I+Qk(n-1)-Wk(n)) -1description="In-line Formulae" end="tail" where for user k at iteration n mk(n) is the said first linear iterative filter, Mk(n) is the said second linear iterative filter, I is an identity matrix with ones on the diagonal and zeros everywhere else, wk(n) is a recursive, complex auxiliary vector and Wk(n) is a first recursive, complex auxiliary matrix, respectively, the recursive update equations for n=3,4, . . . are as follows: description="In-line Formulae" end="lead"wk(n)=wk(n-1) [I-(Hk(n-1)-1(I-W k(n-1))]-1description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Wk(n)=Wk(n-1) +(I-Wk(n-1))(Hk(n-1) )-1(I-Wk(n-1))description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Hk(n-1)-I+Qk(n-2) -Wk(n-1)description="In-line Formulae" end="tail" where Hk(n-1) is a second recursive, complex auxiliary matrix; the initial conditions with xk(0)=0 and xk(0)=0 are mk(1)=skt(SSt+σ2 I)-1, Mk(1)=S kt(SSt+σ2I)-1 for n=1 and wk(2)=skt(SSt+I)-1S k, Wk(2)=S kt(SSt+σ2I)-1S k for n=2, where sk is the linear constraint for user k, skt denotes the complex conjugate transpose of said vector sk, S k is the constraint matrix with column k deleted and S k denotes the complex conjugate transpose of vector S k. 18. An iterative signal processing arrangement according to claim 14, wherein the output of said first signal processing component is de-interleaved and the output of said second signal processing component is interleaved. 19. An iterative signal processing arrangement according to claim 14, wherein the characteristic of a selected transmitted signal is a discrete time series representation of a said selected transmitted signal and where the output of said first signal processing component is a minimum least squared estimate of said selected transmitted signal subject to predetermined statistical models of said signals. 20. An iterative signal processing arrangement according to claim 14, wherein said first and second linear iterative filters provide a minimum least squared estimate of said selected transmitted signal subject to different predetermined statistical models of said signals. 21. An iterative decoding circuit for a wireless multiuser communications receiver comprising: a first signal processing means for receiving at least one received signal, said first signal processing means comprising at least two linear iterative filters such that: the first linear iterative filter provides an estimate of a selected received signal to an estimated signal output and; a second linear iterative filter provides estimates of at least one other received signal, delayed by one iteration cycle, to an input of said first linear iterative filter; a second signal processing means for receiving the estimated signal output of the first linear iterative filter and providing a further received signal estimate to the input of the first signal processing means in a succeeding iteration cycle of the decoding circuit, wherein the linear filters function in accordance with at least one predetermined recursive Bayesian expression, and wherein the predetermined recursive expression comprises the following recursive Bayesian estimation using the following assumptions A1: The received signal is described as r=Sx+n, where S is the constraint matrix, containing all the linear channel constraints, x is a vector containing all transmitted information symbols and n is circularly symmetric complex Gaussian with covariance matrix cov n=σ2I, and where the noise variance σ2 and the constraint matrix S are known; A2: The interleaved code symbol estimates of the interfering users {circumflex over (x)} k(n) which is a vector containing all the signal estimates at iteration n for all users except user k, coming out of said corresponding signal processing component 2 can be modelled as {circumflex over (x)}k(n)=xk+{circumflex over (v)}k(n) where xk is the transmitted symbol for user k and {circumflex over (v)}k(n) is the corresponding estimated noise sample which is uncorrelated with x, which is a vector containing the transmitted symbols for all users, and also uncorrelated over time and iterations, but not over users at a given iteration, that is k(n)>=0, k(n), {circumflex over (v)}k(m)>=0 for n≠m, where n and m denote different iteration numbers, and the estimated noise correlation for user k and j at iteration n is defined as k(n), {circumflex over (v)}j(n)>=qkj; define the estimated noise covariance matrix Qk(n)= k(n), {circumflex over (v)} k(n)>, with elements determined as shown above; let ck(n) be the auxiliary vector that contains all signals received from user k at iteration n and all previous iterations, according to the following recursively defined vector of observables as input to the said linear iterative filter denoted by Λk(n), Under A1 and A2, the linear minimum mean square error estimate of said signal xk given said signal ck(n) is given by the output {tilde over (x)}k(n) of the recursive filter which is an updated estimate of the transmitted signal for user k at iteration n, defined as follows: description="In-line Formulae" end="lead"{tilde over (x)}k(n)={tilde over (x)}k(n-1)+mk(n)( {circumflex over (x)} k(n-1)-{tilde over (x)} k(n-1))description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"{tilde over (x)} k(n)={tilde over (x)} k(n-1)+Mk(n)({circumflex over (x)} k(n-1)-{tilde over (x)} k(n-1))description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"mk(n)=-wk(n) (I+Qk(n-1)-Wk(n))-1 description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Mk(n)=(I-Wk(n) )(I+Qk(n-1)-Wk(n)) -1description="In-line Formulae" end="tail" where for user k at iteration n mk(n) is the said first linear iterative filter, Mk(n) is the said second linear iterative flute, I is an identity matrix with ones on the diagonal and zeros everywhere else, wk(n) is a recursive, complex auxiliary vector and Wk(n) is a first recursive, complex auxiliary matrix, respectively, the recursive update equations for n=3,4, . . . are as follows: description="In-line Formulae" end="lead"wk(n)=wk(n-1) [I-(Hk(n-1)-1(I-W k(n-1))]-1description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Wk(n)=Wk(n-1) +(I-Wk(n-1))(Hk(n-1) )-1(I-Wk(n-1))description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"Hk(n-1)-I+Qk(n-2) -Wk(n-1)description="In-line Formulae" end="tail" where Hk(n-1) is a second recursive, complex auxiliary matrix; the initial conditions with {tilde over (x)}k(0)=0 and x k(0)=0 are mk(1)=skt(SSt+σ2 I)-1, Mk(1)=S kt(SSt+σ2I)-1 for n=1 and wk(2)=skt(SSt+I)-1S k, Wk(2)=S kt(SSt+σ2I)-1S k for n=2, where sk is the linear constraint for user k, skt denotes the complex conjugate transpose of said vector sk,S k is the constraint matrix with column k deleted and S k denotes the complex conjugate transpose of vector S k.