GB2403103A - Multi-user detection and decoding - Google Patents

Abstract

An iterative multi-user detector and decoder includes a joint multi-user detector (DET) and separate soft demodulators (SDEM1-K), decoders (DEC1-K) and modulators (SM1-K) which provide updated estimates to the detector (DET) for the next iteration, through an estimated multi-user channel (EMA) which uses channel parameters estimated by a channel estimator (CE). The decoders (DEC1-K) use a weak decoding algorithm during initial iterations and a strong decoding algorithm during subsequent iterations of the detecting and decoding process, thereby avoiding convergence bottlenecks that would occur if strong decoding were used for all iterations.

Description

2403 1 03 Multi-user Detection and Decoding

Field of the Invention

The present invention relates to a method, apparatus and computer program for multi-user detection and decoding of signals.

Background

Multi-user detection and decoding (MUD) techniques allow detection and decoding of transmissions by two or more mutually interfering users over an interference channel.

In general, MUD involves a detection process in which the received composite signal is resolved into symbol estimates for each user, and a decoding process in which the symbols are decoded to recover their data content, using a forward error correction (FEC) decoding algorithm. An optimal joint decoder combines these two processes using a maximum likelihood decoding technique to minimize the probability of decoder error. This technique has a complexity that increases exponentially with the number of users and the FEC codeword length, and may not be possible with certain FEC coding techniques such as Turbo codes. Hence, it is necessary to devise sub-optimal techniques with reduced complexity.

One sub-optimal approach is separate the detection and decoding processes. Joint decisions are made on each symbol in the detection process, and the symbol streams are then independently decoded using conventional decoding techniques.

Another approach is iterative decoding, where soft decisions by the detector are input to separate decoders for each user, and the soft decisions by the decoders are fed back iteratively to the detector. Examples of iterative decoding algorithms are disclosed in An Iterative Multiuser Decoder for Near-Capacity Communications', Moher M, IEEE Transactions on Communications vol. 46, No. 7, July 1998 and 'Multiuser Decoding for Multibeam systems', Moher M, IEEE Transactions on Vehicular Technology, July 2000, Volume 49, Number 4, pages 1226- 1234.

A problem associated with iterative decoding in general is that the iterations may not converge under certain operating conditions of the receiver; see for example 'Convergence of Iterative Coding', ten Brink S. IKE Electronics Letters, Vol. 35, No.l0, May 1999, pp. 806 - 808 which discloses the use of extrinsic information transfer (EXIT) charts as a tool for convergence analysis.

Statement of the Invention

According to one aspect of the present invention, there is provided a joint multi- user detector and separate soft demodulators, decoders and modulators, which provide updated estimates to the detector for the next iteration. The decoders use a weak decoding algorithm during initial iterations and a strong decoding algorithm during subsequent iterations of the detecting and decoding process.

Weak decoding algorithms have better performance at low signal to noise ratios, but worse performance at high signal to noise ratios than strong decoding algorithms. The present inventor has discovered that, by switching from weak decoding at initial multi-user detecting/decoding iterations to strong decoding at subsequent multi-user detecting/decoding iterations, convergence can be achieved at lower carrier to interference ratios than could be achieved using either strong or weak decoding alone.

According to another aspect of the present invention, there is provided an iterative decoder, comprising: an outer decoder for receiving a set of prior coded bit probabilities and generating a set of posterior coded bit probabilities; an inner decoder for receiving as prior coded bit probabilities the posterior coded bit probabilities output by the outer decoder and generating a set of posterior coded bit probabilities, which are provided as the set of prior coded bit probabilities for input to the outer decoder in the next iteration, if any; wherein the outer decoder uses a weak decoding algorithm for an initial one or more iterations and a strong decoding algorithm for a subsequent one or more iterations.

Both aspects of the invention extend to method, apparatus and computer program categories.

Brief Description of the Drawings

Specific embodiments of the present invention will now be described with reference to the accompanying drawings, in which: Figure 1 is a schematic diagram of multiple transmitters transmitting over a multiple access channel; Figure 2 is a schematic diagram of a multi-user detector and decoder in an embodiment of the present invention; Figures 3a to 3m are graphs of bit and packet error rate against Eb/No in simulation results of the multi-user detector and decoder; Figure 4 is a schematic diagram showing the grouping of the multi-user detector and decoder for the purposes of mutual information transfer analysis; and Figure 5 is an EXIT chart for two different codes; and Figures 6a to 6h are EXIT charts analysing the convergence of the multi user detector and decoder for different C/I values and different numbers of users.

Detailed Description of the Embodiments

Transmitter Figure 1 shows a plurality K of users comprising, for the purpose of this discussion, respective bit sequences b[i]...bK[i] encoded by encoders CI...CK to produce coded sequences d'[i]...dK[i], which are interleaved by respective interleavers n...IlK to generate interleaved sequences lI'(d'[i])...IIK(dK[i]), which are in turn modulated by modulators M'...MK to generate respective sequences of modulated symbols x[i]...xK[i] at time i.

In one specific example, the encoders CI...CK are Turbo encoders i.e. parallel systematic recursive convolutional encoders, one or more but not all of which have an interleaver at the input, as described for example in 'Near Shannon limit error-correcting coding and decoding: Turbo codes', Berrou, C., Glavieux, A. and Thitimajshima, P. Proc. Of ICC '93, pp 10641070. The modulators M...MK may be 16QAM modulators, as used for example in the Inmarsat_ MPDS (mobile packet data service).

Multiple Access Channel The modulated symbol sequences x[i]...xK[i] are transmitted on a multiple access channel MA such that a set of symbol sequences y[i]...yK[i] are received at a receiver.

The effect of the multiple access channel MA may be modelled as: y[i] = AWx[i] + n[i] (1) where y[i] is the complex vector channel output, A is a normalised correlation matrix representing the cross-correlation between symbol sequences, W is a diagonal matrix representing the amplitudes of each user and n[i] represents the channel noise.

Receiver Architecture The received signal y[i]...yK[i] is detected and decoded by an iterative MUD receiver as shown in Figure 2. A multi-user detector DET takes as its input the output of the multiple access channel MA and the current soft estimates (initialised to zero at the first iteration) of each user's average contribution to the received signal, subject to the current probability distributions on the data. The detector DET outputs updated soft estimates by subtracting the current soft estimates of all the interfering users. The soft estimates for the respective users are soft demodulated by soft demodulators SDEM'...SDEMK, which calculate the posterior probabilities of each possible symbol of the modulation constellation. For example, with a 16QAM scheme, for each input symbol a probability is calculated of that symbol being each of the possible 16 symbols of the constellation. The corresponding soft detected bits are reordered by deinterleavers n- t...nK' and input to decoders DEC'...DECK which refine the probabilities of the coded bits derived from the soft demodulators SDEM...SDEMK by taking into account the knowledge of the FEC code. The bits are reordered once again by respective interleavers [I'...nK and output to soft modulators SM...SMK, which produce conditional expectations of the coded and modulated symbols according to the posterior probabilities calculated by the decoders DEC...DECK. These average symbols are input to a model of an estimated multiple access channel EMA which updates the channel estimates for each user, on the basis of estimated channel parameters derived by a channel estimator CE, and feeds these back to the multi-user detector DET for the next iteration.

The receiver architecture may be implemented in software, programmed for example into a digital signal processor (DSP) or other hardware or firmware, which may form part of a terminal. The functional blocks shown in Figure 2 do not necessarily correspond to discrete hardware components.

Receiver Functional Description

Multi-user detector The multi-user detector DET has the following inputs: y[i] a sequence of complex K-vectors (for K users) received from the multiple access channel EMA {9[il---YK[il} a set of sequences of complex K-vectors from the estimated channel EMA m[i]l M[i] = . a sequence of complex K x K matrices. The row vector m[i]k m[i]K is a filter to be used for user I. The multi-user detector DET has the following outputs: x[i] a sequence of complex K- vectors. The component xk[i]is the new estimate of symbol i for user k.

ask estimated residual interference plus noise variance for user k.

The multi-user detector DET has the following operation: to For a synchronous channel, Xk[i] (mk[i],(y[i] >,9,[i])) (2) This is the inner product between the filter for the user k and the results of cancelling all the estimated components other than user k from the channel output. For an asynchronous channel, each sequence xk[i] must be delayed and equalised to compensate for symbol timing and frequency offset. This may be done by an acquisition stage of the receiver.

The sequence of matrices M[i] represents a time-varying matrix filter. In the simplest case, this may be a diagonal matrix of complex values which representing gain and phase. These are assumed to be slowly varying and are estimated from unique words at the beginning and end of a burst.

The residual plus noise interference for each user is estimated from the completely cancelled signal: nk[i] = (mk[i],(y[i] >,y,[i])) (3) using a variance estimation technique: k L - 1 (n k [i] L it, n k [ j] (4) where L is the number of symbols in the bursts.

Soft Demodulator Each soft demodulator SDEMk has the following inputs: xk[i] sequence of complex numbers corresponding to the soft symbol estimates for user k Q=(Qo, Q5) An ordered set containing the normalised complex constellation values (assuming QAM, otherwise the cardinality will be different) {sb: b = 0,1,2,3} A set containing the indices of the constellation points in Q that correspond to bit b being equal to zero.

(---K) Noise plus residual interference estimates for each user the following outputs: (p k[i],pk[i],pk[ilPk[i]) A sequence of 4-vectors (in the case of QAM).

Element Pk [i] is the prior probability, between O and l, that bit b of symbol i for user k is zero and calculates the bit probabilities as follows: P k [i] = >; ll(X k f i] Q. ) JE5b where is the zero mean, variance Ok Gaussian probability density function.

Channel Interleaver Each channel interleaves and puncturer Elk receives as input the data and parity bits from the corresponding coder Ck and interleaves and punctures them to generate sets of bits each corresponding to one symbol for modulation. This type of interleaves and puncturer is used in the Inmarsat_ IPDS. Each user uses the same interleaving and puncturing pattern.

Soft Decoder Each soft decoder SDECk has the following inputs: Nc The number of decoding iterations to perform for each MUD iteration Elk, CHANNEL The channel interleaver for the user k Elk, TURBO The Turbo interleaver for the user k (pkp],pk[iIp2[ilp3 [i]) A sequence of 4-vectors (in the case of QAM).

Element ph [i] iS the prior probability, between O and 1, that bit b of symbol i for user k is zero [i] A sequence of scalars representing the prior probability that bit i for user k is zero and the following outputs: (Pk[iIpk[i],p2[ilp3[i]) A sequence of 4-vectors (in the case of QAM).

Element pb [i] iS the posterior probability, between O and 1, that bit b of symbol i for user k is zero [i] A sequence of scalars representing the posterior probability that bit i for user k is zero The posterior coded and uncoded bit probabilities are calculated from the prior coded and uncoded bit probabilities using an iterative "soft-in/soft-out" Turbo decoder.

Techniques for iterative Turbo decoding are well-known in the art, for example: 'Iterative Decoding of Binary Block and Convolutional Codes', Hagenauer J. IEEE Transactions on Information Theory, Vol. 42, No. 2, March 1996.

Soft Modulator Each soft modulator SMk has the following inputs: Q = (Qo,. . Q's) An ordered set containing the normalised complex constellation values (assuming QAM, otherwise the cardinality will be different) {B.: j = 0,1, 151 A set containing the indices of the bits in j which are equal to zero. For example, Be is the set {0, 1, 2, 3) while B5 is the set { 1, 3} (Pk[i],Pk[iIp2[ilp3[i]) A sequence of 4-vectors (in the case of QAM).

Element pb[i] is the posterior probability, between O and 1, that bit b of symbol i for user k is zero and the following output: x[i] a sequence of complex scalars representing the new soft estimate of symbol i for user j The estimates are calculated as the expectation of the signal constellation according to the current symbol probabilities: X k [i] = QJ J (6) J=O where the symbol probabilities are calculated according to J [n Pk [ 1][n ( Pk [i])1 (7) he B. he B. where B j is the complement set (i.e. the indices of the bits that are ones).

Channel Estimator The channel estimator CE has the following input: x[i] a sequence of complex scalars. xk[i] represents the new soft estimate of symbol i for user k.

and outputs the current estimated channel parameters (phase, frequency, timing and amplitude). The channel estimator estimates the channel parameters for each of the sequences corresponding to the different users.

Estimated Multiple Access Channel The estimated multiple access channel EMA has the following inputs: x[i] a sequence of complex scalars. xk[i] represents the new soft estimate of symbol i for user k - The current estimated channel parameters and the following outputs: {Y'Pl---YK[il} a set of sequences of complex K-vectors. The vector sequence yk[i] corresponds to the current estimated contribution of user k to the channel output.

The estimated multiple access channel EMA models the effect of the actual multiple access channel according to the current estimates of the channel parameters. For example, if the channel is symbol synchronous, W I k 9 k [i] = W.2k k [i] (8) WKk where we is the estimated complex gain from user k to output j.

Improving Convergence Varying Decoding Iterations For each MUD iteration, the number of iterations ND of the soft decoders SDECk is variable. It has been discovered that, for early MUD iterations, it is beneficial to use a low number of decoding iterations, as this improves convergence by giving coding gain at low signal to interference-plus-noise ratio, and also reduces the total complexity of the algorithm. In one example using Turbo decoding and to MUD iterations, only one Turbo iteration was used for MUD iterations l to 5, while for MUD iterations 6 to IO, respectively 6 to 10 Turbo iterations were used.

Simulation Results Figures 3a to 3m show simulation results with the variable number of decoding iterations described above, and the following simulation parameters: - Inmarsat_ IPDS MESP20 packets (i.e. 20 ms, 33,600 symbols/s, 16QAM) - symmetric interference patterns - K=2,4and7 Figure 3a shows the improvement in BER for two users, with the number of MUD iterations shown by dashed lines. The solid line shows the performance for a single user with no interference, using 10 Turbo iterations. C/l power ratios are quoted per user. The BER for two users with MUD approaches single user performance.

Figures 3b to 3f show the simulation results for two users, with BER and PER plotted against Eb/No, for C/I = 15, 12, 9, 6 and 3 dB per user respectively.. For C/I = lS and 12 dB, the loss compared to a single user is minimal - less than 0.2 dB at a bit error rate of 10-4. For C/I = 3 dB, the loss increases to 6 dB. The intercept point is defined as the Eb/No value where PER = 10-3.

Figures 3g to 3j show the simulation results for four users, with C/I = 15, 12, 9 and 6 dB per user respectively, giving similar characteristics to the two- user results. Lower interference levels (15 and 12 dB) result in near single-user performance, while higher interference (9 and 6 dB) results in increased degradation. Convergence is no longer possible for C/I < 5 dB.

Figures 3k to 3m show the results for seven users, with C/1 = 15, 12 and 9 dB per user respectively, showing a loss of almost 0.5 dB for C/I = 15 dB, increasing to 4 dB for C/I = 9 dB. The receiver did not converge for C/I = 6 dB or below.

EXIT Analysis The convergence properties of the MUD receiver will now be analysed without full system simulation by the use of extrinsic information transfer (EXIT) charts, in order to explain the improvement in convergence by varying the number of decoding iterations lS between MUD iterations. Figure 4 shows how the components of the MUD receiver and decoder of Figure 2 are grouped together into inner and outer decoders by analogy with serially concatenated codes. The soft modulator SMk, canceller C comprising the estimated multiple access channel EMA and the multi-user detector DET, and the soft demodulator SDEMk are grouped together as an inner decoder ID which takes as its input the coded bit probabilities PB for the user of interest, together with interference estimates from all the other users, and outputs coded bit probabilities PA. The decoder DECk forms an outer decoder, which takes as input the coded bit probabilities PA, deinterleaved by the deinterleaver II-ik and depunctured, and outputs the coded bit probabilities PB, which are interleaved by the interleaver k, punctured and provided as input to the inner decoder.

EXIT Simulation The mutual information transfer characteristics of the inner and outer decoder were Monte Carlo simulated as follows. For the outer decoder, a random frame of binary data was generated. Random prior probabilities on the bits are generated by transmitting the bits x[i] over an auxiliary binary input AWGN (additive white Gaussian noise) channel with noise variance 2 to produce the received sequence z[i], and setting: p (x[i]) aexp(- (Z[i]-X[i])2) (9) where a is a normalization constant. This has the effect of producing normally distributed log- likelihood ratios and is only used for generation of random probabilities; it has nothing to do with actual data transmission. The resulting PA models the output of the inner decoder. The result is depunctured (meaning that punctured bits are set to uniform probability), de- interleaved and input to the decoder, which performs a number of decoding iterations. The output is then punctured to produce the output probabilities PB.

The input and output mutual information IA, IB are calculated as described below. The process is repeated for a large number of frames and average values of IA and IB are calculated.

For the inner decoder ID, a random frame of binary data is generated for each of K users, encoded, interleaved and punctured to produce the binary sequences xk[i], and are then modulated to produce the associated symbol sequences. Random probabilities pB(xk[i]) on the punctured bits for each user are generated by transmitting the bits xk[i] over an auxiliary binary input AWGN channel with noise variance c'2, as with the outer decoder OD. The received vector signal y is formed by passing the modulated user sequences through a simulated satellite channel model with a fixed SNR and C/I. The values of pB(xk[i]) are soft modulated, passed through the multi-user canceller C (which also takes y as an input) and then soft demodulated to produce pA(xk[i]). The input and output mutual information IA and IB are calculated as described below. The process is repeated with a large number of random frames and average values of IA and IB are calculated.

Given a bit sequence x[i] and the corresponding probabilities p(x[i]), the mutual information I(x; p) is calculated as follows: Calculate the log likelihood ratios: \[i] = log p(x[i]) = 1) (10) p(X[i]) = 0) Calculate empirical conditional probability distributions P(l I x = 0) and P(\ I x = I) by forming normalised histograms (using a fixed bin width) from the sets {[i]: x[i] = 0} and {[i]: x[i] = 1}.

Calculate the empirical mutual information: I=>,P(lIx)log,,,( ) (l1) Simulation Results Figure 5 shows the EXIT transfer chart for two different codes. The mutual information IA (input to the outer decoder) is shown on the horizontal axis, while IB (input to the inner decoder) is shown on the vertical axis. An output mutual information of zero means that the decoder has no knowledge of the transmitted data, while IB = I means that it has perfect knowledge, giving zero error rate. The transfer function of the rate [/2 MPDS decoder is shown for l, 2, 3, 4, 5 and lo iterations. The curve for 1 iteration is dashed, while the rest are solid; the characteristics for iterations 2 to 10 are all fairly similar. For IA less than approximately 0.55, a single iteration of the Turbo decoder provides the greatest

IB

Also shown is the transfer characteristic of a maximal free distance 4 state rate I/2 convolutional code. For IA less than about 0.5, it performs better than the Turbo decoder, but is much slower to reach the ideal IB = 1. The circles indicate the single-user operation points for SNR values of EB/No from 3 to 10 dB. Hence, IB for a particular SNR is given by the intersection of a vertical line through the SNR point with the transfer characteristic curve. The Turbo code yields good single-user performance at EB/No > 3.5 dB, a gain of about 3 dB over the convolutional code.

Figures 6a to 6h show EXIT transfer charts for various numbers of users K, C/I levels and EdNo values. On each chart, the characteristics of the outer decoder with ND = 1 is shown by a dashed line, with ND = 10 by a solid line, and the characteristics of the inner decoder are shown with dotted lines, with characteristics for different values of shown on each chart, and these values are shown in dB where the line intersects the top of the chart.

Each MUD iteration "bounces" between the characteristics of the inner and outer decoders, as the mutual information output from one becomes the input to the other. The algorithm will not converge unless there is a "tunnel" between the inner and outer decoder characteristics. Figure 6a shows an example for K=4, C/I = 9dB and Eb/No = 5 dB. The first MUD iteration starts with no information, at (0, 0). The first cancellation step gives IA 0.35, labelled 1, which is input to the Turbo decoder. At each decoding step, we choose the higher of the ND = 1 and the ND = 10 curves, to achieve the fastest convergence. After the first decoding iteration we have IB 0.35, which is traced across to the canceller curve, and so on for successive MUD iterations labelled 2 to 6. At the 6 iteration, the curve for ND = 10 is higher than the curve for ND = 1, SO 10 decoding iterations can be used per MUD iteration for faster convergence. However, using ND = 10 for each MUD iteration would prevent convergence after the third MUD iteration, as the ND = 10 curve intersects the canceller curve around IA 0.S.

Figures 6b to 6d show the transfer charts for K=2 and C/I = 9, 6 and 3 dB respectively. From these, we can predict convergence thresholds of Eb/No = 3.5, 4 and 6 dB respectively. The corresponding results where BER = 10- 3 from Figures 3d to 3f are 4.25, 5.5 and 9 dB.

Figures be and 6f show the transfer charts for 4 users with C/I = 9 and 6 dB respectively. The predicted convergence thresholds are at Eb/No 4.5 and 9 dB respectively. The corresponding results from Figures 3i and 3j are 5.25 and 8.25 dB.

Figures 6g and 6h are transfer charts for 7 users with C/I = 12 and 9 dB respectively. The predicted convergence thresholds are at Eb/No 4.5 and 9 dB respectively. The corresponding results from Figures 31 and 3m are 5 and 7.5 dB.

The simulation results show a C/I threshold below which performance rapidly deteriorates. This sudden degradation is due to failure of the MUD iterations to converge, as a result of a combination of the characteristics of the multi-user detector and the decoder. The C/I threshold is reduced by switching from a single decoding iteration per MUD iteration to multiple decoding iterations.

The EXIT analysis may be extended to different codes, by simulating the appropriate code characteristics and comparing them to the MUD curves.

It is envisaged that alternative embodiments of the invention may use more than one decoding iteration initially, while using a greater number of decoding iterations during later MUD iterations. Furthermore, different decoding algorithms could be used between the initial and subsequent MUD iterations, provided the different decoding algorithms operate on the same codes.

Claims (18)

1. Claims 1. A method of iterative multi-user detection and decoding,

   comprising: a) receiving from a multiple-access interference channel a signal containing a plurality of mutually interfering transmissions, each comprising a forward error correction codeword of predetermined length modulated with a predetermined modulation scheme; b) jointly estimating each of the plurality of transmissions from the received signal and from estimates of others of the plurality of transmissions; c) separately soft decoding each of the estimated plurality of transmissions estimated at step b), to generate soft decisions on the encoded bits of the corresponding codewords; d) generating separate updated estimates of each of the plurality of transmissions from the soft decisions output at step c); e) providing the updated estimates from step d) as input to step b); and f) repeating steps b) to e) until a predetermined condition is satisfied; wherein step c) is performed using a weak decoding algorithm at an initial one or more iterations of steps b) to e), and using a strong decoding algorithm at a subsequent one or more iterations of steps b) to e).
2. 2. The method of claim 1, wherein the weak decoding algorithm comprises a lesser number of iterations of an iterative decoding algorithm, and the strong decoding algorithm comprises a greater number of iterations of the iterative decoding algorithm.
3. 3. The method of claim 2, wherein the weak decoding algorithm comprises a single iteration of the iterative decoding algorithm and the strong decoding algorithm comprises a plurality of iterations of the iterative decoding algorithm.
4. 4. The method of claim 1 or 2, wherein the strong decoding algorithm comprises a number of iterations which increases with successive iterations of steps b) to e).
5. 5. The method of claim l, wherein the weak decoding algorithm is of a different decoding type, but operates to decode the same code, as the strong decoding algorithm.
6. 6. The method of any preceding claim, wherein step e) includes modifying the updated estimates using a model of the multiple access interference channel and providing the modified updated estimates as input to step b).
7. 7. The method of claim 6, including estimating one or more parameters of the multiple access interference channel and providing the one or more estimated parameters to the model of the multiple access interference channel.
8. 8. A method of iterative decoding in which, for each iteration, a set of prior coded bit probabilities are input to an outer decoder which generates as output a set of posterior coded bit probabilities, and the posterior coded bit probabilities output by the outer decoder are input as prior coded bit probabilities to an inner decoder which generates as output a set of posterior coded bit probabilities, wherein the set of posterior coded bit probabilities output by the inner decoder are provided as the set of prior coded bit probabilities for input to the outer decoder in the next iteration, if any, wherein the outer decoder uses a weak decoding algorithm for an initial one or more iterations and a strong decoding algorithm for a subsequent one or more iterations.
9. 9. An iterative multi-user detector and decoder, comprising: - a receiver for receiving from a multiple-access interference channel a signal containing a plurality of mutually interfering transmissions, each comprising a forward error correction codeword of predetermined length modulated with a predetermined modulation scheme; a multi-user detector for jointly estimating each of the plurality of transmissions from the received signal and from estimates of others of the plurality of transmissions; a plurality of separate soft decoders for decoding the corresponding plurality of transmissions estimated by the multi-user detector, to generate soft decisions on the encoded bits of the corresponding codewords; and a plurality of separate soft modulators for generating corresponding separate updated estimates of each of the plurality of transmissions from the soft decisions output by the soft decoders; - wherein the multi-user detector is arranged to receive the updated estimates for the next iteration of the multi-user detector and decoder; and wherein the soft decoders are arranged to use a weak decoding algorithm at an initial one or more iterations of the iterative multiuser detector and decoder, and to use a strong decoding algorithm at a subsequent one or more iterations of the iterative multi-user detector and decoder.
10. 10. The multi-user detector and decoder of claim 9, wherein the weak decoding algorithm comprises a lesser number of iterations of an iterative decoding algorithm, and the strong decoding algorithm comprises a greater number of iterations of the iterative decoding algorithm.
11. 11. The multi-user detector and decoder of claim 10, wherein the weak decoding algorithm comprises a single iteration of the iterative decoding algorithm and the strong decoding algorithm comprises a plurality of iterations of the iterative decoding algorithm.
12. 12. The multi-user detector and decoder of claim 10 or 11, wherein the strong decoding algorithm comprises a number of iterations that increases with successive iterations of the multi-user detector and decoder.
13. 13. The multi-user detector and decoder of claim 9, wherein the weak decoding algorithm is of a different decoding type from, but operates to decode the same code as, the strong decoding algorithm.
14. 14. The multi-user detector and decoder of any one of claims 9 to 13, further including a simulator of the multiple access interference channel arranged to modify the updated estimates and provide the modified updated estimates to the multi-user detector.
15. is. The multi-user detector and decoder of claim 14, further including a channel estimator for estimating one or more parameters of the multiple access interference channel and providing the one or more estimated parameters to the simulator.
16. 16. An iterative decoder, comprising: an outer decoder for receiving a set of prior coded bit probabilities and generating a set of posterior coded bit probabilities; - an inner decoder for receiving as prior coded bit probabilities the posterior coded bit probabilities output by the outer decoder and generating a set of posterior coded bit probabilities, which are provided as the set of prior coded bit probabilities for input to the outer decoder in the next iteration, if any; - wherein the outer decoder uses a weak decoding algorithm for an initial one or more iterations and a strong decoding algorithm for a subsequent one or more iterations.
17. 17. A computer program arranged to perform the method of any one of claims l to 8 when executed by suitably arranged apparatus.
18. 18. A method of multi-user detection and decoding substantially as herein described with reference to and/or as shown in the accompanying drawings.

    l9. A multi-user detector and decoder substantially as herein described with reference to and/or as shown in the accompanying drawings.