Noncoherent block-coded MPSK

For coherent detection, block-coded modulation is a bandwidth efficient scheme. In this paper, we propose theorems about the error performance of block-coded modulation using M-ary phase-shift keying (MPSK) for noncoherent detection. Based on these theorems, we propose a novel block-coded modulation scheme for noncoherent detection called noncoherent block-coded MPSK. The proposed scheme provides flexible designs of noncoherent block codes with different code rate, block length and error performance. Good noncoherent block codes can be easily obtained by properly choosing binary linear block codes as the component codes. Moreover, noncoherent block codes of this new scheme can be decoded by multistage decoding, which has the advantage of low complexity and satisfactory error performance. In this paper, two algorithms of multistage decoding for noncoherent detection are proposed as well. The error performance of some designed codes and decoding algorithms is verified by computer simulation.     

Iterative Equalization and TCM Decoding with Refined Channel Value

In this correspondence, we present a new method for the iterative equalization and decoding of multilevel trellis coded modulation (TCM) signals over frequency selective channels. Results show that the proposed algorithm achieves better performance compared to the previous work on the MMSE filter- based turbo equalization for a non-binary coded modulation scheme. The performance gain is accomplished by utilizing the combined modulation and coding nature of TCM and passing the refined signal obtained from different paths to the TCM decoder as the channel value in addition to the a priori probabilities.     

空时分块编码OFDM系统的Turbo均衡

研究了空时分块编码的OFDM（正交频分复用）系统,对系统进行了Turbo均衡,并讨论了此时系统的译码算法和均衡算法。系统信道编码采用Turbo码,通过对BCJR（Bahl,Cocke,Jelinek,Raviv）算法的简单修改得到SISO（单输入单输出）MAP（最大后验概率）译码算法;均衡器采用SISOMMSE（最小均方差）Turbo均衡算法,并利用OFDM系统的循环前缀特性进一步降低算法复杂度。通过仿真对系统性能进行了比较分析,仿真结果表明,采用迭代均衡的空时分块编码OFDM系统性能要明显优于未空时编码和未迭代均衡的OFDM系统。     

Overview and comparison of equalization schemes for space-time-coded signals with application to EDGE

This paper describes and compares several practical equalization schemes for space-time-coded transmissions over broadband wireless channels. For space-time trellis codes (STTCs), we describe and compare two reduced-complexity trellis-based joint equalization and decoding schemes whose performance is further optimized by a front-end finite-impulse response (FIR) channel-shortening prefilter. For space-time block codes, we describe and compare three joint equalization and decoding schemes based on a block-level implementation of the well-known Alamouti scheme either in the time or frequency domains. We consider the third-generation time division multiple access (TDMA) cellular system known as Enhanced Data rates for Global Evolution (EDGE) and recommend a promising equalization scheme for space-time trellis-coded and for Alamouti-type space-time block-coded dual-antenna transmissions based on simulation results for typical urban channel conditions where the delay spread is few symbol periods.     

Further results on noncoherent block-coded MPSK [transactions papers]

A novel noncoherent block coding scheme, called noncoherent block-coded MPSK (NBC-MPSK), was proposed recently. In this paper, we present further research results on NBC-MPSK. We first focus on the rotational invariance (RI) of NBC-MPSK. Based on the RI property of NBC-MPSK with multistage decoding, a noncoherent near-optimal linear complexity multistage decoder for NBC-MPSK is proposed. Then we investigate a tree-search ML decoding algorithm for NBCMPSK. The derived algorithm is shown to have low complexity and excellent error performance. In this paper, we also utilize the idea of the NBC-MPSK to design noncoherent space-time block codes, called noncoherent space-time block-coded MPSK (NSTBC-MPSK). For two transmit antennas, we propose a signal set with set partitioning and derive the minimum noncohent distance of NSTBC-MPSK with this signal set. For the decoding of NSTBC-MPSK, we modify the ML decoding algorithm of NBC-MPSK and propose an iterative hard-decision decoding algorithm. Compared with training codes and unitary space-time modulation, NBC-MPSK and NSTBC-MPSK have larger minimum noncoherent distance and thus better error performance for the noncoherent ML decoder.     

高阶相位调制的调制分集

研究了高阶相位调制的调制分集,分析了调制分集对比特交织空时编码调制迭代译码(BI-STCM-ID)系统性能的影响,得到了引入调制分集后系统的解码比特度量的解析表达式。理论分析和仿真结果表明,调制分集改善了BI-STCM-ID系统在Rayleigh信道下的性能,同时,空时分集与调制分集的结合,对改善快衰落信道和慢衰落信道的性能具有相互补充的效果。     

A space-time block-coded OFDM scheme for unknownfrequency-selective fading channels

We introduce a space-time block-coded orthogonal frequency-division multiplexing (STBC-OFDM) selective fading channels which does not require channel knowledge either at the transmitter or at the receiver. The decoding algorithm is based on generalized maximum-likelihood sequence estimation. We investigate the performance of the proposed scheme over two-tap Rayleigh fading channels. Simulation results show the performance to be near optimum     

Refinements and asymptotic performance of bandwidth-efficient turbo product codes

In this letter, a turbo product code (TPC) is combined with multilevel modulations (8-phase-shift keying and 16-quadrature amplitude modulation). The component codes are Bose-Chaudhuri-Hocquengem (BCH) or extended BCH. We derive soft-input/soft-output modules based on the dual code, with exact Euclidean metrics, and we show that the iterative TPC decoder gains no advantage in performance from this. Next, we evaluate asymptotic approximations for maximum-likelihood (ML) decoding from a combinatorial approach that can be applied to any bit-interleaved multilevel modulated code, once the first term (or terms) of the Hamming weight spectrum are known. For the TPCs and modulations studied in this letter, random bit interleaving before modulation leads to improved ML asymptotes. Simulations confirm that this advantage is maintained also under iterative decoding.     

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     

On decoding of block codes with peak-power reduction in OFDMsystems

This letter discusses the decoding of a block-coded scheme proposed for orthogonal frequency division multiplexing peak power reduction, employing the ordered statistic decoding algorithm. Performance is evaluated by computer simulations over an additive white Gaussian noise channel and compared with the union bound. It is shown that with respect to optimum decoding, significant computational reduction can be achieved without noticeable error performance degradation     

Decoding of trellis-encoded signals in the presence of intersymbolinterference and noise

A novel receiver for data-transmission systems using trellis-coded modulation is investigated. It comprises a whitened-matched filter and a trellis decoder which combines the previously separated functions of equalization and trellis-coded modulation (TCM) decoding. TCM encoder, transmission channel, and whitened-matched filter are modeled by a single finite-state machine with combined intersymbol interference and code states. Using ISI-state truncation techniques and the set-partitioning principles inherent in TCM, a systematic method is then developed for reducing the state complexity of the corresponding ISI and code trellis. A modified branch metric is used for canceling those ISI terms which are not represented by the trellis states. The approach leads to a family of Viterbi decoders which offer a tradeoff between decoding complexity and performance. An adaptive version of the proposed receiver is discussed, and an efficient structure for reduced-state decoding is given. Simulation results are presented for channels with severe amplitude and phase distortion. It is shown that the proposed receiver achieves a significant gain in noise margin over a conventional receiver which uses separate linear equalization and TCM decoding     

On the error performance of multilevel block-coded modulation

Multidimensional multilevel block-coded modulation employing quadrature amplitude modulated constellations are considered. An approximation to their error performance is described and compared to simulation results, which show it to be a very good estimate at moderate to high signal-to-noise ratio. The effect of parallel transitions is considered and the tradeoff between distance and the error coefficient is explored     

Diversity Combining and Equalization with TCM for Wireless Communications

This paper presents an equalization structure in which antennadiversity, adaptive decision feedback equalization (DFE), interleavingand trellis-coded modulation (TCM) can be effectively combined to combatboth ISI and cochannel interference in cellular mobile radioenvironments. The feedback filter of the DFE can use either tentative orfinal decision symbols of the TCM Viterbi decoding to cancel tail ISIwith the square root Kalman algorithm. A performance bound on theaverage pairwise error probability for TCM under perfect interleavingand equalization is obtained by analysis. Some simulation results whichillustrate the potential of the proposed system will also be given. Inparticular, a performance comparison between the proposed method anduncoded QPSK modulation will be undertaken.     

基于脉冲位置调制的无线光通信多级编码调制及其多阶段解调译码算法

针对无线光通信脉冲位置调制(PPM)与信道编码的结合应用,提出了一种多级编码调制方案,利用多级编码的多级标签结构,将PPM符号所对应的分组比特分拆到不同子码通道的码字中,同时结合PPM的信号集分割和极大似然检测解调方法,推导了方案的多阶段解调译码算法。在弱湍流大气条件下的仿真分析表明,PPM多级编码调制相对单级编码调制在误码率10-6下获得0.85 dB以上的增益,且可实现对不同重要程度信息段的不等差错保护。在分量码码型给定的条件下,按纠错能力逐级配置分量码并采用所推导的多阶段解调译码,可为系统提供更好差错性能,优于直接的并行译码方法。     

数字调幅广播中基于LDPC码的多级编码方案

研究了DAMB系统中基于LDPC码的多级编码方案。首先,设计了MLC分量码的码率,从而给出一种具有自适应特性的以LDPC码为分量码的多级编码方案。提出了基于可靠信息传播的多级译码方案,该方案不会造成信息丢失,且不需要重编码。构造了一组性能优异的非正则LDPC码并在DAMB信道进行了差错率仿真,结果表明基于LDPC码的MLC方案全面优于标准中RCPC/MLC方案。     

Improved decoding of LDPC coded modulations

A coded modulation belief propagation (CMBP) decoder is proposed for decoding LDPC codes with multilevel modulations. The decoder takes into account statistical dependencies among bits originating in the same symbol, providing better performance than the marginal BP (MBP) decoder. Asymptotically it converges to MAP decoding. The CMBP decoder is based on a single-level coding (SLC) scheme and does not suffer from practical disadvantages of multi-level coding (MLC) schemes. Furthermore, the CMBP decoder can close the capacity gap of the bit interleaved coded modulation (BICM) SLC scheme. The BICM capacity gap increases when the modulation size increases and in scenarios where gray mapping is not possible.     

Systolic architecture for the VLSI implementation of high-speed staged decoders/quantizers

We describe the systolic-array implementation of a block-oriented algorithm known as staged decoding, applicable to a class of signal-space codes and lattices obtained through “generalized concatenation”. By exploiting the trellis representation of block codes and the algebraic formulation of Viterbi Algorithm, we derive a very efficient symbol-level pipelined architecture of the staged processor. In order to show the range of applicability of our architecture, we consider the implementation of a staged decoder for the 8-PSK block-coded modulation (BCM) scheme with block length 8 and rate 1 bit/dimension. We obtain a decoding rate of more than 700 Mbit/s with an associated hardware complexity of less than 30 Kgates with 1μ CMOS technology. A preliminary, shorter version of this paper was presented at ICC'93, Geneva, May 1993.     

一种利用信源冗余的Turbo均衡新算法

为克服无线衰落信道中严重的符号间干扰( ISI)的影响,提出了一种新的利用信源冗余的Turbo均衡算法。该算法将联合信源信道译码技术与Turbo均衡技术结合起来,在均衡、译码、信源之间建立起软信息交互的环路,有效提高了整体接收的性能。外信息传递( EXIT)图分析与计算机仿真均表明,尽管信源冗余给译码器带来的性能提升较为有限,但是将这部分信息反馈回均衡器后,在严重ISI信道,信源冗余度为70%时,整体接收的性能改善约为9.5 dB,基本达到了理想加性高斯白噪声( AWGN)信道下的误码性能。     

一种利用信源冗余的Turbo均衡新算法

为克服无线衰落信道中严重的符号间干扰(ISI)的影响,提出了一种新的利用信源冗余的Turbo均衡算法。该算法将联合信源信道译码技术与Turbo均衡技术结合起来,在均衡、译码、信源之间建立起软信息交互的环路,有效提高了整体接收的性能。外信息传递(EXIT)图分析与计算机仿真均表明,尽管信源冗余给译码器带来的性能提升较为有限,但是将这部分信息反馈回均衡器后,在严重ISI信道,信源冗余度为70%时,整体接收的性能改善约为9.5 dB,基本达到了理想加性高斯白噪声（AWGN）信道下的误码性能。     

用于盲接收的turbo均衡与迭代信道估计

Turbo均衡是一种将信道均衡和差错控制译码联合迭代处理的均衡机制,与传统的均衡器相比,能在更低的信噪比条件下克服严重信道失真导致的符号间干扰(ISI)。该文提出一种用于盲接收的turbo均衡和迭代信道估计方案,不依赖于训练序列或发送符号的先验知识,采用初始盲均衡处理来启动迭代信道估计和turbo均衡。在该方案中,初始盲均衡算法的选择是十分关键的,它需要在恶劣的信道条件为后续迭代处理的启动提供足够的先验信息。该文根据turbo均衡的特点,选择了超指数算法作为初始盲均衡。仿真结果表明,该文提出的用于盲接收的turbo均衡方案是有效的。