Hybrid block-convolutional rate-½ coding strategy forconstant envelope (CE)Q2PSK

The authors address the problem of trellis coding on multidimensional signal space for incorporation into a 4D quadrature-quadrature phase-shift keying (Q²PSK) communication system. A low-complexity rate-½ hybrid block-convolutional coding scheme is proposed, to be utilised in a constant envelope (CE)Q²PSK system configuration. The encoder and decoder designs have been structured to facilitate simple implementation with standard components. The bit error rate performance of the proposed coding scheme is studied by means of simulation on a non-frequency selective Rician fading channel assuming coherent detection. The benefits of the use of channel state information (CSI) in conjunction with maximum-likelihood Viterbi decoding are also considered     

An adaptive coding scheme for time-varying channels

An adaptive coding scheme for digital communication over time-varying channels is presented. The scheme is based on a finite-state Markov channel model. Emphasis is on the adaptation of the error protection to the actual channel state. The throughput gains that are achieved by the adaptive scheme relative to the conventional nonadaptive coding methods are demonstrated by several examples. Of special interest is the use of punctured convolutional codes with maximum-likelihood Viterbi algorithm to enable adaptive encoding and decoding without modifying the basic structure of the encoder and the decoder     

Interleaved convolutional coding for the turbulent atmosphericoptical communication channel

The coding gain of a constraint-length-three, rate one-half convolutional code over a long clear-air atmospheric direct-detection optical communication channel using binary pulse-position modulation signalling is directly measured as a function of interleaving delay for both hard- and soft-decision Viterbi decoding. Maximum coding gains theoretically possible for this code with perfect interleaving and physically unrealizable perfect-measurement decoding were about 7 dB under conditions of weak clear-air turbulence, and 11 dB at moderate turbulence levels. The time scale of the fading (memory) of the channel was directly measured to be tens to hundreds of milliseconds, depending on turbulence levels. Interleaving delays of 5 ms between transmission of the first and second channel bits output by the encoder yield coding gains within 1.5 dB of theoretical limits with soft-decision Viterbi decoding. Coding gains of 4-5 dB were observed with only 100 μs of interleaving delay. Soft-decision Viterbi decoding always yielded 1-2 dB more coding gain than hard-decision Viterbi decoding     

On low-complexity space-time coding for quasi-static channels

We propose a new space-time coding scheme for the quasi-static multiple-antenna channel with perfect channel state information at the receiver and no channel state information at the transmitter. In our scheme, codewords produced by a trellis encoder are formatted into space-time codeword arrays such that decoding can be implemented efficiently by minimum mean-square error (MMSE) decision-feedback interference mitigation coupled with Viterbi decoding, through the use of per-survivor processing. We discuss the code design for the new scheme, and show that finding codes with optimal diversity is much easier than for conventional trellis space-time codes (STCs). We provide an upper bound on the word-error rate (WER) of our scheme which is both accurate and easy to evaluate. Then, we find upper and lower bounds on the information outage probability with discrete independent and identically distributed (i.i.d). inputs (as opposed to Gaussian inputs, as in most previous works) and we show that the MMSE front-end yields a large advantage over the whitened matched filter (i.e., zero-forcing) front-end. Finally, we provide a comprehensive performance/complexity comparison of our scheme with coded vertical Bell Labs layered space-time (V-BLAST) architecture and with the recently proposed threaded space-time codes. We also discuss the concatenation of our scheme with block space-time precoders, such as the linear dispersion codes.     

Block-coded modulation and multiple block-coded modulation withViterbi decoding for fading channels

This paper describes how block-coded modulation (BCM) and multiple BCM (MBCM) with Viterbi decoding can be designed for use in Rayleigh fading and severe Rician fading channels. New codes are developed by modifying known codes to increase the minimum symbol distance, which is one of the distances that has a strong effect on the bit error rate (BER) performance under fading channels. Combined with anti-fading techniques such as fading compensation, interleaving, and branch weighting, the new codes significantly improve BER performance. Computer simulations were used to confirm the code performance     

网内编码：无线视频传感网中分布式编码速率控制机制

Wyner-Ziv Video Coding (WZVC) is considered as a promising video coding scheme for Wireless Video Sensor Networks (WVSNs) due to its high compression efficiency and error resilience functionalities, as well as its low encoding complexity. To achieve a good Rate-Distortion (R-D) performance, the current WZVC paradigms usually adopt an end-to-end rate control scheme in which the decoder repeatedly requests the additional decoding data from the encoder for decoding Wyner-Ziv frames. Therefore, the waiting time of the additional decoding data is especially long in multihop WVSNs. In this paper, we propose a novel progressive in-network rate control scheme for WZVC. The proposed in-network puncturing-based rate control scheme transfers the partial channel codes puncturing task from the encoder to the relay nodes. Then, the decoder can request the additional decoding data from the relay nodes instead of the encoder, and the total waiting time for decoding Wyner-Ziv frames is reduced consequently. Simulation results validate the proposed rate control scheme.     

一种改进的堆栈译码算法

深太空通信对编译码的性能有十分高的要求,卷积码的性能和约束长度密切相关,约束长度越大卷积码的编码增益越大,则其性能越好。维特比译码算法由于受译码开销的限制,并且其译码开销随约束长度增加呈指数增长,维特比译码算法仅适用于短约束长度的卷积码。目前仅有序列译码算法适用于大约束长度卷积码译码。由于堆栈译码算法中堆栈的大小是有限的,在信道受扰较为严重的情况下,潜在的正确路径有可能被删除,这将影响到译码的性能。多堆栈译码算法不存在潜在删除的问题,多堆栈译码算法完成译码所需计算量远小于堆栈译码算法。     

Universal lossless source controlled channel decoding for i.i.d. sequences

Messages coded and transmitted over a channel usually contain some redundancy which is not utilized by channel decoding techniques, especially if its governing statistical parameters are unknown. We propose to integrate universal lossless source coding techniques into channel decoding of redundant sequences with unknown statistics to improve performance of Viterbi and turbo decoding. Simulation results demonstrate that we achieve identical bit error rate (BER) performance to nonuniversal techniques that utilize prior knowledge of the message statistics and that if redundancy exists even in an a-priori unknown form, we can improve the code performance over standard techniques.     

一种利用约束Viterbi算法改进IS95协议信道编码的方法

IS95具有两个速率集,在同一个速率集中,不同的速率其数据帧的长度不同,为了使进入正交调制的数据帧的长度相同,其采用了信号重复器.信号重复器进行简单的重复作用,使得带宽不能充分利用.文中提出的方法利用一个信号发生器,产生已知的信号进入卷积编码,卷积编码后的数据帧长度同样符合要求,而信号发生器产生的已知信号在译码端可以作为译码时的约束条件进行约束Viterbi译码.在BSC信道模型的仿真结果证明,其在较高误码率的情况下具有较好的性能.     

卫星数字视频广播系统中信道编译码性能的分析

本文分析了卫星数字视频广播系统（DVB－S）中信道编码的方式,并采用Viterbi译码器字节错误概率代替比特错误概率的方法来对DVB－S信道编码系统进行分析,所得到的字节错误概率上限界更适于分析DVB－S系统中级联卷积码内码和R－S外码的编码方案。     

Simulations of Convolutional Coding/Viterbi Decoding with Noncoherent CPFSK

Simulation results are presented for the bit error rate performance of binary and quaternary noncoherent CPFSK when used in conjunction withK=7,R=1/2convolutional encoding and Viterbi decoding. Although coding does not appear to offer any significant advantage in the binary case, the results indicate that the quaternary CPFSK modulation with three-symbol demodulation is a good match to the coding, with performance to within a decibel of coherent QPSK at an error rate of 10^-5. Also, simplified optimum demodulator structures are presented, in the case of multisymbol processing, which require onlyNcorrelator branches in the case ofN-ary CPFSK regardless of the number of symbols being used by the demodulator. This is in contrast to conventional receivers which require Nⁿcorrelator branches withn-symbol processing.     

Channel coding with multilevel/phase signals

A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel coding with expanded sets of multilevel/phase signals in a manner which increases free Euclidean distance. Soft maximum--likelihood (ML) decoding using the Viterbi algorithm is assumed. Following a discussion of channel capacity, simple hand-designed trellis codes are presented for 8 phase-shift keying (PSK) and 16 quadrature amplitude-shift keying (QASK) modulation. These simple codes achieve coding gains in the order of 3-4 dB. It is then shown that the codes can be interpreted as binary convolutional codes with a mapping of coded bits into channel signals, which we call "mapping by set partitioning." Based on a new distance measure between binary code sequences which efficiently lower-bounds the Euclidean distance between the corresponding channel signal sequences, a search procedure for more powerful codes is developed. Codes with coding gains up to 6 dB are obtained for a variety of multilevel/phase modulation schemes. Simulation results are presented and an example of carrier-phase tracking is discussed.     

A concatenated coded modulation scheme for error control

A concatenated coded modulation scheme is presented for error control in data communications. The scheme is achieved by concatenating a Reed-Solomon outer code and a bandwidth efficient block inner code for M-ary phase-shift keying (PSK) modulation. Error performance of the scheme is analyzed for an additive white Gaussian noise (AWGN) channel. It is shown that extremely high reliability can be attained by using a simple M-ary PSK modulation inner-code and a relatively powerful Reed-Solomon outer code. Furthermore, if an inner code of high effective rate is used, the bandwidth expansion required by the scheme due to coding will be greatly reduced. The scheme is particularly effective for high-speed satellite communications for large file transfer where high reliability is required. A simple method is also presented for constructing block codes for M-ary PSK modulation. Soome short M-ary PSK codes with good minimum squared Euclidean distance are constructed. These codes have trellis structure and hence can be decoded with a soft-decision Viterbi decoding algorithm. Furthermore, some of these codes are phase invariant under multiples of 45° rotation     

Simplified receiver design for STBC binary continuous phase modulation

Existing space-time codes have focused on multiple- antenna systems with linear modulation schemes such as phase- shift keying and quadrature amplitude modulation. Continuous phase modulation (CPM) is an attractive scheme for digital transmission because of its constant envelope which is needed for power efficient transmitters. Recent research has shown that space-time coded CPM can achieve transmit diversity to improve performance while maintaining the compact spectrum of CPM signals. However, these efforts mainly combine space- time coding (STC) with CPM to achieve spatial diversity at the cost of a high decoding complexity. In this paper, we design space-time block codes (STBC) for binary CPM with modulation index h = 1/2 and derive low-complexity receivers for these systems. The proposed scheme has a much lower decoding complexity than STC CPM with the Viterbi decoder and still achieves near-optimum error performances.     

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     

Sequence MAP decoding of trellis codes for Gaussian and Rayleighchannels

This paper considers the use of sequence maximum a posteriori (MAP) decoding of trellis codes. A MAP receiver can exploit any “residual redundancy” that may exist in the channel encoded signal in the form of memory and/or a nonuniform distribution, thereby providing enhanced performance over very noisy channels, relative to maximum likelihood (ML) decoding. The paper begins with a first-order two-state Markov model for the channel encoder input. A variety of different systems with different source parameters, different modulation schemes, and different encoder complexities are simulated. Sequence MAP decoding is shown to substantially improve performance under very noisy channel conditions for systems with low-to-moderate redundancy, with relative gain increasing as the rate increases. As a result, coding schemes with multidimensional constellations are shown to have higher MAP gains than comparable schemes with two-dimensional (2-D) constellations. The second part of the paper considers trellis encoding of the code-excited linear predictive (CELP) speech coder's line spectral parameters (LSPs) with four-dimensional (4-D) QPSK modulation. Two source LSP models are used. One assumes only intraframe correlation of LSPs while the second one models both intraframe and interframe correlation. MAP decoding gains (over ML decoding) as much as 4 dB are achieved. Also, a comparison between the conventionally designed codes and an I-Q QPSK scheme shows that the I-Q scheme achieves better performance even though the first (sampler) LSP model is used     

Adaptive trellis-coded multiple-phase-shift keying for Rayleighfading channels

An adaptive scheme for trellis-coded modulation of MPSK signals, called adaptive trellis-coded multiple-phase-shift keying (ATCMPSK), is proposed for slowly Rayleigh fading channels. The adaptive scheme employs a slightly modified rate 1/2 convolutional encoder and the corresponding Viterbi decoder to realize a family of codes of different rates which are employed according to channel conditions. During poor channel conditions, trellis-coded QPSK (TCQPSK) together with repetition schemes are employed. As channel conditions improve, higher rate schemes such as trellis-coded 16 PSK are used. An interleaving/deinterleaving method suitable for the adaptive scheme is proposed. Theoretical bounds for the error performance and an exact expression for the throughput of the proposed adaptive scheme are derived, and are compared against simulation results. Simulations have been performed to measure the performance of the scheme for different parameters and some nonideal conditions. It is shown that ATCMPSK results in considerable improvement in bit-error-rate (BER) performance of MPSK signals. Under ideal conditions, gains in the range of 3-20 dB are achieved over conventional fixed rate pragmatic trellis-coded schemes     

Bidirectional decoding of convolutional codes for indoor cellularradio

Bidirectional suboptimal breadth-first decoding of convolutional codes is an attractive technique for slowly varying and quasi-static fading channels as it restricts the extent of decoding errors due to correct path loss to very heavy noise or interference regions. This paper compares the performance of such a decoding scheme to the Viterbi algorithm over wideband TDMA indoor radio links where equalization and space diversity are also used to combat dispersive fading and cochannel interference. On the basis of equal computational complexity and equal decoding delay, suboptimal, breadth-first, bidirectional decoding of a long constraint length convolutional code is shown to be superior to Viterbi decoding of a shorter constraint length code. Furthermore, this advantage increases as the outage criterion (in terms of bit error rate) becomes more stringent which makes bidirectional decoding particularly attractive for data applications and makes channel coding a more attractive alternative to increasing the space diversity order at the receiver     

Combination of BCM and TCM with 90°, 180°, and 270°phase rotational invariance

Two systematic schemes to combine block-coded modulation (BCM) and trellis-coded modulation (TCM) are proposed. In the first scheme, the signal points which are used in TCM should be partitioned by the proper BCM systems constructed by a multilevel construction method. The asymptotic coding gain will be 6.02-3.01/n dB, where n is the length of the BCM systems. Since the average transmission power can be reduced by using a denser signal lattice, the main idea of the second scheme is to construct the TCM system based on the signal points of a denser lattice formed by a proper BCM system. Hence, we can get a higher coding gain which is a combination of both the distance gain of TCM and the density gain of BCM. Theoretically, the net coding gain of this proposed scheme can reach 5.27 dB in the case of an 8-D constellation and 7.15 dB in the case of a 16-D constellation. For practical implementation, the phase ambiguity problems for both schemes are considered and solved by a differential encoder/decoder     

极低码率Turbo码及其应用研究

针对极低信噪比条件下的传输,研究了极低码率Turbo码的编译码器结构,仿真分析了其性能。提出了极低码率Turbo码在高带宽容量、复杂信道环境,例如：短波通信、流星余迹通信等系统中的使用方法。比较了极低码率Turbo码与高码率Turbo码加扩频的性能。研究表明,极低码率Turbo码较传统高码率Turbo码有更好的性能,能将自适应调制编码技术向低信噪比环境扩展。