BICM-ID的MPSK星座映射

在分析了星座映射对比特交织编码调制迭代译码影响的基础上,给出了迭代解调和解码时,星座映射的设计准则,进而给出了一种新的迭代解码的8PSK映射方案.新方案不但满足最大平方欧氏距离(MSEW)映射,在高信噪比时具有较好的性能,而且提高了解调器软信息的输出质量,因而在低信噪比时也具有较好的性能.性能分析和仿真结果表明所给方案的有效性.     

Turbo码结合已知比特的不等保护方案设计

交织器的引入使Turbo码对不同信息位具有明显的不等保护特性,从而对其性能产生影响。为了提高Turbo码译码性能,在给定的S距离伪随机交织器下,首先通过对多组随机输入信息序列的位误比特率仿真分析,找到对Turb0码性能影响较大的关键比特位置,然后在对Turbo码不等保护特性和已知比特Turbo码进行理论分析和研究的基础上,提出了关键比特不等保护和结合已知比特的Turbo码不等保护两种方案。最后,对提出的方案进行了仿真验证,结果表明在交织长度分别为200和400两种条件下,两种保护方案在高信噪比时与未保护相比均有0．2dB以上增益．且结合已知比特的Turbo码不等保护方案比关键比特保护方案性能更优。     

衰落信道中结合短帧交织的Turbo码的研究

Turbo码作为信道编码方案,可以获得较高的误比特性能,而交织器的设计是影响Turbo码性能的关键环节。在码的重量分析的基础上,借用稀疏矩阵概念,对S型随机交织器进行改进,提出了一种短帧交织器的设计原则,它可以减少低重量码的数量,从而提高Turbo码的性能。     

基于OFDM技术的软比特解码系统

提出了基于OFDM基带系统的软比特译码方法,该方法以Viterbi软比特译码为中心,改善传统OFDM基带系统接收端的解映射、解交织、解删余模块,使得各个模块兼容软比特判决。软判决采用3比特的量化作为数据处理单位,提高Viterbi译码的性能。该方法从解映射模块入手,将接收到的数据信号解映射为3比特量化数据,送入改进后兼容3比特量化数据的解交织模块和解删余模块。实验结果表明,对比硬比特解码,所提出的软比特解码系统在性能上有很大的提升。     

具有不等错误保护特性的LDPC 编码调制方案

针对LDPC（low-density parity-check）编码调制系统，提出了一种新的具有不等错误保护特性的调制方案，在一个码字内，利用不同的调制方式对于重要的比特给予较强的保护，对于次要的比特给予较弱的保护，该方案既适用于非规则LDPC码，也适用于规则LDPC码。计算机仿真结果表明，新方案的性能是传统16QAM及4QAM的折衷，当采用1／2码率时，其频带利用率与8PSK相同，但是误码率性能优于8PSK。新方案的性能优于现有文献中基于比特可靠性的调制映射方案，并采用EXIT（extrinsic information transfer）图对新方案的优异性能给出了解释。     

衰落信道下Turbo网格编码调制在图像传输中的性能研究

基于Turbo码和网格编码调制的特点,该文分析了TTCM的具体编译码方法,并分析比较了TTCM在8PSK调制下结合两种典型映射方案UP(Ungerboeck Partitioning),BP(BlockPartitioning)在Rayleigh信道中用于静态图像传输时的性能,给出了计算机仿真结果和评价图像传输质量的峰值信噪比(PSNR).     

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

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

采用预判决信息的LDPC码编码调制方案性能研究

低密度奇偶校验(LDPC)码是Turbo码以外另一种性能接近香农限的好码.本文将LDPC码与比特交织编码调制(BICM)相结合,首先给出了在不使用传统解调器与译码器之间迭代的情况下8PSK调制方案在AWGN信道和Rayleigh衰落信道中的性能(简称为无迭代方案).然后提出了一种新的接收端解决方案:首先对接收符号进行预判决,判决信息被用来调整解调器,从而在一定程度上弥补了不使用解调器与译码器之间迭代所造成的性能损失,并且相对于无迭代方案接收端复杂度几乎没有变化,但性能却有所提高.这说明原有比特度量产生方法并不是最佳的,该文使用预判决信息的方案给出了一个改善的思路.通过仿真结果可以得到结论:使用本文所提出的方案在AWGN信道和Rayleigh衰落信道中都可以在不增加复杂度的情况下提高性能.     

一种基于递归系统卷积码校验重量下限的匹配交织器设计方法

针对短帧Turbo码中交织器优化设计问题,提出了一种基于递归系统卷积码(RSC)校验重量下限的匹配交织器设计方法.文中重新分析了Turbo码中"局部坏点"具体形式,然后提出并证明了一种估计RSC分量码校验序列重量下限的方法,并将其应用于交织器映射方式优选时局部坏点对应Turbo码字重量下限估计,只有能够保证所有局部坏点对应码字重量的交织方法才被认为合法.仿真表明,与几种现有交织器设计方法相比,本文提出的匹配交织器设计方法性能更加优良,可以有效改善Turbo码的误比特性能.     

基于BICM的高效编码协作方案及性能分析

 提出一种基于比特交织编码调制(BICM)的高效编码协作(CC)方案,该方案中协作用户编码比特分为两帧,每一帧都通过BICM调制发送,通过结合比特交织器满足高阶调制星座符号的不同比特经历的衰落独立。一方面,论文分析了该协作方案在不同信道下的成对错误概率,并进一步推导了错误比特概率上界。理论分析以及仿真结果都表明：准静态衰落信道下,基于BICM的高谱效率编码协作方案仍然可以获得完全分集;而快衰落信道下,编码协作没有分集。另一方面,论文针对提出CC方案中映射方式以及交织器的设计进行研究,得出GRAY映射仍然是协作用户采用的最佳映射,且两帧的交织器不同更利于提高性能。     

The Design of a High-Performance Error-Correcting Coding Scheme for the Canadian Broadcast Telidon System Based on Reed-Solomon Codes

Error correction can greatly improve the performance and extend the range of broadcast teletext systems. In this paper, the requirements for an error-correcting scheme for broadcast teletext in North America (NABTS) are set down. An error-correction scheme which meets all these requirements is then described. The simplest case employs the one parity bit in each 8 bit byte and no suffix of parity check bits at the end of each data block. The next level also uses a single byte of parity check bits at the end of each data block. Adding a second byte of parity checks at the end of each data block results in a Reed-Solomon code, called theCcode, for each data block. Adding one data block of parity checks afterh - 1data blocks results in a set ofhdata packets being encoded into a bundle, in which verticalCcodes provide powerful interleaving. In a final alternative, two data blocks hold the check bytes for the vertical codewords, and the most powerful coding scheme, the double bundle code, results. The detailed mathematical definitions of the various codes are referred to or described, formulas for performance calculations are referred to, and performance curves are presented for the AWGN channel as well as for measured field data. These performance curves are discussed and compared to the performance of a difference set cyclic code, originally designed for the Japanese teletext system, which corrects any 8 bits in error in a packet.     

Performance of degree distribution based HARQ scheme for LDPC-coded OFDM system

This article studies the degree distribution property of low density parity check (LDPC) codes by Gaussian approximation (GA) and presents an efficient hybrid automatic repeat quest (HARQ) scheme for LDPC-coded orthogonal frequency division multiplexing (OFDM) system. In the scheme, the important bits with large degrees have high retransmission priorities and are mapped to the sub-carriers with better channel quality indicator (CQI) levels in the OFDM system. The new scheme provides more protection to the bits with large degrees and thus contributes more to the decoding process by offering more transmission power. In this way the system performance would be improved. The statistics and simulation results also prove the new scheme.     

Turbo编码V-BLAST MIMO-OFDM系统中的联合迭代判决反馈信道估计与检测

针对Turbo编码V-BLAST MIMO—OFDM系统，提出了一种联合迭代判决反馈信道估计与检测方案，该方案将Turbo迭代译码与最小二乘（LS，least square）信道估计相结合，充分利用Turbo迭代译码后的信息位和校验位软值信息来改善信道估计性能。仿真结果表明，该方案不仅纠正了低信噪比时的差错传播问题，还使得整个系统的信道估计性能得到进一步提高，且适合于非常恶劣的信道环境。     

Trellis-coded 8PSK with embedded QPSK

A coded eight-phase-shift-keying (C8PSK) method is described that is characterized by a quaternary phase-shift-keyed signal embedded in the modulated sequence. This method is a double-trellis-coded modification of the well-known C8PSK and is referred to as MC8PSK. Five coded bits are generated from four user bits in a single coding step and then mapped to an 8PSK symbol followed by a QPSK symbol. Given comparable decoder or receiver complexity, the coding gains of C8PSK and MC8PSK are comparable. Advantages of MC8PSK concern carrier synchronization. With C8PSK, problems with carrier phase tracking are encountered. With MC8PSK, these can be avoided, since carrier phase control can be based on the embedded QPSK. For some codes, error-free decoding is achievable in any locking condition of a QPSK-dependent PLL (phase locked loop), making synchronization and decoding especially simple. The partitioning of the channel symbol set, the associated bit mapping, and the code design are treated in order to describe MC8PSK. Aspects of receiver synchronization are discussed for C8PSK and for MC8PSK, focusing on QPSK phase-detection principles. The implementation of a four-state MC8PSK modem for an information rate of 2.048 Mb/s is described, and experimental results demonstrating the very robust carrier synchronization are presented     

On ternary phase-shift keyed signaling (Corresp.)

In agreement with a recent paper by Pierce, it is shown that ternary, phase-shift keyed (PSK) signals attain the lowest bit error rate at high signal-to-noise ratio (SNR) if more than4/3binary digits can be mapped to a symbol. This point is further demonstrated by using a 3B-2T Code which maps 1.5 bits to a symbol. The spectrum and bit error rate are evaluated for the 3B-2T coded Ternary. PSK signal and compared with those of quaternary phase-shift keyed (QPSK) signal.     

Turbo codes-based image transmission for channels with multiple types of distortion

Product codes are generally used for progressive image transmission when random errors and packet loss (or burst errors) co-exist. However, the optimal rate allocation considering both component codes gives rise to high-optimization complexity. In addition, the decoding performance may be degraded quickly when the channel varies beyond the design point. In this paper, we propose a new unequal error protection (UEP) scheme for progressive image transmission by using rate-compatible punctured Turbo codes (RCPT) and cyclic redundancy check (CRC) codes only. By sophisticatedly interleaving each coded frame, the packet loss can be converted into randomly punctured bits in a Turbo code. Therefore, error control in noisy channels with different types of errors is equivalent to dealing with random bit errors only, with reduced turbo code rates. A genetic algorithm-based method is presented to further reduce the optimization complexity. This proposed method not only gives a better performance than product codes in given channel conditions but is also more robust to the channel variation. Finally, to break down the error floor of turbo decoding, we further extend the above RCPT/CRC protection to a product code scheme by adding a Reed-Solomon (RS) code across the frames. The associated rate allocation is discussed and further improvement is demonstrated.     

Unveiling turbo codes: some results on parallel concatenated codingschemes

A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the first encoder followed by the parity check bits of both encoders. This construction can be generalized to any number of constituent codes. Parallel concatenated schemes employing two convolutional codes as constituent codes, in connection with an iterative decoding algorithm of complexity comparable to that of the constituent codes, have been previously shown to yield remarkable coding gains close to theoretical limits. They have been named, and are known as, “turbo codes”. We propose a method to evaluate an upper bound to the bit error probability of a parallel concatenated coding scheme averaged over all interleavers of a given length. The analytical bounding technique is then used to shed some light on some crucial questions, which have been floating around in the communications community since the proposal of turbo codes     

Early detection of successful decoding for dual-diagonal block-based LDPC codes

Low-density parity-check (LDPC) codes [1] have attracted much attention in the last decade owing to their capacityapproaching performance. LDPC codes with a dual-diagonal blockbased structure can be encoded in linear time with lower encoder hardware complexity [2]. This class of LDPC codes is adopted by a number of standards such as wireless LAN (IEEE 802.11n) [3], wireless MAN (IEEE 802.16e, WiMAX) [4] and satellite TV (DVB-S2) [5]. LDPC codes are commonly decoded by the iterative belief-propagation (BP) algorithm. The decoder checks the parity-check equations to detect successful decoding at the end of the iteration. The Tanner graph of an irregular LDPC code consists of nodes with different degrees such that coded bits have unequal error protection [6]. Coded bits associated with higher degree nodes tend to converge to the correct answer more quickly. Hence, in order to give better protection to the transmitted data, data bits are always mapped to higher degree nodes whereas parity bits are mapped to lower degree nodes in the encoding process. The commonly used parity-check equations Hc t ? 0t will be satisfied after all the coded bits are correctly decoded. However, as discussed above, data bits converge to the correct answer much more quickly than parity bits, so some unnecessary iterations are wasted waiting for the parity bits to be decoded. In this Letter, a new set of low-complexity check equations are derived for dual-diagonal block-based LDPC codes. Early detection of successfully decoded data can be achieved by exploiting the structure and degree of distribution of the dual-diagonal parity check matrix. The decoder power, speed and complexity can be improved by adopting these equations. Simulation shows that the coding gain performance is little changed.     

An Image Authentication Method by Grouping Most Significant Bits

In 2011, Chan proposed an image authentication method by producing the parity check bits from pixels whose bits have been rearranged. Due to this rearrangement, the value of the most-significant bit of each tampered pixel can be determined according to its parity check bits. With the help of the most-significant bit of the pixel, the pixel can be recovered by selecting two possible (7, 4) Hamming code words. However, if the distance between two Hamming code words is within a certain range, incorrect selection may occur. Chan's method added one additional bit to indicate the correct one. It is trivial that this may degrade the quality of the authenticated image. In this paper, we group four most-significant bits into different groups to form a mapping codebook and the mapping codebook is used to produce authentication data instead of the (7, 4) Hamming code book. The experimental results show that the proposed method has a greater ability to recover tampered areas.