Small‐block interleaving for low‐delay cross‐packet forward error correction over burst‐loss channels

By adding the redundant packets into source packet block, cross‐packet forward error correction (FEC) scheme performs error correction across packets and can recover both congestion packet loss and wireless bit errors accordingly. Because cross‐packet FEC typically trades the additional latency to combat burst losses in the wireless channel, this paper presents a FEC enhancement scheme using the small‐block interleaving technique to enhance cross‐packet FEC with the decreased delay and improved good‐put. Specifically, adopting short block size is effective in reducing FEC processing delay, whereas the corresponding effect of lower burst‐error correction capacity can be compensated by deliberately controlling the interleaving degree. The main features include (i) the proposed scheme that operates in the post‐processing manner to be compatible with the existing FEC control schemes and (ii) to maximize the data good‐put in lossy networks; an analytical FEC model is built on the interleaved Gilbert‐Elliott channel to determine the optimal FEC parameters. The simulation results show that the small‐block interleaved FEC scheme significantly improves the video streaming quality in lossy channels for delay‐sensitive video. Copyright © 2013 John Wiley & Sons, Ltd.     

Multiview coding and error correction coding for 3D video over noisy channels

We consider the joint source–channel coding problem of stereo video transmitted over AWGN and flat Rayleigh fading channels. Multiview coding (MVC) is used to encode the source, as well as a type of spatial scalable MVC. Our goal is to minimize the total number of bits, which is the sum of the number of source bits and the number of forward error correction bits, under the constraints that the quality of the left and right views must each be greater than predetermined PSNR thresholds at the receiver. We first consider symmetric coding, for which the quality thresholds are equal. Following binocular suppression theory, we also consider asymmetric coding, for which the quality thresholds are unequal. The optimization problem is solved using both equal error protection (EEP) and a proposed unequal error protection (UEP) scheme. An estimate of the expected end-to-end distortion of the two views is formulated for a packetized MVC bitstream over a noisy channel. The UEP algorithm uses these estimates for packet rate allocation. Results for various scenarios, including non-scalable/scalable MVC, symmetric/asymmetric coding, and UEP/EEP, are provided for both AWGN and flat Rayleigh fading channels. The UEP bit savings compared to EEP are given, and the performances of different scenarios are compared for a set of stereo video sequences.     

Performance modeling of FEC‐based unequal error protection for H.264/AVC video streaming over burst‐loss channels

Unequal error protection systems are a popular technique for video streaming. Forward error correction (FEC) is one of error control techniques to improve the quality of video streaming over lossy channels. Moreover, frame‐level FEC techniques have been proposed for video streaming because of different priority video frames within the transmission rate constraint on a Bernoulli channel. However, various communication and storage systems are likely corrupted by bursts of noise in the current wireless behavior. If the burst losses go beyond the protection capacity of FEC, the efficacy of FEC can be degraded. Therefore, our proposed model allows an assessment of the perceived quality of H.264/AVC video streaming over bursty channels, and is validated by simulation experiments on the NS‐2 network simulator at a given estimate of the packet loss ratio and average burst length. The results suggest a useful reference in designing the FEC scheme for video applications, and as the video coding and channel parameters are given, the proposed model can provide a more accurate evaluation tool for video streaming over bursty channels and help to evaluate the impact of FEC performance on different burst‐loss parameters. Copyright © 2014 John Wiley & Sons, Ltd.     

Robust adaptive transmission of images and video over multiple channels

Reliable transmission of images and video over wireless networks must address both potentially limited bandwidths and the possibilities of loss. When bandwidth sufficient to transmit the bit stream is unavailable on a single channel, the data can be partitioned over multiple channels with possibly unequal bandwidths and error characteristics at the expense of more complex channel coding (i.e., error correction). This paper addresses the problem of efficiently channel coding and partitioning pre-encoded image and video bit streams into substreams for transmission over multiple channels with unequal and time-varying characteristics. Within channels, error protection is unequally applied based on both data decoding priority and channel packet loss rates, while cross-channel coding addresses channel failures. In comparison with conventional product codes, the resulting product code does not restrict the total encoded data to a rectangular structure; rather, the data in each channel is adaptively coded according to the channel's varying conditions. The coding and partitioning are optimized to achieve two performance criteria: maximum bandwidth efficiency and minimum delay. Simulation results demonstrate that this approach is effective under a variety of channel conditions and for a broad range of source material.     

FEC编码在高速光通信系统中的应用与性能分析

高速光纤通信系统的研究是当前光通信领域的一大热点,信道编码技术是其中的一项关键技术。文章首先介绍了前向纠错（FEC）编码技术及其在光通信系统中的应用,然后描述了ITU-TG．709中定义的FEC帧的具体格式,数学推导了FEC编码给带来的误码率改善,并列出了具体的计算结果。最后通过实测两款具有FEC数字包封功能的芯片,给出了其在系统传输中的误码率与光信噪比的关系曲线,验证了前向纠错功能。     

Audio quality in lossy networks for media‐specific forward error correction schemes

A media‐specific forward error correction (FEC) is used to prevent the loss of audio packets due to noise or interference in the transmission and buffer overflow in the router. In this FEC scheme, for nth packet, the redundant data are added in (n + ?)th packet where ? is called the offset. In this paper, we consider an M/M/1/K queueing system and derive some simple expressions for calculating the audio qualities of the aforementioned schemes. We analytically and numerically show some counter‐examples and characteristics for these FEC schemes by using our analytical model. Copyright © 2012 John Wiley & Sons, Ltd.     

一种抗误码能力强的无线信道图像传输方案

本文提出一种新的综合源编码和信道编码的无线信道图像传输方案，对子波变换后各个子带采用基于统计特性的变系数定长（VCFL）编码，数据经过Reed-Solomon编码后选择不同码率的码率兼容删除卷积码（RCPC）编码以提供不同程度的差错保护（UEP），最后数据经交织后传输。在给定传输的总比特数的情况下，通过优化算法使总体失真最小。模拟结果表明新方案在无线衰落信道上表现出良好的性能。     

Application layer forward error correction for multicast streaming over LTE networks

The next step beyond third generation mobile networks is the Third Generation Partnership Project standard, named Long Term Evolution. A key feature of Long Term Evolution is the enhancement of multimedia broadcast and multicast services (MBMS), where the same content is transmitted to multiple users located in a specific service area. To support efficient download and streaming delivery, the Third Generation Partnership Project included an application layer forward error correction (AL‐FEC) technique based on the systematic fountain Raptor code, in the MBMS standard. To achieve protection against packet losses, Raptor codes introduce redundant packets to the transmission, that is, the forward error correction overhead. In this work, we investigate the application of AL‐FEC over MBMS streaming services. We consider the benefits of AL‐FEC for a continuous multimedia stream transmission to multiple users and we examine how the amount of forward error correction redundancy can be adjusted under different packet loss conditions. For this purpose, we present a variety of realistic simulation scenarios for the application of AL‐FEC and furthermore we provide an in‐depth analysis of Raptor codes performance introducing valuable suggestions to achieve efficient use of Raptor codes. Copyright © 2012 John Wiley & Sons, Ltd.     

Deterministic process‐based generative models for characterizing packet‐level bursty error sequences

Errors encountered in digital wireless channels are not independent but rather form bursts or clusters. Error models aim to investigate the statistical properties of bursty error sequences at either packet level or bit level. Packet‐level error models are crucial to the design and performance evaluation of high‐layer wireless communication protocols. This paper proposes a general design procedure for a packet‐level generative model based on a sampled deterministic process with a threshold detector and two parallel mappers. In order to assess the proposed method, target packet error sequences are derived by computer simulations of a coded enhanced general packet radio service system. The target error sequences are compared with the generated error sequences from the deterministic process‐based generative model using some widely used burst error statistics, such as error‐free run distribution, error‐free burst distribution, error burst distribution, error cluster distribution, gap distribution, block error probability distribution, block burst probability distribution, packet error correlation function, normalized covariance function, gap correlation function, and multigap distribution. The deterministic process‐based generative model is observed to outperform the widely used Markov models. Copyright © 2013 John Wiley & Sons, Ltd.     

Sliding‐window forward error correction using Reed‐Solomon code and unequal error protection for real‐time streaming video

Forward error correction (FEC) techniques are widely used to recover packet losses over unreliable networks in real‐time video streaming applications. Traditional frame‐level FEC encodes 1 video frame in each FEC coding window. By contrast, in the expanding‐window FEC scheme, high‐priority frames are included in the FEC processing of the following frames, so as to construct a larger coding window. In general, expanding‐window FEC improves the recovery performance of FEC, because the high‐priority frame can be protected by multiple windows and the use of a larger coding window increases the efficiency. However, the larger window size also increases the complexity of the coding and the memory space requirements. Consequently, expanding‐window FEC is limited in terms of practical applications. Sliding‐window FEC adopts a fixed window size in order to approximate the performance of the expanding‐window FEC method, but with a reduced complexity. Previous studies on sliding‐window FEC have generally adopted an equal error protection (EEP) mechanism to simplify the analysis. This paper considers the more practical case of an unequal error protection (UEP) strategy. An analytical model is derived for estimating the playable frame rate (PFR) of the proposed sliding‐window FEC scheme with a Reed‐Solomon erasure code for real‐time non‐scalable streaming applications. The analytical model is used to determine the optimal FEC configuration which maximizes the PFR value under given transmission rate constraints. The simulation results show that the proposed sliding‐window scheme achieves almost the same performance as the expanding‐window scheme, but with a significantly lower computational complexity.     

A combined multiple-candidate likelihood decoding and error concealment scheme for compressed video transmission over noisy channels

This paper presents a joint forward error correction (FEC) and error concealment (EC) scheme to enhance the quality of a compressed video signal transmitted over a noisy channel. A multiple candidate likelihood (MCL) channel decoding strategy is used in conjunction with redundancy in the compressed video (syntax validity and spatial discontinuity) to select the best-detected signal.

Simulation results on both objective and subjective performance measures indicate a significant improvement provided by the proposed scheme.     

基于纠错算术码的信源信道自适应联合编解码系统

对信源信道自适应联合编码方法进行了研究,提出了一种新的基于纠错算术码的联合信源信道编解码系统。该系统在编码端利用算术码内嵌禁用符号实现信源信道一体式编码,即利用马尔科夫信源模型和根据信道状态信息自适应地调整禁用符号概率大小从而调整编码码率来实现信道自适应;在解码端,推导出了基于MAP的解码测度数学公式并基于此测度公式提出了一种改进的堆栈序列估计算法。与传统的信道自适应编码算法不同,该自适应编码算法只需调整一个参数:禁用符号,且理论上可获得连续可变的编码码率。实验结果表明,与经典的Grangetto联合编码系统以及分离编码系统相比,所提出的编码系统具有明显改善的性能增益。     

Combining network coding and compressed sensing for error correction in wireless sensor networks

As the spatial and temporal correlations of sensor readings are common in wireless sensor networks, motivated by these features and the drawbacks of network coding (NC), we introduce compressed sensing (CS) into NC scheme and construct a cooperating coding mechanism, which performs over different data fields with a compatible transformation measure for the combination of NC and CS. This cooperating coding scheme can reduce the amount of redundant information transmission significantly, because the temporal and spatial correlations are explored fully. Meanwhile, the erasures and errors are considered simultaneously in relay transmission process; a NC decoding for error control is proposed to correct the erasures and errors. Although the decoding error of NC is existent, this error can be further reduced by the reconstruction process of CS; as a result, the relative recovery error is small enough in the sink. Finally, the reliability and performance analyses confirm that the proposed cooperating coding scheme obtains considerable compression gain as compared with conventional coding scheme of NC and transmits information reliably with high recovery precision. Copyright © 2014 John Wiley & Sons, Ltd.     

Performance analysis of APSK modulation for DVB‐S2 transmission over nonlinear channels

For increased bandwidth efficiency and receiver performance, standards for satellite broadcasting systems are evolving by utilizing efficient transmission techniques. The second‐generation digital video broadcasting for satellites (DVB‐S2) adopts the amplitude phase shift keying (APSK) modulation for enhanced performance over nonlinear channels. In this paper, we derive error rate bounds for APSK modulated symbols and generalize the bounds to the case of distorted constellation, which occurs when the maximum transmission amplitude is saturated by the soft‐limiter type channel. The derived bound is shown to significantly improve the previously known result, to accurately predict both the symbol error rate and bit error rate in the entire signal‐to‐noise ratio (SNR) region of interest. Using the derived formula, the optimal input power level for the soft‐limiter channel is determined, and the corresponding minimal error rates for 16‐ and 32‐APSK are quantified. The result is also interpreted in terms of optimal input back‐off (IBO) for nonlinear power amplifiers by evaluating the performance degradation as a function of IBO. Copyright © 2009 John Wiley & Sons, Ltd.     

A two‐hop equalize‐and‐forward relay scheme in OFDM‐based wireless networks over multipath channels

Relay communications have attracted increasing research attentions as a cost‐effective technique to improve spatial diversity, service coverage, and energy efficiency in wireless networks. However, existing relay schemes (e.g., amplify‐and‐forward and decode‐and‐forward (DF) schemes) still face several major challenges, particularly the accumulation of multipath channels effect in AF and long processing latency in DF. To address these issues, we propose a novel equalize‐and‐forward (EF) relay scheme to enhance the retransmission reliability while maintaining low processing delay at the relay node. In particular, the proposed EF relay estimates and equalizes the channel between source and relay to eliminate the channel accumulation effect without signal regeneration. To further reduce the relay processing time, the channel estimation and equalization in the proposed EF design are performed in parallel. The proposed equalization is realized by presetting the equalizer coefficients with the current channel response that is predicted in parallel using multiple past channel responses. Numerical results show that the proposed EF relay scheme can achieve comparable symbol error rate performance as the DF relay with much less relay latency. In addition, the EF relay exhibits low outage probability at the same data rate as compared with traditional amplify‐and‐forward and DF schemes. schemes. Copyright © 2015 John Wiley & Sons, Ltd     

Spatial modulation and physical layer network coding based bidirectional relay network with transmit antenna selection over Nakagami‐m fading channels

In this paper, a high data rate bidirectional relay network is proposed by combining the merits of spatial modulation (SM) and physical layer network coding. All nodes in the network are equipped with multiple antennas. Spatial modulation technique is used to reduce hardware complexity and interchannel interference by activating only one antenna at any time during transmission. In the proposed bidirectional relay network, transmit antennas are selected at the source nodes and relay node on the basis of the order statistics of channel power. It increases received signal power and provides a significant improvement in the outage performance. Also, the data rate of the proposed network is improved by physical layer network coding at the relay node. A closed form analytical expression for the outage probability of the network over Nakagami‐m fading channel is derived and validated by Monte Carlo simulations. In addition, asymptotic analysis is investigated at high signal‐to‐noise ratio region.The outage performance of the proposed network is compared with SM and physical layer network coding bidirectional relay network without transmit antenna selection and point‐to‐point SM. With approximate SNR≈1 dB difference between the two networks, the same data rate is achieved.     

Compressed error and erasure correcting codes via rank‐metric codes in random network coding

The error control of random network coding has recently received a lot of attention because its solution can increase robustness and reliability of data transmission. To achieve this, additional overhead is needed for error correction. In this paper, we design a compressed error and erasure correcting scheme to decrease the additional overhead of error correction. This scheme reduces the computation overhead dramatically by employing an efficient algorithm to detect and delete linearly dependent received packets in the destination node. It also simplifies the hardware operations when the scheme reduces the received matrix Y to form E_k(Y ) instead of E(Y ) in the decoding process. If at most r original packets get combined in k packets of one batch, the payload of one packet can increase from M ? k to M ? O(rlog _qk) for the application of compressed code, where M is the packet length. In particular, the decoding complexity of compressed code is O(rm) operations in an extension field , which does not enhance the overall decoding complexity of the system. Finally, we also compare our scheme's performance with existing works. The numerical results and analyses illustrate the security and performance of our scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

Performance comparison of dual‐hop hybrid decode‐or‐amplify‐forward relay schemes for M‐ary quadrature amplitude modulation burst transmission over Rayleigh fading channels

This paper shows the analytical performance expressions of M‐ary quadrature amplitude modulation burst symbol transmission for hybrid decode‐or‐amplify‐forward (HDAF) relay schemes over quasi‐static Rayleigh‐fading channels. First, we derive the probability density function of the received instantaneous signal‐to‐noise ratio as the simplified form, which is related to all the possible occurrence probabilities of error‐events for M‐ary quadrature amplitude modulation burst transmission. On the basis of the derived probability density function, we express average bit error probability, average symbol error probability, and average burst error rate as closed forms, which can be also applied to both amplify‐and‐forward and adaptive decode‐and‐forward (ADF) schemes. The analysis and simulation results show that HDAF scheme for burst transmission can achieve the performance of ADF scheme with symbol‐by‐symbol transmission, which is the achievable lower bound. Furthermore, the outage probability, the normalized channel capacity, and the goodput performance are also derived as closed forms. The analysis shows the superiority of HDAF scheme to ADF scheme. Comparison with simulations confirms that the derived analytical expressions are accurate over all signal‐to‐noise ratio regions and for different numbers of relays and modulation orders.     

Symbol error rate calculation and data pre‐distortion for 16‐QAM transmission over nonlinear memoryless satellite channels

This paper presents a simplified mathematical approach to evaluate the performance of any given circular constellation of 16‐level quadrature amplitude modulation (16‐QAM) in terms of symbol error rate (SER). Following this approach, with the aim to work with memoryless nonlinear satellite channels, a model is derived as a generalized form for both linear and nonlinear channels in the presence of down link additive white Gaussian noise (AWGN). The analysis provides means to calculate the optimal ring ratio (RR) and phase difference (PD) for several possible candidates of 16‐QAM circular constellations. The effects of RR and PD on the SER performance are investigated in the analysis. To overcome the nonlinear distortion, data pre‐distortion is taken into account in the study. The paper gives a general procedure for data pre‐distortion implementation for all circular 16‐QAM constellations. The analytical formulation has been extended for total degradation (TD) performance measure as a function of input back‐off (IBO) of the nonlinear amplifier. A SER performance‐comparison between different constellations for 16‐QAM systems has also been presented in this paper. The analytical results are validated by simulation. Copyright © 2006 John Wiley & Sons, Ltd.     

Performance and diversity analysis of decode‐and‐forward cooperative system over Nakagami‐m fading channels

In this paper, we derive the upper bound of bit‐error rate (BER) performance and diversity gain for a decode‐and‐forward (DF) cooperative system. Either maximal‐ratio combining (MRC) or cooperative MRC (C‐MRC) is employed at the receiver in the presence of independent, non‐identical Nakagami‐m fading. Both analytical and simulation results show that C‐MRC takes advantage of spatial diversity more efficiently and thus achieves the same or better performance and diversity order as compared to MRC. Copyright © 2009 John Wiley & Sons, Ltd.