Multiuser demodulation and iterative decoding for frequency-hoppednetworks

Demodulation and decoding for frequency-hopped spread-spectrum multiple-access (FH/SSMA) systems have been traditionally conducted by conventional single-user (noncollaborative) demodulation and error- and erasure-correcting decoding techniques. In this paper, we study the demodulation and decoding aspects of collaborative multiuser reception for FH/SSMA and propose methods which increase the number of users the system can support. In particular, we propose and analyze the optimum maximum a priori probability demodulation of multiple symbols or type, and the use of iterative multiuser decoding after the demodulation. Since hits from one or two other users are the most likely hit events in FH/SSMA, the joint demodulation of two or of three users is performed based on likelihood ratio tests. M-ary frequency-shift keying modulation with noncoherent demodulation and Reed-Solomon codes with hard-decision minimum distance decoding are used in the FH/SSMA system. Results are derived for both synchronous and asynchronous frequency-hop systems. The performance of the proposed multiuser detector in additive white Gaussian noise and flat Rayleigh fading channels is evaluated. Scenarios when all simultaneous users or only a subset of them are collaboratively demodulated and decoded are simulated     

Adaptive iterative multiuser decision feedback detection

Adaptive iterative receivers which combine multiuser decision-feedback detection with maximum a posteriori (MAP) decoding and soft feedback are presented for synchronous coded direct sequence-code-division multiple access. Both successive and parallel demodulation of users are considered. Optimal filters are derived using both minimum mean squared error and least squares (LS) criteria. The latter assumes short (repeated) spreading codes and that the users to be demodulated simultaneously transmit training sequences. The LS criterion does not require prior knowledge or estimates of spreading codes and channels. Simulation results show that the adaptive receiver can perform significantly better than the standard (soft) interference canceller, since the adaptive algorithm attempts to measure and exploit the second-order statistics between the input and output of the MAP decoder. With limited training, successive feedback and decoding performs significantly better than parallel feedback. The effect of code rate on performance is examined, and reduced-rank versions of the adaptive LS algorithms, which can reduce training overhead, are also presented.     

Iterative multiuser detection for coded CDMA signals in AWGN andfading channels

A new iterative receiver for joint detection and decoding of code division multiple access (CDMA) signals is presented. The new scheme is based on a combination of the minimum mean square error (MMSE) criterion and the turbo processing principle by Hagenauer (see Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, p.1-9, 1997). The complexity of the new scheme is of polynomial order in the number of users. The new scheme is applicable to two situations: (a) when the receiver is capable of decoding the signals from all users and (b) when the receiver is only capable of decoding the signals from a subset of users. In the first scenario, we establish that the proposed receiver achieves superior performance to the iterative soft interference cancellation technique under certain conditions. On the other hand, in the second scenario, we argue that the proposed receiver outperforms both the iterative soft interference canceler and the iterative maximum a posteriori (MAP) receiver because of its superior near-far resistance. For operation over fading channels, the estimation of the complex fading parameters for all users becomes an important ingredient in any multiuser detector. In our scheme, the soft information provided by the decoders is used to enhance this estimation process. Two iterative soft-input channel estimation algorithms are presented: the first is based on the MMSE criterion, and the second is a lower-complexity approximation of the first. The proposed multiuser detection algorithm(s) are suitable for both terrestrial and satellite applications of CDMA     

Correction of extrinsic information for iterative decoding in a serially concatenated multiuser DS-CDMA system

The system under study is a coded asynchronous DS-CDMA system with orthogonal modulation in time-varying Rayleigh fading multipath channels. Information bits are convolutionally encoded, block interleaved, and mapped to M-ary orthogonal Walsh codes, where the last step is essentially a process of block coding. This paper aims at tackling the problem of joint iterative decoding of this serially concatenated inner block code and outer convolutional code and estimating frequency-selective fading channels in multiuser environments. The (logarithm) maximum a posteriori probability, (Log)-MAP criterion is used to derive the iterative decoding schemes. In our system, the soft output from inner block decoder is used as a priori information for the outer decoder. The soft output from outer convolutional decoder is used for two purposes. First, it may be fed back to the inner decoder as extrinsic information for the systematic bits of the Walsh codeword. Secondly, it is utilized for channel estimation and multiuser detection (MUD). We also show that the inner decoding can be accomplished without extrinsic information, and in some cases, e.g., when the system is heavily loaded, yields better performance than the decoding with unprocessed extrinsic information. This implies the need for correcting the extrinsic information obtained from outer decoder. Different schemes are examined and compared numerically, and it is shown that iterative decoding with properly corrected extrinsic information or with non-extrinsic/extrinsic adaptation enables the system to operate reliably in the presence of severe multiuser interference, especially when the inner decoding is assisted by decision directed channel estimation and interference cancellation techniques.     

A low-complexity SISO multiuser detector for iterative decoding of asynchronous CDMA systems with convolutional codes

The optimal decoding scheme for asynchronous code-division multiple-access (CDMA) systems that employ convolutional codes results in a prohibitive computational complexity. To reduce the computational complexity, an iterative receiver structure was proposed for decoding multiuser data in a convolutional coded CDMA system. At each iteration, extrinsic information is exchanged between a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders. A direct implementation of the optimal SISO multiuser detector, however, has exponential computational complexity in terms of the number of users which is still prohibitive for channels with a medium to large number of users. This paper presents a low-complexity SISO multiuser detector using the decision-feedback scheme, of which tentative hard decisions are made and fed back to the SISO multiuser from the previous decoding output. In the proposed scheme, the log-likelihood ratios (LLR) as well as the tentative hard decisions of code bits are fed back from the SISO decoders. The hard decisions are used to constrain the trellis of the SISO multiuser detector and the LLRs are used to provide a priori information on the code bits. The detector provides good performance/complexity tradeoffs. The computational complexity of the detector can be set to be as low as linear in the number of users. Simulations show that the performance of the low-complexity SISO multiuser detector approaches that of the single-user system for moderate to high signal-to-noise ratios even for a large number of users.     

A RAKE-based iterative receiver for space-time block-coded multipath CDMA

A turbo multiuser receiver is proposed for space-time block and channel-coded code division multiple access (CDMA) systems in multipath channels. The proposed receiver consists of a first stage that performs detection, space-time decoding, and multipath combining followed by a second stage that performs the channel decoding. A reduced complexity receiver suitable for systems with large numbers of transmitter antennas is obtained by performing the space-time decoding along each resolvable multipath component and then diversity combining the set of space-time decoded outputs. By exchanging the soft information between the first and second stages, the receiver performance is improved via iteration. Simulation results show that while in some cases a noniterative space-time coded system may have inferior performance compared with a system without space-time coding in a multipath channel, proposed iterative schemes significantly outperform systems without space-time coding, even with only two iterations. Furthermore, the performance loss in the reduced-complexity receiver due to decoupling of interference suppression, space-time decoding, and multipath combining is very small for error rates of practical interest.     

Iterative multiuser detection for turbo-coded FHMA communications

An iterative receiver structure Is proposed for turbo-coded frequency-hop multiple access (FHMA) systems. In FHMA systems, the adjacent channel interference (ACI) is the major contributor of multiple access interference (MAI) if orthogonal hopping patterns are used. The ACI is a function of the tone spacings of the adjacent subchannels and the rolloff factor of the pulse-shaping filter. The calculation of the ACI for a square-root raised-cosine pulse-shaping filter in an FHMA system is presented in this paper. In addition, a low complexity iterative multiuser detector is developed to mitigate the degradation caused by ACI in the FHMA systems. The iterative receiver structure is based on a modified turbo decoding algorithm which makes use of the a posteriori log-likelihood ratio (LLR) information of the systematic bits to obtain the a posteriori information of the turbo-encoded parity bits. Iterations of the receiver/decoder are used as the mechanism to estimate and mitigate the MAI in the FHMA system. The properties of both soft and hard interference suppressors based on the modified turbo decoding algorithm are examined and an efficient recursive implementation is derived. Compared to maximum-likelihood multiuser detection, the proposed system is more practical and its complexity is only a linear function of the number of users. Simulation results show that the proposed iterative receiver structure offers significant performance gain in bandwidth efficiency and the required signal-to-noise ratio (SNR) for a target bit-error rate (BER) over the noniterative receiver structure. Moreover, the single user performance can be achieved when imperfect power control exists     

A low-complexity iterative multiuser receiver for turbo-codedDS-CDMA systems

Optimal joint multiuser detection and decoding for direct-sequence code-division multiple-access (DS-CDMA) systems with forward error correction normally requires prohibitively high computational complexity. A suboptimal solution with low complexity is therefore appealing for use in practical applications. We propose a low-complexity iterative multiuser receiver for turbo-coded DS-CDMA systems. The proposed approach consists of a modified decorrelating decision-feedback detector (MDDFD) and K single-user turbo decoders, where K is the number of users in the DS-CDMA system. The MDDFD is derived on the basis of maximizing a likelihood probability and has a feature that it can use the reliability information from the turbo decoders' output. In addition, the MDDFD can deliver interference-cancelled soft outputs to the turbo decoders where the calculation of transition metrics is modified appropriately. Both performance analysis and computer simulation results have indicated that the reliability information from the turbo decoders' output can enhance the multiuser detection capability of the MDDFD. Computer simulations have also shown that the proposed iterative multiuser receiver outperforms the conventional DDFD-based multiuser receiver in terms of the bit-error probability     

Iterative receivers for multiuser space-time coding systems

Space-time coding (STC) techniques, which combine antenna array signal processing and channel coding techniques, are very promising approaches to substantial capacity increase in wireless channels. Multiuser detection techniques are powerful signal processing methodologies for interference suppression in CDMA systems. In this paper, by drawing analogies between a synchronous CDMA system and an STC multiuser system, we study the applications of some multiuser detection methods to STC multiuser systems. Specifically, we show that the so-called “turbo multiuser detection” technique, which performs soft interference cancellation and decoding iteratively, can be applied to STC multiuser systems in flat-fading channels. An iterative multiuser receiver and its projection-based variants are developed for both the space-time block coding (STBC) system and the space-time trellis coding (STTC) system. During iterations, extrinsic information is computed and exchanged between a soft multiuser demodulator and a bank of MAP decoders, to achieve successively refined estimates of the users' signals. Computer simulations demonstrate that the proposed iterative receiver techniques provide significant performance improvement over conventional noniterative methods in both single-user and multiuser STC systems. Furthermore, the performance of the proposed iterative multiuser receiver approaches that of the iterative single-user receiver in both STBC and STTC systems     

Iterative (turbo) soft interference cancellation and decoding forcoded CDMA

The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath code-division multiple-access (CDMA) channels. In this paper, an iterative receiver structure is proposed for decoding multiuser information data in a convolutionally coded asynchronous multipath DS-CDMA system. The receiver performs two successive soft-output decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process. At each iteration, extrinsic information is extracted from detection and decoding stages and is then used as a priori information in the next iteration, just as in turbo decoding. Given the multipath CDMA channel model, a direct implementation of a sliding-window SISO multiuser detector has a prohibitive computational complexity. A low-complexity SISO multiuser detector is developed based on a novel nonlinear interference suppression technique, which makes use of both soft interference cancellation and instantaneous linear minimum mean-square error filtering. The properties of such a nonlinear interference suppressor are examined, and an efficient recursive implementation is derived. Simulation results demonstrate that the proposed low complexity iterative receiver structure for interference suppression and decoding offers significant performance gain over the traditional noniterative receiver structure. Moreover, at high signal-to-noise ratio, the detrimental effects of MAI and ISI in the channel can almost be completely overcome by iterative processing, and single-user performance can be approached     

Frequency-hopped multiple access communications with coding andside information

The authors consider frequency-hopped spread-spectrum multiple-access communications using M-ary modulation and error-correction coding. The major concerns are multiple-access interference and the network capacity in terms of the number of users that can transmit simultaneously for a given level of codeword error probability. Block coding is studied in detail. The authors first consider the use of Q-ary Reed-Solomon (RS) codes in combination with M-ary modulation with mismatched alphabets so that Q>M. It is shown that the network capacity is drastically reduced in comparison with the system with matched alphabets. As a remedy, the use of matched M-ary BCH codes is proposed as an alternative to mismatched RS codes. It is shown that when the number of users in the system is large, a BCH code outperforms an RS code with a comparable code rate and decoding complexity. The authors consider the use of a robust technique for generation of reliable side information based on a radio-threshold test. They analyze its performance in conjunction with MFSK and error-erasure correction decoding. It is shown that this nonideal ratio-threshold method can increase the network capacity in comparison with the system with perfect side information     

Coded FH/SS Communications in the Presence of Combined Partial-Band Noise Jamming, Rician Nonselective Fading, and Multiuser Interference

In this paper we address the problem of combatting combined interference in spread-spectrum communication links. We consider frequency-hopped spread-spectrum systems withM-ary FSK modulation and noncoherent demodulation which employ forward-error-control coding. The interference consists of partial-band noise jamming, nonselective Rician fading, other-user interference, and thermal noise. The coding schemes which we analyze include: ReedSolomon codes (with or without diversity and error-only, erasure-only, or parallel erasure/error decoding), binary, nonbinary, and dual-kconvolutional codes with and without side information (information about the state of the channel), and concatenated schemes (Reed-Solomon outer codes with either inner detection-only block codes or inner convolutional codes). In all cases we derive 1) the minimum signal-to-jammer energy ratio required to guarantee a desirable bit error rate as a function of ρ, the fraction of the band which is jammed, when the number of interfering users is fixed; and 2) the maximum number of users that can be supported by the system as a function of ρ, when the signal-to-jammer energy ratio is fixed.     

Coded asynchronous CDMA and its efficient detection

In this paper, receiver design and performance analysis for coded asynchronous code-division multiple access (CDMA) systems is considered. The receiver front-end consists of the near-far resistant multiuser detector known as the projection receiver (PR). The PR performs multiple-access interference resolution and is followed by error-control decoding. The output of the projection receiver yields the appropriate metric (i.e., soft information) for decoding of the coded sequences. An expression for the metric is derived that allows the use of a standard sequence decoder (e.g., Viterbi algorithm, M-algorithm) for the error-control code. It is then shown that the metric computer has an elegant adaptive implementation based on an extension of the familiar recursive least squares (RLS) algorithm. The adaptive PR operates on a single sample per chip and achieves a performance virtually identical to the algebraic PR, but with significantly less complexity. The receiver performance is studied for CDMA systems with fixed and random spreading sequences, and theoretical performance degradations with regard to the single-user bound are derived. The near-far resistance of the PR is also proven, and demonstrated by simulation     

Erasure insertion in frequency-hop communications with fading andpartial-band interference

The use of block coding and errors-and-erasures decoding can enhance performance substantially in frequency-hop communication systems, provided that a good scheme is employed to determine which symbols to erase. In this paper, methods for determining erasures derived from Bayesian decision theory are applied to the mitigation of fading and partial-band interference. The performance of receivers using the Bayesian technique is compared with that of receivers that make erasure decisions using Viterbi's (1982) ratio-threshold test. The performance of hard-decision demodulation and the theoretical performance of receivers with access to perfect side information are also compared. It is found that the Bayesian receiver provides the best performance, and that error probabilities for the Bayesian receiver are lower than those for hard-decision demodulation by as much as six orders of magnitude     

Successive interference cancellation with SISO decoding and EMchannel estimation

We derive a low-complexity receiver scheme for joint multiuser decoding and parameter estimation of code division multiple access signals. The resulting receiver processes the users serially and iteratively and makes use of soft-in soft-out single-user decoders, of soft interference cancellation and of expectation-maximization parameter estimation as the main building blocks. Computer simulations show that the proposed receiver achieves near single-user performance at very high channel load (number of users per chip) and outperforms conventional schemes with similar complexity     

SVD iterative decision feedback demodulation and detection of coded space-time unitary differential modulation

A new suboptimal demodulator based on iterative decision feedback demodulation (DFD), and a singular value decomposition (SVD) for estimation of unitary matrices, is introduced. Noncoherent communication over the Rayleigh flat-fading channel with multiple transmit and receive antennas, where no channel state information (CSI) is available at the receiver is investigated. With four transmit antennas, codes achieving bit-error rate (BER) lower than 10/sup -4/ at bit energy over the noise spectral density ratio (E/sub b//N/sub o/) of -0.25 dB up to 3.5 dB, with coding rates of 1.6875 to 5.06 bits per channel use were found. The performance is compared to the mutual information upper bound of the capacity attaining isotropically random (IR) unitary transmit matrices. The codes achieve BER lower than 10/sup -4/ at E/sub b//N/sub o/ of 3.2 dB to 5.8 dB from this bound. System performance including the iterative DFD algorithm is compared to the one using Euclidean distance, as a reliability measure for demodulation . The DFD system presents a performance gain of up to 1.5 dB. Uncoded systems doing iterative DFD demodulation and idealized pilot sequence assisted modulation (PSAM) detection are compared. Iterative DFD introduces a gain of more than 1.2 dB. The coded system comprises a serial concatenation of turbo code and a unitary matrix differential modulation code. The receiver employs the high-performance coupled iterative decoding of the turbo code and the modulation code. Information-theoretic arguments are harnessed to form guidelines for code design and to evaluate performance of the iterative decoder.     

Iterative semiblind multiuser receivers for a space-time block-coded MC-CDMA uplink system

Iterative multiuser detection and space-time coding are two promising techniques to improve the capacity and performance of coded multiuser systems in wireless channels. In this paper, we present iterative multiuser detection schemes for a space-time block-coded multicarrier code-division multiple-access system with multiple transmit and receive antennas. We consider a more general case of an uplink system in the presence of both intra- and intercell interferences. We propose two types of iterative semiblind space-time receivers for such an uplink environment. The first is based on the minimum mean-square error criterion and the second is a hybrid scheme based on a combination of parallel interference cancellation and linear multiuser detection. These iterative receivers are derived, using a subspace approach, which utilizes known users' information for the computation of log-likelihood ratios (LLRs) while blindly suppressing the unknown interference. The LLRs are refined successively during the iterative process by using the extrinsic information available through decoding of all known users. A turbo code is used for channel coding. Simulation results in a frequency-selective Rayleigh-fading environment are presented to verify the performance of the proposed schemes.     

Code division multiple access based on independent codes and turbo decoding

We study a multiple access encoding/decoding algorithm based on iterative (turbo) decoding. The algorithm is suitable for both synchronous and asynchronous systems. The quasi-orthogonal pseudo-noise sequences of the DS-SSMA system are replaced by independent channel codes constructed by combining convolutional codes and random interleavers. The interference is rebuilt using soft output information. The results show that the iterative joint decoder is able to completely eliminate the co-channel interference. The performance of the multiple access system tends practically to that of a single user system.     

RS码与LDPC码的联合迭代译码

针对RS码与LDPC码的串行级联结构,提出了一种基于自适应置信传播(ABP)的联合迭代译码方法.译码时,LDPC码置信传播译码器输出的软信息作为RS码ABP译码器的输入;经过一定迭代译码后,RS码译码器输出的软信息又作为LDPC译码器的输入.软输入软输出的RS译码器与LDPC译码器之间经过多次信息传递,译码性能有很大提高.码长中等的LDPC码采用这种级联方案,可以有效克服短环的影响,消除错误平层.仿真结果显示:AWGN信道下这种基于ABP的RS码与LDPC码的联合迭代译码方案可以获得约0.8 dB的增益.     

Soft-decision and erasure decoding in fast frequency-hoppingsystems with convolutional, turbo, and Reed-Solomon codes

In this contribution we present an exhaustive treatment of various coding and decoding techniques for use in fast frequency-hopping/multiple frequency shift keying multiple-access systems. One of the main goals is to show how reliability information on each received bit can be derived to enable soft-decision decoding. Convolutional codes as well as turbo codes are considered applying soft-decision, erasure, and hard-decision decoding. Their performance is compared to that of previously proposed Reed-Solomon with either errors-only or errors-and-erasures decoding. A mobile radio environment yielding a frequency-selective fading channel is assumed. It is shown that the application of turbo codes and convolutional codes with soft decision decoding can allow for a comparable number of simultaneously transmitting users to Reed-Solomon codes with errors-and-erasures decoding. Furthermore, the advantage of soft decisions is shown, which can be applied to a widely and growing range of channel codes. The pertinent technique of calculating soft decisions is described in the paper