Delay Analysis of Interacting Queues with an Approximate Model

An approximate model of coupled Markov chains is proposed and analyzed for a slotted ALOHA system with a finite number of buffered nodes. This model differs from earlier ones in that it attempts to capture the interdependence between the nodes. The analytical results lead to a set of equations that, when solved numerically, yield the average packet delay. Comparison between computational and simulation results for a small number of nodes show excellent agreement for most throughput values, except for values near saturation. Numerical comparisons for a two-node system show that a nonsymmetric loading of the system provides better delay-throughput performance than a symmetric one.     

A new polysilicon CMOS self-aligned double-gate TFT technology

In this paper, a new polysilicon CMOS self-aligned double-gate thin-film transistor (SA-DG TFT) technology is proposed and experimentally demonstrated. The self-alignment between the top- and bottom-gate is realized by a backlight exposure technique. The structure has an ultrathin channel region (300 /spl Aring/) and a thick source/drain region. Experimental results show that this technology provides excellent current saturation due to a combination of the effective reduction in the drain field and the full depletion of the ultrathin channel. Moreover, for n-channel devices, the SA-DG TFT has a 4.2 times higher on-current (V/sub gs/=20V) as compared to the conventional single-gate TFT. Whereas for the p-channel devices, the SADG TFT has a 3.6 times higher on-current (V/sub gs/=-20V) compared to the conventional single-gate device.     

A subspace detection method of analog space-time codes for multiantenna ultra-wideband transmissions

In this letter, we propose a subspace based detection method for space-time block codes (STBC) wedded with ultra-wideband (UWB) transmissions. Without the need of channel information, the proposed algorithm yields the estimation of transmitted symbols by minimizing some quadratic form built on the orthogonality between signal and noise subspaces. Simulations in flat-faded application scenarios show that the subspace method can achieve the same diversity and a loss of about 2 dB at the 10/sup -3/ level with more than four successive space-time codes being decoded jointly, compared to the coherent decoding algorithm.     

End-to-End QoS for Video Delivery Over Wireless Internet

Providing end-to-end quality of service (QoS) support is essential for video delivery over the next-generation wireless Internet. We address several key elements in the end-to-end QoS support, including scalable video representation, network-aware end system, and network QoS provisioning. There are generally two approaches in QoS support: the network-centric and the end-system centric solutions. The fundamental problem in a network-centric solution is how to map QoS criterion at different layers respectively, and optimize total quality across these layers. We first present the general framework of a cross-layer network-centric solution, and then describe the recent advances in network modeling, QoS mapping, and QoS adaptation. The key targets in end-system centric approach are network adaptation and media adaptation. We present a general framework of the end-system centric solution and investigate the recent developments. Specifically, for network adaptation, we review the available bandwidth estimation and efficient video transport protocol; for media adaptation , we describe the advances in error control, power control, and corresponding bit allocation. Finally, we highlight several advanced research directions.     

Analysis of queueing policies in QoS switches

It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.     

MIMO系统中简单的扩展空时块编码分集技术研究

本文提出一种多输入多输出（MIMO）天线系统中简单的扩展空时块编码（SSTBC）分集技术，采用沃尔什码来区分各天线发送数据子流。采用这种方法，在系统带宽一定时，不降低发送信息速率，同时接收机简单。不同天线的发送信息经过了所有收一发天线对之间的空间子信道，获得了所有路径的部分空间分集增益，仿真结果表明，这种增益的获得不受限于接收分集阶数，并且随发射天线的增加以一定的线性关系增加。     

Ultra-wideband bandpass filter with hybrid microstrip/CPW structure

A novel ultra-wideband (UWB) bandpass filter (BPF) is presented using the hybrid microstrip and coplanar waveguide (CPW) structure. A CPW nonuniform resonator or multiple-mode resonator (MMR) is constructed to produce its first three resonant modes occurring around the lower end, center, and higher end of the UWB band. Then, a microstrip/CPW surface-to-surface coupled line is formed and modeled to allocate the enhanced coupling peak around the center of this UWB band, i.e., 6.85GHz. As such, a five-pole UWB BPF is built up and realized with the passband covering the entire UWB band (3.1-10.6GHz). A predicted frequency response is finally verified by the experiment. In addition, the designed UWB filter, with a single resonator, only occupies one full-wavelength in length or 16.9mm.     

Frequency notched printed slot antenna with parasitic open-circuit stub

A new frequency notched ultra-wideband microstrip slot antenna with a parasitic tuning stub is proposed. The antenna is similar in configuration to a conventional microstrip slot antenna; by introducing a parasitic open-circuit tuning stub, flexible frequency notched function is achieved. Several properties of the antenna, such as frequency notched function, antenna transfer function and gain, have been investigated. As is reported, the operation bandwidth of the antenna is 2.91-11.16 GHz, in which a frequency notched band of 5.10-5.85 GHz has been achieved. Furthermore, good ultra-wideband linear transmission performance over the entire operation frequency range has also been achieved.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

On the degree of convergence of lemniscates in finite connected domains

For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω.