Iterative demodulation and decoding of turbo-coded M-ary noncoherent orthogonal modulation

This paper considers bit-interleaved coded modulation (BICM) with a turbo channel code and M-ary orthogonal modulation. The BICM signal is iteratively demodulated and decoded in a noncoherent fashion. A soft demodulator suitable for noncoherent orthogonal modulation is presented, and the convergence of the iterative receiver is analyzed through extrinsic information transfer charts. The demodulator can work either with or without fading amplitude estimates. Extensive simulation results are presented for the well-known cdma-2000 turbo code, and the results are compared with the corresponding channel capacities, which are computed using a Monte Carlo technique. The results indicate gains of up to 1 dB relative to noniterative BICM can be achieved with the iterative receiver.     

BICM在差分跳频系统中的应用

将比特交织编码调制(BICM)技术应用于差分跳频(DFH)通信系统,在加性白高斯噪声(AwGN)信道及频率非选择性瑞利慢衰落信道下,对采用无迭代译码及迭代译码的系统比特误码率(BER)上界进行了理论推导及数值仿真验证,并与传统的差分跳频系统的性能进行了比较.其数值仿真结果表明:采用BICM技术的差分跳频系统,可以在不增加跳频带宽及译码复杂度的情况下,利用最优卷积码增大了其G函数网格图的最小自由距离.同时对于可用频率数为16的无迭代译码BICM/DFH,当BER为10-1时,在瑞利信道下相对于CHESS系统而言,其性能改善可达6dB.若采用迭代译码,则当BER为10-1时,其性能相对于无迭代译码可进一步改善3,dB.     

Benchmarking Iterative Receivers for BICM Multi-Carrier Systems Against Capacity Bounds

In this paper, we analyze iterative receivers for bit-interleaved coded modulation (BICM) multi-carrier systems and compare them against theoretical capacity bounds for the channel, coded modulation, and BICM. We map the theoretical capacity bounds into bit-error rate (BER) versus average signal-to-noise ratio per bit plots to simplify the comparison between the theoretical capacity bounds and simulated BER curves. As BER simulations show, iterative receivers with code doping or spreading reach the turbo-cliff within 1 or 0.3dB of the independent Rayleigh fading channel capacity. While the iterative receiver with spreading is closer to the channel capacity than the one with code doping, the later one can eliminate the residual bit-errors after the turbo-cliff. We further present a combinatorial analysis of the distribution of the spread symbol constellation for Walsh-Hadamard spreading codes used in a BICM multi-carrier system to explain the above results.     

Performance analysis of coded modulation with generalized selection combining in Rayleigh fading

We consider coded modulation with generalized selection combining (GSC) for bandwidth-efficient-coded modulation over Rayleigh fading channels. Our results show that reception diversity with generalized selection combining can conveniently trade off system complexity versus performance. We provide a number of new results by calculating the cutoff rate, and by deriving analytical upper bounds on symbol-interleaved trellis-coded modulation (TCM) and bit-interleaved-coded modulation (BICM) with GSC. All are verified by simulation. We show that our new bounds on TCM with GSC, which includes maximum ratio combining and selection combining as special cases, are tighter than the previously derived bounds. A new asymptotic analysis on the pairwise error probability, which can be used as a guideline for designing coded modulation over GSC channels, is also given. Finally, we show that BICM with iterative decoding (BICM-ID) can achieve significant coding gain over conventional coded modulation in a multiple-receiving-antenna channel.     

一种短延时Turbo编码调制系统的设计

本文设计了一种比传统体制减少了一半延时的Turbo编码调制系统,介绍了交织器的相关限制.提出了一种在译码过程中对信道值的估计方法,使得外信息的计算更加趋于精确,从而提高了译码性能.这种迭代译码算法是标准格码调制译码算法的一种自然推广,同时也类似于二元Turbo码在BPSK调制下的逐比特译码算法.采用吞吐率为2bits/s/Hz的8PSK调制,比特错误率为10^-5所需的信噪比与Shannon限相距不到0.4dB.     

Bit-interleaved space-time coded modulation with iterative decoding

Bit-interleaved space-time coded modulation (BI-STC), which combines serial concatenation of bit-interleaved coded modulation (BICM) with space-time block codes, can effectively exploit the available diversity in space and time under various fading conditions. In this letter, we propose to use iterative decoding to further improve the performance of BI-STC by exploiting the concatenating structure of the codes. The decoding metric is therefore modified to fit for the iterative process, and the derived error bounds suggest that set-partition labeling instead of gray labeling should be used when considering iterative decoding.     

适用于BICM-ID系统的星座成形方法

结合几何成形与概率成形的思想,提出了一种适用于比特交织编码调制系统的星座成形映射方法。该方法基于实用信号星座,通过不使用部分能量较大的信号点并利用多对一的映射关系,使发送信号逼近最佳输入概率分布。利用解调器和译码器之间的迭代译码,该方法可方便地获得成形增益。基于容量和外信息转移图分析,给出了信号星座和信号到符号映射的优化方法。理论分析和仿真结果表明,在高斯白噪声信道和独立Rayleigh衰落信道下,该映射方法利用大信号星座在采用迭代译码的比特交织编码调制系统中均能取得优于传统Gray映射的误码性能,且随着调制阶数的增大可进一步提高成形增益。     

一种用于BICM-ID系统的新颖8APSK映射方案

为了能够通过高阶调制信号增加信道容量,提高编码增益和频谱效率,对8阶振幅移相键控(APSK)星座映射方案进行优化.基于欧氏距离设计准则提出一种新颖(2,6)-scheme 8APSK映射方案,并应用于联合准循环构造法构造的低密度奇偶校验(LDPC)(4599,4307)码的比特交织编码调制迭代译码(BICM-ID)系统中.信道容量仿真表明,所提方案在高、低信噪比区域都具有非常优越的互信息性能.误码率(BER)性能仿真表明,在BER为10-7时,联合LDPC(4599,4307)码的(2,6)-scheme 8APSK映射方案较(4,4)-scheme 8APSK映射方案、8PSK调制的格雷(Gray)映射、集分割(SP)映射、半集分割(SSP)映射分别提高了约0.45 dB、1.10 dB、1.62 dB、2.13 dB的编码增益.外附信息转移(EXIT)图仿真说明,所提方案能够更早地打开译码通道,从而更早地通过迭代来实现无错译码.     

Pilot-symbol-assisted LDPC coded BICM over correlated Rayleigh fading channels

Pilot-symbol-assisted low-density parity-check (LDPC)-coded bit-interleaved coded modulation (BICM) is analyzed using the density evolution (DE) and the extrinsic information-transfer (EXIT) chart for correlated Rayleigh fading channels. The key parameter (the power correlation coefficient) is identified, and the threshold degradation is quantified. The optimal tradeoff of energy allocation between pilots and coded symbols is found to be sensitive to the normalized Doppler spread of the channel, the interpolation filter, the modulation scheme, and the pilot selection. In addition, a simple upper bound on the performance of any receiver that performs joint iterative decoding and channel estimation is derived. Extension to irregular code design is also discussed.     

Multidimensional Subcarrier Mapping for Bit-Interleaved Coded OFDM With Iterative Decoding

A power and bandwidth-efficient bit-interleaved coded modulation (BICM) with orthogonal frequency-division multiplexing (OFDM) and iterative decoding (BI-COFDM-ID) using combined multidimensional mapping and subcarrier grouping is proposed for broadband transmission in a frequency-selective fading environment. A tight bound on the asymptotic error performance is developed, which shows that subcarrier mapping and grouping have independent impacts on the overall error performance, and hence, they can be independently optimized. Specifically, it is demonstrated that the optimal subcarrier mapping is similar to the optimal multidimensional mapping for bit-interleaved coded modulation with iterative decoding (BICM-ID) in frequency-flat Rayleigh fading environment, whereas the optimal subcarrier grouping is the same with that of OFDM with linear constellation preceding (LCP). Furthermore, analytical and simulation results show that the proposed system with the combined optimal subcarrier mapping and grouping can achieve the full channel diversity without using LCP and provide significant coding gains as compared to the previously studied BI-COFDM-ID with the same power, bandwidth, and receiver complexity.     

Bit-interleaved coded modulation with iterative decoding using softfeedback

A new iterative decoding (ID) scheme is suggested for bit-interleaved coded modulation (BICM). The bit-metric generation at the demodulator is optimised with the soft-output feedback from the convolutional decoder. Computer simulation results indicate that BICM-ID, with a few iterations, significantly outperforms conventional trellis coded modulation and is therefore another promising technique to achieve large coding gain without bandwidth expansion     

改进交织的单层极化码高阶编码调制系统

极化码作为一种新型编码方式,被采纳为5G通信中的短码方案。本文将极化码应用到比特交织编码调制（Bit-Interleaved Coded Modulation,BICM）系统,优化交织器的设计,提出了一种新型交织算法。相比于现有的交织算法,新型交织算法的提出是基于比特信道可靠性衡量参数,将高可靠性的比特信道与低可靠性的比特信道交错设计,按照高可靠性信道对低可靠性信道辅助译码的方式,提高极化码的纠错性能。由于新型交织算法只存在于比特信道可靠度参数的简单排序,在复杂度上没有明显增加。仿真结果表明:新型交织算法具有优异的性能,当误码率为10-5,码长为256时,采用新型交织算法的极化码BICM系统与LDPC码的BICM系统相比大约有1.51 dB的增益。      

一种高效的联合编码调制分集——迭代接收方案

本文研究了加入迭代解调译码的比特交织编码调制方案,并通过联合编码调制分集扩展此方案。BICM-ID通过信号空间分集增加分集数,并选择最优旋转角度使性能上进一步取得了明显增益。     

Reliability-based coded modulation with low-density parity-check codes

In this letter, we consider the interleaver design in bit-interleaved coded modulation (BICM) with low-density parity-check (LDPC) codes. The design paradigm is to provide more coding protection through iterative decoding to bits that are less protected by modulation (and are thus less reliable at the output of the demodulator). The design is carried out by an ad hoc search algorithm over the column permutations of the parity-check matrix. Our simulations show that the proposed reliability-based coded modulation scheme can improve the error-rate performance of conventional BICM schemes based on regular LDPC codes by a few tenths of a decibel, with no added complexity.     

Improved space-time coding for MIMO-OFDM wireless communications

Improved space-time coding for multiple-input multiple-output orthogonal frequency division multiplexing is studied for wireless systems using QPSK modulation for four transmit and four receive antennas. A 256-state code is shown to perform within 3 dB of outage capacity (and within 2 dB with perfect channel estimation), which is better than any other published result without using iterative decoding     

Trellis-coded modulation with bit interleaving and iterativedecoding

This paper considers bit-interleaved coded modulation (BICM) for bandwidth-efficient transmission using software radios. A simple iterative decoding (ID) method with hard-decision feedback is suggested to achieve better performance. The paper shows that convolutional codes with good Hamming-distance property can provide both high diversity order and large free Euclidean distance for BICM-ID. The method offers a common framework for coded modulation over channels with a variety of fading statistics. In addition, BICM-ID allows an efficient combination of punctured convolutional codes and multiphase/level modulation, and therefore provides a simple mechanism for variable-rate transmission     

结合6-QAM和双层LDPC码的编码调制研究

针对阶数为3 ×2p的非标准调制与纠错编码难以匹配的问题,提出了一种面向6阶正交幅度调制(QAM)的双层编码调制传输方案.在发送端,采用有限域GF(2)低密度奇偶校验(LDPC)码与GF(3)LDPC码进行分层编码,并将两种编码码字映射为6进制码字后进行6-QAM调制;在接收端,根据GF(2) LDPC码和GF(3) ...     

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.     

SVD iterative detection of turbo-coded multiantenna unitary differential modulation

A new suboptimal demodulator based on a singular value decomposition 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 is available at the receiver is investigated. 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 0/) of 1.6-1.9 dB from code restricted capacity limit were found. At higher data rates, computation of code restricted capacity is impractical. Therefore, the mutual information upper bound of the capacity attaining isotropically random unitary transmit matrices was used. The codes achieve BER lower than 10/sup -4/ at E/sub b//N/sub 0/ of 3.2-6 dB from this bound, with coding rates of 1.125-5.06 bits per channel use, and different modulation decoding complexities. The codes comprise 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.     

A BICM-IDD scheme for non-coherent MIMO communication

A bit-interleaved coded modulation (BICM) scheme with iterative (soft) demapping and decoding (IDD) is developed for non-coherent communication over a multiple-input multiple-output (MIMO) channel. The scheme exploits the underlying Grassmannian geometry of the signalling scheme that approaches the ergodic capacity of the non-coherent model at high signal-to-noise ratios. In particular, this geometry guides the construction of the constellation and the mapper at the transmitter, and gives rise to a computationally-efficient list-based demapping algorithm. The incorporation of a scheme that enables the decoder to augment the demapping list virtually eliminates the mild performance degradation of the efficient demapper. Simulation results demonstrate that at high data rates the proposed scheme can provide significantly better performance than several training-based BICM-IDD schemes.