Multistage decoding of multilevel block M-PSK modulationcodes and its performance analysis

Multistage decoding of multilevel block multilevel phase-shift keying (M-PSK) modulation codes for the additive white Gaussian noise (AWGN) channel is investigated. Several types of multistage decoding, including a suboptimum soft-decision decoding scheme, are devised and analyzed. Upper bounds on the probability of an incorrect decoding of a code are derived for the proposed multistage decoding schemes. Error probabilities of some specific multilevel block 8-PSK modulation codes are evaluated and simulated. The computation and simulation results for these codes show that with multistage decoding, significant coding gains can be achieved with large reduction in decoding complexity. In one example, it is shown that the difference in performance between the proposed suboptimum multistage soft-decision decoding and the single-stage optimum decoding is small, only a fraction of a dB loss in SNR at the block error probability of 10^-6     

Rate 3/4 Convolutional Coding of 16-PSK: Code Design and Performance Study

Convolutional coding coupled with 16-PSK modulation is investigated for bandwidth efficient transmission. Rate 3/4, small memory codes are found which are optimized in the free-distance sense on the Gaussian channel. These codes provide up to 4.8 dB of coding gain with 32 states over uncoded 8-PSK, a scheme having the same spectral efficiency as the codes described. The performance is compared with earlier findings of Ungerboeck and some recent results onR = 2/3coded 8-PSK. In addition, we present results of a channel transmission study to assess the performance of the four-state code on the band-limited nonlinear channel, and find that performance of the coded scheme degrades comparably with uncoded 8-PSK, i.e., coding gain is roughly preserved.     

Single-block differential transmit scheme for broadband wireless MIMO-OFDM systems

In frequency-selective multiple-input multiple-output (MIMO) channel, differential space-time-frequency (DSTF) modulations are known as practical alternatives that are capable of exploiting the available spatial and frequency diversities without the requirement of multichannel estimation at the receiver. However, the encoding nature of the DSTF schemes that expand several OFDM symbol periods makes the DSTF schemes susceptible to fast-changing channel conditions. In this paper, we propose a differential scheme for MIMO-OFDM systems that is able to differentially encode signal within two OFDM symbol periods, and the proposed scheme transmits the differentially encoded signal within one OFDM block. The scheme not only reduces encoding and decoding delay but also relaxes the restriction on channel assumption. The successful differential decoding of the proposed scheme depends on the assumption that the fading channels keep constant over two OFDM symbol periods rather than multiple of them as required in the existing DSTF schemes. We also provide pairwise error probability analysis and quantify the performance criteria in terms of diversity and coding advantages. The design criteria reveal that the existing diagonal cyclic codes can be applied to achieve full diversity. Performance simulations under various channel conditions show that our proposed scheme yields superior performance to previously proposed differential schemes.     

Block-coded M-PSK modulation over GF(M)

Channel codes where the redundancy is obtained not from parity symbols, but from expanding the channel signal-set, are addressed. They were initially proposed by G. Ungerboeck (1982) using a convolutional code. Here, a block coding approach is given. Rate m/(m+1) coded 2^m+1-ary phase-shift keying (PSK) is considered. The expanded signal-set is given the structure of a finite field. The code is defined by a square nonsingular circulant generator matrix over the field. Binary data are mapped on a dataword, of the same length as the codewords, over an additive subgroup of the field. The codes using trellises are described, and then the Viterbi algorithm for decoding is applied. The asymptotic coding gain ranges from 1.8 to 6.0 dB for QPSK going from blocklength 3 to 12. For 8-PSK, the gain is from 0.7 to 3.0 dB with blocklength 4 to 8. With only four states in the trellis, codes of any length for QPSK and 8-PSK are constructed, each having an asymptotic coding gain of 3.0 dB. Simulation results are presented. It is found that the bit-error rate performance at moderate signal-to-noise ratios is sensitive to the number of nearest and next-nearest neighbors     

A space-time coding modem for high-data-rate wirelesscommunications

This paper presents the theory and practice of a new advanced modem technology suitable for high-data-rate wireless communications and presents its performance over a frequency-flat Rayleigh fading channel. The new technology is based on space-time coded modulation (STCM) with multiple transmit and/or multiple receive antennas and orthogonal pilot sequence insertion (O-PSI). In this approach, data is encoded by a space-time (ST) channel encoder and the output of the encoder is split into N streams to be simultaneously transmitted using N transmit antennas. The transmitter inserts periodic orthogonal pilot sequences in each of the simultaneously transmitted bursts. The receiver uses those pilot sequences to estimate the fading channel. When combined with an appropriately designed interpolation filter, accurate channel state information (CSI) can be estimated for the decoding process. Simulation results of the proposed modem, as applied to the IS-136 cellular standard, are presented. We present the frame error rate (FER) performance results as a function of the signal-to-noise ratio (SNR) and the maximum Doppler frequency, in the presence of timing and frequency offset errors. Simulation results show that for a 10% FER, a 32-state eight-phase-shift keyed (8-PSK) ST code with two transmit and two receive antennas can support data rates up to 55.8 kb/s on a 30-kHz channel, at an SNR of 11.7 dB and a maximum Doppler frequency of 180 Hz. Simulation results for other codes and other channel conditions are also provided. We also compare the performance of the proposed STCM scheme with delay diversity schemes and conclude that STCM can provide significant SNR improvement over simple delay diversity     

Multilevel coded modulation for unequal error protection andmultistage decoding .I. Symmetric constellations

In this paper, theoretical upper bounds and computer simulation results on the error performance of multilevel block coded modulations for unequal error protection (UEP) and multistage decoding are presented. It is shown that nonstandard signal set partitionings and multistage decoding provide excellent UEP capabilities beyond those achievable with conventional coded modulation. The coding scheme is designed in such a way that the most important information bits have a lower error rate than other information bits. The large effective error coefficients, normally associated with standard mapping by set partitioning, are reduced by considering nonstandard partitionings of the underlying signal set. The bits-to-signal mappings induced by these partitionings allow the use of soft-decision decoding of binary block codes. Moreover, parallel operation of some of the staged decoders is possible, to achieve high data rate transmission, so that there is no error propagation between these decoders. Hybrid partitionings are also considered that trade off increased intraset distances in the last partition levels with larger effective error coefficients in the middle partition levels. The error performance of specific examples of multilevel codes over 8-PSK and 64-QAM signal sets are simulated and compared with theoretical upper bounds on the error performance     

The effects of phase noise on trellis coded modulation overGaussian and fading channels

In this paper, error performance bounds are derived for 8-PSK trellis coded modulation (TCM) over Gaussian and fading channels in the presence of phase noise. Coherent demodulation combined with both phase-locked loop (PLL) and transparent tone in band technique (TTIB) for phase recovery is assumed. The analysis is then applied to a number of Ungerboeck 8-PSK trellis codes and the results for the bit error rate (BER) performance, obtained both analytically and by Monte Carlo simulation, are presented. The derived bounds can be directly extended to any M-PSK trellis code     

High Rate CPFSK Space-Time Trellis Codes

Space-time trellis coding is an established diversity technique that reduces the effects of multipath fading over wireless communication channels. Here, we consider high rate space-time trellis codes (STTC) with continuous phase frequency shift keying (CPFSK). We present optimized rate-2/3 STTC implemented with 3 transmit antennas. These codes provide system throughputs of 4 and 6 bits per channel use with 4-ary and 8-ary CPFSK respectively. Simulated error rate performance of the optimized codes with receive diversity is presented. We show that although the schemes do not achieve full transmit diversity, they provide excellent coding gains compared to full rank schemes that have equivalent throughput, but higher order modulations and greater complexity.     

Analysis and design of trellis codes optimized for a binarysymmetric Markov source with MAP detection

We consider the problem of transmitting a binary symmetric Markov source (BSMS), over the additive white Gaussian noise (AWGN) channel. The coding technique considered is trellis-coded modulation (TCM), where we utilize decoders which implement the maximum-likelihood (ML) and maximum a posteriori (MAP) criteria. Employing 8-PSK Ungerboeck codes on a BSMS with state transition probability 0.1, we first show that the MAP decoder realizes a 0.8-2.1-dB coding gain over the ML decoder. Motivated by these gains, we consider the design of trellis codes optimized for the BSMS/AWGN/MAP system. An approximate union bound is established for this system. Using this bound, we found codes which exhibit additional 0.4-1.1-dB gains over Ungerboeck codes. Finally, we compare the proposed TCM system with a tandem coding system. At normalized signal-to-noise ratio (SNR) of 10.8 dB and below, the proposed system significantly outperforms the tandem system     

Space-time turbo trellis codes for two, three, and four transmit antennas

New space-time turbo trellis codes (ST turbo TCs) with 4-phase-shift keying (PSK) and 8-PSK for two, three, and four transmit antennas in slow and fast fading channels are proposed in this paper. The component codes of the space-time turbo schemes are constructed by choosing the feedforward coefficients to maximize the minimum squared Euclidean distance and the feedback coefficients to minimize the iterative decoding threshold. The performance of the proposed ST turbo TCs with various memory orders, transmit antennas, and interleaver structures is evaluated by simulation. It is shown that the new codes achieve better performance than previously designed codes. The impact of antenna correlation and imperfect channel estimation on the code performance is also discussed.     

New rate-1/3 trellis codes with 8-PSK signals for bandlimited AWGN channels

New rate-1/3 linear trellis (convolutional) codes with 8-PSK modulation for bandlimited additive white Gaussian noise (AWGN) channels are reported. The simulated bit error probability performance of the trellis-coded modulation schemes with unquantised Viterbi decoding shows useful coding gains over the uncoded coherent BPSK having the same bandwidth efficiency of 1 bit/s/Hz and the schemes are suitable for use in many practical bandlimited channels.<>     

Speech transmission using rate-compatible trellis codes andembedded source coding

This paper presents bandwidth-efficient speech transmission systems using rate-compatible channel coders and variable bitrate embedded source coders. Rate-compatible punctured convolutional codes (RCPC) are often used to provide unequal error protection (UEP) via progressive bit puncturing. RCPC codes are well suited for constellations for which Euclidean and Hamming distances are equivalent (BPSK and 4-PSK). This paper introduces rate-compatible punctured trellis codes (RCPT) where rate compatibility and UEP are provided via progressive puncturing of symbols in a trellis. RCPT codes constitute a special class of codes designed to maximize residual Euclidean distances (RED) after symbol puncturing. They can be designed for any constellation, allowing for higher throughput than when restricted to using 4-PSK. We apply RCPC and RCPT to two embedded source coders: a perceptual subband coder and the ITU embedded ADPCM G.727 standard. Different operating modes with distinct source/channel bit allocation and UEP are defined. Each mode is optimal for a certain range of AWGN channel SNRs. Performance results using an 8-PSK constellation clearly illustrate the wide range of channel conditions at which the adaptive scheme using RCPT can operate. For an 8-PSK constellation, RCPT codes are compared to RCPC with bit interleaved coded modulation codes (RCPC-BICM). We also compare performance to RCPC codes used with a 4-PSK constellation     

Trellis-Coded MPSK with Reference Phase Errors

With trellis-coded MPSK schemes, reference phase errors have a major impact on the system performance. This paper analyzes the interrelation among the coded-modulation format, the reference phase tracker, and the carrier phase noise. A tight upper bound to the error probability of a maximum likelihood decoder is introduced. This bound reveals eight new distance-type functions which, along with the wellknown minimum Euclidean distance, characterize the coded-modulation scheme. Relationships between the new distance-type functions and the various system parameters as well as the irreducible probability of error are pointed out. Numerical results for uncoded QPSK and three Ungerboeck encoded 8-PSK schemes showy that excessive smoothing of the reference phase in presence of carder phase noise can degrade the performance of coded 8-PSK modulation considerably.     

Serial concatenation of LDPC codes and differential modulations

In this paper, we consider serially concatenated schemes with outer novel and efficient low-density parity-check (LDPC) codes and inner modulations effective against channel impairments. With a pragmatic approach, we show how to design LDPC codes tailored for simple and robust modulation formats, such as differentially encoded (DE) modulations. The LDPC codes are optimized through the use of a recently proposed analysis technique based on extrinsic information transfer (EXIT) charts. In particular, we optimize, through a "clever" random walk in the parametric space, the degree distributions of the outer LDPC codes, obtaining significant insights on the impact of such distributions on the performance of the proposed concatenated schemes. The optimization is carried out for transmission over both the additive white Gaussian noise channel and a noncoherent channel. The performance predicted by the EXIT chart-based optimization is confirmed by results obtained via computer simulations, considering phase-shift keying and quadrature amplitude modulation at the transmitter side, and iterative demodulation/decoding at the receiver side. The significance of the proposed optimized design of LDPC-coded schemes with DE modulations is validated by the fact that standard nonoptimized LDPC codes perform poorly when used together with inner DE modulations.     

Encoded 16-PSK: a study for the receiver design

The authors present the results of a design study of the receiver in a digital transmission system using the combined coding and modulation schemes known as Ungerboeck codes. Specifically, they examine the design of the receiver for encoded 16-PSK (phase shift keying) modulation, presenting first the traditional structure for the optimum receiver and then a simpler structure. The decoding depth of the Viterbi algorithm, the quantization of the metrics inside the Viterbi processor, and the phase jitter in the recovered carrier are considered. The impact of branch and path metric quantization inside the receiver is discussed, showing that a reasonable number of bits (8) is sufficient to obtain nearly optimum performance when the code complexity is limited. The effect of imperfect carrier recovery inside the receiver is studied, providing accurate analytical estimates of the error event probability as well as an upper bound to the symbol error probability. Results of a detailed simulation, including carrier and bit timing recovery blocks, show that the effects of imperfections on the bit error probability are very small, even at low signal-to-noise ratios. On the whole, results show the robustness of the Viterbi algorithm with respect to fairly rough quantizations of the metrics and indicate that carrier recovery is not as critical as expected     

Coding Schemes Incorporating Soft-Decision DPSK over HF Rayleigh Fading Channels

A soft-decision 8-DPSK modulation format is introducedin a concatenated coding scheme and the performance of the resultingsystem is evaluated over a slow Rayleigh fading HF ionospheric link inthe presence of Additive White Gaussian noise (AWGN). Well-known UngerboeckTCM techniques are used as inner codes and a Reed–Solomon blockcode as outer code. The coded/modulated signal is differentially encodedbefore transmission to combat random phase changes caused by the channel.Soft-decision demodulator's output is used as an input to a modifiedViterbi decoder that calculates the Euclidean distances of the receivedsignal from an 8-PSK constellation adapted to the signal's amplitudevariations. Block interleaving techniques are necessary to randomise longbursts of errors caused by the fading channel. Simulation results showthat significant coding gains are achieved with a minor bandwidth expansionover uncoded, diversity or other coded systems. Finally, theinteresting effects of interleaving on the performance of the proposedsystems are analysed.     

多天线对角空频编码传输

将平坦衰落信道的对角代数空时码(DAST)推广到频率选择性衰落信道,提出了对角空频分组码(DSF).基于多输入多输出天线和正交频分复用(OFDM),DSF码将满秩的旋转信号星座和子载波分组结合起来,以对角发送方式(每时刻只有一个天线发射)发射旋转信息符号向量的每个分量.成对错误概率分析表明:在频率选择性信道中,通过选择最佳的旋转矩阵,这种DSF-OFDM系统能实现满分集增益和最大的编码增益.系统采用了球型解码器对DSF码实施最大似然解码,它的解码复杂性是中等的,并且,解码算法的复杂性与信号星座的维数无关.此外,和先前所提出的一些方法相比,提出的空频码还具有频谱效率高(1symbol/s/Hz)的性能特点.     

Robustly good trellis codes

The relationship between the distance properties of trellis codes and the computational effort and error performance of sequential decoding is studied and optimum distance profile (ODP) and optimum free distance (OFD) trellis codes are constructed for 8-PSK and 16 QAM modulation. A comparison of the performance of both the ODP and the OFD trellis codes reveals that neither class of codes results in the best trade-off between error performance and computational effort when sequential decoding is used. A new algorithm is then proposed to construct robustly good trellis codes for use with sequential decoding. New trellis codes with asymptotic coding gains up to 6.66 dB are obtained using this algorithm, and the new codes achieve nearly the same free distances as the OFD codes and nearly the same distance profiles as the ODP codes     

Multilevel block codes for Rayleigh-fading channels

New multilevel block codes for Rayleigh-fading channels are presented. At high signal-to-noise ratios (SNRs), the proposed block codes can achieve better bit error performance over TCM codes, optimum for fading channels, with comparable decoder complexity and bandwidth efficiency. The code construction is based on variant length binary component block codes. As component codes for the 8-PSK multilevel block construction, the authors propose two modified forms of Reed-Muller codes giving a good trade-off between the decoder complexity and the effective code rates. Code design criteria are derived from the error performance analysis. Multistage decoding shows very slight degradation of bit error performance relative to the maximum likelihood algorithm     

基于无率纠错码和高阶QAM调制的收端速率自适应方案

现有的自适应解调方案中调制阶数最高仅限于16,且方案分析和设计中没有考虑信道编码的译码环节.本文研究适用于高阶QAM的自适应解调算法,并结合无率纠错码提出一种收端速率自适应方案.接收端有多种解调模式,每种解调模式删除一个符号中不同数量的、似然比绝对值最低的几个比特,以提高解调比特的可靠度和平均互信息.从互信息分析的角度,得到在满足要求的译码误码性能时,译码所需要的码字长度的理论结果,进一步给出在译码复杂度约束条件下解调模式的选择方案.以256-QAM调制星座和Raptor码为例对方案进行了仿真,验证了理论分析的正确性和方案的有效性.