Mapping optimization for space-time bit-interleaved coded modulation with iterative decoding

Bit-interleaved coded modulation with iterative decoding (BICM-ID) is investigated for bandwidth efficient transmissions, where the error performance can be improved by employing a suitable symbol mapping. This paper first introduces a low-complexity regular mapping optimization for BICM-ID and 8PSK, for the purpose of finding the optimal mapping. Furthermore, the irregular mapping optimization is proposed for a closer approach to the channel capacity. The extrinsic information transfer (EXIT) chart analysis is aided for the proposed optimization algorithms to provide design guidelines of mappings. The bit error rate (BER) results demonstrate that the BICM-ID system with the proposed optimal irregular mapping outperforms the other mappings used for comparison, and yields about 0.5dB away from the channel capacity over the additive white Gaussian noise (AWGN) channel.

We study the impact of imperfect channel state information (CSI) on the bit-error rate (BER) of QAM bit-interleaved coded modulation with iterative decoding (BICM-ID), in flat Rayleigh fading. The key parameter characterizing this effect is the power correlation coefficient /spl rho/ between the fading gain and its estimate. An accurate and efficient bound is developed to predict the asymptotic BER. We also show simulation results for QAM BICM-ID with 8-state and 16-state convolutional codes to provide the performance evaluation. For the 16-state code with modified set partitioning labeling and power correlation /spl rho/=0.95, a BER of 10/sup -6/ can be achieved at E/sub b//N/sub 0/=11 dB, with 4 passes of soft feedback. This corresponds to about 3.5 dB increase in the required E/sub b//N/sub 0/ compared to that of perfect CSI.

We investigate the impact of imperfect channel state information (CSI) on the bit error rate (BER) performance of uncoded and coded modulation schemes over Nakagami fading channels using the model proposed in C. Polprasert and JA Ritcey (2005). The analytical and asymptotic BER performance of uncoded M-PSK modulation is evaluated and verified by the simulation. For coded modulation, the error free feedback bound (EF bound) of the bit-interleaved coded modulation with iterative decoding (BICM-ID) for both perfect and imperfect CSI is developed. We show that asymptotically, the error floor generated due to imperfect CSI depends on the fading parameter and the power correlation coefficient between the fading coefficient and its estimate.

We analyze the impact of imperfect channel state information (CSI) on the performance of bit-interleaved coded modulation with iterative decoding (BICM-ID) over fading channels. We develop a general, accurate and efficient theoretical error-free feedback bound (EF bound) to analyze the asymptotic bit-error rate (BER) of BICM-ID with imperfect CSI, and predict the BER floor due to channel estimation error. The convergence to the EF bound and the accuracy of the BER floor prediction are verified by simulation with various sets of code and channel parameters. These results are canonical, in that they apply to a variety of system configurations. Pilot symbol assisted modulation is used as a particular example for Rayleigh-fading channels.

This paper studies the technique of bit-interleaved coded modulation with iterative decoding (BICM-ID) in a two-way relaying communication system. Iterative decoding based on the quaternary code representation is adopted at the relay for the multiple access (MA) phase. An upper-bound of the bit error probability (BEP) under the error-free (EF) feedback assumption for BICM-ID in the MA phase is obtained. Based on the obtained EF bound of the BEP, it is found that the multiple-access interference (MAI) is successfully eliminated by performing the iterative decoding and XOR based network coding at the relay. Simulation results are provided to corroborate the analysis and demonstrate the performance superiority of the proposed framework.

In this paper, we analytically derive the bit error rate (BER) for bit-interleaved coded modulation (BICM) under the assumption of a temporally correlated flat Rayleigh fading channel. We assume the channel state information (CSI) to be unknown at receiver side and consider a linear minimum mean-squared error (LMMSE) channel estimator that relies on periodically inserted pilot symbols. We give asymptotic results for both non-iterative BICM and BICM with iterative decoding (BICM-ID). Furthermore, we show that the interpretation of the channel estimation error as an SNR degradation holds true in these cases.

This paper studies bit-interleaved coded modulation with iterative decoding (BICM-ID) systems that employ multi-dimensional mappings of M-ary constellations to improve the error performance over Rayleigh fading channels. Based on the analytical evaluations of the asymptotic bit error rate (BER), the distance criteria for the mapping designs can be obtained. A binary switching algorithm (BSA) is then applied to find the optimal mappings with respect to the asymptotic performance. Simulation and analytical results show that the use of multi-dimensional mappings of M-ary constellations can significantly improve the error performance

Forward error correction (FEC) coding, modulation formats like differential phase shift keying (DPSK) and adaptive electronic equalization to mitigate, e.g. polarization mode dispersion (PMD) are some of the methods applied in current direct-detection optical communication systems, which are limited to a spectral efficiency of 1 bit/s/Hz. Coherent single-carrier QPSK systems with polarization multiplexing (PolMUX) allows to attain an spectral efficiency of up to 4 bit/s/Hz. However, to guarantee a bit error rate (BER) <; 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-15</sup> adaptive multiple-input multiple-output (MIMO) equalization as well as outer FEC coding has to be included which results in less than 4 bit/s/Hz in commercial 40 Gbit/s systems. From wireline and wireless systems it is well known that larger symbol alphabets in combination with FEC coding (denoted as coded modulation) and orthogonal frequency division multiplexing (OFDM) can significantly enhance the spectral efficiency. However, in order to exploit the channel capacity of the fiber the modulation itself needs to be capacity achieving. In this contribution we apply capacity achieving constellations in an optical OFDM system and jointly design mapping and low-density parity-check (LDPC) codes for an iterative decoding scheme, namely bit-interleaved coded modulation with iterative decoding (BICM-ID). The authors expect this coding scheme to be most appropriate for future optical transponders to utilize long haul communications close to channel capacity.

Turbo decodulation is the combination of iterative demodulation and iterative source-channel decoding to a single multiple turbo process. The receiver structures of bit-interleaved coded modulation with iterative decoding (BICM-ID), iterative source-channel decoding (ISCD), and iterative source coded modulation (ISCM) are merged to one novel turbo system, in which in two iterative loops reliability information is exchanged between the three single components, demodulator, channel decoder, and (softbit) source decoder. Simulations show quality improvements compared to the different previously known systems, which use iterative processing only for two components of the receiver. We propose the enhancement to turbo decodulation by an additional link for a direct supply of reliabilities from the softbit source decoder to the demodulator. We will demonstrate that using three-dimensional EXIT charts a convergence analysis of turbo decodulation similar to single turbo processes is possible

Exploiting signal space diversity (SSD) to improve the error performance of communications systems over fading channels has been shown to be a very effective technique. The application of SSD in bit-interleaved coded modulation with iterative decoding (BICM-ID) is considered for cascaded Rayleigh fading channels, which are suitable for mobile-to-mobile communications. A tight bound on the asymptotic error performance is first derived. The bound is then used to find the optimal rotation matrix. It is shown that employing SSD in a sufficiently large constellation can close the performance gap between a conventional Rayleigh fading channel and a cascaded Rayleigh fading channel. In fact, similar to the case of conventional Rayleigh fading, it is demonstrated that the error performance of BICM-ID with SSD over a cascaded Rayleigh fading channel can also closely approach the performance of BICM-ID over an AWGN channel. Various analytical and simulation results are provided to confirm the analysis.

The demands for high data rates and spectrally efficient modulation techniques are increasing due to the evolution of multimedia service in wireless communication systems. Bit-interleaved coded modulation with iterative decoding (BICM-ID) is a bandwidth efficient transmission scheme and is well suitable for the next-generation mobile communications. But the performance of BICM-ID is poor in slow fading channels. As we know that diversity is an effective method to cope with fading and channel interleaving with error correction coding brings time diversity, an effective scheme is proposed in the paper in which a block interleaver is introduced to the BICM-ID encoder at the transmitter. This block interleaver serves as a channel interleaver which makes the burst errors induced by slow fading to be changed into random errors. Simulation results show that channel interleaving greatly improves the performance of BICM-ID in slow fading channels.

In this paper, we extend the iterative demapping technique to observation separation (OS), which is an iterative channel estimation and symbol detection procedure. We consider a bit interleaved coded modulation with iterative decoding (BICM-ID) on a multipath channel with coded packet oriented transmission system with 16QAM. The channels considered are the time-invariant multipath and the channel estimation corresponds to the pseudo-inverse type. We propose here to study the influence of mapping over the performance of turbo equalization. Turbo equalization is a receiving process performing iteratively equalization and channel decoding; soft information generated by each receiving function is improved through the iterations until the optimum behavior of the system reached. In the studied system the turbo equalization and the channel estimation part is based on our previous work. In the context of bit interleaved coded modulation (BICM), the iterative demapping is an iterative process between the soft demapping device and the channel decoding. We analyze here the improvement of mapping optimization for turbo equalization and we proposed an optimized binary mapping of 16-QAM constellation in order to increase coding gain, which can be used for some practically important cases. It is demonstrated that owning to a carefully designed mapping, different to the classical Gray mapping, bit error rate performance is improved.

Employing multi-dimensional constellation and mapping to improve the error performance of the bit-interleaved coded modulation with iterative decoding (BICM-ID) has recently received a lot of attention, both in single-antenna and multiple-antenna systems. To date, except for the cases of BPSK and QPSK constellations, good multi-dimensional mappings have only been found by computer searching techniques. This paper introduces an explicit algorithm to construct a good multidimensional mapping of 8-PSK for improving the asymptotic performance of BICM-ID systems. By comparing the performance of the proposed mapping with an unachievable lower bound, it is conjectured that the proposed mapping is the global optimal mapping. The superiority of the proposed mapping over the best conventional (two-dimensional) mapping and the multidimensional mapping found previously by computer search is also thoroughly demonstrated

Double differential phase shift keying(DDPSK) modulation is an efficient method to compensate the Doppler shifts, whereas the phase noise will be amplified which results in the signal-to-noise ratio (SNR) loss. In this paper, we propose a novel receiver architecture for underwater acoustic DSSS communications with Doppler shifts. The proposed method adopts not only the DDPSK modulation to compensate the Doppler shifts, but also the improved bit-interleaved coded modulation with iterative decoding (BICM-ID) algorithm for DDPSK to recover the SNR loss. The improved DDPSK demodulator adopts the multi-symbol estimation to track the channel variation, and an extended trellis diagram is constructed for DDPSK demodulator. Theoretical simulation shows that our system can obtain around 10.2 dB gain over the uncoded performance, and 7.4 dB gain over the hard-decision decoding performance. Besides, the experiment conducted in the Songhua Lake also shows that the proposed receiver can achieve lower BER performance when Doppler shifts exists.

We present a low-complexity combination of a BLAST-like MIMO system and bit-interleaved coded modulation with iterative decoding (BICM-ID). We present a method to exploit soft information stemming from the outer decoder to mitigate the influence of multistream interference. Furthermore, we introduce an inner code to remove the error floor which is normally present in BICM-ID systems. This code is of rate one and has memory one; it thus adds no redundancy and only very little complexity. Both schemes are evaluated in the EXIT chart and with BER simulations.