Performance Bound for LDPC Coded Unitary Space–Time Modulation

This paper is concerned with the bit error probability (BEP) of coded unitary space–time modulation systems based on finite-length low density parity check (LDPC) codes. The union bound on the BEP of the maximum likelihood (ML) decoding is derived for any code rate, unitary space–time constellation and mapping. The tightness of the bound is checked with simulation results of the ordered statistic decoding (OSD). Numerical and simulation results show that the union bound is also close to the error performance of the sum–product (SP) decoding at low BEP levels when Gray mapping is employed. The derived bound is useful to benchmark the error performance of finite-length coded unitary space–time modulation systems, especially for those that employ short-to-medium length LDPC codes.

ECVBA traffic‐smoothing scheme for VBR media streams

We propose an effective and efficient traffic‐smoothing called the efficient changes and variability bandwidth allocation (ECVBA) scheme. This algorithm not only minimizes the peak rate of a stream but also increases the likelihood of successful VBR stream transmission. The main benefit is that it can immediately release bandwidth to other sites in the network. Copyright © 2002 John Wiley & Sons, Ltd.     

Systematic Generation of Current-Mode Linear Transformation Filters Based on Multiple Output CCIIs

A transformation called current-mode linear transformation (CMLT) and its filter applications using multiple output second-generation current conveyors (MOCCIIs) are presented. The systematic method is developed to realize CMLT MOCCII-based filters efficiently. Based on the proposed design tables, we can synthesize high-order current-mode all-pole and elliptic filters with MOCCIIs, grounded resistors and capacitors. Moreover, the high-frequency elliptic filter can also be efficiently realized by adding capacitors to the relative all-pole filter, although floating capacitors are needed. Third-order Chebychev and elliptic lowpass filters are described in this paper. Experimental results that confirm the theoretical analysis are obtained. Furthermore, the proposed circuits can be extended to higher-order filters.     

Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree construction, and we introduce and evaluate algorithms for tree construction in infrastructureless, all-wireless applications. The performance metric used to evaluate broadcast and multicast trees is energy-efficiency. We develop the Broadcast Incremental Power (BIP) algorithm, and adapt it to multicast operation by introducing the Multicast Incremental Power (MIP) algorithm. These algorithms exploit the broadcast nature of the wireless communication environment, and address the need for energy-efficient operation. We demonstrate that our algorithms provide better performance than algorithms that have been developed for the link-based, wired environment.     

Energy-aware wireless networking with directional antennas: the case of session-based broadcasting and multicasting

We consider ad hoc wireless networks that use directional antennas and have limited energy resources. To explore quantitatively the advantage offered by the use of directional antennas over the case of omnidirectional antennas, we consider the case of connection-oriented multicast traffic. Building upon our prior work on multicasting algorithms, we introduce two protocols that exploit the use of directional antennas and evaluate their performance, We observe significant improvement with respect to the omnidirectional case, in terms of both energy efficiency and network lifetime. Additionally, we show that further substantial increase in the network's lifetime can be achieved by incorporating a simple measure of a node's residual energy into the node's cost function.     

Dual-output switched-capacitor DC–DC converter with pseudo-three-phase swap-and-cross control and amplitude modulation mechanism

This paper presents an inductorless dual-output switched-capacitor DC–DC converter employing pseudo-three-phase swap-and-cross control (PTPSCC) and an amplitude modulation mechanism (AMM). The AMM circuit scales the amplitudes of the driving signals for the switches according to the loading conditions in order to minimize switching losses. To reduce output ripples, average charge distribution, and improve regulation, the PTPSCC circuit continuously switches power transistors to deliver enough charge to the outputs by keeping at least one flying capacitor connected to each output. The switched capacitor DC–DC converter was implemented in a standard 0.18-μm 3.3-V CMOS process. Measurements were used to verify that the proposed converter provides dual independently regulated output voltages without cross regulation. The two outputs were regulated at 2.5 and 0.8 V with input ranges of 1.7–2 V. The maximum output loading was 100 mA for both outputs. A power efficiency of 90.5% was achieved at a maximum total output power of 330 mW with a switching frequency of 500 kHz, and a maximum power efficiency of 92.1% was achieved for a total output power of 210 mW. The maximal peak-to-peak output ripple voltages for the two outputs at 100 mA load currents were suppressed to below 26 and 20 mV, respectively.     

Downlink queuing model and packet scheduling for providing lossless handoff and QoS in AG mobile networks

Next generation mobile networks are expected to provide seamless personal mobile communication and quality-of-service (QoS) guaranteed IP-based multimedia services. Providing seamless communication in mobile networks means that the networks have to be able to provide not only fast but also lossless handoff. This paper presents a two-layer downlink queuing model and a scheduling mechanism for providing lossless handoff and QoS in mobile networks, which exploit IP as a transport technology for transferring datagrams between base stations and the high-speed downlink packet access (HSDPA) at the radio layer. In order to reduce handoff packet dropping rate at the radio layer and packet forwarding rate at the IP layer and provide high system performance, e.g., downlink throughput, scheduling algorithms are performed at both IP and radio layers, which exploit handoff priority scheduling principles and take into account buffer occupancy and channel conditions. Performance results obtained by computer simulation show that, by exploiting the downlink queuing model and scheduling algorithms, the system is able to provide low handoff packet dropping rate, low packet forwarding rate, and high downlink throughput.     

Downlink Performance Analysis of MIMO Relaying Networks

In recent years, there has been an upsurge of interest in relay-augmented infrastructure-based networks. On the other hand, multiple-input-multiple-output (MIMO) wireless system becomes a hot topic for it can achieve significant increases in overall system performance. This paper gives a detailed analysis of downlink performance of MIMO relaying networks, in which different channel models and classic MIMO cellular system model with fixed relay are considered. Our results in single cell scenario show that when meeting effective relay system efficiency of 100%, the required relay SNR gain of 2-antenna system can be reduced to less than half of that with only one transceiver antenna. We also observe that MIMO is more tolerant to interference compared with the one-transceiver antenna system. After that, multi-hop architecture is researched and statistics figures out the tolerable number of hops which is supported in wireless communication with a view to real application. In addition, multi-cell scenario is also studied. Statistics results show that there is more 8 dB average spectral efficiency gain in a two-hop fixed relay 4 × 4 MIMO system than that in a SISO system. These results present significant indications in deployment and optimization of relay-based MIMO networks.     

performance Evaluation of IPv4/IPv6 Networks for Ubiquitous Home-Care Service

Because of rapid development in network technology,Internet usage has become widespread.It allows users with sensing devices to obtain medical data for healthcare,such as physiological signals,voice,and video streams from telemedicine systems,and to send the healthcare data to back-end database systems,creating a ubiquitous healthcare environment.However,this environment requires a widespread and suitable network.IPv6(Internet protocol version 6) is the next-generation Internet protocol that will be the protocol of future networks;it improves many shortcomings of IPv4.In this paper,we propose an IPv6/IPv4 U-home-care test system and analyze the network’s parameters though a series of tests by adjusting network parameters to find the optimal design for applications in the IPv6/IPv4 U-home-care service so as to assure good performance and high quality.