流星余迹通信变速率编码研究

流星余迹通信是一种利用流星电离余迹反射电波实现数据传输的通信方式。衡量流星余迹通信系统性能的指标之一是所采用编码的数据包正确传输概率。通常采用的编码方式为固定速率编码,这种编码数据包传输正确概率较低,系统性能较差。变速率编码根据流星余迹通信信道特点,通过改变数据包中各个码字的码率,提高数据包正确传输概率,改善系统性能。理论分析和仿真结果表明,采用变速率编码系统性能提高。     

Variable-rate coding for meteor-burst communications

The performance of variable-rate Reed-Solomon error-control coding for meteor-burst communications is considered. The code rate is allowed to vary from codeword to codeword within each packet, and the optimum number of codewords per packet and optimum rates for the codewords are determined as a function of the length of the message and the decay rate for the meteor trail. The resulting performance is compared to that obtained from, fixed-rate coding. Of central importance is the derivation of tractable expressions for the probability of correct decoding for bounded-distance decoding on a memoryless channel with a time-varying symbol error probability. A throughout measure is developed that is based on the probability distribution of the initial signal-to-noise ratio     

Image coding using variable-rate side-match finite-state vectorquantization

Future B-ISDN (broadband integrated services digital network) users will be able to send various kinds of information, such as voice, data, and image, over the same network and send information only when necessary. It has been recognized that variable-rate encoding techniques are more suitable than fixed-rate techniques for encoding images in a B-ISDN environment. A new variable-rate side-match finite-state vector quantization with a block classifier (CSMVQ) algorithm is described. In an ordinary fixed-rate SMVQ, the size of the state codebook is fixed. In the CSMVQ algorithm presented, the size of the state codebook is changed according to the characteristics of the current vector which can be predicted by a block classifier. In experiments, the improvement over SMVQ was up to 1.761 dB at a lower bit rate. Moreover, the improvement over VQ can be up to 3 dB at nearly the same bit rate.     

Direct sequence CDMA power control, interleaving, and coding

The authors develop and analyze models of power control that consider other aspects of code-division multiple access (CDMA) systems, such as interleaving and coding on the land mobile radio channel. The orientation is that a power control scheme keeps the received powers at the base station almost equal, and the performance degradation incurred if the powers are not exactly equal will be quantified. In doing so, the authors consider the performance implications of control latency and a maximum speech delay constraint. Because of positive correlations between the fading channel amplitudes, the effectiveness of the combination of interleaving and coding in combating the effects of power variations due to slow Rayleigh fading is reduced. It is shown that power control and interleaving/coding are most effective in complementary parameter regions, thus providing a degree of robustness for both fast and slow Rayleigh fading     

Robust video multicast with joint network coding and video interleaving

In this work, we propose a cross-layer solution to robust video multicast in erasure networks based on random linear network coding (RLNC) in the network layer and video interleaving (VI) in the application layer, and call it the joint RLNC-VI scheme. In the RLNC implementation, we partition one video coding unit (VCU) into several priority levels using scalable properties of H.264/SVC video. Packets from the same priority level of several VCUs form one RLNC generation, and unequal protection is applied to different generations. RLNC provides redundancy for video packets in the network layer and has proved to be useful in a multicast environment. Then, we propose a new packet-level interleaving scheme, called the RLNC-facilitated interleaving scheme, where each received packet corresponds to a new constraint on source packets. As a result, it can facilitate the RLNC decoding at the destination node. Furthermore, we study the problem of optimal interleaving design, which selects the optimal interleaving degree and the optimal redundancy of each generation. The tradeoff between delay and received video quality due to the choice of different VCUs is also examined. It is shown by simulation results that the proposed RLNC-VI scheme outperforms the pure RLNC method for robust video multicast in erasure networks. This can be explained by two reasons. First, the VI scheme distributes the impact of the loss (or erasure) of one VCU into partial data loss over multiple neighboring VCUs. Second, the original video content can be easily recovered with spatial/temporal error concealment (EC) in the joint RLNC-VI scheme.     

Erasure coding for reliable adaptive retransmission in wireless broadcast/multicast systems

In this paper, we present new adaptive automatic repeat request (ARQ) schemes for wireless broadcast/multicast combining erasure coding (EC) and packet retransmission. Traditional approaches rely on retransmitting the lost packets in a point-to-point or point-to-multipoint mode. The main idea behind the presented protocols is to retransmit adaptive combinations of the lost packets using EC, which can help several receivers to recover the lost information with fewer retransmission attempts. We propose two versions of EC-based ARQ protocols, and investigate theoretically the corresponding transmission bandwidths in different contexts. We show through simulation results the efficiency of the proposed protocols with respect to conventional ARQ strategies and new published ARQ works for broadcast/multicast. Finally, a new sliding window NACK feedback policy is presented for the case of a high number of receivers to avoid the feedback implosion problem.     

On the optimum average distortion attainable by fixed-rate coding of a nonergodic source

A simple proof is given for the Gray-Davisson result on the ergodic decomposition of the optimum average distortion attainable by fixed-rate coding of a nonergodic source, for the special ease of a bounded distortion measure. A second proof is given for a more general class of distortion measures using a result of Ziv.     

Concatenated coding schemes and interleaving techniques over Rayleigh fading ionospheric channels

In this paper the performance of a concatenated coding scheme is evaluated over a slow Rayleigh fading HF ionospheric link with additive white Gaussian noise (AWGN). Well‐known Ungerboeck TCM techniques onto an 8‐PSK signal set are used as inner codes and Reed–Solomon block codes as outer codes. The coded/modulated signal is further differentially encoded before transmission to combat random phase changes. Block interleaving techniques are necessary to randomise long bursts of errors caused by the fading channel. The performance of the proposed concatenated coding system is investigated for various Doppler spreads. Significant coding gains are achieved over uncoded, diversity or other conventionally coded systems with a small bandwidth expansion. Finally the interesting effects of interleaving on the behaviour of the proposed systems are analysed. Copyright © 2001 John Wiley & Sons, Ltd.     

无线光通信卷积交织与编码的实验及仿真研究

大气光强闪烁会明显降低无线光通信的通信质量。为了降低这种影响,进行了卷积交织结合(1/2,7)卷积编码用于无线光通信系统的实验及仿真研究,完成了相应的实验光机和通信电路的研制,设计了OOK方式调制785nm半导体激光器的方案应用于室外无线光通信系统。理论和实验结果都表明,设计的差错控制编码技术在弱湍流条件下,较好地提高无线光通信系统的通信性能。此外,外场实验和仿真结果还反映出,大气湍流引起的光信号的深衰落会明显影响系统的通信误码率,提高交织器的交织深度可以有效地抑制其影响。     

Variable-rate hybrid ARQ for meteor-burst communications

The authors introduce a form of automatic repeat request (ARQ), referred to as variable-rate type-I hybrid ARQ, in which the code rate varies in response to the fluctuations in the power received from a meteor trail. For one implementation, the source or the destination periodically obtains estimates of the signal power at the destination, and the source uses these estimates to select the rate of the code. For an alternative approach, the code rate is determined completely by the decoding successes and failures during previous transmissions. The performance measure is the throughput per trail, which is defined as the expected number of information bits received correctly for a given meteor trail. Numerical results for Reed-Solomon codes are included to illustrate the relative performance of the various schemes. It is shown that the throughput is larger for both implementations of variable-rate type-I hybrid ARQ than for fixed-rate type-I hybrid ARQ and ARQ without forward error correction     

Incremental-redundancy transmission for meteor-burst communications

The performance of type-II hybrid automatic repeat request (ARQ) is compared to that of fixed-rate type-I hybrid ARQ for meteor-burst communications. Maximum throughput is obtained for meteor-burst communications by using a transmission scheme for which the information rate of the code, varies in response to the fluctuations in the power received from a meteor trail. For type-II hybrid ARQ, a variation in the code rate is inherent in the coding scheme. On the first transmission that is made for a data block, a code of relatively high rate is used, but if an additional transmission is required, only redundant symbols are sent, and this reduces the overall rate of the code. The performance measure is the throughput per trail, which is defined as the expected number of successfully received information bits for a given meteor trail. The authors also develop an approximation for the average value of the throughput, averaged over the parameters of the meteor trail. Numerical results for Reed-Solomon codes are included to illustrate the relative performance of the various schemes. It is shown that the throughput is larger for type-II hybrid ARQ than for either fixed-rate type-I hybrid ARQ or ARQ without forward-error-correction     

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

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

JPEG image transmission over mobile network with an efficient channel coding and interleaving

This article studies improving of coloured JPEG image transmission over mobile wireless personal area network through the Bluetooth networks. This article uses many types of enhanced data rate and asynchronous connectionless packets. It presents a proposed chaotic interleaving technique for improving a transmission of coloured images over burst error environment through merging it with error control scheme. The computational complexity of the used different error control schemes is considered. A comparison study between different scenarios of the image transmission is held in to choose an effective technique. The simulation experiments are carried over the correlated fading channel using the widely accepted Jakes’ model. Our experiments reveal that the proposed chaotic interleaving technique enhances quality of the received coloured image. Our simulation results show that the convolutional codes with longer constraint length are effective if its complexity is ignored. It reveals also that the standard error control scheme of old Bluetooth versions is ineffective in the case of coloured image transmission over mobile Bluetooth network. Finally, the proposed scenarios of the standard error control scheme with the chaotic interleaver perform better than the convolutional codes with reducing the complexity.     

Video coding and delivery challenges for next generation IPTV

Current generation, large-scale, Internet protocol television (IPTV) systems borrow heavily from the broadcast industry, which makes a number of delivery assumptions that do not apply to IP networks. Consequently we can perceive major improvements if we better match the delivery of IPTV services with the underlying network transport. We can expect next generation IPTV systems to adapt video streams dynamically to maximise throughput, allow constant quality delivery, and degrade gracefully in congested networks. This paper outlines the challenges in optimising IPTV delivery and the contribution that BT’s research has made to overcoming some of these.     

Message waiting time performance for meteor-burst communicationsystems

The performance is investigated of the meteor-burst channel in terms of the waiting time required to reliably transmit a message of length N bits. Two modulation techniques are considered. The first is the traditional fixed-rate modulation scheme where the modem operates at a constant bit rate whenever the channel is available for message traffic. The second is an adaptive modulation method where the channel symbol rate varies continuously to match the time-varying signal-to-noise ratio at the receiver. Upper and lower bounds on waiting time for the general case are derived using probabilistic arguments. Novel closed-form expressions for waiting time and optimal bit rate are derived for the fixed-rate modem. Bounds on mean waiting time are derived for the adaptive-symbol-rate modem. It is shown that for fixed-rate modems operating at the optimal bit rate and for adaptive modems operating at a minimum bit rate equal to this rate, the improvement in mean waiting time can never exceed a factor of two     

A limit on optimum performance degradation in fixed-rate coding of the discrete Fourier transform (Corresp.)

The discrete Fourier transform (DFT) often is used instead of the optimum Karhunen-Lograve{e}ve transform (KLT) in encoding a stationary normal time series, because the recursive FFT is computationally efficient and yields "nearly" uncorrelated components. Substituting the DFT for the KLT and then treating its components as if they were uncorrelated reduces the ultimate performance attainable in fixed-rate source coding. We address the problem of this performance degradation by deriving a simple and easily applied upper bound on the increase in the distortion-rate function (DRF) for the mean-squared error criterion incurred by substitution of the DFT for the KLT.     

An improved side information generation for distributed video coding

This paper presents a side information (SI) scheme for distributed video coding based on multilayer perceptron. The suggested scheme predicts a Wyner–Ziv (WZ) frame from two decoded key frames. The network is trained offline using patterns from different standard video sequences with varied motion characteristics to achieve generalization. The proposed scheme is simulated along with other standard video coding schemes. Performance comparisons have been made with respect to training convergence, rate distortion (RD), peak signal to noise ratio (PSNR), number of requests per SI frame, decoding time requirement, etc. In general, it is observed that the proposed scheme has a superior SI frame generation capability as compared to its competent schemes.     

Improved side information generation algorithm for Wyner-Ziv video coding简

Side information has a significant influence on the rate-distortion（RD） performance of distributed video coding（DVC）. In the conventional motion compensated frame interpolation scheme, all blocks adopt the same side-information generation method regardless of the motion intensity inequality at different regions. In this paper, an improved method is proposed. The image blocks are classified into two modes, fast motion and slow motion, by simply computing the discrete cosine transformation（DCT） coefficients at the encoder. On the decoder, it chooses the direct interpolation and refined motion compensated interpolation correspondingly to generate side information. Experimental results show that the proposed method, without increasing the encoder complexity, can increase the average peak signal-to-noise ratio（PSNR） by up to 1~ 2 dB compared with the existing algorithm. Meanwhile, the proposed algorithm significantly improves the subjective quality of the side information.     

A low-complexity method for fixed-rate entropy-constrained vector quantization

This paper describes a new approach to fixed-rate entropy-constrained vector quantization (FEVQ) for stationary memoryless sources where the structure of codewords are derived from a variable-length scalar quantizer. We formulate the quantization search operation as a zero-one integer-optimization problem, and show that the resulting integer program can be closely approximated by solving a simple linear program. The result is a Lagrange formulation which adjoins the constraint on the entropy (codeword length) to the distortion. Unlike the previously known methods with a fixed Lagrange multiplier, we use an iterative algorithm to optimize the underlying objective function, while updating the Lagrange multiplier until the constraint on the overall rate is satisfied. The key feature of the new method is the substantial reduction in the number of iterations in comparison with previous related methods. In order to achieve some packing gain, we combine the process of trellis-coded quantization with that of FEVQ. This results in an iterative application of the Viterbi algorithm on the underlying trellis for selecting the Lagrange multiplier. Numerical results are presented which demonstrate substantial improvement in comparison with the alternative methods reported in the literature.