Kite code-based incremental redundancy hybrid ARQ scheme for fast-fading channels

Incremental redundancy hybrid automatic repeat request （IR HARQ） has been extensively studied for reliable data transmission over slow-fading or quasi-static channels. With the increase in movement speed of users and the use of long code words for data transmission, IR HARQ strategy in fast-fading channels is starting to attract attention in the academia. This paper studies the perfor- mance of the IR HARQ strategy based on Kite codes （a class of rateless codes） in the finite regime over fast-fading channels where a number of channel realizations are experienced in each retransmission round. We propose an algorithm that exploits current decoding reliability to determine the size of subsequent retransmissions. Long- term throughput and delay constraint throughput are ana- lyzed and compared. Furthermore, in HARQ systems available, most of the computation power is consumed on failed decoding if a code word is retransmitted many times, which is not energy-efficient. Therefore, to improve theenergy efficiency, we propose two efficient algorithms （early stopping algorithm and freezing node algorithm） for incremental decoding, which reduce the computational complexity of the most time-consuming steps in decoding procedure. Simulation results show that the substantial complexity reduction is achieved in terms of the total required number of decoding iterations and the required node operation complexity compared to conventional incremental decoding scheme.     

Joint Source and Relay Precoding/Beamforming Algorithm for OFDM Multi-user Cooperative Relay Systems

In order to reduce the feedback load of multi-user orthogonal frequency division multiplexing （ OFDM ） -based wireless systems, a practiral limited bits feedback precoding algorithm is proposed with direct source-destination link based on amplify-and- forward cooperative relay network under frequency selective fading channels. Using joint minimum mean square error（MMSE） filter, the receiving decoding matrix is designed for each user in the paper. Source precoding （beamforming） matrix is optimized with convex function of weight mean square error （MSE）. Relay precoding matrix is obtained under MSE decomposition and convex optimization. The precoding matrix index is fed back for clustered subcarrier of OFDM with limited feedback. Then using interpolation algorithm, all precoding matrices are achieved at base station （BS） and relay nodes. Simulations indicate the effectiveness of the proposed limited feedback joint precoding and beam_formlng design. The proposed method can improve bit error rate （BER） performance and obtain better sum-rate performance in contrast to existing algorithms. It displays the BER performance is close to that of the unquantified precoding feedback method.     

Simple, High-Performance Fusion Rule for Censored Decisions in Wireless Sensor Networks

Data selection-based summation fusion （DSSF） was developed to overcome the shortcomings ot previously developed likelihood ratio tests based on channel statistics （LRT-CS） for the problem of fusing censored binary decisions transmitted over Nakagami fading channels in a wireless sensor network （WSN）. The LRT-CS relies on detection probabilities of the local sensors, while the detection probabilities are a priori unknown for uncooperative targets. Also, for Nakagami fading channels, the LRT-CS involves an infinite series, which is cumbersome for real-time application. In contrast, the DSSF only involves data comparisons and additions and does not require the detection probabilities of local sensors. Furthermore, the performance of DSSF is only slightly degraded in comparison with the LRT-CS when the detection probabilities of local sensors are a priori unknown. Therefore, the DSSF should be used in a WSN with limited resources.     

RTP-Packets＇ Loss Recovery Scheme Based on Layered Buffer-Routers

This paper introduces an RTP-packets‘ loss recovery scheme in MPEG-4 playback type multicast application model, which is based on retransmission scheme. Through the auxiliary and coordinated buffer playing scheme of layered “buffer-routers”, the RTP-packets‘ loss recovery in limited time is made possible. We consider in the scheme to handle retransmission request with buffer waiting when network congestion occurs. Thus, neither the degree of congestion will be worsened nor the retransmission request will be lost when sending the request to higherlevel buffer router. The RTP-packets‘ loss recovery scheme suggested by us is not only applied to MPEG-4 muhieast application in LAN, but also can be extended to more spacious WAN (wide area network) when user groups comparatively centralize in certain number of local areas.     

Exploiting cooperative multipath –Doppler diversity in relay-assisted high-speed train communications

Severe doubly selective channel fading, or the time- and frequency-selective fading, prevailing in high- speed train （HST） communications, has been a critical issue that hinders the improvement of system efficiency and reli- ability. In this paper, a relay-assisted HST communication system is considered, and a low-complexity but effective scheme is proposed to cooperatively exploit the joint mul- tipath-Doppler diversity of both the direct link and the relay link and thus to mitigate the negative effect of channel fading and improve the system reliability. In particular, using a special precoding structure followed by two-dimensional Fourier transform, the transmit signal is generated which in effect parallelizes the doubly selective fading channel. As a result, in the transform domain, pointwise combining and equalization, which are of linear complexity, become feasi- ble and diversity gain is obtained. The maximal diversity order is then analyzed under the amplify-and-forward relay settings, which reveals that by cooperative relaying the joint multipath-Doppler diversity of both links can be well exploited. Simulation results verified our analysis.     

A simple channel estimator for space-time coded OFDM systems in rapid fading channels

A simple channel estimator for space-time coded orthogonal frequency division multiplexing (OFDM) systems in rapid fading channels is proposed. The channels at the training bauds are estimated using the EM (expectation-maximization) algorithm, while the channels at the data bauds are estimated based on the method for modelling the time-varying channel as the linear combination of several time-invariant “ Doppler channels“. Computer simulations showed that this estimator outperforms the decision-directed tracking in rapid fading channels and that the performance of this method can be improved by iteration.     

Novel differential unitary space-time modulation schemes for fast fading channels

Differential unitary space-time modulation （DUSTM）, which obtains full transmit diversity in slowly fiat-fading channels without channel state iufonnation, has generated significant interests recently. To combat frequency-selective fading, DUSTM has been applied to each subcarrier of an OFDM system and DUSTM-OFDM system was proposed. Both DUSTM and DUSTM-OFDM, however, are designed for slowly fading channels and suffer performance deterioration in fast fading channels. In this paper, two novel differential unitary space-time modulation schemes are proposed for fast fading channels. For fast fiat-fading channels, a subatrix interleaved DUSTM （SMI-DUSTM） scheme is proposed, in which matrix-segmentation and sub-matrix based interleaving are introduced into DUSTM system. For fast frequency-selective fading channels, a differential unitary space-frequency modulation （DUSFM） scheme is proposed, in which existing unitary space-time codes are employed across transmit antennas and OFDM subcarriers simultaneouslv and differential modulation is performed between two adjacent OFDM blocks. Compared with DUSTM and DUSTM-OFDM schemes, SMI-DUSTM and DUSFM-OFDM are more robust to fast channel fading with low decoding complexity, which is demonstrated by performance analysis and simulation resuits.     

An efficient channel estimator for OFDM system with sparse multipath fading

A channel estimator used in sparse multipath fading channel for orthogonal frequency division multi-plexing(OFDM)system is proposed.The dimension of signal subspace can be reduced to improve theperformance of channel estimation.The simplified version of original subspace fitting algorithm is em-ployed to derive the sparse multipaths.In order to overcome the difficulty of termination condition,weconsider it as a model identification problem and the set of nonzero paths is found under the generalizedAkaik...     

Error propagation determined iterative channel estimation with ICI mitigation for fast time-varying OFDM channels

The intersubcarrier interference （ICI） degrades the performance of the pilot-aided channel estimation in fast time-varying orthogonal frequency division multiplexing （OFDM） systems.To solve the error propagation in joint channel estimation and data detection due to this ICI,a scheme of error propagation determined iterative estimation is proposed,where in the first iteration,Kalman filter based on signal to interference and noise is designed with ICI transformed to be part of the noise,and for the later iterations,a determined iterative estimation algorithm obtains an optimal output from all iterations using the iterative updating strategy.Simulation results present the significant improvement in the performance of the proposed scheme in high-mobility situation in comparison with the existing ones.     

Packet matching algorithm based on improving differential evolution

The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment.     

一种基于链路质量的选择协作式HARQ传输协议

针对单中继协同混合自动重传请求(hybrid automatic repeat request,HARQ)策略中重传时延性能不佳的问题,通过对快衰落信道下单中继HARQ系统的误码率和时延特性的研究和分析,提出一种基于目的端控制选择协作式HARQ(selective cooperative-HARQ,SC-HARQ)传输...     

一种基于链路质量的选择协作式HARQ传输协议

针对单中继协同混合自动重传请求(hybrid autom atic repeat request,HARQ)策略中重传时延性能不佳的问题,通过对快衰落信道下单中继HARQ系统的误码率和时延特性的研究和分析,提出一种基于目的端控制选择协作式HARQ(selective cooperative-HARQ,SC-HARQ)传输协议的实现方案,此方案是在单中继环境下根据中继链路和直达链路的链路质量判断选择重传路径的HARQ传输协议。SC-HARQ传输协议方案需要设定传输链路质量的门限值,然后根据不同的链路质量选择不同的重传模式:当直达链路质量大于设定的门限值时,选择直达链路进行重传;反之,选择完全协同HARQ传输协议进行重传。经过理论分析和MATLAB仿真验证证明,SC-HARQ传输协议方案在保证一定传输质量的前提下能够有效减小系统时延、改善系统性能。     

基于比特可靠性的改进HARQ星座图重排技术

研究采用低密度奇偶校验(LDPC)码和64QAM调制的Chase合并型混合ARQ(HARQ)系统. 提出一种适用于任意重传次数的星座图重排(CoRe)搜索算法,根据该算法搜索得到采用星座图重排的HARQ优化方案. 仿真结果表明,所得优化方案能够有效地降低多次重传合并后比特间的可靠性差异,显著提高系统的误比特率(BER)性能和信息传输效率.     

HSDPA系统中高码率混合重传协议映射准则优化

针对高速下行分组接入(HSDPA)系统中的混合重传(HARQ)协议,提出适用于高码率Turbo码的全增余(FIR)和部分增余(PIR)型的映射准则优化方法. 分析了不同编码比特的重传优先级,通过向高优先级的比特提供高可靠性差错保护实现不等差错优化,并且在优化策略中使不同编码比特在初始传输和重传过程中的可靠性度量尽可能均匀. 仿真结果表明,在高码率的全增余和部分增余型HARQ协议中,优化策略能够提高系统性能,而复杂度不会有明显增加.     

基于LDPC码的HARQ系统仿真

为有效和可靠地传输数据,在不降低数据传输速率的条件下,最大限度地减小误码率,提高系统吞吐量,利用Matlab和Simulink平台共同仿真了混合自动重传请求HARQ (Hybrid Automatic Repeat Request)系统.该系统使用低密度奇偶校验码LDPC (Low-Density Parity-Che...     

莱斯信道下跨层系统的频谱效率分析

为提高无线通信网络在传输中的频谱利用率,提出一种莱斯信道下的跨层系统.该系统联合了物理层的自适应调制技术与数据链路层的自动重传技术.利用从接收端反馈回的信道状态信息和自动重传请求,发射端自适应调节调制模式,自动重传发射数据.推导了莱斯信道下,跨层系统的频谱效率和中断概率的封闭表达式,以及固定调制模式系统的频谱效率的表达式,并利用推导的表达式进行仿真.结果表明,对比仅有自适应调制的系统,跨层系统的频谱增益大约是1.5 dB;而与仅有自动重传的系统相比,其频谱增益最大达到3 dB.     

低密度校验码编码系统混合ARQ协议设计

分析了低密度校验(LDPC)码译码所产生的错误码字中码位的译码输出量可靠度信息的统计特性。结合自动重传请求(ARQ)协议提出了一种简单高效的混合ARQ方案,和基于译码可靠度的混合ARQ方案（RB-HARQ）的性能进行了比较。仿真结果说明,在考虑反向信道重传请求消息信息比特功率的条件下,混合ARQ方案的总体性能超过RB-HARQ方案,具有较强的实际应用价值。     

发射分集TDS-OFDM系统中迭代NR译码辅助的信道估计

为了改善信道估计的精度并提高时域同步正交频分复用(TDS-OFDM)系统在衰落信道下的性能,在发射分集TDS-OFDM系统中提出了一种迭代NR(Nordstrom-Robinson)译码辅助的信道估计方法。该方法利用对NR译码后的比特辅助指导信道估计,更新后的信道估计结果又重新辅助进行NR译码。完成迭代后,对NR译码结果进行帧间解交织,最后经过低密度奇偶校验(low-density parity-check,LDPC)译码输出最终的比特流。仿真结果表明:该方法应用于发射分集TDS-OFDM系统中在仅迭代1次的条件下即能有效改善信道估计的精度,获得显著的分集增益。     

Code Design and Shuffled Iterative Decoding of a Quasi-Cyclic LDPC Coded OFDM System

In multipath environments,the error rate performance of orthogonal frequency division multiplexing (OFDM) is severely degraded by the deep fading subcarriers.Powerful error-correcting codes must be used with OFDM.This paper presents a quasi-cyclic low-density parity-check (LDPC) coded OFDM system,in which the redundant bits of each codeword are mapped to a higher-order modulation constellation.The optimal degree distribution was calculated using density evolution.The corresponding quasi-cyclic LDPC code was then constructed using circulant permutation matrices.Group shuffled message passing scheduling was used in the iterative decoding.Simulation results show that the system achieves better error rate performance and faster decoding convergence than conventional approaches on both additive white Gaussian noise (AWGN) and Rayleigh fading channels.     

基于编码的OFDM系统性能仿真

OFDM在多径衰落信道中,一些子载波由于深衰落会完全被丢失,从而影响整个系统的误码性能因此,必须将OFDM系统与信道编码结合起来以提高整系统的误码性能。构建了基于编码的OFDM仿真系统,通过仿真比较了基于LDPC码、乘积积累码(PA)和卷积码的OFDM系统在多径衰落信道下的BER性能。研究了信道块衰落长度与编码性能之间的关系,仿真结果分析表明,LDPC码和PA码在不引入交织的情况下,均可获得比引入交织的卷积码更大的性能增益,表明LDPC码和PA码在无线信道环境下具有很好的适应性。