Pilot symbol-assisted coherent multistage interference cancellerusing recursive channel estimation for DS-CDMA mobile radio

A pilot symbol-assisted coherent multistage interference canceller using recursive channel estimation is proposed for DS-CDMA mobile radio cellular system. Since the channel variation caused by fading is recursively estimated at each interference cancelling stage, the accuracy of channel estimation is improved successively. Computer simulation results show that the required E_b/N₀ at the average BER of 3×10^-2 is improved by ~3.5 dB compared to the matched filter receiver for 10 users and two paths with equal power, and where f_dT=10^-3 (f_d: fading maximum Doppler frequency, T: data symbol duration)     

Multistage recursive interleaver for turbo codes in DS-CDMA mobileradio

A multistage recursive block interleaver (MIL) is proposed for the turbo code internal interleaver. Unlike conventional block interleavers, the MIL repeats permutations of rows and columns in a recursive manner until reaching the final interleaving length. The bit error rate (BER) and frame error rate (FER) performance with turbo coding and MIL under frequency-selective Rayleigh fading are evaluated by computer simulation for direct-sequence code-division multiple-access mobile radio. The performance of rate-1/3 turbo codes with MIL is compared with pseudorandom and S-random interleavers assuming a spreading chip rate of 4.096 Mcps and an information bit rate of 32 kbps. When the interleaving length is 3068 bits, turbo coding with MIL outperforms the pseudorandom interleaver by 0.4 dB at an average BER of 10^-6 on a fading channel using the ITU-R defined Vehicular-B power-delay profile with the maximum Doppler frequency of f_D = 80 Hz. The results also show that turbo coding with MIL provides superior performance to convolutional and Reed-Solomon concatenated coding; the gain over concatenated coding is as much as 0.6 dB     

The error performance of CD900-like cellular mobile radio systems

The symbol error performance of CD900-like digital cellular mobile radio systems over narrowband and urban wideband transmission channels was investigated. The basic performance is presented for Gaussian, flat-fading Rayleigh, and log-normal channels in the presence of selection and ratio combining space diversity schemes. For wideband channels having more than one resolvable fading path, a CD900-like system without diversity reception suffers from large residual symbol error probabilities P_R(≈10^-1). The introduction of adaptive correlation diversity (ACD) mitigates the effects of multipath, yielding a P_R of 6×10^-5. Although this P_R value is relatively low, the probability of symbol error (P_e) versus signal-to-noise ratio (SNR) is significantly poorer than for the Gaussian channel. By combining the ACD scheme with space diversity, the P_R is eliminated by P_e >10^-5, and the channel SNR is within 5 dB of the Gaussian channel performance when P_e is 10^-10     

Augmented APP (A2P2) module for a posterioriprobability calculation and channel parameter tracking

The augmented a posteriori probability (APP) module, denoted by A ²P², comprises two mutually supporting algorithms: (1) a soft-input soft-output (SISO) APP module, adjusted to output edge metric information and (2) a recursive estimator for the channel parameters that benefits from this information at each step of the recursion. The thus-estimated parameters appropriately transform, in turn, the channel output signals that feed the SISO module. When applied to decoding a parallel concatenated convolutional code (PCCC) transmitted by binary phase-shift keying through a channel with frequency offset (0.08/T_s Hz) and phase jitter (0.23-rad RMS), concentrated at 0.01/T_s Hz, (T_s-symbol duration), the degradation compared to fully coherent reception is a small fraction of 1 dB, without use of a preamble     

Space-time turbo codes with full antenna diversity

In attempting to find a spectrally and power efficient channel code which is able to exploit maximum diversity from a wireless channel whenever available, we investigate the possibility of constructing a full antenna diversity space-time turbo code. As a result, both three-antenna and two-antenna (punctured) constructions are shown to be possible and very easy to find. To check the decodability and performance of the proposed codes, we derive non-binary soft-decoding algorithms. The performance of these codes are then simulated and compared with two existing space-time convolutional codes (one has minimum worst-case symbol-error probability; the other has maximal minimum free distance) having similar decoding complexity. As the simulation results show, the proposed space-time turbo codes give similar or slightly better performance than the convolutional codes under extremely slow fading. When fading is fast, the better distance spectra of the turbo codes help seize the temporal diversity. Thus, the performance advantage of the turbo codes becomes evident. In particular, 10^-5 bit-error rate and 10^-3 frame-error rate can be achieved at less than 6-dB E_b/N₀ with 1 b/s/Hz and binary phase-shift keying modulation. The practical issue of obtaining the critical channel state information (CSI) is also considered by applying an iteratively filtered pilot symbol-assisted modulation technique. The penalty when the CSI is not given a priori is about 2-3 dB     

Directive antenna diversity reception for an adaptive modulationsystem in land mobile communications

The Letter proposes a directive antenna diversity reception scheme for an adaptive modulation /TDMA/TDD system to achieve high quality, high bit rate and high spectral efficient data transmission even in high mobility land mobile communication environments. In mobile stations, a directive antenna diversity is applied to reduce the Doppler spread equally in each branch. At each branch, the offset frequency (f_off ) and f_off-cancelled fading variation are estimated to improve the accuracy of the propagation path characteristic estimation even in high maximum Doppler frequency (f_d) environments. Computer simulation confirms that the proposed scheme can achieve successful variable rate transmission in fast fading environments     

Comparison of decoding algorithms of binary linear block codes inRayleigh fading channels with diversity reception

The word error probability of binary linear block codes is evaluated in Rayleigh fading channels with diversity reception for three decoding algorithms: error correction (EC), error/erasure correction (EEC), and maximum likelihood (ML) soft decoding algorithms. The performance advantage of EEC over EC in the required average SNR decreases as the number of diversity channels increases. The performance advantage of EEC over EC does not depend on the specific value of word error probability although the advantage of ML soft decoding over EC increases for lower word error probability     

Design, analysis, and performance evaluation for BICM-ID withsquare QAM constellations in Rayleigh fading channels

We consider bit-interleaved coded modulation with iterative decoding (BICM-ID) for bandwidth-efficient transmission over Rayleigh fading channels. We propose the design criteria that utilize a large Hamming distance inherited in a low-rate code and a new labeling technique designed specifically for fading channels. This results in a large coding gain over noniterative coded modulation and performance close to that of “turbo” coded modulation with less complexity. We also show that BICM-ID designed for fading channels usually has a very good performance over the additive white Gaussian noise (AWGN) channel while the converse is difficult to achieve. When combined with signal space diversity, diversity order can be improved to twice the diversity order of conventional BICM-ID; therefore, the code complexity can further be reduced while maintaining the same level of performance. Specifically, with the bandwidth efficiency of 2 bits/s/Hz over Rayleigh fading channels, a bit error rate (BER) of 10^-6 can be achieved with 16-QAM, a four-state rate 1/2 code at E_b/N₀ of about seven dB. We also derive performance bounds for BICM-ID with and without signal space diversity over Rayleigh fading channels, which can be easily extended for other types of fading channels     

Experimental evaluation of combined postdetection diversity andconcatenated channel coding

The combined effects of postdetection diversity reception and concatenated channel coding are experimentally evaluated for π/4-shift QDPSK signal transmission over a Rayleigh fading channel. Two-branch postdetection diversity reception using maximal ratio combining (MRC) and selection combining (SC) are considered. The concatenated channel coding uses the Reed-Solomon (15,k) code of GP(2 ⁴) as the outer code and the BCH (7,4) code as the inner code (k=9,11,13). Measured bit error rate (BER) performance results are presented under cochannel interference (CCI) and multipath channel delay spread, as well as additive white Gaussian noise (AWGN)     

On forward-adaptive versus forward/backward-adaptive SISOalgorithms for Rayleigh fading channels

Two types of soft-input soft-output (SISO) algorithms have previously been proposed for iterative decoding of concatenated codes applied over fading channels; forward-adaptive algorithms exploit the dependency between the present symbol interval and past symbol intervals, while forward/backward-adaptive algorithms take both the past and the future into account. Numerical results presented for interleaved serially concatenated continuous phase modulation (CPM) over the Rayleigh fading channel indicate that the performance of forward-adaptive algorithms approaches the performance of forward/backward-adaptive algorithms when a long channel-memory depth is exploited     

Concatenated multilevel block coded modulation

Encoding and decoding schemes for concatenated multilevel block codes are presented. By one of these structures, a real coding gain of 5.6-7.4 dB for the bit error range of 10^-6 to 10^-9 is achieved for transmission through the additive white Gaussian noise channel. Also, a rather large asymptotic coding gain is obtained. The new coding schemes have very low decoding complexity and increased coding gain in comparison with the conventional block and trellis coded modulation structures. A few design rules for concatenated (single and) multilevel block codes with large coding gain are also provided     

Efficient soft-in-soft-out sub-optimal decoding rule for singleparity check codes

The authors present an efficient, sub-optimal, soft-in-soft-out decoding rule for single parity check (SPC) codes, which requires only three addition-equivalent-operations per information bit. Its application is demonstrated by the simulation results of a rate 5/6 four-dimensional concatenated SPC code, for which performance of BER=10 ^-5 at E_h/N₀=3.5 dB is observed, which is only ~1.2 dB from the theoretical limit     

Analysis and performance of bidirectional decoding of convolutionalcodes over fading channels

The performance of suboptimal convolutional decoding over fading channels is explored. The suboptimal decoding algorithm used is the bidirectional algorithm. By estimating a “decoder weight spectrum” for the decoder, an “equivalent free distance” may be observed. Furthermore, by using this “decoder weight spectrum”, useful estimations of the error probabilities are obtained and compared to computer-simulation results in the case of very slow and very fast fading. The resultant curves are shown to be very tightly related. Computer-simulation results are also shown for various signal-to-noise ratios, normalized Doppler spreads, and frame length on three typical fading channels: the Rayleigh fading channel with exponential and Bessel autocorrelation functions and the Rician fading channel with exponential autocorrelation function. We show that considerable gains (up to 4 dB) can be obtained with respect to a similar-complexity Viterbi decoder at a frame error probability P_e =10^-3 and a slightly smaller gain (up to 1.8 dB) at a bit error probability P_b=10^-5     

Adaptive differential detection using linear prediction for M-aryDPSK

This paper proposes a novel adaptive differential detection scheme (adaptive DD), which can significantly reduce the irreducible bit-error rate (BER) of M-ary DPSK due to Doppler spread by the adaptive linear prediction of the reference signal. The predictor coefficient is adapted to changing channel conditions by using the recursive least-square (RLS) algorithm. A phase sequence estimation based on the M-state Viterbi algorithm (VA) and another based on the decision feedback algorithm (DFA) are presented. A theoretical BER analysis is presented for adaptive DD-DFA. BER performances of 2 and 4DPSK in Rayleigh fading channels are evaluated by computer simulations. When the RLS forgetting factor of β=1 is used, simulation results show that the irreducible BER of 4DPSK can be reduced to 7.2×10^-5 (3.9×10 ^-4) for VA (DFA) while conventional DD offers 3.9×10 ^-3 when f_DT_b (maximum Doppler frequency times bit duration)=0.01 and average E_b/N₀ (signal energy per bit-to-additive white Gaussian noise (AWGN) power spectrum density ratio)=60 dB, where most errors are produced by Doppler spread. Adaptive DD is also effective in AWGN channels-simulations show that for the case of 4DPSK, a performance gain of 1.2 (0.7) dB is achieved over conventional DD for VA (DFA) at BER=10^-3     

Variable rate data transmission with blind rate detection forcoherent DS-CDMA mobile radio

A variable rate data transmission scheme with blind rate detection is described for pilot-symbol-assisted coherent DS-CDMA mobile radio. Cyclic redundancy check (CRC) coding and decoding is used for blind rate detection. Computer simulations of eight-rate variable rate data transmission demonstrate that when 16 bit CRC is used, the loss in required total E_b/N₀ at a frame error rate of 10 ^-2 under two-path Rayleigh fading, is only ~0.1 dB from the known rate case     

MAP decoding of convolutional codes using reciprocal dual codes

A new symbol-by-symbol maximum a posteriori (MAP) decoding algorithm for high-rate convolutional codes using reciprocal dual convolutional codes is presented. The advantage of this approach is a reduction of the computational complexity since the number of codewords to consider is decreased for codes of rate greater than 1/2. The discussed algorithms fulfil all requirements for iterative (“turbo”) decoding schemes. Simulation results are presented for high-rate parallel concatenated convolutional codes (“turbo” codes) using an AWGN channel or a perfectly interleaved Rayleigh fading channel. It is shown that iterative decoding of high-rate codes results in high-gain, moderate-complexity coding     

Multilevel trellis coded modulations for the Rayleigh fadingchannel

The authors present coded 8-phase-shift-keyed (8-PSK) modulations for the Rayleigh fading channel. The schemes are based on multilevel trellis-coded-modulation constructions and utilize maximum free Hamming distance binary convolutional codes as building blocks. A suboptimal multistage decoder that utilizes interstage interleaving and iterative decoding is proposed and evaluated. Examples are constructed to show that the proposed schemes outperform the best modified codes of the Ungerboeck type due to significantly higher implicit time diversity, yielding seven branches of built-in time diversity, whereas the Ungerboeck code yields four branches of time diversity for a 64-state system. The transmission delay is higher, however. The new schemes can provide three levels of unequal error protection when 8-PSK or 8-differential-phase-shift-keying (8-DPSK) modulations are used. They provide 10-14-dB channel signal-to-noise ratio gain over uncoded 4-DPSK at a bit error rate of 10^-3 for a modest decoding complexity     

Interference cancelling equalizer (ICE) for mobile radiocommunication

This paper proposes an adaptive interference cancelling equalizer (ICE), which not only equalizes intersymbol interference (ISI), but also cancels cochannel interference (CCI) in the received signal in Rayleigh-fading environments, ICE is an adaptive multiuser detector for the frequency-selective fading environment commonly experienced by mobile communication channels. ICE employs a novel detection scheme: recursive least-squares maximum-likelihood sequence estimation (RLS-MLSE), which simultaneously estimates time-varying channel parameters and transmitted signal sequences. Diversity reception is used to enhance the signal detection performance of ICE. A computer simulation of a 40-kb/s QPSK time-division multiple-access (TDMA) cellular mobile radio system demonstrates the possibility of improving system capacity with ICE. Simulations of ICE with and without diversity are carried out under various fading conditions. For the maximum Doppler frequency of 40 Hz, ICE can attain an average bit-error rate (BER) of 10 ^-2 under a single CCI carrier-to-interference ratio (CIR) of ~14 dB. Moreover, ICE for two independent CCI signals can attain the average BER of 1.5×10^-2 with average CIR⩾-10 dB     

Soft decision decoding of block codes using received signalenvelope in digital mobile radio

The codeword error rate (WER) performance of noncoherent frequency-shift keying with soft decision decoding of block codes using Chase's second algorithm (1972) is investigated in a Rayleigh fading channel. The received signal envelope is sampled and used as channel measurement information. The theoretical upper and lower bounds of the WER are derived, assuming independent Rayleigh envelope samples in a received block. When the Golay (23, 12, 7) code is used, soft decision decoding with 6-bit error correction capability (3-bit error and 3-bit erasure) requires an average signal-to-noise power ratio about 5 dB lower than that for minimum distance decoding with 3-bit error correction to obtain a WER=10^-3. The effects of bit interleaving on the WER performance when fading envelope variation is slow compared to the bit rate are investigated through computer simulations     

Iterative channel estimation and decoding of pilot symbol assistedturbo codes over flat-fading channels

A method for coherently detecting and decoding turbo-coded binary phase shift keying (BPSK) signals transmitted over frequency-flat fading channels is discussed. Estimates of the complex channel gain and variance of the additive noise are derived first from known pilot symbols and an estimation filter. After each iteration of turbo decoding, the channel estimates are refined using information fed back from the decoder. Both hard-decision and soft-decision feedback are considered and compared with three baseline turbo-coded systems: (1) a BPSK system that has perfect channel estimates; (2) a system that uses differential phase shift keying and hence needs no estimates; and (3) a system that performs channel estimation using pilot symbols but has no feedback path from decoder to estimator. Performance can be further improved by borrowing channel estimates from the previously decoded frame. Simulation results show the influence of pilot symbol spacing, estimation filter size and type, and fade rate. Performance within 0.49 and 1.16 dB of turbo-coded BPSK with perfect coherent detection is observed at a bit-error rate of 10^-4 for normalized fade rates of f_dT_s=0.005 and f_dT_s=0.02, respectively