一种高阶PSK调制比特重映射方案

针对M-PSK高阶调制信号接收端解调各比特可靠性不一致，进而影响解码性能的问题，提出了一种新颖的重传时进行比特-符号重映射的重传方案，重传合并后此方案可以有效平均比特的可靠性。仿真结果显示，文章算法可以在极少增加处理复杂度的同时，有效提高接收端的误码率性能。     

基于LLR近似算法的星座重排高级混合ARQ

本文研究了采用16-QAM调制和星座重排的chase合并型高级混合ARQ系统.针对星座重排中比特可靠性的差异.提出一种近似算法逼近软解调输出比特的对数似然比.仿真结果表明,该近似算法能有效降低重传后比特可靠性的差异,且计算复杂度大大降低,提高了系统的性能.     

混合ARQ基于OFDM的系统

基于正交频分复用（OFDM）系统提出一种自适应混合自动重传请求（HARQ）方案,它充分利用发送端获得的信道状态信息对每次重传数据符号进行重组并且采用星座重组方案平均调制符号内各比特间的可靠性差异。仿真分析表明,自适应HARQ方案与星座重组方案相结合大大提高了系统通过率。     

移动通信系统HARQ技术的研究

数据通信最初是在有线网上发展起来的,通常要求较大的带宽和较高的传输质量.对于有线连接,数据传输的可靠性是通过重传来实现的.当前一次尝试传输失败时,就要求重传数据分组,这样的传输机制就称之为ARQ(自动请求重传).在无线传输环境下,信道噪声和由于移动性带来的衰落以及其他用户带来的干扰使得信道传输质量很差,所以应该对数据分组加以保护来抑制各种干扰.这种保护主要是采用前向纠错编码(FEC),在分组中传输额外的比特.然而,过多的前向纠错编码会使传输效率变低.因此,一种混合方案HARQ,即ARQ和FEC相结合的方案被提出了.本文对移动通信系统HARQ技术做了详细的研究.     

不等概率可变长符号联合信源信道编码的调制

传统的信源信道编码调制,都是基于四十年代香农分离理论的比特级和定长符号级解调译码,采用均匀分布和等概率的星座映射,在资源受限的无线通信系统中,难以与动态变化的多径信道相匹配,不可逾越通信技术发展所面对的可靠性墙和功耗墙等障碍.本文针对比特级和定长符号级调制/解调译码框架的局限,将变长信源信道编码与非等概率、优化的非均匀APSK(Amplitude Phase Shift Keying)调制星座映射相结合,提出了不等概率可变长符号联合信源信道编码的调制方法.仿真实验结果表明:该方法在10的-5次方量级的符号差错率下,同现存的符号级2D-8PSK方法比较,至少可获得约2.5dB的功率信噪比增益,同现存的比特级16APSK方法比较,至少可获得约1.1dB的功率信噪比增益.     

一种新型的基于OFDM系统的自适应HARQ方案

基于正交频分复用(OFDM)系统提出一种自适应混合自动重传请求(HARQ)方案,它充分利用发送端获得的信道状态信息对每次重传数据符号进行重组并且采用星座重组方案平均调制符号内各比特间的可靠性差异。仿真分析表明,自适应HARQ方案与星座重组方案相结合大大提高了系统通过率、降低误块率和传输时延。     

OFDM系统中HARQ方案与性能仿真

研究了正交频分复用(OFDM)系统中采用的混合自动重传请求(HARQ)技术,对其性能和实现方案进行了分析;在采用高阶调制时,为均衡同一映射符号内比特可靠性差异采用星座重排方案,并对星座重排技术进行了研究;在典型城区多径信道环境下,对不采用HARQ、采用Type I HARQ、采用Type Ⅲ chase合并的HARQ和采用带有星座重排的Chase合并的HARQ4种方案的误码率和吞吐量性能分别进行了仿真;仿真结果表明,星座重排技术结合Chase合并的HARQ机制是无线通信系统中提高传输质量和吞吐量的一种高效可行的方案.     

一种基于自适应调制的LDPC-COFDM系统性能研究

本文研究了一种基于自适应调制和软解调算法的LDPC-COFDM(LDPC Coded OFDM)系统模型，该自适应调制方案根据各个了信道的信道增益来自适应地分配比特。文中对自适应调制和软解调算法进行了讨论和分析，最后给出了仿真结果。仿真结果表明，基于自适应调制的LDPC-COFDM能够有效提高系统的误码性能，适应多径衰落信道的时变特性。     

移动通信中基于Turbo码的混合ARQ方案

在移动环境中，由于信道的时变特性，单纯的FEC或ARQ机制往往无法提供所希望的系统性能。为了提高数据及图像的传输可靠性，需采用ARQ与FEC相结合的混合ARQ差错控制方案。首先介绍了几种常见的以Turbo码作为纠错码的混合ARQ方案，然后研究了基于Turbo码组合译码的有限次重传混合ARQ方案，给出了传输方案及组合译码算法。仿真结果表明，低Eb/No时，该方案对通过率有明显改善。     

MIMO-OFDM系统中自适应比特交织HARQ方案

基于多天线正交频分复用(MIMO- OFDM)系统提出了一种根据信道状态信息进行自适应比特交织的混合自动重传请求(HARQ)方案,它充分利用信道的状态信息对每次重传的比特进行交织来获得频率分集增益和平均各个比特间的可靠性.仿真结果表明,在Type III HARQ类型(包括Chase合并和部分冗余递增)下,该方案可以有效降低系统的误码率性能.     

Reliability-based incremental redundancy with convolutional codes

Incremental redundancy, or Hybrid type-II ARQ (HARQ), algorithms use a combination of forward error correction and retransmissions to guarantee reliable packet data communications. In this work, we propose a HARQ algorithm that exploits received packet reliability to improve system performance. Specifically, the receiver uses the average magnitude of the log-likelihood ratios of the information bits as the packet reliability metric, which is then used to determine the sizes of subsequent retransmissions. The proposed retransmission strategy attempts to maximize user throughput while satisfying a maximum packet delay constraint. The performance of our reliability-based HARQ algorithm is evaluated in static and time-varying channels through simulations. Furthermore, analytical results on the relationship between the reliability metric, the code rate and the block error rate are presented.     

Hierarchical constellation for multi-resolution data transmission over block fading channels

We propose a new technique for multi-resolution video/image data transmission over block fading channels. The proposed scheme uses an adaptive scheduling protocol employing a retransmission strategy in conjunction with a hierarchical signal constellation (known also as nonuniform, asymmetric, multi-resolution constellation) to give different transmission priorities to different resolution levels. Transmission priorities are given in terms of average packet loss rate as well as average throughput. Basically, according to the transmission scheduling and channel state (acknowledgment signal) of the previous transmission, it dynamically selects packets from different resolution levels to transmit for the current transmission. The bits from the selected packets are assigned to different hierarchies of a hierarchical 4/16-quadrature amplitude modulation to transmit them with different error protections. The selection of packets for transmission and the assignment of these selected packets to different hierarchies of the hierarchical constellation are referred to as the scheduling protocol in our proposed scheme. We model this protocol by a finite state first order Markov chain and obtain the packet loss rate and the packet transmission rate over Nakagami-m block fading channel in closed-form. Some selected numerical results show that the proposed scheme can control the relative packet loss rate and the packet transmission rate of different resolution levels by varying the priority parameter (or equivalently, the asymmetry) of the hierarchical constellation and the maximum number of allowed retransmissions.     

Packet level acknowledgement and Go‐Back‐N protocol performance in infrared wireless LANs

Infrared wireless LANs may employ repetition rate (RR) coding to increase the symbol capture probability at the receiver. This paper examines the effectiveness of RR coding to utilization for infrared LANs using the physical and link layer parameter values proposed in the Advanced Infrared (AIr) protocol standard, which is developed by the Infrared Data Association (IrDA). Infrared LANs employ a Go‐Back‐N (GBN) automatic repeat request (ARQ) retransmission scheme at the Link Control (LC) layer to ensure reliable information transfer. To efficiently implement RR coding, the receiver may return after every DATA packet a suggestion for the suitable RR value to be used by the transmitter and implement a Stop‐and‐Wait (SW) ARQ scheme at the medium access control (MAC) layer. The effectiveness of employing this optional SW ARQ scheme at the MAC layer is discussed. Analytical models for the ARQ retransmission schemes are developed and employed to compare protocol utilization for different link parameter values such as window size, packet length and LC time out periods. This analysis identifies the ARQ protocol that maximizes performance for the specific link quality and the implemented link layer parameters. The effectiveness of the proposed RR coding to LAN utilization for different ARQ scheme implementation is finally explored. This analysis identifies the link quality level at which RR should be adjusted for maximum performance. It is concluded that if the packet error rate is higher than 0.1–0.4 (depending on the implemented ARQ protocol), the receiver should advise the transmitter to double the implemented RR for maximum performance. These error rate values are high and can be effectively estimated by the transmitter based on packet retransmissions. Thus, the usefulness of the receiver indicating to the transmitter to adjust RR is questionable, as the transmitter can effectively implement the suitable RR value based on packet retransmissions. Copyright © 2003 John Wiley & Sons, Ltd.     

A reliability output Viterbi algorithm with applications to hybridARQ

We present an algorithm that permits a receiver to calculate the probability of packet error in parallel with the Viterbi decoding process. This packet reliability value may be used to request retransmissions in a type-I hybrid ARQ scheme. It is shown that this scheme can be used to guarantee any required bound on the packet error probability. In addition, this scheme can be used in conjunction with packet combining. The performance of this scheme is compared with that of the Yamamoto-Itoh algorithm and is shown to provide a significant improvement in throughput     

Sequential decoding with an efficient incremental redundancy ARQscheme

Sequential decoding is analyzed in conjunction with an efficient incremental redundancy automatic repeat request (ARQ) scheme using punctured convolutional coding. With the incremental redundancy ARQ scheme, whenever the decoding time of a given data packet exceeds some predetermined value T_max, decoding of that data packet is stopped and incremental redundancy bits are provided by the transmitter, a few bits at a time, as needed. It is shown that the incremental redundancy ARQ scheme provides throughput improvement over the partial retransmission code combining ARQ scheme. The advantage of the incremental redundancy ARQ scheme is that the throughput increases as the starting coding rate increases over all ranges of signal-to-noise ratios     

Reduced-rate retransmissions for spread-spectrum packet radio multimedia networks

A reduced-rate retransmission (RRR) scheme is proposed for improving the throughput performance of spread-spectrum packet radio networks. The scheme takes advantages of the available multi-rate scalable source coding techniques. It assumes that several versions of a data packet with different sizes (number of information bits) are available. The transmission of a packet starts from its full-size version. If the full-size version is not correctly received, its half-size version is used in the retransmission. If further retransmissions are needed, the quarter-size version and so on are used. The shrunk packets are transmitted either in a minislot if the processing gain is kept the same, or occupying a slot duration by increasing the processing gain proportionally. In both cases, the effective signal to interference ratio for a packet is increased. As a result, the system throughput is improved. Theoretical and numerical results are provided in this paper which illustrate the throughput improvement. Another advantage of the proposed RRR scheme is that the packet-size reduction provides finer granules for link adaptation. Therefore, it is especially suitable for multimedia applications for which codes of variable rate for the source data are available and which can tolerate gracefully degraded quality of service. The performance of the proposed scheme in fading channels is also addressed.     

An ARQ scheme using combined QPSK and BPSK transmissions

We propose a hybrid ARQ scheme which uses QPSK modulation for the first transmission and BPSK modulation for retransmissions. The throughput performance of the proposed ARQ scheme is better that those of ARQ schemes purely using QPSK modulation or purely using BPSK modulation for transmissions. Furthermore, the proposed scheme does not require any operation of error correction as usually required in hybrid ARQ schemes. Therefore, the ARQ scheme proposed in this paper can be easily implemented     

Optimum subpacket transmission for hybrid ARQ systems

Hybrid automatic-repeat-request (ARQ) is a flexible and efficient technique for data transmissions. In hybrid ARQ, subpacket schemes are more attractive for systems with burst errors than complete packet schemes. Although subpacket schemes were proposed in ARQ systems, optimum subpacket transmission is more effective to maximize throughput in a dynamic channel. Since convolutional codes have properties of burst errors in decoding, the optimum subpacket can be applied to convolutional codes. This paper investigates the performance of subpacket transmission for convolutionally coded systems. An efficient method is proposed to estimate the optimum number of subpackets, and adaptive subpacket schemes, i.e., schemes that enable a system to employ different optimum numbers of subpackets under various conditions, are suggested to achieve the maximum throughput of the system. Numerical and simulation results show that the adaptive subpacket scheme is very effective for the convolutionally coded hybrid ARQ system, and it can provide higher throughput, smaller delay,and lower dropping rate than complete packet schemes. Moreover, the adaptive subpacket scheme can be flexibly used with packet combining techniques to further improve the system throughput.     

Improving Wireless TCP Throughput by a Novel TCM-Based Hybrid ARQ

A novel hybrid ARQ (HARQ) scheme using a concatenated two-state trellis-coded modulation (CT-TCM) code is proposed for improving wireless TCP throughput. A distinguished feature of the proposed scheme is that the heavily punctured TCM codes are used for retransmissions of the corrupted data block, which are combined at the receiver with the previously received sequences of the same data block for decoding. By this method, significantly improved coding gain and efficient spectrum utilization can be achieved with very low complexity. A Markov model is developed to evaluate TCP throughput over the proposed HARQ in wireless link. By both analysis and simulation, we demonstrate that compared with other existing TCM-based ARQ schemes, significant improvement of TCP throughput over wireless links is achieved by the proposed CT-TCM HARQ while smaller buffer size is required at the access point.     

Adaptive Retransmission Diversity with Packet Combining for Slotted DS/CDMA Packet Radio Networks

A time diversity automatic repeat-request (ARQ) scheme is investigated for slotted random access direct-sequence code-division multiaccess (DS/CDMA ALOHA) wireless packet radio networks on multipath Rayleigh fading channels. The receiver retains and processes all the retransmissions of a single data block (packet) using predetection diversity combining, instead of discarding those which are detected in error. This effectively improves the system throughput and delay characteristics especially at small values of signal-to-noise ratio (SNR) per bit. A simple and practical selection combining rule is proposed, which lends itself to a low-complexity receiver structure and specifically suitable for high data rate transmissions. Owing to the stochastic nature of the multiple access interference, the new maximum output selection diversity (MO/SD) system yields superior performance in comparison to the traditional maximum SNR selection diversity (SNR/SD) model. The bit error rate performance, throughput and the average number of transmissions required to transmit a packet successfully with and without forward error correction (FEC) are evaluated. Numerical results reveal that the proposed adaptive retransmission diversity with packet combining provides a considerable advantage over the conventional slotted DS/CDMA ALOHA without incurring a substantial penalty in terms of cost or complexity.