A convolutional single-parity-check concatenated coding scheme forhigh-data-rate applications

The coding scheme uses a set of n convolutional codes multiplexed into an inner code and a (n,n-1) single-parity-check code serving as the outer code. Each of the inner convolutional codes is decoded independently, with maximum-likelihood decoding being achieved using n parallel implementations of the Viterbi algorithm. The Viterbi decoding is followed by additional outer soft-decision single-parity-check decoding. Considering n=12 and the set of short constraint length K=3, rate 1/2 convolutional codes, it is shown that the performance of the concatenated scheme is comparable to the performance of the constraint length K=7, rate 1/2 convolutional code with standard soft-decision Viterbi decoding. Simulation results are presented for the K=3, rate 1/2 as well as for the punctured K=3, rate 2/3 and rate 3/4 inner convolutional codes. The performance of the proposed concatenated scheme using a set of K=7, rate 1/2 inner convolutional codes is given     

Variable-rate convolutional network coding

Four types of variable-rate convolutional network codes are investigated over a single-source finite cyclic network.It is found that variable-rate generic,dispersion and broadcast can be implemented on the same network without changing the local encoding kernels of the non-source nodes.The efficient implementation has the advantage that each non-source node only needs to store one copy of the local encoding kernel within a session.However,it is also shown by an example that variable-rate multicast may not always be implemented under the above condition.     

DC-free binary convolutional coding

A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free coding and error-correcting capability simultaneously. The scheme has a simple cascaded structure of the running digital sum (RDS) control encoder and the conventional convolutional encoder. A given sequence becomes DC-free if and only if the absolute RDS value of the sequence is bounded by a constant for any time instant. The RDS control encoder generates a sequence which gives the convolutional-coded sequence with a bounded RDS value. The structure allows us to exploit efficient soft-decision decoding which attains additional coding gains compared with hard-decision decoding over an additive white Gaussian noise (AWGN) channel. Bounds on the RDS value are explicitly established for the proposed scheme. By using the bounds, we have performed computer searches for finding good RDS control encoders. The proposed scheme provides wide varieties of reasonable tradeoffs between the coding gain, the RDS constraint, and decoding complexity. For example, a 64-state DC-free coding scheme with the overall rate 6/16 and the minimum free distance 10 has been obtained. This scheme satisfies a bounded RDS constraint (from -18 to +18) and it yields a considerably high asymptotic coding gain (over an AWGN channel) of 5.7 dB     

Performance of selective space‐time coding and selection diversity under perfect and imperfect CSI

Selective space‐time coding and selection diversity can be viewed as practical means to reduce the implementation complexity of multiple‐input multiple‐output (MIMO) systems while still taking benefit of the use of multiple antennas. In this paper, we evaluate the performance of selective space‐time block coding (selective‐STBC) and antenna selection diversity, and analyze the performance of both techniques under perfect and imperfect channel state information (CSI) available at both ends of the transmission link. Our performance analysis reveals that, under perfect or imperfect CSI and ideal feedback channel, selective‐STBC yields a loss in selection diversity gains and that selecting just a single antenna at the transmitter side is the best transmission strategy. We also show that selective‐STBC and antenna selection diversity have different behaviors when the feedback channel is imperfect. Indeed, it is shown that selection diversity outperforms selective‐STBC when the feedback channel is of high quality, while selective‐STBC yields better performance when the feedback channel is of low quality. Copyright © 2008 John Wiley & Sons, Ltd.     

Performance of unequalized frequency-hopped TDMA with convolutional coding on dispersive fading channels

Increasing demand for wireless personal communications has stimulated research on new digital radio technologies that are optimized for various service applications and environments. This paper discusses the performance of a slow-frequency-hopped time-division multiple-access (SFH-TDMA) technique, which has been proposed as a high-tier extension of a low-complexity TDMA architecture optimized for low-power pedestrian applications. The SFH-TDMA technique considered uses QPSK modulation and rate-1/2 convolutional coding. Numerical results for a wide range of fading rates are obtained through analytical calculation of the effective signal-to-noise ratio combined with a simulation approach which incorporates measured multipath channels and actual frequency correlation among contiguous hopping channels. The results indicate that the SFH-TDMA technique can tolerate root-mean-square (rms) delay spread up to several bit periods without a need for adaptive equalization, but also point to the need for fast power control when the fading is slow and the rms delay spread is much smaller than the bit period. This work is targeted toward understanding the implications to local exchange networks of wireless technology alternatives that could provide access to those networks.     

级联信道编码的多幅值差分空时分组码方案及性能

通过引入多电平振幅调制和变换矩阵方法,提出了一种基于多幅值调制的差分正交空时分组码方案。该方案可克服通常基于PSK调制的单幅值差分空时码(DSTC,differential space-time coding)在高频带利用率下由于星座符号间的最小距离减小所带来的性能下降,而且可用于编码矩阵是非方阵情况,避免了已有方案仅适合于方阵码矩阵。与已有单幅值DSTC相比,所提方案有着高的频谱效率和编码增益,且可实现线性译码复杂度和高的码率。此外,还给出了所提方案级联信道编码时的性能。仿真结果表明所提方案与已有单幅值DSTC方案相比,有着较低的误比特率,而且信道编码后的所提多幅值DSTC也好于相应的单幅值DSTC。     

An efficient convolutional coding/decoding strategy for channelswith memory

Many digital communication channels are affected by errors that tend to occur in bursts. A great deal of work has been devoted to finding good burst-error-correcting codes and developing burst-error-correcting schemes. However, burst-error-correcting codes are generally not effective for long bursts. Some burst-error-correcting schemes suffer long delay in decoding. Others are very sensitive to random errors in the guard space. Most of these schemes are not adaptive to channel conditions. A new adaptive scheme is proposed to overcome these drawbacks. The scheme employs a combination of two complementary punctured convolutional (CPC) codes. One of the codes is used for burst detection and for channel state estimation, and both codes are used for error correction. The proposed scheme is analyzed over a two state Markov chain channel model. Unlike existing burst-error-correcting schemes, it is shown that the proposed scheme is adaptive to channel conditions and less sensitive to errors in the guard space. For the same delay, the proposed scheme offers better performance than the interleaving schemes. When the channel is heavily corrupted by bursts, the improvement is even more pronounced     

SNR-adaptive deep joint source-channel coding scheme for image semantic transmission with convolutional block attention module

With the development of deep learning(DL), joint source-channel coding(JSCC) solutions for end-to-end transmission have gained a lot of attention. Adaptive deep JSCC schemes support dynamically adjusting the rate according to different channel conditions during transmission, enhancing robustness in dynamic wireless environment. However, most of the existing adaptive JSCC schemes only consider different channel conditions, ignoring the different feature importance in the image processing and tran...     

高码率无线光通信交织卷积编码新方案研究

为了克服大气湍流引起的光信号的深衰落,提高交织器的交织深度是一种有效的方法。提出了一种新的前向纠错方案用来降低交织深度较大的交织器设计的复杂性,该方案在发射端采用交错卷积编码结构,将编码输出序列经字节组合后,再通过字节交织方式离散大气湍流所引起的衰落信号;在接收端设计成字寻址的解交织,给出了一种对数度量量化的软判决Viterbi并行译码方式。针对该方案进一步优化了字节组合方式,提出了与之相匹配的新型的互质型分段字节卷积交织结构。将该方案用于通信速率为300Mbit/s的无线光通信系统,仿真结果表明,该方案能够降低交织器和单译码器的处理速度要求,而且在误码率为10？6时,相对于最佳阈值判决有约6.9dB的编码增益,与完美交织下的编码性能仅相差0.3dB,这在高码率无线光通信系统中抑制大气湍流的影响有潜在的应用价值。     

Performance limits of M-FSK with Reed-Solomon coding and diversity combining

This paper examines the asymptotic (M/spl rarr//spl infin/) performance of M-ary frequency-shift keying (M-FSK) in multi-channels, or multiple frequency-nonselective, slowly fading channels, with coding, side information, and diversity reception. In particular, Reed-Solomon (RS) coding is considered in conjunction with the ratio-threshold test (RTT), which generates side information regarding the reliability of received symbols. The asymptotic performance of orthogonal signaling in multichannels with maximal ratio combining (MRC), postdetection equal gain combining (EGC), hybrid selection combining (H-SC), and selection combining (SC) is derived for an arbitrary statistical fading model and diversity order. The derivations reveal that coherent and noncoherent implementations of diversity combining schemes yield the same performance asymptotically. In addition, the asymptotic results are evaluated assuming a Nakagami-m fading model, and the effect of fading severity, diversity order, code rate, and side information upon the performance of the various diversity combiners is investigated. The minimum signal-to-noise ratio (SNR) required to achieve arbitrarily reliable or error-free communication, as well as the associated optimal RS code rate, are determined for various cases.     

Improved HF modem using convolutional coding

The paper describes the design of a digitally implemented modem for use over HF (2-30 MHz) radio channels. As a completely digital approach offers the prospect of a number of significant improvements, a new digital multifrequency-shift-keying (MFSK) modem has been developed that employs a novel digital processing procedure termed code-assisted bit synchronisation (CABS). Signal detection is achieved via a set of noncoherent correlators, whilst symbol synchronisation and error correction are performed using a soft-decision Viterbi decoder. Practical tests of modem show that it operates effectively under both additive white Gaussian noise and real HF channel conditions     

Concatenated Reed-Solomon/convolutional coding for datatransmission in CDMA-based cellular systems

A robust error control scheme for data transmission in CDMA-based cellular systems is proposed which employs outer Reed-Solomon codes concatenated with inner convolutional codes. The performance of this scheme is analyzed assuming nonperiodic random spreading sequences and a Rake receiver with perfect knowledge of the channel. In particular, a simple model for the memoryless inner coding channel that encompasses the effects of multiple access interference, self-noise and thermal noise is first derived. Using new tight upper bounds on bit- and symbol-error probabilities of convolutional codes over Nakagami, Rayleigh, and Rician fading multipath channels, the performance of the concatenated coding scheme is then evaluated. The Reed-Solomon/convolutional coding scheme has been adopted by the European RACE Project Code Division Testbed (CODIT) and implemented in an experimental testbed. The code design methodology, which has been used to specify the 9.6-, 64-, and 128-kbit/s data traffic channels of the CODIT testbed, is presented and the single-cell CDMA capacity is computed     

基于正交处理的网络编码方法及其性能分析

为有效传输多用户多中继网络信息,在线性网络编码的基础上给出一种基于正交处理的网络编码方法（NCOP, network coding based on orthogonal process）,该编码方式结合正交低频子载波处理思想,将传输数据正交化,利用处理后数据正交性实时传输并解码需要用户数据,进一步降低系统中断概率,提高分集增益。理论分析了该编码方法的系统中断概率和平均误码率,分析和仿真结果表明在多用户协作网络的应用中,NCOP中断性能及误码性能均优于线性网络编码。     

On a hybrid beamforming/space-time coding scheme

A multiple transmit antenna system based on hybrid beamforming and space-time coding technologies is examined. The reduction factor of the required transmitted energy achievable by the use of hybrid scheme is quantified for any given outage capacity. We show that although a sole space-time coding configuration is superior asymptotically (i.e., for extremely low outage requirements), a hybrid beamforming/space-time coding configuration can be a more effective solution for modest outage requirements. It may provide a useful design guideline for wireless systems, especially for the downlink where multiple transmit antenna scheme is feasible.     

Variable-frame-rate coding scheme for speech-analysis/synthesis systems

In analysis/synthesis systems for the digital coding of speech, the synthesis control information is normally required in `frames? arriving at a constant rate. At the expense of a small delay, a considerable reduction of frame rate is possible by transmitting appropriately selected frames, and deriving intermediate frames from those transmitted.     

Denoise-and-forward based adaptive diversity scheme for physical-layer network coding with multiple relay node

The capacity issue of a denoise-and-forward(DNF) protocol was focused on based PNC system of frequency non-selective Rayleigh fading channel.First,the total sum-rate of the system was derived.With the derived sum-rate expression,two policies maximizing the system sum-rate are proposed.On this basis,a novel adaptive diversity scheme was proposed.Closed-form expressions of the system outage probability with the new proposed scheme as well as the amplify-and-forward (AF) based PNC system and the conventional direct transmission were derived over frequency-nonselective Rayleigh fading channels.Simulation experiments are conducted and the results show that the outage performance of the system can be im-proved significantly compared to the AF based PNC system and the conventional direct transmission scheme.     

基于时空多样性编码的低轮值无线传感器网络可靠传输算法

提出了适用于低轮值无线传感器网络的可靠传输算法,主要特点是发掘并利用低轮值无线传感器网络特有的时空相关性,结合编码机制以获得较高的能量效率和较低的传输时延。针对编码块在多条路径上的最优分配问题进行了建模。由于求解最优策略是NP难题,给出了近似算法,并通过仿真分析了不同参数对近似算法的影响。仿真结果表明,基于时空多样性编码的分配算法能够在较低的能量开销条件下,实现低时延的可靠传输。     

Performance of robust metrics with convolutional coding anddiversity in FHSS systems under partial-band noise jamming

The performance of robust metrics (metrics that can be computed from the outputs of the matched filters only) with convolutional coding and diversity under worst-case partial-band noise jamming is analyzed. Both binary and dual-k convolutional codes employing these metrics with diversity are compared via Union-Chernoff bounds. The performances of metrics considered in the literature that assume perfect side-information are given for comparison purposes. It is found that there exist very good robust metrics that provide performance comparable to metrics using perfect side-information. Among the robust metrics considered, the self-normalized metric offers the best performance and achieves performance practically identical to that of the square-law-combining metric with perfect side-information for M=8     

Subband speech coding and matched convolutional channel coding formobile radio channels

The effects of digital transmission errors on a family of variable-rate embedded subband speech coders (SBC) are analyzed in detail. It is shown that there is a difference in error sensitivity of four orders of magnitude between the most and the least sensitive bits of the speech coder. As a result, a family of rate-compatible punctured convolutional codes with flexible unequal error protection capabilities have been matched to the speech coder. These codes are optimally decoded with the Viterbi algorithm. Among the results, analysis and informal listening tests show that with a 4-level unequal error protection scheme transmission of 12 kb/s speech is possible with very little degradation in quality over a 16 kb/s channel with an average bit error rate (BER) of 2×10^-2 at a vehicle speed of 60 m.p.h. and with interleaving over two 16 ms speech frames     

A novel grouped multilevel dynamic space–time trellis coding scheme

Grouped multilevel space–time trellis codes (GMLSTTCs) utilize multilevel coding, antenna grouping and STTCs for simultaneously providing coding gain, diversity improvement and increased spectral efficiency. The performance of GMLSTTCs is limited because of using predefined STTCs as component codes in multilevel coding. GMLSTTCs assume perfect channel state information (CSI) at the receiver only and do not consider the CSI at the transmitter. It has been shown that when perfect or partial CSI is available at the transmitter, the performance and capacity of a space–time coded system can be further improved. In this paper, we present new codes, designed by combining GMLSTTCs and the CSI information at the transmitter, henceforth referred to as grouped multilevel dynamic space–time trellis codes (GMLDSTTCs). A code set having different sets of generator sequences is selected that matches best with the current channel profile. The selected code set is used for generating DSTTCs. DSTTCs are used as component codes in GMLSTTCs instead of predefined STTCs to generate GMLDSTTCs. Analysis and simulation results show that GMLDSTTCs outperform GMLSTTCs. Copyright © 2014 John Wiley & Sons, Ltd.