IrDA infrared wireless communications: protocol throughput optimization

The delivery of the maximum data rate to users from IrDA IR wireless links depends not only on the physical layer, but also on higher-layer protocols being optimized. This article reviews the IrDA link layer protocol, IrLAP, and examines how to maximize its throughput performance. Simple equations yield to simple rules for the optimization of IrLAP. The analysis presented can also be employed in studying the physical layer requirements of the predicted future data rate increases (40 Mb/s and 100 Mb/s) of the IrDA 1.x standard. The model gives insights for the optimum control of the infrared connection for high performance. Simple formulas are derived for the optimum values of the window and frame size link layer parameters that maximize throughput. Results show that, for the proposed 16 Mb/s extension, significant throughput increase is observed if optimum link layer parameter values are employed. At high error rates, the significance of the minimum turnaround time (a physical layer parameter) and of the transmission control passing mechanism is studied. When the links are adapted to using the optimum window and frame size, combined with low minimum turnaround values and an efficient transmission control passing scheme, we observe performance improvements even at high error rates.     

Optimal TCP segment size for mobile server access over wireless links of cellular networks

Internet access from mobile phones over cellular networks suffers from severe bandwidth limitations and high bit error rates over wireless access links. Tailoring TCP connections to best fit the characteristics of this bottleneck link is thus very important for overall performance improvement. In this work, we propose a simple algorithm in deciding the optimal TCP segment size to maximize the utilization of the bottleneck wireless TCP connection for mobile contents server access, taking the dynamic TCP window variation into account. The proposed algorithm can be used when the product of the access rate of the wireless link and the propagation time to mobile contents servers is not large. With some numerical examples, it is shown that the optimal TCP segment size becomes a constant value when the TCP window size (WS) exceeds a threshold. One can set the maximum segment size (MSS) of a wireless TCP connection to this optimal segment size for mobile contents server access for maximum efficiency on the expensive wireless link. Copyright © 2007 John Wiley & Sons, Ltd.     

Sliding window and interleaver design

Terminating the trellis was considered essential to lower the bit error probability in a turbo coded system. When a sliding window algorithm is used, this issue becomes even more important. It is shown that trellis termination can be completely ignored by using an interleaver that takes into account the particular window size of the sliding window algorithm     

区域覆盖LEO星座网络中TCP协议性能仿真

当今,能够覆盖中国领土的区域覆盖低轨道（LEO,Low Earth Orbit）星座网络还处于理论研究和验证阶段,对于该系统的网络性能,特别是对于TCP协议在该网络中的性能,没有现成的资料和数据可供参考。信道速率、分组长度、发送窗口的大小和误码率等条件都会对传输控制协议（TCP,Transfer Control Protocol）性能产生不同影响。现在一种针对网络技术的源代码公开的、免费的软件模拟平台（NS2,Network Simulator version 2）软件中建立了24/3/1Walker星座网络模型,然后在该模型下通过仿真给出了TCP协议在各种情况下性能表现,并得到了一些结论。     

Recursive structures and finite impulse response implementations oflinear multiuser detectors for an asynchronous CDMA system

We present order-recursive structures for implementing the linear decorrelating and linear minimum mean square error (MMSE) detectors in a computationally efficient manner. These infinite memory length, linear time invariant, noncausal systems can be approximated by implementing them as K-input K-output finite impulse response (FIR) filters. We developed a linear multiuser receiver architecture called a recursive linear multiuser detector which has lower computational and memory requirements then an equivalent tap delay line FIR filter implementation. We establish the tradeoff between window length and bit error rate and find that relatively small window size yields performance indistinguishable from the ideal decorrelating detector and the ideal MMSE detector     

Application of classical cosine series window functions to fullresponse signaling offset quadrature binary modulation systems

It is proposed that classical cosine series window functions be applied to finite symbol duration quadrature binary modulation systems as pulse shapes in the interest of increasing the spectral confinement of the resulting modulated signals. The respective modulation systems are analyzed in terms of modulated signal envelope uniformity, spectral confinement, and bit error rate in the presence of white Gaussian noise with varying degrees of modulated signal amplitude compression. Even in the presence of moderate modulated signal compression, classical cosine series window function pulse shapes offer spectral confinement for quadrature binary modulation systems that is equal to or better than that provided by the conventional pulse shapes corresponding to QPSK, MSK, SFSK, and DSFSK. It is shown that moderate levels of modulated signal compression have negligible effects on the system bit error rate. A system implementation using the sum of FSK modulated signal components to achieve spectral confinement based on the classical cosine series window functions is presented     

Performance modeling of the IrDA protocol for infrared wirelesscommunications

This article presents a performance analysis of the IrDA protocol used for short-range IR data communication using an analytical mathematical model. The IrDA protocol specifies a protocol stack for reliable short-range infrared wireless data communication between devices with the data link layer (IrLAP) being an HDLC derivative. The mathematical model is based on unidirectional data transfer and uses the concept of the virtual transmission time, which provides the average end-to-end transmission time of a packet, incorporating the time for retransmissions if packet errors occur or other enforced delays. Analytical results are produced for throughput against packet size, BER and minimum turnaround time. They indicate certain limitations of the protocol for efficient throughput at high data speeds, and indicate that the maximum frame size and window size should be increased and the minimum turnaround time minimized for improved results     

Performance Analysis of Sliding Window Turbo Decoding Algorithms for 3GPP FDD Mode

In this paper we analyze the performance of a turbo decoder using two sliding window algorithms for the frequency division duplex (FDD) mode of the Third Generation Partnership Project (3GPP) standard. Focusing on the solution for the user equipment, we compare fixed-point realizations of the sliding window algorithms in terms of the computational complexity and memory requirements. We show that the bit and frame error rate performance of the sliding window scheme strongly depends on the guard window size. Furthermore, simulation results indicate that relatively small guard window sizes can significantly decrease the iteration gain for large frames. Finally, optimization of the windowing parameters achieves the desired trade-off between the performance degradation introduced by a windowing approach and the computational complexity and memory utilization.     

A bandwidth allocation strategy for a FDM multichannel modem

Implementing a frequency division multiplexing (FDM)-based modem for a multichannel application requires a bandwidth allocation strategy. That is, one must decide how to allocate total bandwidth to individual channels such that (a) the desired aggregate rate can be achieved and (b) the desired individual channel bit rates can be achieved. An optimal strategy for bandwidth allocation is proposed. The multitone channel result is used to specify a scheme to allocate four separate channels. The allocation strategy assigns to each subchannel a constellation that is equal in size to that of an equivalent single-band modem operating at the aggregate rate. In this manner, bandwidth is allocated proportional to the desired bit rate on a particular subchannel. Power allocation will be done to maintain a constant probability of error between all channels. This technique will allow the user to split total bandwidth to meet error performance objectives, provided that the desired aggregate rate does not exceed the maximum bit rate allowed by channel conditions     

最小误码率准则盲源分离算法

针对通信混合信号的盲分离问题,结合通信系统中的误码率性能指标,本文提出一种基于最小误码率准则的盲源分离算法。本算法基本原理是,将推导的最小误码率准则结合最大似然原则建立盲源分离代价函数,形成一种最小误码率约束的代价函数,接着借助于自然梯度下降搜索,最小化代价函数实现盲源分离。仿真实验分析表明提出的最小误码率约束代价函数得到的盲源分离算法,比原有的最大似然原则代价函数得到的盲源分离算法,具有更好的收敛性能和分离精度。      

最低误码率非线性均衡器的快速自适应学习算法

针对最低误码率非线性均衡器的参数在线自适应学习问题,本文提出基于拟牛顿方法的快速自适应学习算法。采用Parzen窗函数方法估计误码率,通过设定切换条件,使参数学习在滑窗随机梯度法与滑窗拟牛顿法之间切换。这既增加了新算法的数值稳定性,又可提高收敛速度。通过对拟牛顿方法进行修改,还使新算法既可以在线自适应学习,也可用于高维参数的快速学习。仿真采用最低误码率非线性均衡器对通信系统进行干扰抑制和信道均衡,结果表明了新算法的高效性。     

Optimization of IrDA IrLAP link access protocol

The widespread installation of millions of Infrared Data Association (IrDA) infrared (IR) ports in mobile devices for wireless communication applications necessitates for throughput performance optimization of the IR links at the IrDA link access protocol (IrLAP) link layer. For IrDA connectivity, link-layer throughput optimization is important for any line bit-error rate (BER). The paper provides a mathematical model with which we derive a simple equation linking IrLAP throughput with physical and link-layer parameters. Simple equations for optimum values of window size and frame length for maximum link-layer throughput as a function of BER are derived. A study of the importance of parameters such as link minimum turnaround time and F-timer time out period is presented. Finally, a protocol improvement that utilizes special supervisory frames (S frames) to pass transmission control is proposed to deal with delays introduced by F-timer expiration. Results indicate that employing the special S frame highly improves throughput performance when optimum window and frame-size values are implemented.     

ATM switch with distributed queue windowing scheme

The input queueing switch can be enhanced using a non-first come-first-service (non-FCFS) discipline like window scheme. However, large window sizes are not feasible in centralised contention resolution algorithms due to the increased internal bit rate. Based on the distributed queue concept, a new window scheme for the ATM switch is proposed where the window size can be easily extended. The proposed scheme does not require that the scheduling hardware be speeded up in proportion to the window size, which is essential in the conventional window scheme     

一种甚低速率语音编码的抗误码算法

为满足在高误码率的窄带信道上进行语音通信的需求，本文研究了一种适用于甚低速率语音通信的抗误码参数估值算法。在一定的解码状态下，声码器通过计算最小均方误差（MMSE）估计的方法估计最优参数，充分降低信道误码对重建语音质量的影响。对于解码状态参数，通过计算最大后验转移概率的方法作最佳估计，并给出了一种简化的计算方法。这种抗误码算法复杂度低。计算机仿真结果表明，在不同误码率下该算法恢复出的语音的平均谱失真（ASD）低于帧删除方法的谱失真最大可达0.4dB。     

无线光开关键控调制在Turbo码下的差错特性分析

目前无线光通信工程主要采用开关键控调制,该调制简单、易实现,但误码率高,需要引入纠错编码技术.在分析Turbo码译码结构和开关键控迭代译码算法的基础上,分析仿真了迭代次数、帧长以及约束长度对开关键控调制误码率的影响.结果表明,引入Turbo码编译码技术能够有效改善无线光开关键控调制系统的误码性能.     

Transmission of 622 Mbit/s spectrum-sliced WDM channel over 60 kmof nondispersion-shifted fibre at 1550 nm

The transmission of a spectrum-sliced WDM channel at 622 Mbit/s over 60 km of nondispersion-shifted fibre using an optical bandwidth of only 0.23 nm is reported. This is the highest single channel bit rate-length product (40 Gbit/s·km) and smallest channel bandwidth reported to date for spectrum-sliced WDM systems. The bit error rate performance is theoretically predicted and experimentally confirmed and limits on the bit rate-length products of spectrum-sliced WDM channels using nondispersion-shifted fibre in the 1550 nm window are given     

Explicit window adaptation: a method to enhance TCP performance

We study the performance of TCP in an internetwork consisting of both rate-controlled and nonrate-controlled segments. A common example of such an environment occurs when the end systems are part of IP datagram networks interconnected by a rate-controlled segment, such as an ATM network using the available bit rate (ABR) service. In the absence of congestive losses in either segment, TCP keeps increasing its window to its maximum size. Mismatch between the TCP window and the bandwidth-delay product of the network results in accumulation of large queues and possibly buffer overflows in the devices at the edges of the rate-controlled segment, causing degraded throughput and unfairness. We develop an explicit feedback scheme, called explicit window adaptation, based on modifying the receiver's advertised window in TCP acknowledgments returning to the source. The window size indicated to TCP is a function of the free buffer in the edge device. Results from simulations with a wide range of traffic scenarios show that this explicit window adaptation scheme can control the buffer occupancy efficiently at the edge device, and results in significant improvements in packet loss rate, fairness, and throughput over a packet discard policy such as random early detection (RED)     

Self-stabilizing sliding window ARQ protocols

It is shown that implementing a practical self-stabilizing sliding window protocol requires a bound on the maximum delay or maximum memory of the communication channel involved. This motivates using communication channel models that incorporate a delay or memory bound. For such models, two new ARQ protocols are presented that self-stabilize by using 1 bit of overhead in each transmitted message. The protocols operate like selective repeat ARQ, except that when a fault places them in an incorrect (unsafe) state, the additional bit in the protocol messages allows automatic recovery. Following a transient fault, the bounded delay protocol stabilizes within four round-trip times. The bounded memory protocol stabilizes after sending at most 2(K+n) messages, where K the is maximum number of messages that can be stored in one direction on the channel, and n is the window size of the sender     

一种单芯片DVB-C解调器的VLSI实现

设计了一个单芯片实现的用于DVB-C的QAM解调器.片上集成有3.3V 10位精度的40MSPS模数转换器及FEC前向纠错解码器.该芯片支持4～256QAM多种模式,最高码率达80Mbps,具有宽的载波频偏捕获范围.采用改进的算法及VLSI实现结构,性能稳定,面积优化.采用SMIC 0.25μm 1P5M混合信号CMOS工艺制造,面积为3.5mm×3.5mm,最大功耗为447mW.     

Low-complexity maximum-likelihood detection of coded signals sentover finite-state Markov channels

We propose a decision-feedback decoder for coded signals transmitted over finite-state Markov channels. The decoder achieves maximum-likelihood sequence detection (in the absence of feedback errors) with very low complexity by exploiting previous bit decisions and the Markov structure of the channel. We also propose a similar decoder, the output-feedback decoder, that does not use previous bit decisions and therefore does not suffer from error propagation. The decoder performance is determined using a new sliding window analysis technique as well as by simulation. Both decoders exhibit excellent bit error rate performance with a relatively low complexity that is independent of the channel decorrelation time