Performance of hybrid ARQ for IP packet transmission on fadingchannel

This paper proposes and analyzes the performance of a hybrid selective repeat (SR)/multicopy (MC) automatic repeat request (ARQ) scheme to transmit fragmented Internet protocol (IP) packets. The ARQ scheme works in the SR mode until the last IP packet fragment is transmitted. If a fragment is negatively acknowledged after the last fragment is transmitted, then the system goes in the MC mode. In the MC mode, multiple copies of the erroneous fragment are transmitted. After all IP fragments are received without error, the system goes back to the SR mode. The performance of the proposed scheme is evaluated in terms of the bit error rate (BER), IP packet size, and fragmentation size with and without Bose Chaudhuri Hocquenghem (BCH) error correction codes. Both the results are obtained under additive white Gaussian noise (AWGN) as well as flat Rayleigh fading channels. The proposed scheme gives a throughput of 0.9, even at high BER conditions, for any IP packet size under an AWGN channel while, an 8-dB improvement is achieved, when using BCH(63, 51, 2) for throughput of 0.9, over selective repeat+stutter scheme 2 (SR+ST 2) under a flat Rayleigh fading channel     

Multidestination Protocols for Satellite Broadcast Channels

Two retransmission procedures, the go-back-N(GBN) scheme and the selective repeat (SR) scheme, have been analyzed for data transfer from one transmitter to many receivers. We consider transfer of error-controlled bulk data over a satellite broadcast channel. Two retransmission strategies, the dynamic retransmission group reduction (DRGR) technique and the fixed retransmission group (FRG) technique, are proposed. We study the GBN and SR schemes for both strategies. Analytic expressions are derived for the throughput performance of the GBN scheme and of the SR scheme with infinite resources, while discrete event simulation is used to estimate the throughput of the selective repeat scheme with finite resources. Only the SR scheme using the DRGR technique provides acceptable performance for high-speed bulk data transfer. For the DRGR technique, the throughput falls logarithmically with an increase in the number of receivers. In contrast, the throughput for the FRG technique falls exponentially with an increase in the number of receivers.     

Analysis of a new broadcast protocol for satellite communications

In this letter, we propose a tandem broadcast selective repeat (SR) ARQ scheme for satellite communications. In the scheme, the satellite operates in a store and forward manner, which minimizes the effect of the large round-trip delay. Numerical results show that the proposed scheme would largely improve the system performance     

Trellis Coded Hybrid Selective Repeat ARQ Schemes for Point-to-Multipoint Communication over Rayleigh Fading Channels

In this paper, the hybrid selective repeat (SR) automatic repeat request (ARQ) scheme using trellis coded modulation (TCM) proposed by Tellambura and Bhargava [21] is generalized to point-to-multipoint communications for Rayleigh fading channel. Analytical expressions are derived for the throughputs of the point-to-multipoint communication schemes with and without code combining technique. Numerical results show that the protocol using code combining technique yields better throughput than the protocol without code combining and the throughputs decrease when the number of receivers and the value of erasure threshold increase. When the number of receivers equals 1, the scheme without code combining becomes the point-to-point communication scheme proposed in [21].     

Queuing analysis of the selective repeat automatic repeat requestprotocol wireless packet networks

This paper presents an analytical approach for analyzing the mean packet delay and mean queue length at the transmitting terminal in wireless packet networks using the selective repeat (SR) automatic repeat request (ARQ) scheme to control the errors introduced by the nonstationary transmission channel. Each transmitting terminal is modeled as a discrete time queue with an infinite buffer. The nonstationary transmission channel is modeled as a two-state Markov chain. Comparisons of numerical predictions and simulation results are presented to highlight the accuracy of the proposed analytical approach     

A novel driving scheme for synchronous rectifier suitable for modules in parallel

In this paper, a short circuit phenomenon when dc-dc modules with self-driven synchronous rectifier (SR) run in parallel is described. Three existing driving schemes are analyzed and compared. A novel driving scheme for SR maintains the performance of SR as a self-driven scheme, while solving the problem of a short circuit when modules run in parallel. In addition, the amplitude of an SR driving voltage can be adjusted by using the proposed scheme. Therefore, the scheme is more attractive in the applications of comparatively high-voltage output. The principle of operation and the characteristics of the scheme are analyzed and verified on a 36-75V input 1.8-V/60-A output experimental prototype, whose size is 1/4 brick and efficiency is above 90% under rating conditions.     

Equation Chapter 1 Section 1基于中继的协作频谱感知性能分析及优化

提出了一种基于目标的中继协作频谱感知方案,证明了SU到SR链路上的信道条件对系统性能有较大的影响;鉴于此,提出了一种优化的最佳中继协作频谱感知(optimized BRCSS)方案,通过联合考虑目标SU到SR链路上的信道条件和 SR 到 FC 链路上的信道条件选择最佳认知中继;最后,从更实际的应用场景考虑,为了节约系统开销,进一步提出了一种自适应的最佳中继协作频谱感知方案（A-BRCSS）,即 SU 根据其信道条件,自适应地选择是否需要认知中继的协作传输。分析和仿真结果均表明,相比传统最佳中继协作频谱感知方案, Optimized BRCSS方案可以实现更高的感知性能;所提A-BRCSS方案可以实现几乎最佳的感知性能。     

Performance evaluation of a finite buffer generalized selectiverepeat ARQ scheme for satellite communications

This article presents a new generalized selective repeat automatic repeat request (ARQ) scheme for error control in broadcast and point-to-point satellite communication systems. In the proposed scheme, each bit in a packet is repeated m times consecutively to increase the transmission reliability. Finite capacity buffers have been assumed at the earth stations. The throughput, theoretically derived for the proposed scheme, is optimized with respect to the number of copies transmitted per bit. A suitable algorithm to adaptively choose this number in relation to the transmission channel propagation conditions can also be used. In comparison with classical and modified versions of the selective repeat ARQ scheme as described in the literature, the proposed scheme provides enhanced throughput, especially with poor channel conditions and a high number of receiving earth stations     

Multiplexed ARQ for time-varying channels. II. Postponedretransmission modification and numerical results

For pt.I see ibid., vol.46, no.1, p.41-51, 1998. A “postponed retransmission” (PR) modification to both go-back-N (GBN) and ideal selective repeat (ISR) automatic-repeat-request (ARQ) is discussed and analyzed. A scheme for reducing the number of states involved in the calculation for multiplexed GBN ARQ is also presented. Numerical results are then shown for stop-and-wait (SW), GBN, and selective repeat (SR) ARQ (as well as the PR modified versions), under both round-robin and adaptive multiplexing     

A Novel Driving Scheme for Synchronous Rectifiers in LLC Resonant Converters

This paper proposes a novel synchronous rectifier (SR) driving scheme for resonant converters. It is very suitable for high-frequency, high-efficiency, and high-power-density dc–dc resonant converters with SRs. In this paper, an LLC resonant converter with the proposed synchronous rectification is designed and analyzed. With the proposed driving scheme, the SR body diode conduction is reduced to almost zero. The driving scheme eliminates the reverse-recovery problem of SRs. Both current and voltage stresses are greatly decreased, and the conduction loss and switching loss of SRs are also reduced considerably. The experimental results show that the proposed LLC resonant converter with SRs can achieve low stress, high efficiency, and high power density.      

Morphologic gain-controlled regularization for edge-preserving super-resolution image reconstruction

Total Variation or Bilateral Total variation-based regularization of ill-posed super-resolution (SR) problem is well established. However, the SR image reconstructed by this method produces ringing artifacts near strong edges. Second, the extension of SR Imaging to SR video always desire faster SR reconstruction process. We develop a gain-controlled-based locally adaptive regularization technique for SR reconstruction for faster convergence and more detail reconstruction while suppressing the ringing artifacts. We present an iterative process for the model and perform a series of numerical experiments to show evidence of the good performance of the numerical scheme and the proposed gain-controlled regularization.     

Single tag scheme for segment routing in software-defined network

This paper proposes a scheme to reduce a size of a packet header for a segment routing (SR) scheme in a software-defined network (SDN). The SR scheme inserts a segment identification (SID) list into the packet header to indicate a path for the source–destination pair of the packet. The path can be split into different segments to suit the service requirement and the segments are carried by the SID-list whose length increases with the number of segments. This also increases the packet overhead, and an additional packet is needed if the packet length exceeds the maximum transmission unit (MTU). Moreover, it may not be possible to implement SR in SDN due to the limited number of stacked labels provided by the switch vendor. In the proposed scheme, the SID-list is replaced by a single tag to indicate a node edge, called a swapping node. The tag is replaced by a new tag at the swapping node. With this scheme, the size of SID-list is fixed and does not vary with the number of segments, and no additional packets are required. A mathematic model to balance the number of flow entries in each swapping node is introduced by minimizing the maximum number of flow entries in each swapping node over the network. We implement the proposed scheme on the transmission-Japan science information network (SINET5) and demonstrate confirms its functionality.

     

An integrated FEC coding scheme for ATM transmission over regenerative satellite networks

The application of asynchronous transfer mode (ATM) on both wireless and satellite networks requires system adaptation. This adaptation has to improve the overall system's performance, and achieve high quality‐of‐service classes approaching that for fibre‐optic communications. In this paper, a new integrated forward‐error‐correction (FEC) coding scheme is introduced for ATM transmission over regenerative satellite networks. The proposed FEC scheme is a concatenation of two Reed–Solomon codes tailored for the header and payload parts of the ATM cell. This integrated coding scheme is shown to significantly improve the cell loss ratio as compared to the standard CRC code used in the ATM cell header. We obtain both upper and lower performance bounds for the concatenated code and check their accuracy when compared to exact system's performance. Both analytical and simulation results show that a cell loss ratio and bit‐error rate (BER) of 10^?25 and 10^?7 can be, respectively, achieved with minimum delay requirements on the SATCOM link. Finally, an approximation for the system's throughout is obtained. It is shown that using a hybrid selective‐repeat automatic‐repeat‐request (SR‐ARQ) with the RS code, a large throughput of approximately 0.843 can be achieved at BERs lower than 10^?7 for data services. Copyright © 2005 John Wiley & Sons, Ltd.     

基于随机共振电路模拟的微弱周期信号检测

采用电路模拟非线性Duffing振子，利用其随机共振机制来检测微弱周期信号。针对随机共振只适用于极低频输入信号的限制，引入一种适当的变量变换可以将高频信号转化成符合随机共振理论要求的低频信号进行处理，增强了该方法在工程应用中的可行性。采用电路模拟方法检测微弱周期信号，不需要象随机共振数值仿真所要求的那样对信号过采样，在满足采样定理的条件下，可以取较小的采样频率，降低了对硬件的要求。实验表明，该方法能有效地从强背景噪声中检测出微弱周期信号，在机械系统故障早期检测、化学谱信号提取、多传感器测量等领域有实际应用价值。     

基于DSP的开关磁阻电机数字化实验平台的设计

针对许多国内大专院校相关课程缺少开关磁阻电机及其控制系统实验器材的现状,设计了全数字开关磁阻电机实验系统,运用数字信号处理器TMS320F2812作为主控CPU设计了电流环、速度环、位置环的闭环控制系统。这一全数字实验平台的设计使得先进的控制算法应用于开关磁阻电机成为可能,可以为相应教学实践环节提供平台。该实验平台具有硬件简单、易于实现等特点,且控制策略修改灵活方便,适合于教学实验使用。     

Performance evaluation of polling systems for wireless localcommunication networks

This paper evaluates the performance of different polling systems used in wireless local networks where the transmission channel exhibits a nonstationary behavior. Many spatially dispersed data user terminals have been assumed to share a common short-range radio uplink channel to access a hub station. We have specifically considered cyclic polling systems with M queues (terminals), having the same general packet arrival process and general switchover period. The gated and exhaustive disciplines have been considered in ordering the transmission of the packets buffered at each terminal. By appropriately modeling the uplink channel, we propose analytical approaches to derive the average packet waiting time and the average cycle length for gated polling systems, combined with stop-and-wait (SW) and go-back-N (GBN) automatic repeat request (ARQ) techniques to control errors. A gated cyclic polling scheme combined with the selective-repeated (SR) stutter ARQ technique as well as an exhaustive cyclic polling scheme combined with SW, GBN, or SR stutter ARQ techniques, respectively, have also been considered In order to give an in-depth knowledge of the behavior of suitable polling alternatives for applications in wireless local communication networks     

Wavelength routing with spare reconfiguration for all-optical WDM networks

This study presents a wavelength-routing scheme with spare reconfiguration (SR) to construct dependable all-optical wavelength-division-multiplexing (WDM) networks. Path protection using shared spare lightpaths is a general wavelength-routing method for reducing blocking probability while minimizing demand for spare resources. However, in a dynamic traffic environment, this method may still yield a poor performance because a wavelength on a link is very likely to be continuously held by a spare lightpath and to be unable to be assigned to the working lightpath of a new connection. This study develops a spare reconfiguration mechanism with wavelength reassignment (SR/spl I.bar/WR) and path reassignment (SR/spl I.bar/PR) to make the spare dynamic and thus further reduce the blocking probability. The proposed wavelength routing with SR proceeds in three stages and has polynomial time complexity. Extensive simulation experiments were conducted on the NSFNET and the K5 fully connected network to investigate the performance of the proposed wavelength routing with SR. Results of this study show that the proposed wavelength routing with SR can reduce the blocking probability compared with the general wavelength routing with just shared spare lightpaths by choosing a positive tuning cost. In addition, the improvement of the blocking performance is maximized when using SR/spl I.bar/WR followed by SR/spl I.bar/PR.     

基于准正交空时分组码的多中继协作方案

根据准正交空时分组码提出了一种基于选择中继协议的多中继协作方案。从两个方面讨论了该方案的空间分集性能,通过分析成对差错概率证明,若所有的中继都正确译码,该方案可以获得全分集增益;若某些中继不能正确译码,该方案仍可以获得部分分集增益。将所提方案与使用正交空时分组码的协作方案进行比较,仿真结果表明,在信噪比较高时,两个方案都可获得全分集增益,但所提方案具有更高的编码增益。而当信噪比变低时,所提方案具有更高的分集增益和编码增益。     

Optimization of Hybrid ARQ for IP Packet Transmission

This paper presents, optimizes, and analyzes the performance of a novel hybridSelective Repeat/Multi Copy(SR/MC) Automatic Repeat Request (ARQ) scheme for transmitting fragmentedInternetProtocol (IP) packets. The ARQ scheme works in the SR mode until the last IPpacket fragment istransmitted. If a fragment is negatively acknowledged after the last fragmentis transmitted, then the system goes into theMC mode. In the MC mode, multiple copies of the erroneous fragment aretransmitted. After the IPfragments are received without error, the system returns to the SR mode.The optimization of the ARQ is done in terms of two parameters: fragment sizeand the optimum number of packetsto be transmitted in the MC mode, M. Optimum values for both parameters arecalculated for Bit ErrorRate (BER), throughput, IP packet size, and delay. The fragment size is alsocalculated for actual datathroughput for a given IP packet size, both with and without Forward ErrorCorrection (FEC). Then,the performance of the proposed scheme is evaluated in terms of BER andIP packet size with theoptimum M and fragment size. Performance results are obtained with and withoutBose ChaudhuriHocquenghem (BCH) error correction codes under Additive White Gaussian Noise(AWGN) as wellas Flat Rayleigh Fading channels. The ARQ scheme gives optimum performance forM equal to 10fragments and fragment size of 75 bytes. Under the AWGN channel, a throughputof 0.9 is achieved for any IPpacket size and at higher BER conditions compared to the Selective Repeat +Stutter Scheme 2 (SR + ST 2).An 8 dB improvement is achieved under the flat Rayleigh fading channel usingBCH(63, 51, 2) for a throughputof 0.9.     

Performance analysis of go-back-N ARQ scheme with selective repeatin intra-block

The performances of the go-back-N ARQ scheme with selective repeat in intra-block (GBN-SR) and revised GBN-SR (Rev-GBN-SR) schemes are analyzed. Using the derived generating function of the service time of a packet, the throughputs of the proposed schemes are compared with that of Benelli's (1986) scheme. It is shown that the proposed Rev-GBN-SR scheme shows good performance in a wider range from low to high packet error rate regions